Delay-Efficient Forwarding in SDN Assisted Mesh Networks: An Application of Shapley Value

The use of Software Defined network (SDN) as a key future Internet communications paradigm has great potential to enable efficient network communication. One of the key challenges for SDNs is to provide strategies for delay-efficient traffic forwarding in mesh. In particular, unlike the naïve strategies, the key challenge is to ensure that, besides avoiding overloading particular links, the available link resources are adequately utilized to minimize communication delays. This thesis proposes a sophisticated SDN assisted strategy by applying the principles of Shapley value. Specifically, the proposed strategy forms coalitions of links to calculate a route that is delay efficient. We demonstrate the applicability of the proposal by using Matlab and compare the results with naïve approaches.