Abstract
Overlay routing is a promising way to improve the quality of service in the Internet but its main drawback is scalability: measuring the characteristics of the paths, exchanging the measurement results between the nodes and computing the best routes in the full mesh overlay network generally imply a high consumption of resources. In this paper, we design the basis of a lightweight self-organising one-hop overlay routing mechanism improving the latencies: we define criteria that rely on the information provided by an Internet Coordinate System (ICS) in order to provide a small set of potential one-hop shortcuts for any given path in the network with a small measurement cost. Our best criterion does not guarantee to find the best shortcut for any given path in a network but, even in networks with hundreds or thousands of nodes, it will restrict the search for potential shortcuts to about one or two percent of the total number of nodes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Andersen, D., Balakrishnan, H., Kaashoek, F., Morris, R.: Resilient overlay networks. SIGOPS Oper. Syst. Rev. 35(5), 131–145 (2001)
Dabek, F., Cox, R., Kaashoek, F., Morris, R.: Vivaldi: A decentralized network coordinate system. In: Proc. of SIGCOMM, Portland, OR, USA (August 2004)
Gummadi, K.P., Madhyastha, H.V., Gribble, S.D., Levy, H.M., Wetherall, D.: Improving the reliability of internet paths with one-hop source routing. In: Proceedings of OSDI. USENIX Association, Berkeley (2004)
Kaafar, M., Cantin, F., Gueye, B., Leduc, G.: Detecting triangle inequality violations for internet coordinate systems. In: Proc. of Future Networks 2009 Workshop, Dresden, Germany (June 2009)
Ledlie, J., Gardner, P., Seltzer, M.I.: Network coordinates in the wild. In: Proc of NSDI, Cambridge, UK (April 2007)
Liao, Y., Kaafar, M., Gueye, B., Cantin, F., Geurts, P., Leduc, G.: Detecting triangle inequality violations in internet coordinate systems by supervised learning - work in progress. In: Proc. of Networking 2009, Aachen, Germany (May 2009)
Lumezanu, C., Baden, R., Levin, D., Spring, N., Bhattacharjee, B.: Symbiotic relationships in internet routing overlays. In: Proceedings of NSDI, pp. 467–480. USENIX Association, Berkeley (2009)
Nakao, A., Peterson, L., Bavier, A.: A routing underlay for overlay networks. In: Proceedings of SIGCOMM, pp. 11–18. ACM, New York (2003)
Nakao, A., Peterson, L., Bavier, A.: Scalable routing overlay networks. SIGOPS Oper. Syst. Rev. 40(1), 49–61 (2006)
Ng, T.S.E., Zhang, H.: Predicting Internet network distance with coordinates-based approaches. In: Proc. of INFOCOM, New York, NY, USA (June 2002)
A simulator for peer-to-peer protocols, http://www.pdos.lcs.mit.edu/p2psim/index.html
PlanetLab: An open platform for developing, deploying, and accessing planetary-scale services, http://www.planet-lab.org
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)
Savage, S., Collins, A., Hoffman, E., Snell, J., Anderson, T.: The end-to-end effects of internet path selection. SIGCOMM Comput. Commun. Rev. 29(4), 289–299 (1999)
Sontag, D., Zhang, Y., Phanishayee, A., Andersen, D.G., Karger, D.: Scaling all-pairs overlay routing. In: Proceedings of CoNEXT, Rome, Italy (December 2009)
Wong, B., Slivkins, A., Sirer, E.: Meridian: A lightweight network location service without virtual coordinates. In: Proc. of the ACM SIGCOMM (August 2005)
Zheng, H., Lua, E.K., Pias, M., Griffin, T.G.: Internet routing policies and round-trip-times. In: Dovrolis, C. (ed.) PAM 2005. LNCS, vol. 3431, pp. 236–250. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cantin, F., Leduc, G. (2011). Finding Routing Shortcuts Using an Internet Coordinate System. In: Bettstetter, C., Gershenson, C. (eds) Self-Organizing Systems. IWSOS 2011. Lecture Notes in Computer Science, vol 6557. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19167-1_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-19167-1_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19166-4
Online ISBN: 978-3-642-19167-1
eBook Packages: Computer ScienceComputer Science (R0)