Abstract
Virtual Ring Routing (VRR) schemes were introduced in the context of wireless ad hoc networks and Internet anycast overlays. They build a network-routing layer using ideas from distributed hash table design, utilizing randomized virtual identities along a ring. This makes maintenance practical when nodes may enter or leave.
Previously, VRR was evaluated over a small wireless network and through medium-scale simulations, exhibiting remarkably good performance. In this paper, we provide a formal analysis of a family of VRR-like schemes. The analysis provides insight into a variety of issues, e.g., how well does VRR perform compared with brute force shortest paths routing? What properties of an underlying network topology make VRR work well?
Our analysis is backed by extensive simulation over a variety of topologies. Whereas previous works evaluated VRR over fairly small networks (up to 200 nodes), we are interested in scaling the simulations so as to exhibit asymptotic trends. Simulating network sizes beyond 220 results in a memory explosion: In some of the topologies of interest, such as a 2-dimensional plane, the total memory taken up by routing tables is \({\it \Omega}(N^{3/2})\) for an N-node network. We devise a simulation strategy that builds necessary information on the fly using a Luby and Rackoff pseudo-random permutation, leading to simulations at a scale of 232 nodes.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abraham, I., Gavoille, C., Malkhi, D.: On space-stretch trade-offs: Upper bounds. In: ACM Symposium on Parallel Algorithms and Architectures (SPAA) (July 2006)
Abraham, I., Gavoille, C., Malkhi, D.: Compact routing for graphs excluding a fixed minor. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 442–456. Springer, Heidelberg (2005)
Barrière, L., Fraigniaud, P., Kranakis, E., Krizanc, D.: Efficient routing in networks with long range contacts. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol. 2180, pp. 270–284. Springer, Heidelberg (2001)
Caesar, M., Castro, M., Nightingale, E.B., O’Shea, G., Rowstron, A.: Virtual ring routing: Network routing inspired by DHTs. In: ACM annual conference of the Special Interest Group on Data Communication (SIGCOMM), pp. 351–362 (2006)
Caesar, M., Condie, T., Kannan, J., Lakshminarayanan, K., Stoica, I., Shenker, S.: ROFL: Routing on flat labels. In: ACM annual conference of the Special Interest Group on Data Communication (SIGCOMM) (September 2006)
Cheng, B.-N., Yuksel, M., Kalyanaraman, S.: Orthogonal rendezvous routing protocol for wireless mesh networks. In: IEEE International Conference on Network Protocols (2006)
Gavoille, C.: Routing in distributed networks: Overview and open problems. ACM SIGACT News - Distributed Computing Column 32(1), 36–52 (2001)
Kim, C., Caesar, M., Rexford, J.: Floodless in SEATTLE: a scalable ethernet architecture for large enterprises. In: ACM annual conference of the Special Interest Group on Data Communication (SIGCOMM), pp. 3–14 (2008)
Luby, M., Rackoff, C.: How to construct pseudorandom permutations and pseudorandom functions. SIAM J. Comput. 17, 373–386 (1988)
Mao, Y., Wang, F., Qiu, L., Lam, S.S., Smith, J.M.: S4: Small state and small stretch routing protocol for large wireless sensor networks. In: 4th USENIX Symposium on Networked Systems Design and Implementation (NSDI) (2007)
Pucha, H., Das, S.M., Hu, Y.C.: Imposed route reuse in ad hoc network routing protocols using structured peer-to-peer overlay routing. IEEE Transactions on Parallel and Distributed Systems (2006)
Westphal, C., Kempf, J.: A compact routing architecture for mobility. In: MobiArch 2008: Proceedings of the 3rd international workshop on Mobility in the Evolving Internet Architecture, pp. 1–6. ACM Press, New York (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Malkhi, D., Sen, S., Talwar, K., Werneck, R.F., Wieder, U. (2009). Virtual Ring Routing Trends. In: Keidar, I. (eds) Distributed Computing. DISC 2009. Lecture Notes in Computer Science, vol 5805. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04355-0_42
Download citation
DOI: https://doi.org/10.1007/978-3-642-04355-0_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04354-3
Online ISBN: 978-3-642-04355-0
eBook Packages: Computer ScienceComputer Science (R0)