本文選題：路由可擴(kuò)展性 + 大規(guī)模路由　； 參考：《清華大學(xué)》2015年博士論文

【摘要】：互聯(lián)網(wǎng)在近年來(lái)面臨嚴(yán)峻的路由可擴(kuò)展性問(wèn)題,具體體現(xiàn)為核心網(wǎng)絡(luò)路由器中路由表規(guī)模和路由更新數(shù)量的快速增加。本文提出了基于自治域編址的可擴(kuò)展路由機(jī)制用以解決該問(wèn)題。本文分別綜述了路由可擴(kuò)展性的測(cè)量工作和解決路由可擴(kuò)展性的方案。路由可擴(kuò)展性的測(cè)量工作從互聯(lián)網(wǎng)路由表規(guī)模和路由更新兩個(gè)角度,研究?jī)烧叩脑鲩L(zhǎng)規(guī)律和增長(zhǎng)原因。路由可擴(kuò)展性的方案包括編址類方案、核心/邊緣分離方案、移除方案和聚合方案,這四種方式都能提高路由可擴(kuò)展性并各有優(yōu)缺點(diǎn)。本文主要從地址分配角度(包括域內(nèi)和域間兩個(gè)方面)測(cè)量路由可擴(kuò)展性及其變化規(guī)律。從域內(nèi)地址聚合角度將前綴分為連續(xù)碎片、不連續(xù)碎片、聚合非碎片和吸收非碎片,發(fā)現(xiàn)大部分前綴由于地址分配因素形成。從域間地址聚合的角度,提出指標(biāo)“兄弟前綴距離”用以衡量前綴被聚合的可能性,發(fā)現(xiàn)新分配前綴的聚合可能性逐漸降低。測(cè)量表明了合理的地址分配對(duì)路由可擴(kuò)展性的重要性。本文提出基于自治域的無(wú)類編址和路由機(jī)制(CABA):在編址結(jié)構(gòu)上反向嵌入AS號(hào)碼將前綴和AS號(hào)碼進(jìn)行關(guān)聯(lián),并通過(guò)PA方式分配AS號(hào)碼促進(jìn)路由信息在域間的聚合;在路由機(jī)制上限制AS拆分和發(fā)布更細(xì)小的前綴。因此從地址分配和使用兩方面減少了對(duì)路由可擴(kuò)展性的影響。本文提出了混合源路由機(jī)制(HSR)對(duì)CABA機(jī)制進(jìn)行擴(kuò)展。HSR在CABA的基礎(chǔ)上引入了不可見(jiàn)自治域的概念,不可見(jiàn)自治域不對(duì)外宣告路由信息,可以在增加不可見(jiàn)自治域的同時(shí)不增加網(wǎng)絡(luò)中的路由信息。同時(shí),HSR也解決了不可見(jiàn)自治域的通信問(wèn)題,它使報(bào)文在離開(kāi)不可見(jiàn)自治域時(shí)攜帶路由信息并根據(jù)該路由信息返回不可見(jiàn)自治域。本文提出了域間不相交多路徑路由(DIMR),提高CABA的路徑多樣性以增強(qiáng)對(duì)流量工程的支持,為了降低多路徑路由對(duì)路由可擴(kuò)展性的影響,每條宣告前綴最多計(jì)算兩條路徑,并要求兩條路徑盡可能不相交。DIMR將兩條AS路徑看作一個(gè)整體(路徑對(duì)),發(fā)現(xiàn)兩條不相交AS路徑可以形成AS環(huán),且AS環(huán)也能分成兩條不相交路徑。因此DIMR包含了一個(gè)基于路徑對(duì)的路由選擇算法,該算法可以讓更多的AS找到不相交AS路徑。本文還證明了該路由算法的收斂性,并提出路由策略的實(shí)現(xiàn)方法和兩種無(wú)環(huán)報(bào)文轉(zhuǎn)發(fā)方法。
[Abstract]:In recent years, the Internet is faced with severe routing scalability problem, which is embodied in the rapid increase of routing table size and the number of routing updates in core network routers. In this paper, an extensible routing mechanism based on autonomous domain addressing is proposed to solve this problem. This paper summarizes the measurement of routing scalability and the solution of routing scalability. The measurement of routing extensibility is based on the scale of routing table and the update of routing, and the growth rules and reasons of both are studied. Routing scalability schemes include addressing class scheme, core / edge separation scheme, removal scheme and aggregation scheme. These four schemes can improve routing scalability and have their own advantages and disadvantages. In this paper, routing scalability and its variation are measured from the point of view of address assignment (including intra-domain and inter-domain). From the perspective of intra-domain address aggregation, the prefixes are divided into continuous fragments, discontinuous fragments, polymerized non-fragments and absorbed non-fragments. It is found that most prefixes are formed by address assignment factors. From the point of view of inter-domain address aggregation, the index "brother prefix distance" is proposed to measure the possibility of prefix aggregation, and it is found that the aggregation possibility of newly assigned prefixes decreases gradually. The measurement shows the importance of reasonable address allocation to routing scalability. In this paper, we propose a classless addressing and routing mechanism based on autonomous domains: backward embedding as numbers in the addressing structure to correlate the prefix and as numbers, and allocate as numbers to facilitate the aggregation of routing information between domains through PA. The routing mechanism limits as splitting and publishing smaller prefixes. Therefore, the impact on routing scalability is reduced in terms of address allocation and usage. In this paper, the hybrid source routing mechanism (HSRs) is proposed to extend the CABA mechanism. HSR introduces the concept of invisible autonomous domain on the basis of Caba. The invisible autonomous domain does not declare routing information. You can add invisible autonomous domains without adding routing information in the network. At the same time, HSR also solves the communication problem of invisible autonomous domains, which enables packets to carry routing information when leaving invisible autonomous domains and return to invisible autonomous domains according to the routing information. In this paper, disjoint multipath routing between domains is proposed to improve the diversity of CABA paths to enhance support for traffic engineering. In order to reduce the impact of multipath routing on routing scalability, each declared prefix calculates up to two paths. It is also required that the two paths should not intersect as much as possible. DIMR regards the two as paths as a whole. It is found that the two disjoint as paths can form as rings and the as rings can be divided into two disjoint paths. Therefore, DIMR includes a routing algorithm based on path pairs, which allows more as to find disjoint as paths. This paper also proves the convergence of the routing algorithm, and proposes the implementation of the routing strategy and two non-loop packet forwarding methods.
【學(xué)位授予單位】：清華大學(xué)
【學(xué)位級(jí)別】：博士
【學(xué)位授予年份】：2015
【分類號(hào)】：TP393.0

【相似文獻(xiàn)】

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

1 韓宗芬;陶智飛;楊思睿;鄒德清;;一種基于自治域的協(xié)同入侵檢測(cè)與防御機(jī)制[J];華中科技大學(xué)學(xué)報(bào)(自然科學(xué)版);2006年12期

2 吉勇;李瑞軒;;基于模糊評(píng)判的多自治域風(fēng)險(xiǎn)關(guān)聯(lián)評(píng)估算法[J];計(jì)算機(jī)工程與科學(xué);2007年12期

3 唐卓;盧正鼎;李瑞軒;;基于專家綜合評(píng)定法的多自治域安全互操作的風(fēng)險(xiǎn)評(píng)估方法[J];小型微型計(jì)算機(jī)系統(tǒng);2006年08期

4 張效娟;李偉;;可信可控網(wǎng)絡(luò)中跨自治域的流合作測(cè)量模型[J];計(jì)算機(jī)應(yīng)用;2011年09期

5 范琪琳;尹浩;林闖;董加卿;宋偉;;互聯(lián)網(wǎng)自治域商業(yè)關(guān)系推測(cè)算法[J];計(jì)算機(jī)學(xué)報(bào);2014年04期

6 陳建剛;王汝傳;王海艷;;一種網(wǎng)格自治域安全系統(tǒng)的設(shè)計(jì)與實(shí)現(xiàn)[J];信息網(wǎng)絡(luò)安全;2007年01期

7 李瑞軒;胡勁緯;唐卓;盧正鼎;;R~2BAC:基于風(fēng)險(xiǎn)的多自治域安全互操作模型[J];通信學(xué)報(bào);2008年10期

8 ;北京CHINAnet的建設(shè)[J];計(jì)算機(jī)與通信;1997年03期

9 葛麗娜;賀忠華;;多自治域協(xié)同的數(shù)據(jù)庫(kù)訪問(wèn)控制[J];計(jì)算機(jī)工程與應(yīng)用;2007年16期

10 陸俊秀;朱韻成;陳茂科;;互聯(lián)網(wǎng)4byte自治域標(biāo)識(shí)過(guò)渡研究[J];電信科學(xué);2008年03期

相關(guān)會(huì)議論文 前2條

1 羅守山;賈曉蕓;;網(wǎng)格計(jì)算中的可信自治域機(jī)制研究[A];全國(guó)網(wǎng)絡(luò)與信息安全技術(shù)研討會(huì)’2004論文集[C];2004年

2 李鵬;王晟;;基于Stackelberg的域間網(wǎng)絡(luò)資源配置研究[A];中國(guó)通信學(xué)會(huì)第五屆學(xué)術(shù)年會(huì)論文集[C];2008年

相關(guān)重要報(bào)紙文章 前1條

1 中國(guó)互聯(lián)網(wǎng)絡(luò)信息中心 鄭寧;IP Anycast＋BGP 實(shí)戰(zhàn)分析[N];計(jì)算機(jī)世界;2010年

相關(guān)博士學(xué)位論文 前2條

1 吳丹;基于自治域編址的可擴(kuò)展路由機(jī)制研究[D];清華大學(xué);2015年

2 李磊;自治域路由快速收斂、競(jìng)爭(zhēng)策略和流量特性建模[D];北京交通大學(xué);2008年

相關(guān)碩士學(xué)位論文 前7條

1 胡一非;邊界路由仿真系統(tǒng)的設(shè)計(jì)與實(shí)現(xiàn)[D];東南大學(xué);2016年

2 李紅平;多自治域安全互操作的風(fēng)險(xiǎn)評(píng)估方法研究[D];華中科技大學(xué);2006年

3 李鵬;自治域間的網(wǎng)絡(luò)資源優(yōu)化研究[D];電子科技大學(xué);2008年

4 王翔宇;基于自治域的異構(gòu)信息協(xié)同機(jī)制的研究與應(yīng)用[D];中南大學(xué);2009年

5 李駿;基于WSRF的多自治域網(wǎng)格服務(wù)模型的研究與實(shí)現(xiàn)[D];南京理工大學(xué);2011年

6 張衍均;可重構(gòu)控制器自治域的研究及其應(yīng)用[D];上海交通大學(xué);2008年

7 陳祥榴;可重構(gòu)控制器中自治域模塊的開(kāi)發(fā)及應(yīng)用[D];上海交通大學(xué);2007年

，

本文編號(hào)：2043789