Abstract
We propose in this paper RCAN, a novel topology to improve the routing performance of CAN overlays while minimizing the maintenance overhead during frequent nodes join and departure in large size networks. The key idea for our design is to equip each node with a few long links towards some distant nodes in the systems. Long links are clockwise directed and wrap around to form small rings along each dimension (multi-ring). Unlike other protocols, RCAN does not assume a priori fixed limits for the network size or the routing state per node. The number of rings and their sizes self-adjust as nodes join and leave. Nodes auto-adapt their routing states to cope with network changes. RCAN is a pure P2P design, where all nodes assume the same responsibility. Following a uniform greedy routing, RCAN uses O(logn) routing state and achieves O(logn) routing performance which is asymptotically optimal. Besides, the communication cost of join operation is reduced to O(logn) messages, instead of O(log2 n) in other existing protocols, such as: Chord, pastry, SCAN, etc. Our secondary aim is also to enhance nodes’ connectivity to provide more routing flexibility and robustness against failures. Through simulation we demonstrate the full scalability and efficiency of our design and its advantages over other existing methods.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Lua, E.K., Crowcroft, J., Pias, M., Sharma, R., Lim, S.: A survey and comparison of peer-to-peer overlay network schemes. IEEE Communications Surveys and Tutorials 7(2), 72–93 (2005)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: Proc. of ACM-SIGCOMM, pp. 161–172 (August 2001)
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Transactions on Networking 11(1), 17–32 (2003)
Rowstron, A.I.T., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Proc. of the IFIP/ACM Intl. Conf. on Distributed Systems Platforms, pp. 329–350. Springer, Heidelberg (2001)
Aberer, K.: P-grid: A self-organizing access structure for p2p information systems. In: CooplS 2001, London, UK, pp. 179–194. Springer, Heidelberg (2001)
Loguinov, D., Kumar, A., Rai, V., Ganesh, S.: Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience. In: Proc. of the 2003 Conf. on Applications, technologies, architectures, and protocols for computer communications(SIGCOMM 2003), pp. 395–406. ACM, New York (2003)
Manku, G.S., Bawa, M., Raghavan, P.: Symphony: distributed hashing in a small world. In: Proc. of the 4th conf. on USENIX Symposium on Internet Technologies and Systems(USITS 2003), Berkeley, CA, USA, p. 10. USENIX Association (2003)
Xu, Z., Zhang, Z.: Building low-maintenance expressways for P2P systems. Technical Report HPL-2002-41 41, HP Laboratories, Palo Alto (2002)
Sahin, O.D., Agrawal, D., Abbadi, A.E.: Techniques for efficient routing and load balancing in content-addressable networks. In: Proc. of the 5th IEEE Intl. Conf. on Peer-to-Peer Computing (P2P 2005), Washington, DC, USA, pp. 67–74. IEEE Computer Society, Los Alamitos (2005)
Sun, X.: SCAN: a small-world structured P2P overlay for multi-dimensional queries. In: Proc. of the 16th intl. Conf. on World Wide Web(WWW 2007), pp. 1191–1192. ACM, New York (2007)
Kleinberg, J.: The small-world phenomenon: An algorithmic perspective. In: STOC 2000: Proc. of the 32 annual ACM symposium on Theory of computing, pp. 163–170. ACM, New York (2000)
Boukhelef, D.: IH*: Accomodating interpolation-based hashing into distributed environments. Master’s thesis, National Institute of Computer Science, Algiers. Algeria (July 2002) (in French)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boukhelef, D., Kitagawa, H. (2008). Multi-ring Infrastructure for Content Addressable Networks. In: Meersman, R., Tari, Z. (eds) On the Move to Meaningful Internet Systems: OTM 2008. OTM 2008. Lecture Notes in Computer Science, vol 5331. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88871-0_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-88871-0_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88870-3
Online ISBN: 978-3-540-88871-0
eBook Packages: Computer ScienceComputer Science (R0)