Scalable Resilient Overlay Networks Using Destination-Guided Detouring

Routing policies used in the Internet tend to be restrictive, limiting communication between source-destination pairs to one path, when often better alternatives exist. To avoid route flapping, recovery mechanisms may be dampened, making adaptation slow. Unstructured overlays have been widely used to mitigate the issues of path and performance failures in the Internet by routing through alternate paths via overlay peers. The construction of such routing overlays often does not take into account the physical topology of the network, which necessitates that all overlay nodes aggressively probe paths to check performance, limiting scalability. In this paper, we analyze a topologically-aware architecture to estimate end-to-end path availability for service on the Internet. We propose destination-guided detouring via resilient overlay networks (DG-RON); a distributed coordinate-based overlay architecture, which uses landmark based heuristics for scalable end-to-end path discovery. Simulations show that DG- RON can predict alternate paths with a high success rate.

[1]  Akihiro Nakao,et al.  Scalable routing overlay networks , 2006, OPSR.

[2]  Aruna Seneviratne,et al.  Enhancing QoS Through Alternate Path: An End-to-End Framework , 2005, ICN.

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

[4]  Helen J. Wang,et al.  Server-based inference of Internet link lossiness , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[5]  Hari Balakrishnan,et al.  Improving web availability for clients with MONET , 2005, NSDI.

[6]  Mark Crovella,et al.  Virtual landmarks for the internet , 2003, IMC '03.

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

[8]  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..

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

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

[11]  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.

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

[13]  Lakshminarayanan Subramanian,et al.  An investigation of geographic mapping techniques for internet hosts , 2001, SIGCOMM 2001.

[14]  Yehuda Afek,et al.  Improved BGP convergence via ghost flushing , 2004, IEEE J. Sel. Areas Commun..

[15]  Hui Zhang,et al.  Predicting Internet network distance with coordinates-based approaches , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

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

[17]  Ram Keralapura,et al.  Can ISPs Take the Heat from Overlay Networks ? , 2004 .

[18]  Jasleen Kaur,et al.  Testing the Scalability of Overlay Routing Infrastructures , 2004, PAM.

[19]  E BustamanteFabián,et al.  Drafting behind Akamai (travelocity-based detouring) , 2006 .

[20]  Randy H. Katz,et al.  OverQoS: offering Internet QoS using overlays , 2003, CCRV.

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

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

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

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

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

[26]  Mahadev Satyanarayanan,et al.  Proceedings of the eighteenth ACM symposium on Operating systems principles , 2001, SOSP 2001.

[27]  Mark Handley,et al.  Topologically-aware overlay construction and server selection , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

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

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