【摘要】：中間系統(tǒng)到中間系統(tǒng)（ISIS）路由協(xié)議具有易于擴(kuò)展、快速收斂等特性，作為一種內(nèi)部網(wǎng)關(guān)鏈路狀態(tài)路由協(xié)議，在大型網(wǎng)絡(luò)中例如電信運(yùn)營商廣泛應(yīng)用。多拓?fù)渎酚杉夹g(shù)是近幾年提出的一種智能路由方案，在不改變網(wǎng)絡(luò)原有物理拓?fù)涞那疤嵯�，通過在一個(gè)物理拓?fù)渖蟿澐殖龆鄠�(gè)邏輯子拓?fù)�，使得�?duì)鏈路質(zhì)量有不同要求的業(yè)務(wù)擁有專門的網(wǎng)絡(luò)拓?fù)洌瑥亩乐挂驗(yàn)榫W(wǎng)絡(luò)流量過大對(duì)某些業(yè)務(wù)造成影響。ISIS支持多拓?fù)渎酚杉夹g(shù)為解決網(wǎng)絡(luò)安全、流量工程以及均衡負(fù)載等問題提供了新的視角。但是隨著大量邏輯子拓?fù)涞纳�，各種網(wǎng)絡(luò)資源的存儲(chǔ)導(dǎo)致內(nèi)存消耗率較大、路由收斂速度較慢等問題逐漸浮出水面。 本文在深入理解ISIS路由協(xié)議的基礎(chǔ)上，依據(jù)RFC5120研究了ISIS多拓?fù)渎酚蓪?shí)現(xiàn)過程中的關(guān)鍵技術(shù)，并對(duì)其進(jìn)行了優(yōu)化。ISIS多拓?fù)渎酚砂ㄈ竽K：鄰居建立模塊、鏈路狀態(tài)信息（LSP）維護(hù)模塊和路由計(jì)算模塊。本文對(duì)鏈路狀態(tài)信息維護(hù)模塊和路由計(jì)算模塊進(jìn)行了優(yōu)化。針對(duì)存在大量邏輯子拓?fù)鋾r(shí)，原存儲(chǔ)方案中子拓?fù)渑c標(biāo)準(zhǔn)拓?fù)鋯为?dú)存儲(chǔ)鏈路狀態(tài)信息，導(dǎo)致占用內(nèi)存較大的弊端，提出了一種新的子拓?fù)滏溌窢顟B(tài)信息存儲(chǔ)方案，將標(biāo)準(zhǔn)拓?fù)湟约白油負(fù)湫畔凑找环N改進(jìn)的多層鏈表嵌套的存儲(chǔ)結(jié)構(gòu)進(jìn)行存儲(chǔ)，首先第一層存儲(chǔ)拓?fù)銲D，第二層則存儲(chǔ)每個(gè)拓?fù)涞脑敿?xì)鏈路狀態(tài)信息，且只存儲(chǔ)一份鏈路狀態(tài)信息，有效地提高了內(nèi)存存儲(chǔ)效率。針對(duì)原增量最短路徑優(yōu)先算法（ISPF）在計(jì)算規(guī)模增大和網(wǎng)絡(luò)環(huán)境日益復(fù)雜的情況下路徑計(jì)算效率較低等問題，本文對(duì)增量計(jì)算過程進(jìn)行了優(yōu)化，提出了一種改進(jìn)的ISPF算法，，有效地加快了路由收斂速度。針對(duì)原路由計(jì)算信息維護(hù)方案中，各子拓?fù)洫?dú)立維護(hù)路由計(jì)算所需要的信息，隨著子拓?fù)鋽?shù)量增加從而導(dǎo)致內(nèi)存消耗較大等問題，本文結(jié)合網(wǎng)絡(luò)多拓?fù)涞奶攸c(diǎn)，提出了一種改進(jìn)的路由計(jì)算信息維護(hù)方案，并針對(duì)新的路由信息維護(hù)方案，改進(jìn)了路由計(jì)算方案，大大地減少了路由器內(nèi)存的負(fù)荷，提高了資源存儲(chǔ)率和網(wǎng)絡(luò)運(yùn)行速度。 在后續(xù)的研究工作中，應(yīng)關(guān)注多拓?fù)渎酚稍谪?fù)載均衡以及網(wǎng)絡(luò)安全方面的應(yīng)用，通過合理地設(shè)計(jì)子拓?fù)湟约白油負(fù)涞陌踩呗裕咕W(wǎng)絡(luò)物理鏈路上的負(fù)載達(dá)到最優(yōu)，且服務(wù)的安全性得到保證。
[Abstract]:As an internal gateway link-state routing protocol, the intermediate system-to-intermediate system (ISIS) routing protocol has the characteristics of easy expansion and fast convergence. It is widely used in large-scale networks such as telecom operators. Multi-topology routing technology is an intelligent routing scheme proposed in recent years. Under the premise of not changing the original physical topology of the network, multiple logical sub-topologies are divided into several logical sub-topologies on one physical topology. Enables services with different requirements for link quality to have dedicated network topologies to prevent the impact of excessive network traffic on certain services. ISIS supports multi-topology routing technology to address network security. Traffic engineering and load balancing provide a new perspective. However, with the generation of a large number of logical sub-topologies, the storage of various network resources has led to a large memory consumption rate and a slow convergence rate of routing, and other problems gradually surfaced. On the basis of deep understanding of ISIS routing protocol, this paper studies and optimizes the key technologies in the implementation of ISIS multi-topology routing based on RFC5120. Isis multi-topology routing includes three modules: neighbor establishment module. Link-state information (LSP) maintenance module and routing calculation module. In this paper, link-state information maintenance module and routing calculation module are optimized. In view of the disadvantage that the original sub-topology and standard topology store link-state information separately when there are a large number of logical sub-topologies, a new sub-topology link-state information storage scheme is proposed, which takes up a large amount of memory. Standard topology and sub-topology information are stored in an improved multi-layer list nested storage structure, first layer 1 storage topology ID, layer 2 stores detailed link-state information for each topology. Only one link-state information is stored, which effectively improves the memory storage efficiency. In order to solve the problem that the original incremental shortest path priority algorithm (ISPF) is less efficient when the computing scale increases and the network environment becomes more and more complex, this paper optimizes the incremental computing process and proposes an improved ISPF algorithm. The convergence speed of routing is accelerated effectively. In the maintenance scheme of the original routing computing information, each sub-topology maintains the information required for the routing calculation independently. With the increase of the number of sub-topologies, the memory consumption is large and so on. This paper combines the characteristics of the multi-topology of the network. In this paper, an improved routing computing information maintenance scheme is proposed, and for the new routing information maintenance scheme, the routing computing scheme is improved, which greatly reduces the router memory load, improves the resource storage rate and network running speed. In the follow-up research work, we should pay attention to the application of multi-topology routing in load balancing and network security. By reasonably designing the sub-topology and the sub-topology security policy, the load on the physical link of the network should be optimized. And the security of the service is guaranteed.
【學(xué)位授予單位】：西安電子科技大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：TP393.04

【參考文獻(xiàn)】

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

1 黃赫;王晟;;多拓?fù)渎酚蓪?shí)現(xiàn)IP網(wǎng)絡(luò)區(qū)分服務(wù)的優(yōu)化算法[J];計(jì)算機(jī)應(yīng)用研究;2010年12期

2 別碧勇;;ISIS路由協(xié)議及其在IP網(wǎng)絡(luò)工程設(shè)計(jì)中的應(yīng)用[J];鐵道勘測(cè)與設(shè)計(jì);2006年01期

3 平驍卓 ,葛寶忠;一種SPF計(jì)算調(diào)度算法的設(shè)計(jì)與實(shí)現(xiàn)[J];微計(jì)算機(jī)信息;2005年14期

4 王之梁;尹霞;范倫挺;施新剛;;網(wǎng)絡(luò)路由收斂性能測(cè)試研究[J];廈門大學(xué)學(xué)報(bào)(自然科學(xué)版);2007年S2期

本文編號(hào)：2465666