Skip to main content

The Performance of Measurement-Based Overlay Networks

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2511))

Abstract

The literature contains propositions for the use of overlay networks to supplement the normal IP routing functions with higher-level information in order to improve aspects of network behavior. We consider the use of such an overlay to optimize the end-to-end behavior of some special traffic flows. Measurements are used both to construct the virtual links of the overlay and to establish the link costs for use in a link-state routing protocol. The overlay attempts to forward certain packets over the least congested rather than the shortest path. We present simulation results showing that contrary to common belief overlay networks are not always beneficial and can be detrimental.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cleary, J., Graham, I., McGregor, T., Pearson, M., Ziedins, I., Curtis, J., Donnelly, S., Martens, J., Martin, S.: High Precision Traffic Measurement. IEEE Communications Magazine 40 (2002) 167–183

    Article  Google Scholar 

  2. Bauer, D., Rooney, S., Scotton, P.: Network Infrastructure for Massively Distributed Games. In: NetGames 2002-First Workshop on Network and System Support for Games, Braunschweig, Germany (2002)

    Google Scholar 

  3. Andersen, D.G., Balakrishnan, H., Kaashoek, M.F., Morris, R.: Resilient Overlay Networks. In: Proc. 18th ACM Symposium on Operating Systems Principles, Banff, Canada (2001)

    Google Scholar 

  4. Savage, S., Anderson, T., Aggarwal, A., Becker, D., Cardwell, N., Collins, A., Hoffman, E., Snell, J., Vahdat, A., Voelker, G., Zahorjan, J.: Detour: a Case for Informed Internet Routing and Transport. Technical Report TR-98-10-05, University of Washington (1998)

    Google Scholar 

  5. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content Addressable Network. In: ACM SIGCOMM. (2001) 161–172

    Google Scholar 

  6. Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: IFIP/ACM International Conference on Distributed Systems Platforms (Middleware). (2001) 329–350

    Google Scholar 

  7. Jacobson, V.: How to Infer the Characteristics of Internet Paths. Presentation to Mathematical Sciences Research Institute (1997) ftp://ftp.ee.lbl.gov/pathchar/msri-talk.pdf.

  8. Lai, K., Baker, M.: Measuring link bandwidths using a deterministic model of packet delay. In: ACM SIGCOMM 2000, Stockholm, Sweden. (2000) 283–294

    Google Scholar 

  9. Wolski, R., Spring, N., Hayes, J.: The Network Weather Service: A Distributed Resource Performance Forecasting Service for Metacomputing. In: Journal of Future Generation Computing Systems. (1998)

    Google Scholar 

  10. Medina, A., Lakhina, A., Matta, I., Byers, J.: BRITE: Universal Topology Generation from a User’s Perspective. Technical Report BUCS-TR2001-003, Boston University (2001)

    Google Scholar 

  11. Fall, K., Varadhran, K.: The ns manual (formerly ns Notes and Documentation. http://www.isi.edu/nsnam/ns/ns-documentation.html (2002)

  12. Faloutsos, M., Faloutsos, P., Faloutsos, C.: On Power-Law Relationships of the Internet Topology. In: ACM SIGCOMM, Harvard University, Cambridge, US (1999) 251–262

    Google Scholar 

  13. Labovitz, C., Ahuja, A., Bose, A., Jahanian, F.: Delayed Internet Routing Convergence. In: ACM SIGCOMM 2000, Stockholm, Sweden. (2000) 175–187

    Google Scholar 

  14. Karn, P., Partridge, C.: Improving Round-Trip Time Estimates in Reliable Transport Protocols. Computer Communications Review 17 (1987) 2–7

    Article  Google Scholar 

  15. Floyd, S., Paxson, V.: Difficulties in Simulating the Internet. IEEE/ACM Transactions on Networking 9 (2001) 392–403

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bauer, D., Rooney, S., Scotton, P., Buchegger, S., Iliadis, I. (2002). The Performance of Measurement-Based Overlay Networks. In: Stiller, B., Smirnow, M., Karsten, M., Reichl, P. (eds) From QoS Provisioning to QoS Charging. QofIS ICQT 2002 2002. Lecture Notes in Computer Science, vol 2511. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45859-X_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-45859-X_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44356-8

  • Online ISBN: 978-3-540-45859-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics