Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
IP lookups using multiway and multicolumn search
IEEE/ACM Transactions on Networking (TON)
Communications of the ACM
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
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
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
Scalable, memory efficient, high-speed IP lookup algorithms
IEEE/ACM Transactions on Networking (TON)
SkipNet: a scalable overlay network with practical locality properties
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
| Hi-index | 0.00 |
The tremendous growth of public interest in Peer-to-Peer (P2P) networks in recent years has initiated a lot of research work on how to design efficient overlay structures for P2P systems. Structured overlay networks that based on various distributed hash tables (DHTs) provide no control over where data is stored and cannot support range queries directly. Ordered overlays such as skip graphs and SkipNet have obviously practical advantages over DHTs, which can support several locality properties and range queries. This paper presents a novel longest prefix matching algorithm for speeding up query routing in skip graphs without consumption of extra memory space. A novel data structure called Triple Linked List (TLL) is designed to store each node's pointers in the network. Experimental results show that the TLL-based longest prefix matching algorithm can speed up both exact-match and range queries in different network sizes.