期刊文献+

面向弹性路由层生成的网络拓扑评价与优化方法 被引量:3

Methods of Network Topology Evaluation and Optimization for Resilient Routing Layers Generation
下载PDF
导出
摘要 针对弹性路由层重路由技术在不同应用需求下的适用性问题及本身存在的路径次优问题,提出了一种面向弹性路由层的网络拓扑评价方法以及原拓扑结构优化方法。在介绍弹性路由层相关理论背景的基础上,给出了其规范的矩阵表述方式,提出了3个从不同角度反映生成的弹性路由层性能的评估指标,为了对原拓扑结构进行优化设计,提出了评判弹性路由层生成潜力的原全拓扑评估指标,基于此给出了面向弹性路由层生成的原拓扑结构优化方法。仿真结果表明,评估指标可以客观地评判出弹性路由层在不同情况下的适用程度,而优化的原拓扑结构能够以较少的资源满足应用需求,且很大程度上克服了路径次优问题。 In order to solve the problem of resilient routing layers' adaptability under different requirement and sub-op- timum routes, the methods of network topology evaluation and original topology optimization for resilient routing layers were presented. The formal matrix expression of resilient routing layers was given on the basis of its theoretical back- ground. Three indices to evaluate the resilient muting layers ~ performance were put forward from different point of view. The indices to evaluate the potential of original full topology generating resilient routing layers were proposed. In order to realize optimum design of original topology, the original topology optimum method for resilient routing layers' generation was given. The simulation results show that the indices can objectively assess the adaptability of resilient routing layers under different requirement, and the optimized original topology can satisfy the application requirement with fewer resources, also the problem of sub-optimum routes is greatly overcome.
出处 《计算机科学》 CSCD 北大核心 2014年第1期196-201,共6页 Computer Science
基金 国家自然科学基金项目(61003252 61201209) 全军军事学研究生课题(2011JY002-524 2012JY002-563) 空军工程大学信息与导航学院博士生创新基金项目(20110501)资助
关键词 IP重路由 网络拓扑 弹性路由层 评估指标 优化 IP rerouting, Network topology, Resilient routing layers, Evaluation indices, Optimization
  • 相关文献

参考文献14

  • 1Sterbenz J P G,Hutchison D,Ctinkaya E K. Resilience and survivability in communication networks:strategies,principles,and survey of disciplines[J].Computer Networks,2010,(08):1245-1265.
  • 2Retvari G,Csikor L,Tapolcai J. Optimizing IGP link costs for improving IP-level resilience with Loop-Free alternates[A].2011.62-69.
  • 3Su H K. A local fast-reroute mechanism for single node or link protection in hop-by-hop routed networks[J].Computer Communications,2012,(08):970-979.
  • 4苏金树,胡乔林,赵宝康.互联网无中断转发的生存性路由协议[J].软件学报,2010,21(7):1589-1604. 被引量:8
  • 5Atlas A. U-turn alternates for IP/LDP local protection[Z].IETF Internet Draft,Draft-Atlas-IP-Local-Protect-Uturn03.Txt,Work in Progress,2006.
  • 6Xu M W,Yang Y,Li Q. Selecting shorter alternate paths for tunnel-based IP fast reroute in linear time[J].Computer Networks,2012,(02):845-857.
  • 7Shand M,Bryant S,Previdi S. IP fast reroute using not-via addresses[Z].IETF Internct Draft,Draft-Ietf-Rtgwg-Ipfrr-NotviaAddresses-007.Txt,2008.
  • 8于涛,陈山枝,李昕,秦臻.偏转路由的网络故障处理技术[J].北京邮电大学学报,2007,30(6):1-4. 被引量:4
  • 9Nelakuditi S,Lee S,Yu Y Z. Fast local rerouting for handling transient link failures[J].IEEE/ACM Transactions on Networking,2007,(02):359-372.
  • 10Hansen A F;Kvalbein A;Gjessing S.Fast,effective and stable IP recovery using resilient routing layers[A]北京,20051631-1640.

二级参考文献64

  • 1Hansen AF,Lysne O,Cicic T,Gjessing S.Fast proactive recovery from concurrent failures.In:Proc.of the ICC 2007.Glasgow:IEEE Computer Society,2007.115-122.http://dx.doi.org/10.1109/ICC.2007.28.
  • 2Kini S,Ramasubramanian S,Kvalbein A,Hansen AF.Fast recovery from dual link failures in IP networks.In:Proc.of the Infocom 2009.Rio de Janeiro:IEEE Computer Society,2009.1368-1376.http://dx.doi.org/10.1109/INFCOM.2009.5062052.
  • 3Motiwala M,Elmore M,Feamster N,Nempala S.Path splicing.In:Proc.of the SIGCOMM 2008.Seattle:ACM Press,2008.27-38.http://doi.acm.org/10.1145/1402958.1402963.
  • 4Lakshminarayanan KK,Caesar MC,Rangan M,Anderson T,Shenker S,Stoica I.Achieving convergence-free routing using failure-carrying packets.In:Proc.of the ACM SIGCOMM 2007.Kyoto:ACM Press,2007.241-252.http://doi.acm.org/10.1145/ 1282380.1282408.
  • 5Wang J,Zhong Z,Nelakuditi S.Handling multiple network failures through interface specific forwarding.In:Proc.of the GLOBECOM 2006.San Francusco:IEEE Computer Society,2006.1-6.http://dx.doi.org/10.1109/GLOCOM.2006.33.
  • 6Ermolinskiy A,Shenker S.Reducing transient disconnectivity using anomaly-cognizant forwarding.In:Proc.of the ACM SIGCOMM Hotnet VII.Calgary:ACM Press,2008.91-96.http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.141.3080.
  • 7Elmokash A,Kvalbein A,Dovrolis C.On the scalability of BGP:The roles of topology growth and update rate-limiting.In:Proc.of the CoNEXT 2008.Madrid:ACM Press,2008.1-12.http://doi.acm.org/10.1145/1544012.1544020.
  • 8de Carli L,Pan Y,Kumar A,Estan C,Sankaralingam K.PLUG:Flexible lookup modules for rapid deployment of new protocols in high-speed routers.In:Proc.of the ACM SIGCOMM 2009.Barcelona:ACM Press,2009.207-218.http://doi.acm.org/10.1145/ 1592568.1592593.
  • 9Kvalbein A,Cicic T,Gjessing S.Post-Failure routing performance with multiple routing configurations.In:Proc.of the IEEE INFOCOM 2007.Anchorage:IEEE Computer Society,2007.98-106.http://dx.doi.org/10.1109/INFCOM.2007.20.
  • 10Godfrey PB,Ganichev I,Shenkerz S,Stoica I.Pathlet routing.In:Proc.of the ACM SIGCOMM 2009.Barcelona:ACM Press,2009.111-122.

共引文献10

同被引文献10

引证文献3

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部