基于SDN的IP骨干網(wǎng)流量調(diào)度研究與實(shí)現(xiàn)
發(fā)布時(shí)間：2018-11-09 17:49
【摘要】：在傳統(tǒng)IP骨干網(wǎng)中一般采取分布式的流量調(diào)度方式和靜態(tài)的路由策略。這些方法缺乏全局視角,導(dǎo)致網(wǎng)絡(luò)鏈路的利用率較低和網(wǎng)絡(luò)擁塞等問題。Google在2012將SDN(Software Defined Network)技術(shù)成功引入到IP骨干網(wǎng)中,實(shí)現(xiàn)了跨數(shù)據(jù)中心之間廣域網(wǎng)的集中式流量調(diào)度機(jī)制,使網(wǎng)絡(luò)中鏈路利用率提高到95%以上。這為運(yùn)營商對其電信廣域網(wǎng)的流量調(diào)度帶來了新的思路。本文探索將SDN技術(shù)引入到IP骨干網(wǎng)的可行性問題,針對IP骨干網(wǎng)的特殊性,設(shè)計(jì)了基于SDN的流量調(diào)度架構(gòu)和粒度可變的流量調(diào)度算法,有效解決傳統(tǒng)IP骨干網(wǎng)中鏈路利用率低與鏈路負(fù)載不均衡等問題。本文的主要研究成果如下:(1)分析了將SDN引入到IP骨干網(wǎng)所面臨的五個(gè)挑戰(zhàn):控制器與交換機(jī)交互壓力成為性能的瓶頸,控制器下發(fā)路由表項(xiàng)的不一致性,控制器獲取網(wǎng)絡(luò)信息難度大,底層設(shè)備表項(xiàng)容量限制,流量調(diào)度算法性能要求高。針對這些挑戰(zhàn),設(shè)計(jì)了基于路徑標(biāo)識的集中式IP骨干網(wǎng)流量調(diào)度架構(gòu)。該架構(gòu)的主要特點(diǎn):1)預(yù)分配流表,將全局路由信息預(yù)先下發(fā)到底層設(shè)備,減少控制器與交換機(jī)交互信息;2)路徑標(biāo)識,使用全局唯一標(biāo)識表示全局唯一的路徑,解決表項(xiàng)下發(fā)不一致問題;3)分類非重疊表項(xiàng),流表項(xiàng)匹配范圍不重疊,并且流表按照匹配規(guī)則進(jìn)行分類,結(jié)合SDN南向接口協(xié)議實(shí)現(xiàn)網(wǎng)絡(luò)匯聚流監(jiān)測機(jī)制;4)匯聚流粒度調(diào)整與流量調(diào)度交互執(zhí)行,匯聚流粒度調(diào)整為流量調(diào)度提供匯聚流預(yù)處理,將匯聚流粒度控制在合理范圍,避免表項(xiàng)數(shù)量過多,并且提高流量調(diào)度執(zhí)行效率,以及匯聚流遷移成功率�；贔loodlight+Mininet平臺,驗(yàn)證了該架構(gòu)能夠完整執(zhí)行,并正確做出決策。(2)為解決鏈路擁塞問題,設(shè)計(jì)了粒度可變的流量調(diào)度算法。該算法從調(diào)度對象和調(diào)度方法兩個(gè)方面設(shè)計(jì),提出匯聚流粒度調(diào)整算法和流量調(diào)度算法。匯聚流粒度調(diào)整算法的作用是控制匯聚流粒度在合理范圍。為防止匯聚流粒度過細(xì),提出了匯聚流聚合算法和匯聚流調(diào)換算法,為防止匯聚流粒度過粗,提出匯聚流拆分算法。流量調(diào)度算法的作用是通過匯聚流遷移降低擁塞鏈路負(fù)載。本文提出三個(gè)算法:1)MILP流量調(diào)度算法,以最小化重路由業(yè)務(wù)數(shù)量為目標(biāo)構(gòu)建混合整數(shù)線性規(guī)劃(MILP)模型;2)分層鏈路動態(tài)上限調(diào)度算法,以最小化重路由業(yè)務(wù)數(shù)為目標(biāo)構(gòu)建MILP模型,以及通過改變鏈路容量上限實(shí)現(xiàn)負(fù)載均衡;3)組合擁塞鏈路算法,優(yōu)先遷移流經(jīng)數(shù)條擁塞鏈路的匯聚流,將擁塞鏈路上的數(shù)條匯聚流均衡分配到數(shù)條備選路徑。經(jīng)仿真驗(yàn)證,三個(gè)算法在不同的性能上有不同的優(yōu)勢。
[Abstract]:Distributed traffic scheduling and static routing strategy are generally adopted in traditional IP backbone networks. These methods lack a global perspective, resulting in low utilization of network links and network congestion. Google successfully introduced SDN (Software Defined Network) technology into IP backbone network in 2012. The centralized traffic scheduling mechanism of WAN across data centers is implemented, and the link utilization rate in the network is increased to more than 95%. This brings a new idea to the traffic scheduling of telecom wide area network (WAN). This paper explores the feasibility of introducing SDN technology into IP backbone network. According to the particularity of IP backbone network, the traffic scheduling architecture based on SDN and the traffic scheduling algorithm with variable granularity are designed. It can effectively solve the problems of low link utilization and unbalanced link load in traditional IP backbone network. The main results of this paper are as follows: (1) five challenges of introducing SDN into IP backbone network are analyzed: the interaction pressure between controller and switch becomes the bottleneck of performance, and the inconsistency of routing table items under controller is analyzed. It is difficult for the controller to obtain network information, the capacity of the underlying equipment table is limited, and the performance of the traffic scheduling algorithm is high. Aiming at these challenges, a centralized IP backbone network traffic scheduling architecture based on path identification is designed. The main features of the architecture are as follows: 1) preassigned flow table, sending global routing information down to the underlying device in advance, reducing the interactive information between controller and switch; 2) path identification, which uses the global unique identity to represent the globally unique path, which solves the problem of inconsistency of table items; 3) Non-overlapping table items are classified, the matching range of stream table items is not overlapped, and the flow table is classified according to matching rules, and the network convergence flow monitoring mechanism is realized with the combination of SDN southward interface protocol. 4) aggregate flow granularity adjustment interacts with traffic scheduling. Convergence flow granularity adjustment provides convergence flow preprocessing for traffic scheduling, controls aggregation flow granularity within a reasonable range, avoids excessive number of table items, and improves the efficiency of traffic scheduling. And the success rate of convergent flow migration. Based on the Floodlight Mininet platform, it is verified that the architecture can be implemented completely and the decision is made correctly. (2) in order to solve the problem of link congestion, a traffic scheduling algorithm with variable granularity is designed. The algorithm is designed from two aspects of scheduling object and scheduling method, and proposes a convergence flow granularity adjustment algorithm and a traffic scheduling algorithm. The function of the convergence flow granularity adjustment algorithm is to control the convergence flow granularity in a reasonable range. In order to prevent the convergence flow granularity from being too fine, the convergence flow aggregation algorithm and the convergent flow exchange algorithm are proposed. In order to prevent the convergence flow from being too coarse, the convergent flow splitting algorithm is proposed. The function of traffic scheduling algorithm is to reduce the congestion link load by converging flow migration. This paper proposes three algorithms: 1) MILP traffic scheduling algorithm to minimize the number of rerouting traffic as the goal to build a mixed integer linear programming (MILP) model; 2) hierarchical link dynamic upper bound scheduling algorithm, aiming at minimizing the number of rerouting services, constructing MILP model, and realizing load balancing by changing the upper limit of link capacity; 3) combining the congestion link algorithm, the convergent flow flowing through several congestion links is transferred first, and several converging flows on the congestion link are equalized to several alternative paths. Simulation results show that the three algorithms have different advantages in different performance.
【學(xué)位授予單位】：電子科技大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：TP393.0
本文編號：2321128
[Abstract]:Distributed traffic scheduling and static routing strategy are generally adopted in traditional IP backbone networks. These methods lack a global perspective, resulting in low utilization of network links and network congestion. Google successfully introduced SDN (Software Defined Network) technology into IP backbone network in 2012. The centralized traffic scheduling mechanism of WAN across data centers is implemented, and the link utilization rate in the network is increased to more than 95%. This brings a new idea to the traffic scheduling of telecom wide area network (WAN). This paper explores the feasibility of introducing SDN technology into IP backbone network. According to the particularity of IP backbone network, the traffic scheduling architecture based on SDN and the traffic scheduling algorithm with variable granularity are designed. It can effectively solve the problems of low link utilization and unbalanced link load in traditional IP backbone network. The main results of this paper are as follows: (1) five challenges of introducing SDN into IP backbone network are analyzed: the interaction pressure between controller and switch becomes the bottleneck of performance, and the inconsistency of routing table items under controller is analyzed. It is difficult for the controller to obtain network information, the capacity of the underlying equipment table is limited, and the performance of the traffic scheduling algorithm is high. Aiming at these challenges, a centralized IP backbone network traffic scheduling architecture based on path identification is designed. The main features of the architecture are as follows: 1) preassigned flow table, sending global routing information down to the underlying device in advance, reducing the interactive information between controller and switch; 2) path identification, which uses the global unique identity to represent the globally unique path, which solves the problem of inconsistency of table items; 3) Non-overlapping table items are classified, the matching range of stream table items is not overlapped, and the flow table is classified according to matching rules, and the network convergence flow monitoring mechanism is realized with the combination of SDN southward interface protocol. 4) aggregate flow granularity adjustment interacts with traffic scheduling. Convergence flow granularity adjustment provides convergence flow preprocessing for traffic scheduling, controls aggregation flow granularity within a reasonable range, avoids excessive number of table items, and improves the efficiency of traffic scheduling. And the success rate of convergent flow migration. Based on the Floodlight Mininet platform, it is verified that the architecture can be implemented completely and the decision is made correctly. (2) in order to solve the problem of link congestion, a traffic scheduling algorithm with variable granularity is designed. The algorithm is designed from two aspects of scheduling object and scheduling method, and proposes a convergence flow granularity adjustment algorithm and a traffic scheduling algorithm. The function of the convergence flow granularity adjustment algorithm is to control the convergence flow granularity in a reasonable range. In order to prevent the convergence flow granularity from being too fine, the convergence flow aggregation algorithm and the convergent flow exchange algorithm are proposed. In order to prevent the convergence flow from being too coarse, the convergent flow splitting algorithm is proposed. The function of traffic scheduling algorithm is to reduce the congestion link load by converging flow migration. This paper proposes three algorithms: 1) MILP traffic scheduling algorithm to minimize the number of rerouting traffic as the goal to build a mixed integer linear programming (MILP) model; 2) hierarchical link dynamic upper bound scheduling algorithm, aiming at minimizing the number of rerouting services, constructing MILP model, and realizing load balancing by changing the upper limit of link capacity; 3) combining the congestion link algorithm, the convergent flow flowing through several congestion links is transferred first, and several converging flows on the congestion link are equalized to several alternative paths. Simulation results show that the three algorithms have different advantages in different performance.
【學(xué)位授予單位】：電子科技大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：TP393.0
【參考文獻(xiàn)】
相關(guān)博士學(xué)位論文 前1條
1 楊仝;骨干網(wǎng)路由表壓縮、查找及增量更新技術(shù)研究[D];清華大學(xué);2013年
，本文編號：2321128
本文鏈接：http://sikaile.net/guanlilunwen/ydhl/2321128.html
最近更新
教材專著
