本文選題：路由規(guī)劃與保護 + IP網(wǎng)絡的快速重路由　； 參考：《電子科技大學》2014年碩士論文

【摘要】：在近幾年中,隨著云計算技術和移動終端服務的快速發(fā)展,通信網(wǎng)絡承載的業(yè)務流量迅速增多,通信網(wǎng)絡在人們日常的生活工作中扮演的角色越來越重要,用戶也對通信網(wǎng)絡的承載能力、穩(wěn)定性和健壯性提出了更高的要求。業(yè)務的路由規(guī)劃和保護這一通信網(wǎng)絡中的關鍵問題,對通信網(wǎng)絡的承載能力、穩(wěn)定性和健壯性有著極為重要的影響。對業(yè)務的路由規(guī)劃直接影響到通信網(wǎng)絡的業(yè)務接納能力和資源利用狀況,而對業(yè)務的路由提供保護則可以有效的提高通信網(wǎng)絡的穩(wěn)定性和健壯性。本文著眼于通信網(wǎng)絡的業(yè)務路由規(guī)劃和保護問題,重點關注了IP網(wǎng)絡的業(yè)務路由保護問題和彈性光傳輸網(wǎng)絡的業(yè)務規(guī)劃問題。IP快速重路由是互聯(lián)網(wǎng)工程任務組提出的快速響應IP網(wǎng)絡的元件失效的框架標準。在網(wǎng)絡發(fā)生失效后,IP快速重路由框架可以把業(yè)務恢復時間縮短至數(shù)十毫秒,從而保護業(yè)務不受失效的影響。在近十年內已出現(xiàn)了很多IP快速重路由機制,在這其中,無環(huán)保護路最簡單最易于部署,但無法保證覆蓋所有的失效場景。而另一方面,最大冗余樹可以實現(xiàn)對單元件失效的100%保護,但是最大冗余樹提供的保護路由更長,更容易引起流量集中和過載,引發(fā)網(wǎng)絡擁塞。本文在分析對比了無環(huán)保護路和最大冗余樹的優(yōu)缺點后,提出了結合這兩種機制的IP快速重路由機制MRT+LFA,以利用這兩種機制的優(yōu)點提高保護質量。仿真實驗的結果顯示,本文提出的IP快速重路由機制MRT+LFA,與無環(huán)保護路相比可以保護更多的業(yè)務不受失效影響,與最大冗余樹相比可以有效的縮短保護路由、減少流量集中、避免網(wǎng)絡擁塞。頻譜彈性分切光路網(wǎng)絡(SLICE networks)是一種可以實現(xiàn)靈活的頻譜帶寬分配的彈性光網(wǎng)絡結構。與傳統(tǒng)的波分復用(WDM)光網(wǎng)絡相比,SLICE網(wǎng)絡可以實現(xiàn)對頻譜帶寬的靈活分配,從而有效的提高頻譜資源的利用率,增大網(wǎng)絡容量,提高網(wǎng)絡承載業(yè)務的能力。SLICE網(wǎng)絡中的一個基礎問題,是在業(yè)務請求接入網(wǎng)絡時為業(yè)務計算路由和分配頻譜資源,即路由與頻譜分配(RSA)問題。本文關注SLICE網(wǎng)絡在動態(tài)業(yè)務和靜態(tài)業(yè)務兩種場景下的路由與頻譜分配問題,并提出相應的RSA算法。在解決動態(tài)RSA問題時,本文提出將動態(tài)RSA問題分解成路由問題與頻譜分配問題兩個子問題。本文提出一個多約束路由算法SFPS來解決路由問題,并證明了算法的正確性,分析了算法的時間復雜度。而在考慮頻譜分配問題時,本文設計了兩種基于頻譜分段的頻譜分配策略,固定分段(FS)和自適應分段(AS)頻譜分配策略,以減少頻譜碎片,提高資源利用率。仿真實驗的結果顯示,本文提出的動態(tài)RSA算法(SFPS+FS和SFPS+AS)與已有的動態(tài)RSA算法相比,可以有效的提高計算效率,降低網(wǎng)絡阻斷率,減少頻譜碎片,提高資源利用率。在解決靜態(tài)RSA問題時,本文提出將批量業(yè)務按照某種順序逐個規(guī)劃,從而將靜態(tài)RSA問題轉化成動態(tài)RSA問題加以解決。按照這種思路,本文提出靜態(tài)RSA算法SA-mMRSA。該算法包括子算法SASP和子算法mMRSA。SASP算法采用模擬退火的搜索框架,搜索使得接納業(yè)務最多的規(guī)劃順序。而mMRSA算法則在最大重用頻譜分配算法框架中加入業(yè)務路由的計算,同時引入AS策略為業(yè)務分配頻譜資源。仿真實驗的結果顯示,本文提出的靜態(tài)RSA算法SA-mMRSA,在解決規(guī)模較小的靜態(tài)RSA問題和業(yè)務頻譜需求相同的靜態(tài)RSA問題時,可以取得與整數(shù)規(guī)劃模型相近的規(guī)劃結果;在與已有的靜態(tài)RSA算法相比時,可以有效的減少業(yè)務阻斷,提高資源利用率。
[Abstract]:In recent years, with the rapid development of cloud computing technology and mobile terminal service, the traffic volume of communication network is increasing rapidly. Communication network plays a more and more important role in people's daily life work. Users also put forward higher requirements for the capacity, stability and robustness of communication network. The key problems in the communication network planning and protection have a very important influence on the capacity, stability and robustness of the communication network. The routing planning of the service directly affects the service acceptance and resource utilization of the communication network, while the protection of the service route can effectively improve the communication network. Stability and robustness. This paper focuses on the business routing planning and protection of communication networks, focusing on the service routing protection of the IP network and the business planning problem of the elastic optical transmission network (.IP fast rerouting) is the framework standard for the fast response of the IP network to the component failure of the Internet Engineering task force. After the failure, the IP fast rerouting framework can shorten the business recovery time to tens of milliseconds, thus protecting business from failure. In the last ten years, many IP fast rerouting mechanisms have emerged, in which the easiest and most easy to deploy, but not guaranteed to cover all failure scenarios. The large redundant tree can achieve 100% protection to the failure of the element, but the maximum redundant tree provides a longer protection route, which is easier to cause traffic concentration and overload, causing network congestion. In this paper, after analyzing and comparing the advantages and disadvantages of the acyclic protection path and the maximum redundant tree, the IP fast rerouting mechanism, MRT+LFA, which combines these mechanisms, is put forward. In order to improve the quality of protection by using the advantages of these two mechanisms, the simulation experiment shows that the IP fast rerouting mechanism proposed in this paper, MRT+LFA, can protect more services from the acyclic protection path. Compared with the maximum redundant tree, it can effectively shorten the protection route, reduce traffic concentration and avoid network congestion. SLICE networks is an elastic optical network structure which can realize flexible bandwidth allocation. Compared with the traditional WDM optical network, SLICE network can realize the flexible allocation of spectrum bandwidth, thus effectively improve the utilization of spectrum resources, increase the network capacity and improve the network bearing industry. A basic problem in.SLICE network is the routing and allocation of spectrum resources for Business Computing and allocation of spectrum resources, namely routing and spectrum allocation (RSA). This paper focuses on the routing and spectrum allocation problem of the SLICE network in two scenarios of dynamic service and static service, and proposes a corresponding RSA algorithm. In the dynamic RSA problem, this paper proposes to decompose the dynamic RSA problem into two sub problems of routing problem and spectrum allocation problem. In this paper, a multi constrained routing algorithm SFPS is proposed to solve the routing problem, and the correctness of the algorithm is proved and the time complexity of the algorithm is analyzed. In this paper, two kinds of algorithms are designed in this paper, which are based on the spectrum allocation problem. Spectrum allocation strategy, fixed segment (FS) and adaptive segmentation (AS) spectrum allocation strategy, to reduce spectrum fragmentation and improve resource utilization. The simulation experiment results show that the dynamic RSA algorithm (SFPS+FS and SFPS+AS) proposed in this paper can effectively improve the computing efficiency and reduce network blocking compared with the existing dynamic RSA algorithm. Rate, reduce spectrum debris and improve resource utilization. In solving static RSA problems, this paper proposes to plan batch business in a certain order to solve the static RSA problem into a dynamic RSA problem. According to this idea, the static RSA algorithm SA-mMRSA., which includes sub algorithm SASP and sub algorithm mMRSA.SASP, is proposed. The algorithm uses the search framework of simulated annealing to search the planning order that allows the most to accept business. While the mMRSA algorithm adds the computing of the business routing in the framework of the maximum reuse spectrum allocation algorithm, the AS strategy is introduced to allocate the spectrum resources for the service. The simulation experiment results show that the static RSA algorithm SA-mMRSA proposed in this paper is solved. When the small static RSA problem and the static RSA problem with the same business spectrum demand, the planning results similar to that of the integer programming model can be obtained. When compared with the existing static RSA algorithms, the business block can be reduced effectively and the utilization of resources can be improved.
【學位授予單位】：電子科技大學
【學位級別】：碩士
【學位授予年份】：2014
【分類號】：TN915.0
，

本文編號：1906930