Abstract
Peer-to-peer overlay networks provide a useful infrastructure for building distributed applications. These networks provide efficient and fault-tolerant routing and object locating within a self-organizing overlay network. This paper presents a multi-dimensional overlay network called RAQNet which is based on RAQ. RAQ supports exact match queries and range queries over multi-dimensional data efficiently. Moreover, its routing cost does not depend on the dimension of the search space. In RAQNet, we have improved its original routing algorithms and extended it to have topology awareness property. In RAQNet, nodes are connected to each other if their labels are “close” to each other with respect to the topology of its underlying network. A topology match between the overlay and underlying network results in reduced routing delay and network link traffic. In comparison with RAQ, we will describe different node-join algorithms and routing table maintenance in order to provide the topology awareness. We present the experimental results through a prototype implementation of two emulated networks.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Nazerzadeh, H., Ghodsi, M.: RAQ: A range queriable distributed data structure (extended version). In: Vojtáš, P., Bieliková, M., Charron-Bost, B., Sýkora, O. (eds.) SOFSEM 2005. LNCS, vol. 3381, pp. 264–272. Springer, Heidelberg (2005)
Alaei, S., Toossi, M., Ghodsi, M.: SkipTree: A Scalable Range-Queryable Distributed Data Structure for Multidimensional Data. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 298–307. Springer, Heidelberg (2005)
Rostami, H., Habibi, J.: A Mathematical Foundation for Topology Awareness of P2P Overlay Networks. In: Zhuge, H., Fox, G.C. (eds.) GCC 2005. LNCS, vol. 3795, pp. 906–918. Springer, Heidelberg (2005)
Zhao, B.Y., Kubiatowicz, J.D., Joseph, A.D.: Tapestry: An infrastructure for fault-resilient wide-area location and routing, Tech. Rep. UCB//CSD-01-1141, U.C. Berkeley (April 2001)
Plaxton, C.G., Rajaraman, R., Richa, A.W.: Accessing nearby copies of replicated objects in a distributed environment. In: Proc. 9th ACM Symp. on Parallel Algorithms and Architectures, June 1997, Newport, Rhode Island, USA, pp. 311–320 (1997)
Rowstron, A., Druschel, P.: Pastry: Scalable,distributed object location and routing for large-scale peer-to-peer systems. In: Proc. IFIP/ACM Middleware 2001, Heidelberg, Germany (November 2001)
Costa, M., Castro, M., Rowstron, A., Key, P.: PIC: Practical Internet Coordinates for Distance Estimation. In: 24th IEEE International Conference on Distributed Computing Systems (ICDCS’ 04), Tokyo, Japan (March 2004)
Karger, D.R., Ruhl, M.: Finding nearest neighbors in growth-restricted metrics. In: STOC’02 (July 2002)
Zegura, E., Calvert, K., Bhattacharjee, S.: How to model an internetwork. In: INFOCOM96 (1996)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content-Addressable Network. In: Proc. of ACM SIGCOMM (August 2001)
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proceedings of the ACM SIGCOMM ’01 Conference, San Diego, California (August 2001)
Freedman, M., Mazieres, D.: Sloppy hashing and self-organizing clusters. In: Proc. 2nd International Workshop on Peer-to-Peer Systems (IPTPS03) (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mirrezaei, S.I., Shahparian, J., Ghodsi, M. (2007). RAQNet: A Topology-Aware Overlay Network. In: Bandara, A.K., Burgess, M. (eds) Inter-Domain Management. AIMS 2007. Lecture Notes in Computer Science, vol 4543. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72986-0_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-72986-0_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72985-3
Online ISBN: 978-3-540-72986-0
eBook Packages: Computer ScienceComputer Science (R0)