DS-TE應(yīng)用MPLS VPN網(wǎng)絡(luò)解決時延問題的研究
[Abstract]:The core of multiprotocol label switching is the introduction and application of label concept. Multi-protocol label switching consists of three parts of CE,PE,P, CE is also called user edge routing, mainly for users to access VPN services, PE is also called service provider edge routing, it is directly connected with CE and has the function of LER in MPLS network. At the same time, a virtual route forwarding table is created for each user to isolate multiple VPN users and distribute VPN service labels. P is also called core routing of backbone network. It has the function of LSR in MPLS network and completes fast forwarding and control tasks. DS-TE technology is a collection of differentiated service model and traffic engineering model. In the differentiated service model, the data grouping is divided into different priority according to the service level, which is embodied in the encapsulation of the TOS field, which is composed of six binary digits. It is divided into 12 levels, the highest level belongs to the network control class; The lowest level belongs to the service class as much as possible. When MPLSVPN receives packet with differentiated service level, PE (LER) maps PHB to EXP field in label, converts 12 priority into 8 priority, and then selects different LSP resource according to different priority. The function of traffic engineering model in MPLS VPN is to prevent too many forwarding equivalents of the same type or priority from occupying the same or several LSP resources and causing other bandwidth resources to be wasted. The functional components that MPLS TE needs to use consist of four parts: packet forwarding, information distribution, path calculation and signaling. Therefore, traffic engineering can greatly reduce congestion in VPN networks. Therefore, DS-TE technology is a kind of dual safeguard technology which can not only meet the communication needs of users but also avoid the waste of resources for operators. The starting point of BH algorithm is to solve the problem of bandwidth waste, so the preemption principle and cost formula of the algorithm are mainly based on the utilization of bandwidth. Due to the development of optical communication, the current computer communication network has a very rich bandwidth resources, and the major domestic operators have started to reduce the price of bandwidth services. Therefore, the available bandwidth resources of enterprise users are no longer the bottleneck limiting the quality of communication service. BH-PREPT algorithm has better performance in avoiding cascading preemption. The drawback is that too much attention is paid to the cost of bandwidth waste caused by preemption of LSP, which makes the complexity of the algorithm and the requirement of the device much higher. The author proposes an improved BH-PREPT algorithm, that is, LH-PREPT algorithm. The algorithm has the advantages of avoiding cascade preemption and preemptive priority cost minimization. The performance of communication network is mainly reflected in the reduction of delay of the main services of VPN users. According to the current demand of VPN services for communication network performance, the author modifies the total cost calculation formula (H (l) and modifies the y (l) to y2 (l) to increase the proportion of priority preemptive cost in the total cost. In order to take into account the efficient utilization of resources and the improvement of delay characteristics, when bandwidth resources and LSP resource conditions are allowed, the user's communication packets will directly preempt the current LSP resources to reduce the delay. When the communication resource is limited or the LSP can not meet the user's communication demand, the algorithm will bundle the current LSP tunnel to increase the utilization of the LSP resource. Finally, the author simulates the communication scene of the two algorithms by using OPNET. The communication nodes in the two scenarios adopt the LH-PREPT algorithm strategy and the BH-PREPT algorithm strategy respectively. Then the author compares and analyzes the experimental results. Finally, it is concluded that the new algorithm has good performance in reducing communication delay.
【學(xué)位授予單位】:吉林大學(xué)
【學(xué)位級別】:碩士
【學(xué)位授予年份】:2014
【分類號】:TP393.1
【參考文獻(xiàn)】
相關(guān)期刊論文 前10條
1 劉大蓮;王麗偉;胡琳;;一種新的求解約束優(yōu)化問題的遺傳算法[J];北京聯(lián)合大學(xué)學(xué)報(bào)(自然科學(xué)版);2010年02期
2 何曉明;唐宏;葉梧;;MPLS流量工程中的最小化搶占路徑選擇方法[J];北京郵電大學(xué)學(xué)報(bào);2009年01期
3 徐蕾;于銀輝;董小剛;郭蕊;張匯川;;DS-TE網(wǎng)絡(luò)環(huán)境中的搶占算法[J];吉林大學(xué)學(xué)報(bào)(信息科學(xué)版);2011年03期
4 杜荔;李海濤;;DS-TE網(wǎng)絡(luò)中自適應(yīng)搶占算法研究[J];東北大學(xué)學(xué)報(bào)(自然科學(xué)版);2010年02期
5 朱明英;葉梧;馮穗力;何曉明;;MPLS網(wǎng)絡(luò)中的自適應(yīng)接入搶占策略[J];電路與系統(tǒng)學(xué)報(bào);2010年03期
6 曾穎;BGP/MPLS VPN原理及技術(shù)探析[J];廣東通信技術(shù);2005年04期
7 朱明英;葉梧;馮穗力;何曉明;;MPLS網(wǎng)絡(luò)中支持Diffserv流量工程的搶占算法[J];華南理工大學(xué)學(xué)報(bào)(自然科學(xué)版);2008年08期
8 鄒仕洪,王文東,程時端;MPLS VPN支持QoS的研究[J];計(jì)算機(jī)工程與應(yīng)用;2003年05期
9 邵海霞;劉炯;李智勇;魏晉;;DS-TE網(wǎng)絡(luò)中改進(jìn)的LSP搶占算法[J];計(jì)算機(jī)工程;2011年18期
10 唐乙雙;田波;;一種在DS-TE網(wǎng)絡(luò)環(huán)境中新的LSP搶占算法[J];通信技術(shù);2009年12期
本文編號:2374618
本文鏈接:http://sikaile.net/guanlilunwen/ydhl/2374618.html