Research On Theory And Algorithm On Resource Competition Of Multiple Overlay Environments

With the continuous development of the Internet, more and more Internet services are provided to the users. And the service demand of the users grows continuously. However, due to the ossification phenomenon of the Internet, their service demand can hardly be satisfied. Overlay network can provide new functionality without modifying the traditional network. This characteristic of overlay makes it play an important role on refining the Internet. Therefore, overlays are widely deployed to provide all kinds of services, such as, P2P, multicast, CDN, and enhancing QoS.Moreover, overlay can also be applied to other kinds of networks, such as,SDN.As the widely deployment of overlay network, it is common that multiple overlays are deployed onto the same native network. These overlays are often deployed independently by different service providers.Therefore, they are not aware each other, and they will compete for underlay resources to optimize their performance. As a consequence,the environment of the whole network will be degraded, and the performance of overlays will be sub-optimal.This paper focuses on the situation that multiple overlays deployed onto the same native network. The interaction of co-existing overlays is analyzed. By taking the fairness between overlays into consideration, we propose several approaches to improve the cooperation between overlays.Our research focuses on motivating the cooperation between overlays,and improving the interaction between homogeneous/heterogeneous overlays. We present the following contributions:(1) An approach of motivating the cooperation between overlays is proposed. This approach aims to avoid the betrayal of overlay when they cooperate with each other. The interaction between overlays is modeled as a repeated game, and a penalty scheme to designed to stabilize the cooperation between overlays. By degrading the expected revenue of the defecting overlay, the betrayal of overlay is avoided.(2) A self-interest cooperative overlay routing method is proposed.The traditional cooperative overlay routing may degrade the performance of particular overlays, which makes them refuse to cooperate. To solve this issue, the self-interest of overlay is taken into consideration. By applying the proposed method, all the performance of the co-existing overlays will be improved. The objective function of the method is distributed to simplify the realization of the method.(3) A cooperative approach for multi-overlays is proposed. In a multi-overlay environment, the profit relationship between overlays is very complicated. Some overlays can cooperate to improve their benefits, while others may have irreconcilable conflicts. The cooperative approach makes overlays to form coalitions to cooperate. A revenue allocation solution is carefully designed make overlays share the coalition revenue according to their contributions. The coalition formation process is analyzed,and a solution for fast convergence of the process. The approach also ensures the fairness of overlays, and improves their benefits.(4) A cooperative approach is proposed for heterogeneous overlays.To make heterogeneous overlays realize the performance goals of each other, the concept of SDN is introduced to the deployment of overlays. Then, a cooperative overlay routing is proposed for heterogeneous overlays. By applying the distributed scheme,overlays can arrange their traffic coordinately, and make better use of underlay resources. A weight balancing solution is designed to solve the benefit balancing issue of heterogeneous overlays . A fast convergence scheme introduced to make the approach more efficient.