Skip to main content

Dynamic Algorithms to Provide a Robust and Scalable Overlay Routing Service

  • Conference paper
Information Networking. Advances in Data Communications and Wireless Networks (ICOIN 2006)

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

Included in the following conference series:

Abstract

Service providers and companies wishing to connect a number of distributed sites need a QoS enabled and resilient network to provide their services. As network providers can not yet offer multidomain end-to-end QoS and Internet path outages can last several minutes, using Overlay Service Networks to route around congested or failing parts of the network is a hot topic in the research community. Typically a full mesh topology is used to connect the servers of the Overlay Service Network. Because this approach is not scalable, we propose to use a dynamic topology that is only a fraction of the full mesh. A novel algorithm that automatically reconfigures the topology when link outages or congestion occur is introduced. We have also developed an on-demand overlay routing algorithm that decreases the overlay network load. Through simulation it is shown that our algorithms allow to offer a robust routing service in a scalable way.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. 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. Tech. Rep. TR-98-10-05 (1998)

    Google Scholar 

  2. Feamster, N., Andersen, D., Balakrishnan, H., Kaashoek, F.: Measuring the effects of Internet path faults on reactive routing. In: Proc. ACM SIGMETRICS (June 2003)

    Google Scholar 

  3. Andersen, D., Balakrishnan, H., Kaashoek, F., Morris, R.: Resilient overlay networks. In: Symposium on Operating Systems Principles, pp. 131–145 (2001)

    Google Scholar 

  4. De Vleeschauwer, B., De Turck, F., Dhoedt, B., Demeester, P.: On the Construction of QoS Enabled Overlay Networks. In: Solé-Pareta, J., Smirnov, M., Van Mieghem, P., Domingo-Pascual, J., Monteiro, E., Reichl, P., Stiller, B., Gibbens, R.J. (eds.) QofIS 2004. LNCS, vol. 3266, pp. 164–173. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  5. Lao, L., Cui, J.-H., Gerla, M.: Multicast service overlay design. In: Proceedings of International Symposium on Performance Evaluation of Computer and Telecommunication Systems (SPECTS 2005) (2005)

    Google Scholar 

  6. Li, Z., Mohapatra, P.: Impact of topology on overlay routing service. In: INFOCOM, p. 418 (March 2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

De Vleeschauwer, B., De Turck, F., Dhoedt, B., Demeester, P. (2006). Dynamic Algorithms to Provide a Robust and Scalable Overlay Routing Service. In: Chong, I., Kawahara, K. (eds) Information Networking. Advances in Data Communications and Wireless Networks. ICOIN 2006. Lecture Notes in Computer Science, vol 3961. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11919568_94

Download citation

  • DOI: https://doi.org/10.1007/11919568_94

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-48563-6

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics