Research On Cooperative Resource Allocation Between Network And Applications In SDN

With the diversified development of the Internet,the concept embraced by early Internet designers that the network only needs to ensure connectivity and reliability can no longer meet the demand for high quality of service.The industry has proposed ANN and NAA to try to make more effective decisions for applications and the network by strengthening the perception of each other's status in recent years.However,there are only a few successful cases in reality due to limited perception.Information sharing between network and applications has become an urgent issue to be solved.Software-Defined Networking(SDN)provides a promising solution to this situation.By opening the northbound interface of SDN to applications,there are chances for sharing dynamic status information between applications and the network,and SDN enables programmatically efficient network configuration,which makes it possible for cooperative resource allocation between applications and the network.In this thesis,we study how to utilize the convenience of status information sharing in SDN to improve the performance of applications and the network.Note that the network has the inconsistent or even conflict goal with applications,so we have to find ways to resolve the conflict during cooperative resource allocation.we propose three different approaches to resolve resource allocation conflicts and trade off between applications and the network in three scenarios.In the network where the network controls resource allocation,in order to improve the service quality of applications,we propose a cooperation model based on falsifying link status information.The main idea of this model is to hand over the resource allocation right to applications,allow the network falsify link status information,and trade off between the network and applications by adjusting the extent of falsification.Compared to network-controlled resource allocation methods,our model can achieve better quality of service for applications.Besides,the cooperation model can provide differentiated quality of service by providing information with different authenticity for applications with different priorities.In the network where an overlay network is deployed by a certain application,in order to improve the efficiency of resource allocation and the stability of network environment during the interaction between traffic engineering and overlay routing,we improve the traditional overlay routing model by sharing status information with applications in SDN and improve the traffic engineering model by adding the oblivious performance ratio constraint.In the network where multiple overlays coexist,in order to maximize the performance of the network and each overlay,we let overlay routing and traffic engineering make decisions together,and model the cooperation between them as a coalition game under non-transferable utility.The optimal routing scheme satisfying Shapley fairness and Pareto effectiveness is obtained by calculating the Shapley value under non-transferable utility.