Toward Compact Interdomain Routing

Despite prevailing concerns that the current Internet interdomain routing system will not scale to meet the needs of the 21st century global Internet, networking research has not yet led to the construction of a new routing architecture with satisfactory and mathematically provable scalability characteristics. Worse, continuing empirical trends of the existing routing and topology structure of the Internet are alarming: the foundational principles of the current routing and addressing architecture are an inherently bad match for the naturally evolving structure of Internet interdomain topology. We are fortunate that a sister discipline, theory of distributed computation, has developed routing algorithms that offer promising potential for genuinely scalable routing on realistic Internet-like topologies. Indeed, there are many recent breakthroughs in the area of compact routing, which has been shown to drastically outperform, in terms of efficiency and scalability, even the boldest proposals developed in networking research. Many open questions remain, but we believe the applicability of compact routing techniques to Internet interdomain routing is a research area whose potential payoff for the future of networking is too high to ignore.

[1]  Stéphane Pérennes,et al.  Memory requirement for routing in distributed networks , 1996, PODC '96.

[2]  Farouk Kamoun,et al.  Hierarchical Routing for Large Networks; Performance Evaluation and Optimization , 1977, Comput. Networks.

[3]  Mark Handley,et al.  HLP: a next generation inter-domain routing protocol , 2005, SIGCOMM '05.

[4]  Sanjay J. Patel,et al.  POSITION STATEMENT. , 1995, Gastrointestinal Endoscopy.

[5]  Mikkel Thorup,et al.  Approximate distance oracles , 2001, JACM.

[6]  Yehuda Afek,et al.  Upper and Lower Bounds for Routing Schemes in Dynamic Networks (Abstract) , 1989, FOCS 1989.

[7]  Evi Nemeth,et al.  Internet expansion, refinement and churn , 2002, Eur. Trans. Telecommun..

[8]  Priya Mahadevan,et al.  Lessons from Three Views of the Internet Topology , 2005, ArXiv.

[9]  Ittai Abraham,et al.  Practical Locality-Awareness for Large Scale Information Sharing , 2005, IPTPS.

[10]  kc claffy,et al.  Beyond CIDR Aggregation , 2004 .

[11]  Abhijit Bose,et al.  Delayed Internet routing convergence , 2000, SIGCOMM.

[12]  George Varghese,et al.  The impact of address allocation and routing on the structure and implementation of routing tables , 2003, SIGCOMM '03.

[13]  J. Noel Chiappa,et al.  The Nimrod Routing Architecture , 1996, RFC.

[14]  Geoff Huston,et al.  Commentary on Inter-Domain Routing in the Internet , 2001, RFC.

[15]  Rajmohan Rajaraman,et al.  Compact routing with name independence , 2003, SPAA '03.

[16]  J. Chiappa.  A New IP Routing and Addressing Architecture , 2002 .

[17]  Geoff Huston,et al.  Scaling Inter-Domain Routing—A View Forward , 2001 .

[18]  Ratul Mahajan,et al.  Colt ? ? ? ? ? ? ◦ DTAG ? ◦ • ◦ ? ? ? ? ! ◦ ? ? ? ◦ ◦ ? ? Eqip ? ? ? ? ? ? , 2003 .

[19]  Gordon T. Wilfong,et al.  Analysis of the MED oscillation problem in BGP , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..

[20]  Mikkel Thorup,et al.  Compact name-independent routing with minimum stretch , 2004, SPAA '04.

[21]  Fan Chung Graham,et al.  The Average Distance in a Random Graph with Given Expected Degrees , 2004, Internet Math..

[22]  B. Karp,et al.  Reduced State Routing in the Internet ∗ , 2004 .

[23]  Gordon T. Wilfong,et al.  An analysis of BGP convergence properties , 1999, SIGCOMM '99.

[24]  Cyril Gavoille,et al.  Space-Efficiency for Routing Schemes of Stretch Factor Three , 2001, J. Parallel Distributed Comput..

[25]  P. Fraigniaud.  A New Perspective on the Small-World Phenomenon: Greedy Routing in Tree-Decomposed Graphs , 2005 .

[26]  Ramesh Govindan,et al.  RSR: Reduced-State Routing in the Internet , 2004, SIGCOMM 2004.

[27]  Xiaowei Yang,et al.  Compact routing on Internet-like graphs , 2003, IEEE INFOCOM 2004.

[28]  Lenore Cowen,et al.  Compact routing with minimum stretch , 1999, SODA '99.