AMIR: Another Multipath Interdomain Routing

Multipath routing is an important and 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 a destination network, which does not satisfy the diverse requirements of end users. In this paper, in order to support the effective and efficient multipath routing, we propose a multipath interdomain routing system(AMIR), which not only provides more novel paths but also realizes a new AS-level routing scheme. In the control plane, the topology information is collected from neighboring ASes around the primary path, and based on this topology, multipath of the special node pairs is calculated by our multipath discovery algorithm. In the data plane, we use the interdomain source routing to forward the packets. Experiments with Internet topology and routing data demonstrate that AMIR is practical and feasible, and offers tremendous flexibility and diversity for path selection with reasonable overhead.

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

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

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

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

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

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

[7]  Renata Teixeira,et al.  Characterizing and measuring path diversity of internet topologies , 2003, SIGMETRICS '03.

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

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

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

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

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

[13]  Sunil Kumar,et al.  WITHDRAWN: Bill-and-Keep peering , 2006 .

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

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

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

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

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

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

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

[21]  Stefan Savage,et al.  The end-to-end effects of Internet path selection , 1999, SIGCOMM '99.

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

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