Finding Alternate Paths in the Internet: A Survey of Techniques for End-to-End Path Discovery

The Internet provides physical path diversity between a large number of hosts, making it possible for networks to use alternative paths when one path fails to deliver the required Quality of Service. However, for various reasons, many established protocols (e.g. de facto Internet inter-domain routing protocol, Border-Gateway Protocol - BGP) do not fully exploit such alternate paths. This paper surveys research into techniques for discovering end-to-end alternate paths, including those based on monitoring path performance, choosing paths that are maximally disjoint, and in routing across multiple paths. It surveys proposals for making BGP better able to exploit multiple paths and how multi-homing can create alternate paths. It also describes how alternate paths can be realized through detour routing (application layer mechanisms) and routing deflections (network layer mechanisms). It also discusses Fast Re-Route techniques for construction of backup routes. It concludes by surveying open research issues into the discovery and use of alternate paths in the Internet.

[1]  Tim Moors,et al.  Practical issues of statistical path monitoring in overlay networks with large, rank-deficient routing matrices , 2008, 2008 5th International Conference on Broadband Communications, Networks and Systems.

[2]  Yehuda Afek,et al.  Improved BGP convergence via ghost flushing , 2003, IEEE Journal on Selected Areas in Communications.

[3]  Amin Vahdat,et al.  Detour: a Case for Informed Internet Routing and Transport , 2007 .

[4]  Aleksandar Kuzmanovic,et al.  Drafting behind Akamai (travelocity-based detouring) , 2006, SIGCOMM '06.

[5]  Tim Moors,et al.  Using Type-of-Relationship (ToR) Graphs to Select Disjoint Paths in Overlay Networks , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

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

[7]  Mark Crovella,et al.  Network Kriging , 2005, IEEE Journal on Selected Areas in Communications.

[8]  Shi Zhou,et al.  The rich-club phenomenon in the Internet topology , 2003, IEEE Communications Letters.

[9]  George Varghese,et al.  Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications , 2001, SIGCOMM 2001.

[10]  Philip K. McKinley,et al.  On the cost-quality tradeoff in topology-aware overlay path probing , 2003, 11th IEEE International Conference on Network Protocols, 2003. Proceedings..

[11]  D. Saucez,et al.  Interdomain traffic engineering in a locator/identifier separation context , 2008, 2008 IEEE Internet Network Management Workshop (INM).

[12]  Olivier Bonaventure,et al.  Interdomain traffic engineering with BGP , 2003, IEEE Commun. Mag..

[13]  Arun Venkataramani,et al.  Consensus Routing: The Internet as a Distributed System. (Best Paper) , 2008, NSDI.

[14]  Chen-Nee Chuah,et al.  Race Conditions in Coexisting Overlay Networks , 2008, IEEE/ACM Transactions on Networking.

[15]  Yin Zhang,et al.  On the constancy of internet path properties , 2001, IMW '01.

[16]  Ion Stoica,et al.  Characterizing selfishly constructed overlay routing networks , 2004, IEEE INFOCOM 2004.

[17]  Sujata Banerjee,et al.  Bandwidth-Aware Routing in Overlay Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[18]  Hari Balakrishnan,et al.  Resilient overlay networks , 2001, SOSP.

[19]  Randy H. Katz,et al.  Backup path allocation based on a correlated link failure probability model in overlay networks , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..

[20]  Hari Balakrishnan,et al.  Best-path vs. multi-path overlay routing , 2003, IMC '03.

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

[22]  Donald F. Towsley,et al.  On characterizing BGP routing table growth , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[23]  Jean-Philippe Vasseur,et al.  Path-Computation-Element-Based Architecture for Interdomain MPLS/GMPLS Traffic Engineering: Overview and Performance , 2007, IEEE Network.

[24]  Stewart Bryant,et al.  IP Fast Reroute Framework , 2010, RFC.

[25]  Brice Augustin,et al.  Detection, understanding, and prevention of traceroute measurement artifacts , 2008, Comput. Networks.

[26]  Robert D. Nowak,et al.  Maximum likelihood network topology identification from edge-based unicast measurements , 2002, SIGMETRICS '02.

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

[28]  Daniel Massey,et al.  BGP-RCN: improving BGP convergence through root cause notification , 2005, Comput. Networks.

[29]  Yan Chen,et al.  Algebra-Based Scalable Overlay Network Monitoring: Algorithms, Evaluation, and Applications , 2007, IEEE/ACM Transactions on Networking.

[30]  Ramesh Govindan,et al.  Heuristics for Internet map discovery , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

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

[32]  David Wetherall,et al.  Source selectable path diversity via routing deflections , 2006, SIGCOMM 2006.

[33]  Olivier Bonaventure,et al.  An evaluation of IP-based fast reroute techniques , 2005, CoNEXT '05.

[34]  Philip K. McKinley,et al.  A distributed approach to topology-aware overlay path monitoring , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[35]  Randy H. Katz,et al.  Algebra-Based Scalable Overlay Network Monitoring: Algorithms, Evaluation, and Applications , 2007, IEEE/ACM Transactions on Networking.

[36]  Jordi Domingo-Pascual,et al.  On the challenges of establishing disjoint QoS IP/MPLS paths across multiple domains , 2006, IEEE Communications Magazine.

[37]  Randy H. Katz,et al.  Tomography-based overlay network monitoring , 2003, IMC '03.

[38]  Arnold L. Rosenberg,et al.  Comparing the structure of power-law graphs and the Internet AS graph , 2004, Proceedings of the 12th IEEE International Conference on Network Protocols, 2004. ICNP 2004..

[39]  Bradley Huffaker,et al.  Traceroute probe method and forward IP path inference , 2008, IMC '08.

[40]  Arvind Krishnamurthy,et al.  Managing a portfolio of overlay paths , 2004, NOSSDAV '04.

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

[42]  Adrian Farrel,et al.  A Path Computation Element (PCE)-Based Architecture , 2006, RFC.

[43]  Renata Teixeira,et al.  Network sensitivity to hot-potato disruptions , 2004, SIGCOMM 2004.

[44]  Ben Y. Zhao,et al.  Exploiting routing redundancy via structured peer-to-peer overlays , 2003, 11th IEEE International Conference on Network Protocols, 2003. Proceedings..

[45]  Yin Zhang,et al.  On selfish routing in Internet-like environments , 2003, IEEE/ACM Transactions on Networking.

[46]  Cormac J. Sreenan,et al.  Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video , 2004 .

[47]  David Watson,et al.  An Experimental Study of Internet Path Diversity , 2006, IEEE Transactions on Dependable and Secure Computing.

[48]  Walter Willinger,et al.  Internet connectivity at the AS-level: an optimization-driven modeling approach , 2003, MoMeTools '03.

[49]  Donald F. Towsley,et al.  Exploring the performance benefits of end-to-end path switching , 2004, Proceedings of the 12th IEEE International Conference on Network Protocols, 2004. ICNP 2004..

[50]  Aleksandar Kuzmanovic,et al.  Drafting behind Akamai (travelocity-based detouring) , 2006, SIGCOMM 2006.

[51]  Ben Y. Zhao,et al.  Brocade: Landmark Routing on Overlay Networks , 2002, IPTPS.

[52]  Yin Zhang,et al.  On selfish routing in internet-like environments , 2006, TNET.

[53]  Roch Guérin,et al.  How to Select a Good Alternate Path in Large Peer-to-Peer Systems? , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[54]  Marcelo Bagnulo,et al.  The paths toward IPv6 multihoming , 2006, IEEE Communications Surveys & Tutorials.

[55]  Michael G. Rabbat,et al.  Compressed network monitoring for ip and all-optical networks , 2007, IMC '07.

[56]  M Py.  Multi Homing Translation Protocol (MHTP) , 2001 .

[57]  Peter Steenkiste,et al.  Exploiting internet route sharing for large scale available bandwidth estimation , 2005, IMC '05.

[58]  Chen-Nee Chuah,et al.  Race conditions in coexisting overlay networks , 2008, TNET.

[59]  Krishna P. Gummadi,et al.  Improving the Reliability of Internet Paths with One-hop Source Routing , 2004, OSDI.

[60]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[61]  Yong Zhu,et al.  Dynamic overlay routing based on available bandwidth estimation: A simulation study , 2006, Comput. Networks.

[62]  Anees Shaikh,et al.  A comparison of overlay routing and multihoming route control , 2004, SIGCOMM '04.

[63]  Philip K. McKinley,et al.  Improving multipath reliability in topology-aware overlay networks , 2005, 25th IEEE International Conference on Distributed Computing Systems Workshops.

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