Accessing nearby copies of replicated objects in a distributed environment
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Finding nearest neighbors in growth-restricted metrics
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
PIC: Practical Internet Coordinates for Distance Estimation
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
A mathematical foundation for topology awareness of p2p overlay networks
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
SkipTree: a scalable range-queryable distributed data structure for multidimensional data
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
RAQ: a range-queriable distributed data structure
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
| Hi-index | 0.00 |
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.