本文選題：覆蓋網(wǎng)絡(luò)　切入點(diǎn)：流量工程　出處：《北京郵電大學(xué)》2016年博士論文

【摘要】：隨著互聯(lián)網(wǎng)的進(jìn)一步發(fā)展,特別是當(dāng)前移動(dòng)互聯(lián)網(wǎng)的興起,各種類(lèi)型的新型應(yīng)用不斷涌現(xiàn),例如移動(dòng)社交、移動(dòng)電商、手機(jī)游戲和虛擬現(xiàn)實(shí)等,這些新型應(yīng)用對(duì)網(wǎng)絡(luò)的可靠性、時(shí)延和丟包率等性能提出了更高的要求。然而,當(dāng)前互聯(lián)網(wǎng)采用的盡力而為的數(shù)據(jù)傳輸方式缺乏對(duì)服務(wù)質(zhì)量的有效保障,無(wú)法滿(mǎn)足某些業(yè)務(wù)的需求。隨著互聯(lián)網(wǎng)大規(guī)模的部署,想要通過(guò)改變現(xiàn)有網(wǎng)絡(luò)協(xié)議架構(gòu)來(lái)提高網(wǎng)絡(luò)性能將會(huì)非常困難。覆蓋網(wǎng)絡(luò)(Overlay Network)為改進(jìn)互聯(lián)網(wǎng)性能提供了一種新思路。它是構(gòu)建在物理網(wǎng)絡(luò)之上的一種虛擬網(wǎng)絡(luò),由分布在網(wǎng)絡(luò)中的覆蓋節(jié)點(diǎn)通過(guò)邏輯鏈路連接而成。覆蓋網(wǎng)絡(luò)不需要大規(guī)模改變物理網(wǎng)絡(luò)結(jié)構(gòu)就能提供比現(xiàn)有互聯(lián)網(wǎng)更好的服務(wù)質(zhì)量,它能根據(jù)用戶(hù)的特定需求在應(yīng)用層上計(jì)算路由,并通過(guò)傳輸路徑中其它覆蓋節(jié)點(diǎn)的轉(zhuǎn)發(fā)來(lái)完成數(shù)據(jù)的傳輸。覆蓋路由是指通過(guò)覆蓋網(wǎng)絡(luò)進(jìn)行的路由模式,是覆蓋網(wǎng)絡(luò)研究的關(guān)鍵技術(shù),受到了國(guó)內(nèi)外學(xué)者的廣泛關(guān)注。在現(xiàn)實(shí)中,為了提升服務(wù)的性能,服務(wù)提供商在互聯(lián)網(wǎng)上部署了大量支持各種類(lèi)型服務(wù)的覆蓋網(wǎng)絡(luò)。然而,覆蓋路由的本質(zhì)是自私路由,它根據(jù)具體服務(wù)的需求進(jìn)行路由,與物理網(wǎng)絡(luò)流量工程的路由目標(biāo)通常并不一致,因此常常會(huì)發(fā)生沖突;同時(shí),共存的覆蓋網(wǎng)絡(luò)之間也可能會(huì)因?yàn)楦?jìng)爭(zhēng)網(wǎng)絡(luò)資源而出現(xiàn)沖突。這種沖突所引起的路由交互問(wèn)題,嚴(yán)重影響了網(wǎng)絡(luò)的效率和穩(wěn)定性。本文針對(duì)多個(gè)覆蓋網(wǎng)絡(luò)共存環(huán)境下路由的混合交互問(wèn)題展開(kāi)研究,主要采用非合作和合作博弈理論對(duì)整個(gè)交互過(guò)程進(jìn)行分析,專(zhuān)注于提高網(wǎng)絡(luò)的性能和穩(wěn)定。全文的研究?jī)?nèi)容和主要貢獻(xiàn)概括如下:(1)考慮到物理網(wǎng)絡(luò)為上層的覆蓋網(wǎng)絡(luò)提供物理網(wǎng)絡(luò)資源,它的地位應(yīng)該等于或者高于覆蓋網(wǎng)絡(luò),本文采用n+1參與者非合作博弈對(duì)物理網(wǎng)絡(luò)地位與覆蓋網(wǎng)絡(luò)相等情況下的混合交互進(jìn)行建模,其中n+1個(gè)參與者分別為n個(gè)覆蓋路由和1個(gè)流量工程。在該博弈中,所有覆蓋路由和流量工程的地位相等,它們?cè)谄降葪l件下輪流執(zhí)行。本文證明了納什均衡的存在,并分別提出了靜態(tài)最優(yōu)反應(yīng)算法和動(dòng)態(tài)最優(yōu)反應(yīng)算法兩種算法來(lái)求解納什均衡。(2)采用1領(lǐng)導(dǎo)者n跟隨者的斯塔克爾伯格-納什博弈對(duì)物理網(wǎng)絡(luò)地位高于覆蓋網(wǎng)絡(luò)情況下的混合交互進(jìn)行建模。在該博弈中,流量工程為領(lǐng)導(dǎo)者,n個(gè)覆蓋路由為跟隨者,流量工程的地位高于所有覆蓋路由,覆蓋路由之間的地位相等。流量工程作為領(lǐng)導(dǎo)者先執(zhí)行,然后所有覆蓋路由基于它的策略給出最優(yōu)反應(yīng),所有覆蓋路由的策略依賴(lài)流量工程的策略。本文證明了斯塔克爾伯格-納什均衡的存在,以及流量工程在斯塔克爾伯格-納什均衡狀態(tài)的性能要好于在納什均衡狀態(tài)的性能,并給出了斯塔克爾伯格-納什均衡求解算法。(3)考慮到創(chuàng)新點(diǎn)(1)和(2)得到的納什均衡和斯塔克爾伯格-納什均衡都是非合作博弈情況下的結(jié)果,通常是非帕累托最優(yōu)的,對(duì)它們進(jìn)行性能改進(jìn)是可行的。本文提出了一種聯(lián)盟合作機(jī)制和一種基于夏普利值的公平有效的成本分配方案,即參與者通過(guò)結(jié)成聯(lián)盟來(lái)共同優(yōu)化聯(lián)盟的目標(biāo),并使用夏普利值來(lái)決定聯(lián)盟內(nèi)每個(gè)參與者需要分擔(dān)的成本。仿真實(shí)驗(yàn)驗(yàn)證在聯(lián)盟合作方案下,各參與者均獲得了比獨(dú)立非合作博弈時(shí)更好的性能。(4)考慮到覆蓋網(wǎng)絡(luò)熱門(mén)應(yīng)用之一的云計(jì)算數(shù)據(jù)中心和多個(gè)互聯(lián)網(wǎng)服務(wù)提供商的網(wǎng)絡(luò)之間也存在交互問(wèn)題,本文首先采用非合作博弈理論對(duì)數(shù)據(jù)中心選擇和多個(gè)物理網(wǎng)絡(luò)流量工程之間的交互進(jìn)行建模,證明了納什均衡的存在并用例子說(shuō)明了納什均衡的有效性損失。然后,基于納什討價(jià)還價(jià)解模型提出了一個(gè)公平有效的合作方法,并設(shè)計(jì)了一個(gè)分解算法來(lái)求解納什討價(jià)還價(jià)解。仿真實(shí)驗(yàn)驗(yàn)證了在納什討價(jià)還價(jià)解模型中,數(shù)據(jù)中心和所有物理網(wǎng)絡(luò)都獲得了比非合作時(shí)更好的性能。
[Abstract]:With the further development of Internet, especially the rise of the mobile Internet, new applications of various types are emerging, such as mobile social networking, mobile providers, mobile phone games and virtual reality, the reliability of these new applications of the network, such as delay and packet loss rate can put forward higher requirements. However, the current data transmission mode the Internet uses the best effort the lack of effective protection of the quality of service, can not meet the needs of some services. With the large-scale deployment of Internet, want to change the existing network protocol architecture to improve the performance of the network will be very difficult. The overlay network (Overlay Network) provides a new way to improve the performance of the Internet. It is built on a the virtual network physical network, covered by the distribution of nodes in the network through logical link connection and coverage. The network does not need to be large. Change the mode of physical network architecture can provide better quality of service than the existing Internet, it can according to the specific requirements of the user computing routing at the application layer, and through the transmission path of other overlay nodes to transmit data. Overlay routing refers to the routing mode covering network, is the key technology of network coverage the widespread attention of scholars at home and abroad. In reality, in order to improve the performance of services, service providers support the deployment of a large number of various types of service overlay network on the Internet. However, covering the road by nature is selfish routing, it according to the specific needs of service routing, routing and physical network traffic engineering usually are not the same, so often clash; at the same time, may also be because of the coexistence between the overlay network and the emergence of cyber source competition conflict. This impact The routing problem caused by the interaction process, which seriously affects the efficiency and stability of the network. Based on the multiple overlay network coexistence environment routing mixed interaction issues, mainly by non cooperative and cooperative game theory to analyze the whole process, focus on improving network performance and stability. The main research content and main contributions are summarized as follows: (1) considering the physical network to provide physical and cyber source for overlay network layer, its status should be equal to or higher than the overlay network, this paper adopts n+1 non cooperative game participants mixed to physical network status and network coverage under the same interaction model, the n+1 participants respectively n overlay routing and 1 traffic engineering. In the game, covering all routing and traffic engineering are equal, they take turns in equal conditions. The Wen Zhengming The existence of the Nash equilibrium, and then proposed the static optimal algorithm and dynamic response optimal reaction algorithm two algorithm to solve Nash equilibrium. (2) the 1 N leader follower Stackelberg game - Nash on the physical network status is higher than that of hybrid overlay network under the condition of interactive modeling. In the game, traffic engineering as a leader, a n overlay routing is the follower, traffic engineering status is higher than that of all overlay routing overlay routing between equals. As the leader of the first implementation of traffic engineering, then all overlay routing based on its strategy of optimal reaction, all overlay routing strategy on traffic engineering strategy. This paper proves that the Stackelberg - the existence of Nash equilibrium, and traffic engineering in Stackelberg Nash equilibrium state is better than the performance in the Nash equilibrium, and gives the Adams Berg Tucker - Nash equilibrium solution algorithm. (3) considering innovation (1) and (2) to get the Nash equilibrium and Stackelberg Nash equilibrium are non cooperative game conditions, is usually non Pareto optimal, for their performance improvement is feasible. This paper proposes a kind of alliance cooperation mechanism and a Shapley value of fair and effective cost allocation scheme based on which the participants through formed an alliance to jointly optimize the objectives of the alliance, and use Shapley value to determine the alliance each participant need to share the cost. The simulation verification in the alliance cooperation scheme, each participant had better performance than non cooperation the game. (4) also has the problem of interaction between one of the popular network applications covering cloud computing data center and a number of Internet service providers network into account, this paper firstly uses non alloy As the game theory to model the interaction between the data center and multiple physical network traffic engineering, proves the existence of Nash equilibrium is illustrated by an example of loss of effectiveness of the Nash equilibrium. Then, Nash bargaining solution model put forward a fair and effective cooperation method based on a decomposition algorithm to solve the Nash bargaining the solution is designed. The simulation experiment in the Nash bargaining solution model, data center and all the physical network have better performance than non cooperative.

【學(xué)位授予單位】：北京郵電大學(xué)
【學(xué)位級(jí)別】：博士
【學(xué)位授予年份】：2016
【分類(lèi)號(hào)】：TP393.0

【參考文獻(xiàn)】

相關(guān)期刊論文 前2條

1 王鵬;羅軍舟;李偉;曲延盛;于楓;;基于可信可控網(wǎng)絡(luò)的流量工程與覆蓋網(wǎng)路由的合作博弈模型[J];計(jì)算機(jī)學(xué)報(bào);2010年09期

2 王e鴈，

本文編號(hào)：1686197