Abstract
A growing number of network applications create virtual networks called overlays on top of the Internet. Because advanced communication modes such as multicast have not been able to be successfully deployed at the network layer, they are now being implemented at the application layer thus creating such virtual networks. However these overlays require some form of addressing and routing inside themselves. Usually their topology is kept as simple as possible (e.g. tree, ring, etc.) but as their size increases, the need to be able to cope with a non trivial topology will increase. Our aim is to design a simple but robust addressing and routing scheme for topologically complex overlays. The only assumption is that the overlays are built upon the Internet and thus their topologies are constrained by the Internet topology. The benefit of our architecture is that they will not have to set up and maintain specific trivial topologies. In this paper we present the mechanisms of our distributed addressing and routing scheme. We have carried out simulations and we present some performance results of our routing algorithm such as path inflation and resistance to network dynamics.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Eilam, T., Gavoille, C., Peleg, D.: Compact routing schemes with low stretch factor. In: Proceedings of the 17th ACM Symposium on Principles of Distributed Computing, pp. 11–20 (1998)
Cowen, L.: Compact routing with minimum stretch. In: Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms (1999)
Law, A., Kelton, W.: Simulation Modelling and Analysis, 3rd edn. McGraw-Hill, New York (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Magoni, D., Lorenz, P. (2005). Distributed Addressing and Routing Architecture for Internet Overlays. In: Lorenz, P., Dini, P. (eds) Networking - ICN 2005. ICN 2005. Lecture Notes in Computer Science, vol 3420. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31956-6_76
Download citation
DOI: https://doi.org/10.1007/978-3-540-31956-6_76
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25339-6
Online ISBN: 978-3-540-31956-6
eBook Packages: Computer ScienceComputer Science (R0)