Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
Finding neighbors of equal size in linear quadtrees and octrees in constant time
CVGIP: Image Understanding
IP lookups using multiway and multicolumn search
IEEE/ACM Transactions on Networking (TON)
Communications of the ACM
Freenet: a distributed anonymous information storage and retrieval system
International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
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
Ahnentafel Indexing into Morton-Ordered Arrays, or Matrix Locality for Free
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
The impact of DHT routing geometry on resilience and proximity
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
P-Grid: a self-organizing structured P2P system
ACM SIGMOD Record
Scalable, memory efficient, high-speed IP lookup algorithms
IEEE/ACM Transactions on Networking (TON)
Structured Overlay without Consistent Hashing: Empirical Results
CCGRID '06 Proceedings of the Sixth IEEE International Symposium on Cluster Computing and the Grid
Fast additions on masked integers
ACM SIGPLAN Notices
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
SkipMard: A Multi-attribute Peer-to-Peer Resource Discovery Approach
IMSCCS '07 Proceedings of the Second International Multi-Symposiums on Computer and Computational Sciences
Converting to and from Dilated Integers
IEEE Transactions on Computers
Scalaris: reliable transactional p2p key/value store
Proceedings of the 7th ACM SIGPLAN workshop on ERLANG
PeerCube: A Hypercube-Based P2P Overlay Robust against Collusion and Churn
SASO '08 Proceedings of the 2008 Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems
PRIME: peer-to-peer receiver-driven mesh-based streaming
IEEE/ACM Transactions on Networking (TON)
Fast-mesh: a low-delay high-bandwidth mesh for peer-to-peer live streaming
IEEE Transactions on Multimedia
HyperCuP: hypercubes, ontologies, and efficient search on peer-to-peer networks
AP2PC'02 Proceedings of the 1st international conference on Agents and peer-to-peer computing
AP2PC'03 Proceedings of the Second international conference on Agents and Peer-to-Peer Computing
When multi-hop peer-to-peer lookup matters
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
A survey and comparison of peer-to-peer overlay network schemes
IEEE Communications Surveys & Tutorials
A structured overlay for multi-dimensional range queries
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Tide: An effective and practical design for hierarchical-structured P2P model
Computer Communications
Journal of Network and Computer Applications
Ego network models for Future Internet social networking environments
Computer Communications
Hierarchical DHT-based name resolution for information-centric networks
Computer Communications
| Hi-index | 0.24 |
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. Scalable overlay networks such as Chord, CAN, Pastry, and Tapestry provide no control over where data is stored and the location of the peers and resources is determined by the hash values of their identifiers and keys respectively. As a result, these overlays cannot support range queries and other proximity-aware complex queries directly. In this paper, we present a hierarchical P2P overlay network called SkipCluster, which is capable of supporting both exact-match and multi-dimensional range queries efficiently without consumption of extra memory space. SkipCluster is derived from skip graphs and SkipNet, but it has a two-tier hierarchical architecture.In both tiers, peers are connected in sequence according to the order of their peer IDs, and related resources are stored near each other without hashing of their resource keys. We design a novel data structure called Triple Linked List (TLL) to store each super-peer's pointers in the higher tier, which can be used to find the longest prefix and speed up query routing of inter-cluster. In the lower tier, each intra-cluster peer's routing table contains pointers with exponentially incremental distance. Experimental results show that SkipCluster can speed up both exact-match and range queries in different network sizes.