期刊文献+

一种基于故障时间的可调域间出口选择算法

A Tunable Interdomain Egress Selection Algorithm Based on the Failure Duration
下载PDF
导出
摘要 在大型Internet服务提供商中,BGP(border gateway protocol)出口路径选择常常采用"热土豆"机制.然而研究表明,该机制具有相当大的局限性以及出口调节的间接性,它容易影响域间路由的健壮性.针对"热土豆"机制的缺点,出现了一些新的BGP出口路径选择机制和算法.然而,这些方法在解决问题时往往忽略网络运行过程中经常出现的IP链路故障或故障持续时间的影响,提出了一种基于故障时间的可调域间出口路径选择算法,该算法能够根据流量工程的目标、路由稳定性等要求进行动态的调整,同时满足路由变化的实时性.模拟实验结果表明。 Hot-Potato routing is a mechanism widely employed in the border gateway protocol (BGP) interdomain egress selection in large internet service provider (ISP). Recent work has shown that hot-potato routing is convoluted, restrictive so that it can impact the robustness of interdomain routing. Though a lot of research have been done to replace it with new mechanisms, these methods often ignore the issue of link failures or the failure duration, which arise as part of everyday network operations. In this paper, a tunable interdomain egress selection algorithm based on the IP link failure duration is proposed. The algorithm is tunable with the change of traffic engineering goals and routing stability in routers. It can also satisfy the purpose of real time in routers. Simulation results show that the algorithm can reach good balance among multiple goals.
出处 《软件学报》 EI CSCD 北大核心 2007年第12期3080-3091,共12页 Journal of Software
基金 Supported by the National Basic Research Program of China under Grant No.2003CB3148020(国家重点基础研究发展计划(973)) the National Natural Science Foundation of China under Grant No.90204005(国家自然科学基金)
关键词 BGP(border GATEWAY protocol) 流量工程 路由项 转发路径 路由稳定性 BGP (border gateway protocol) traffic engineering route prefix forwarding path routing stability
  • 相关文献

参考文献1

二级参考文献10

  • 1AWDUCHE D, MALCOLM J, JAGOGBUA J, et al. Requirements for Traffic Engineering over MPLS[S]. RFC 2702, 1999.
  • 2XIAO X P. Traffic enRineering with MPLS in the Internet[J]. IEEE Networking, 2000, 14(2): 28-33.
  • 3GIRISH M K, ZHOU B, HU J Q. Formulation of the traffic engineering problems in MPLS based IP networks[A]. The Fifth IEEE ISCC[C]. Antibes, France, 2000. 214-219.
  • 4WANG Y F, WANG Z. Explicit routing algorithms for Intemet Waffic engineering[A]. IEEE ICCCN'99[C]. Boston, MA, 1999.582-588.
  • 5LEE Y, SEOK Y, CHOI Y. A consu'ained multipath traffic engineering scheme for MPLS networks[A]. ICC'02[C]. New York, 2002.2431-2436.
  • 6BERTSEKAS D. GALAGER R. Data Networks[M]. NJ: Printice Hall, 1992.
  • 7ALOUANE A B, BEAN J C. A generic algorithm for the multiple-choice integer program[J]. Operations Research, 1997,45(1):92-101.
  • 8SRINIVAS M, PATNAINK L M. Adaptive probabilities of crossover and mutation in genetic algorithms[J]. IEEE Transactions on Systems, MAN and Cybernetics,1994,24(4): 656-667.
  • 9CHONG E I, SANJEEV S R, MADDILA R, et al. On finding single-source single-destination k shortest paths[A]. ICCI '95[C].Peterborogh, Canada, 1995.40-47.
  • 10WAXMAN B M. Routing of multipoint connections[J]. IEEE Jounlal on Selected Areas in Communications, 1988, 6(9): 1617-1622.

共引文献26

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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