Dynamic overlay routing based on available bandwidth estimation: A simulation study

Dynamic overlay routing has been proposed as a way to enhance the reliability and performance of IP networks. The major premise is that overlay routing can bypass congestion, transient outages, or suboptimal paths, by forwarding traffic through one or more intermediate overlay nodes. In this paper, we perform an extensive simulation study to investigate the performance of dynamic overlay routing. In particular, we leverage recent work on available bandwidth (avail-bw) estimation, and focus on overlay routing that selects paths based on avail-bw measurements between adjacent overlay nodes. First, we compare two overlay routing algorithms, reactive and proactive, with shortest-path native routing. We show that reactive routing has significant benefits in terms of throughput and path stability, while proactive routing is better in providing flows with a larger safety margin (''headroom''), and propose a hybrid routing scheme that combines the best features of the previous two algorithms. We then examine the effect of several factors, including network load, traffic variability, link-state staleness, number of overlay hops, measurement errors, and native sharing effects. Some of our results are rather surprising. For instance, we show that a significant measurement error, even up to 100% of the actual avail-bw value, has a negligible impact on the efficiency of overlay routing.

[1]  Prasant Mohapatra,et al.  The impact of topology on overlay routing service , 2004, IEEE INFOCOM 2004.

[2]  Eric Anderson,et al.  On the stability of adaptive routing in the presence of congestion control , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[3]  Prasant Mohapatra,et al.  QRON: QoS-aware routing in overlay networks , 2004, IEEE Journal on Selected Areas in Communications.

[4]  Angelos D. Keromytis,et al.  SOS: secure overlay services , 2002, SIGCOMM '02.

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

[6]  Akihiro Nakao,et al.  A routing underlay for overlay networks , 2003, SIGCOMM '03.

[7]  Peter Steenkiste,et al.  Evaluation and characterization of available bandwidth probing techniques , 2003, IEEE J. Sel. Areas Commun..

[8]  M. Frans Kaashoek,et al.  A measurement study of available bandwidth estimation tools , 2003, IMC '03.

[9]  Randy H. Katz,et al.  Over QoS: Offering QoS using overlays , 2002 .

[10]  Kirk L. Johnson,et al.  Overcast: reliable multicasting with on overlay network , 2000, OSDI.

[11]  Hui Zhang,et al.  A case for end system multicast (keynote address) , 2000, SIGMETRICS '00.

[12]  Joseph D. Touch.  Dynamic Internet overlay deployment and management using the X-Bone , 2000, Proceedings 2000 International Conference on Network Protocols.

[13]  Sally Floyd,et al.  Wide area traffic: the failure of Poisson modeling , 1995, TNET.

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

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

[16]  Anees Shaikh,et al.  An empirical evaluation of wide-area internet bottlenecks , 2003, IMC '03.

[17]  Yin Zhang,et al.  On self adaptive routing in dynamic environments - an evaluation and design using a simple, probabilistic scheme , 2004, Proceedings of the 12th IEEE International Conference on Network Protocols, 2004. ICNP 2004..

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

[19]  Randy H. Katz,et al.  An algebraic approach to practical and scalable overlay network monitoring , 2004, SIGCOMM 2004.

[20]  Vern Paxson,et al.  Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications , 2002, SIGCOMM 2002.

[21]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..

[22]  Hans Eriksson,et al.  MBONE: the multicast backbone , 1994, CACM.

[23]  Manish Jain,et al.  End-to-end available bandwidth: measurement methodology, dynamics, and relation with TCP throughput , 2003, TNET.

[24]  Manish Jain,et al.  End-to-end available bandwidth: measurement methodology, dynamics, and relation with TCP throughput , 2003, IEEE/ACM Trans. Netw..

[25]  Srinivasan Seshan,et al.  A case for end system multicast , 2002, IEEE J. Sel. Areas Commun..

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

[27]  Anees Shaikh,et al.  A measurement-based analysis of multihoming , 2003, SIGCOMM '03.

[28]  Joseph D. Touch.  Dynamic Internet overlay deployment and management using the X-Bone , 2001, Comput. Networks.

[29]  Donald F. Towsley,et al.  Exploring the Performance Benefits of End-to-End Path Switching , 2004, ICNP.

[30]  Tim Roughgarden,et al.  How bad is selfish routing? , 2002, JACM.

[31]  Richard G. Baraniuk,et al.  pathChirp: Efficient available bandwidth estimation for network paths , 2003 .

[32]  Jeffrey Considine,et al.  Informed content delivery across adaptive overlay networks , 2002, IEEE/ACM Transactions on Networking.

[33]  Nick Feamster,et al.  Measuring the effects of internet path faults on reactive routing , 2003, SIGMETRICS '03.

[34]  Ratul Mahajan,et al.  Measuring ISP topologies with rocketfuel , 2002, TNET.

[35]  Aditya Akella,et al.  Mechanisms for Internet Routing: A Study , 2002 .

[36]  Randy H. Katz,et al.  Dynamics of Simultaneous Overlay Network Routing , 2003 .

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