Skip to main content

On the Feasibility of Bandwidth Detouring

  • Conference paper
Passive and Active Measurement (PAM 2011)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 6579))

Included in the following conference series:

Abstract

Internet applications that route data over default Internet paths can often increase performance by sending their traffic over alternative “detour” paths. Previous work has shown that applications can use detour routing to improve end-to-end metrics such as latency and path availability. However, the potential of detour routing has yet to be applied where it may be most important: improving TCP throughput.

In this paper, we study the feasibility of bandwidth detouring on the Internet. We find that bandwidth detours are prevalent: between 152 Planetlab nodes, 74.8% of the paths can benefit from detours with at least 1 Mbps and 20% improvement. To understand how to exploit bandwidth detours in practice, we explore the trade-offs between network- and transport-level mechanisms for detouring. We show, both analytically and experimentally, that direct, TCP-based detour routing improves TCP throughput more than encapsulated, IP-based tunneling, although the latter provides a more natural interface.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Andersen, D.G., Balakrishnan, H., Kaashoek, M.F., Morris, R.: Resilient Overlay Networks. In: SOSP, Chateau Lake Louise, Banff, Canada (2001)

    Google Scholar 

  2. Baccelli, F., Carofiglio, G., Foss, S.: Proxy Caching in Split TCP: Dynamics, Stability and Tail Asymptotics. In: INFOCOM 2008, pp. 131–135 (2008)

    Google Scholar 

  3. Gummadi, K.P., Madhyastha, H., Gribble, S.D., et al.: Improving the reliability of internet paths with one-hop source routing. In: OSDI (2004)

    Google Scholar 

  4. Ho, S.W., Haddow, T., Ledlie, J., Draief, M., Pietzuch, P.: Deconstructing Internet Paths: An Approach for AS-Level Detour Route Discovery. In: IPTPS (2009)

    Google Scholar 

  5. Jain, M., Dovrolis, C.: Pathload: A Measurement Tool for End-to-End Available Bandwidth. In: PAM, Fort Collins, CO (2002)

    Google Scholar 

  6. Jain, M., Dovrolis, C.: Path Selection using Available Bandwidth Estimation in Overlay-based Video Streaming. Com. Networks 52(12), 2411–2418 (2008)

    Article  Google Scholar 

  7. Karbhari, P., Ammar, M.H., Zegura, E.W.: Optimizing End-to-End Throughput for Data Transfers on an Overlay-TCP Path. In: Boutaba, R., Almeroth, K.C., Puigjaner, R., Shen, S., Black, J.P. (eds.) NETWORKING 2005. LNCS, vol. 3462, pp. 943–955. Springer, Heidelberg (2005)

    Google Scholar 

  8. Kopparty, S., Krishnamurthy, S.V., Faloutsos, M., Tripathi, S.K.: Split TCP for Mobile Ad Hoc Networks. In: GLOBECOM (2002)

    Google Scholar 

  9. Ladiwala, S., Ramaswamy, R., Wolf, T.: Transparent TCP Acceleration. Com. Communications 32(4), 691–702 (2009)

    Article  Google Scholar 

  10. Lakshman, T., et al.: Performance of TCP/IP for Networks with High Bandwidth-delay Products and Random Loss. IEEE/ACM Trans. Netw. 5(3), 336–350 (1997)

    Article  Google Scholar 

  11. Lee, S.J., Banerjee, S., Sharma, P., Yalagandula, P., Basu, S.: Bandwidth-Aware Routing in Overlay Networks. In: INFOCOM, Phoenix, AZ (2008)

    Google Scholar 

  12. Lee, S.-J., Sharma, P., Banerjee, S., Basu, S., Fonseca, R.: Measuring Bandwidth Between PlanetLab Nodes. In: Dovrolis, C. (ed.) PAM 2005. LNCS, vol. 3431, pp. 292–305. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  13. Lumezanu, C., Baden, R., Levin, D., Bhattacharjee, B., Spring, N.: Symbiotic Relationships in Internet Routing Overlays. In: NSDI (2009)

    Google Scholar 

  14. Lumezanu, C., Baden, R., Spring, N., Bhattacharjee, B.: Triangle Inequality and Routing Policy Violations in the Internet. In: Moon, S.B., Teixeira, R., Uhlig, S. (eds.) PAM 2009. LNCS, vol. 5448, pp. 45–54. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  15. Madhyastha, H.V., Isdal, T., Piatek, M., Dixon, C., et al.: iPlane: An Information Plane for Distributed Services. In: OSDI, Seattle, WA (2006)

    Google Scholar 

  16. Padhye, J., Firoiu, V., Towsley, D.F., Kurose, J.F.: Modeling TCP Throughput: A Simple Model and Its Empirical Validation. In: SIGCOMM (1998)

    Google Scholar 

  17. Savage, S., Anderson, T., Aggarwal, A., Becker, D., Cardwell, N., Collins, A., Hoffman, E., Snell, J., Vahdat, A., Voelker, G., Zahorjan, J.: Detour: Informed Internet Routing and Transport. IEEE Micro. 19(1), 50–59 (1999)

    Article  Google Scholar 

  18. Strauss, J., Katabi, D., Kaashoek, M.F.: A Measurement Study of Available Bandwidth Estimation Tools. In: IMC (2003)

    Google Scholar 

  19. Zhu, Y., Dovrolis, C., Ammar, M.H.: Dynamic Overlay Routing based on Available Bandwidth Estimation: A Simulation Study. Com. Networks 50(6), 742–762 (2006)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Haddow, T., Ho, S.W., Ledlie, J., Lumezanu, C., Draief, M., Pietzuch, P. (2011). On the Feasibility of Bandwidth Detouring. In: Spring, N., Riley, G.F. (eds) Passive and Active Measurement. PAM 2011. Lecture Notes in Computer Science, vol 6579. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19260-9_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-19260-9_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-19259-3

  • Online ISBN: 978-3-642-19260-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics