Multipath interdomain routing via deviation from primary path

Multi-path routing is a promising technique to increase the Internet's reliability and to give users greater control over the service they receive. Currently the interdomain routing protocol limits each router to using a single route for same destination, which may not satisfy the diverse requirements of end users. In this paper, in order to support the effective and efficient multi-path service(MPS), we propose a multi-path inter-domain routing via deviation from primary path(MIR-DPP) which includes two main steps as following. Firstly, to improve the path diversity of node pairs, the special topology collected from neighboring ASes around the primary path, and the multipath set is calculated by our multipath discovery method. Secondly, to gain high-quality paths which are not compliant with routing policy, a negotiation mechanism is designed to address policy limits. Experiments with Internet topology and routing data demonstrate that MIR-DPP offers tremendous flexibility and diversity for path selection with reasonable overhead.

[1]  Steve Uhlig,et al.  Modeling the routing of an autonomous system with C-BGP , 2005, IEEE Network.

[2]  Xiaowei Yang,et al.  Source selectable path diversity via routing deflections , 2006, SIGCOMM.

[3]  Xiaomin Zhu,et al.  Introducing multipath selection for concurrent multipath transfer in the future internet , 2011, Comput. Networks.

[4]  Lixin Gao On inferring autonomous system relationships in the internet , 2001, TNET.

[5]  Santosh S. Vempala,et al.  Path splicing , 2008, SIGCOMM '08.

[6]  Joan Feigenbaum,et al.  A BGP-based mechanism for lowest-cost routing , 2002, PODC '02.

[7]  Bruce M. Maggs,et al.  R-BGP: Staying Connected in a Connected World , 2007, NSDI.

[8]  Thomas L. Saaty Fundamentals of decision making and priority theory , 2000 .

[9]  Jennifer Rexford,et al.  MIRO: multi-path interdomain routing , 2006, SIGCOMM 2006.

[10]  Kwan Lawrence Yeung,et al.  Traffic distribution over equal-cost-multi-paths , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[11]  SeungJae Shin,et al.  Internet Interconnection Economic Model and its Analysis: Peering and Settlement , 2002, Communication Systems: The State of the Art.

[12]  Yakov Rekhter,et al.  A Border Gateway Protocol 4 (BGP-4) , 1994, RFC.

[13]  S. Clarke,et al.  Computing the N Best Loopless Paths in a Network , 1963 .

[14]  Jennifer Rexford,et al.  Toward internet-wide multipath routing , 2008, IEEE Network.

[15]  X.. Yang,et al.  NIRA: A New Inter-Domain Routing Architecture , 2007, IEEE/ACM Transactions on Networking.

[16]  J. Y. Yen,et al.  Finding the K Shortest Loopless Paths in a Network , 2007 .

[17]  J. Y. Yen Finding the K Shortest Loopless Paths in a Network , 1971 .

[18]  Sunil Kumar,et al.  Bill-and-Keep peering , 2008 .

[19]  Brighten Godfrey,et al.  YAMR: yet another multipath routing protocol , 2010, CCRV.

[20]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[21]  Jon Postel,et al.  Internet Protocol , 1981, RFC.