A generic theoretical framework for modeling gossip-based algorithms
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Compositional gossip: a conceptual architecture for designing gossip-based applications
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Structured overlay for heterogeneous environments: Design and evaluation of oscar
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Peer to peer multidimensional overlays: approximating complex structures
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Magnet: practical subscription clustering for Internet-scale publish/subscribe
Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems
Enabling content-based publish/subscribe services in cooperative P2P networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Dynamically reconfigurable filtering architectures
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
SkewCCC+: a heterogeneous distributed hash table
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
GROUP: a gossip based building community protocol
NEW2AN'11/ruSMART'11 Proceedings of the 11th international conference and 4th international conference on Smart spaces and next generation wired/wireless networking
Simple dynamic load balancing mechanism for structured P2P network and its evaluation
International Journal of Grid and Utility Computing
A peer-to-peer recommender system for self-emerging user communities based on gossip overlays
Journal of Computer and System Sciences
Hi-index | 0.00 |
This paper presents GosSkip, a self organizing and fully distributed overlay that provides a scalable support to data storage and retrieval in dynamic environments. The structure of GosSkip, while initially possibly chaotic, eventually matches a perfect set of Skip-list-like structures, where no hash is used on data attributes, thus preserving semantic locality and permitting range queries. The use of epidemic-based protocols is the key to scalability, fairness and good behavior of the protocol under churn, while preserving the simplicity of the approach and maintaining O(log(N)) state per peer and O(log(N)) routing costs. In addition, we propose a simple and efficient mechanism to exploit the presence of multiple data items on a single physical node. GosSkip's behavior in both a static and a dynamic scenario is further conveyed by experiments with an actual implementation and real traces of a peer to peer workload.