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
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
Scalable application layer multicast
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
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
Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
Making gnutella-like P2P systems scalable
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
The robustness of content-based search in hierarchical peer to peer networks
Proceedings of the thirteenth ACM international conference on Information and knowledge management
Meghdoot: content-based publish/subscribe over P2P networks
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
Hierarchical Peer-to-Peer Networks Using Lightweight SuperPeer Topologies
ISCC '05 Proceedings of the 10th IEEE Symposium on Computers and Communications
Speeding up search in peer-to-peer networks with a multi-way tree structure
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
PeerCluster: A Cluster-Based Peer-to-Peer System
IEEE Transactions on Parallel and Distributed Systems
Survey of research towards robust peer-to-peer networks: search methods
Computer Networks: The International Journal of Computer and Telecommunications Networking
Characterizing unstructured overlay topologies in modern P2P file-sharing systems
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
Peer-to-peer similarity search over widely distributed document collections
Proceedings of the 2008 ACM workshop on Large-Scale distributed systems for information retrieval
Routing of structured queries in large-scale distributed systems
Proceedings of the 2008 ACM workshop on Large-Scale distributed systems for information retrieval
The FastTrack overlay: A measurement study
Computer Networks: The International Journal of Computer and Telecommunications Networking - Overlay distribution structures and their applications
| Hi-index | 0.00 |
This paper proposes a new scheme for ensuring data consistency in unstructured p2p networks where peers can subscribe to multiple content types (identified by labels) and are rapidly informed of content updates. The idea is based on using a static tree structure, the Cluster-K^+ tree, that maintains most of the structural information about peers and labels. A label denotes a set of replicated or co-related data in the network. The Cluster-K^+ tree provides efficient retrieval, addition, deletion and consistent updates of labels. Our proposed structure guarantees a short response search time of O(H+K), where H denotes the height of the tree and K the degree of an internal tree node. We present theoretical analytic bounds for the worst-case performance. To verify the bounds, we also present experimental results obtained from a network simulation. The results demonstrate that the actual performance of our system is significantly better than the theoretical bounds.