计算机科学 ›› 2013, Vol. 40 ›› Issue (10): 104-107.
曹生林,马旭
CAO Sheng-lin and MA Xu
摘要: 当前的域间路由协议BGP全局敏感性极高且收敛慢。为了解决该问题,提出了基于区域的路由模型ZCR。在ZCR中,将同属于同一政治经济组织的AS划分为一个区域,在区域内采用连接向量路由协议,区域间以区域为单位部署路径向量协议。ZCR能够将网络事件控制在区域内,在支持路由策略的同时降低网络的全局敏感性,提高网络的收敛速度。并且ZCR可以在Internet中递增部署,以便逐步对当前网络进行升级改造。AS级别的实验结果显示了ZCR的有效性。
[1] John J P,Katz-Bassett E,Krishnamurthy A,et al.ConsensusRouting:The Internet as a Distribute System [C]∥Proceedings of the fifth USENIX Network Symposium on Design and Implementation(NSDI’08).2008:351-364 [2] Subramanian L,Caesar M,Ee C T,et al.HLP:A next generation inter-domain routing protocol[C]∥Proc.ACM SIGCOMM.2011:13-24 [3] Zhang Xin,Perrig A,Zhang Hui.Centaur:A Hybrid Approachfor Reliable Policy-Based Routing[C]∥the 29th International Conference on Distributed Computing Systems(ICDCS).June 2010:22-26 [4] Pei D,et al.BGP-RCN:Improving BGP Convergence throughRoot Cause Notification[R].TR-030047.UCLA,2012 [5] Karlin J,et al.Nation-State Routing:Censorship,Wiretapping,and BGP[J].Computing Research Repository-CORR,2009,903 [6] SSF-Scalable Simulation Framework.http://www.ssfnet.org,2010-04-23 [7] Medina A,Lakhina A,Matta I,et al.BRITE:An approach to universal topology generation[C]∥MASCOTS.2011 [8] 吴大鹏,杨正川,刘乔寿,等.带有相遇预测的自适应路由机制[J].重庆邮电大学学报:自然科学版,2013,25(3):368-371 |
No related articles found! |
|