Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
ACM Transactions on Computer Systems (TOCS)
Extending equation-based congestion control to multicast applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
ACM Transactions on Computer Systems (TOCS)
Probabilistic Reliable Dissemination in Large-Scale Systems
IEEE Transactions on Parallel and Distributed Systems
A Gossip Protocol for Subgroup Multicast
ICDCSW '01 Proceedings of the 21st International Conference on Distributed Computing Systems
SplitStream: high-bandwidth multicast in cooperative environments
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Lightweight probabilistic broadcast
ACM Transactions on Computer Systems (TOCS)
An Adaptive Algorithm for Efficient Message Diffusion in Unreliable Environments
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
Gossip-based aggregation in large dynamic networks
ACM Transactions on Computer Systems (TOCS)
Using PlanetLab for network research: myths, realities, and best practices
ACM SIGOPS Operating Systems Review
CREW: A Gossip-based Flash-Dissemination System
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Enabling contribution awareness in an overlay broadcasting system
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
OSDI '06 Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation - Volume 7
Chunkyspread: Heterogeneous Unstructured Tree-Based Peer-to-Peer Multicast
ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
Epidemic live streaming: optimal performance trade-offs
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Is Random Scheduling Sufficient in P2P Video Streaming?
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
Is There a Future for Mesh-Based live Video Streaming?
P2P '08 Proceedings of the 2008 Eighth International Conference on Peer-to-Peer Computing
Universal IP multicast delivery
Computer Networks: The International Journal of Computer and Telecommunications Networking - Overlay distribution structures and their applications
FlightPath: obedience vs. choice in cooperative services
OSDI'08 Proceedings of the 8th USENIX conference on Operating systems design and implementation
Chainsaw: eliminating trees from overlay multicast
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
A Measurement Study of a Large-Scale P2P IPTV System
IEEE Transactions on Multimedia
A case for end system multicast
IEEE Journal on Selected Areas in Communications
Understanding the Power of Pull-Based Streaming Protocol: Can We Do Better?
IEEE Journal on Selected Areas in Communications
LiFTinG: lightweight freerider-tracking in gossip
Proceedings of the ACM/IFIP/USENIX 11th International Conference on Middleware
Scaling microblogging services with divergent traffic demands
Middleware'11 Proceedings of the 12th ACM/IFIP/USENIX international conference on Middleware
| Hi-index | 0.00 |
Gossip-based information dissemination protocols are considered easy to deploy, scalable and resilient to network dynamics. Loadbalancing is inherent in these protocols as the dissemination work is evenly spread among all nodes. Yet, large-scale distributed systems are usually heterogeneous with respect to network capabilities such as bandwidth. In practice, a blind load-balancing strategy might significantly hamper the performance of the gossip dissemination. This paper presents HEAP, HEterogeneity-Aware gossip Protocol, where nodes dynamically adapt their contribution to the gossip dissemination according to their bandwidth capabilities. Using a continuous, itself gossip-based, approximation of relative bandwidth capabilities, HEAP dynamically leverages the most capable nodes by increasing their fanout, while decreasing by the same proportion that of less capable nodes. HEAP preserves the simple and proactive (churn adaptation) nature of gossip, while significantly improving its effectiveness. We extensively evaluate HEAP in the context of a video streaming application on a testbed of 270 PlanetLab nodes. Our results show that HEAP significantly improves the quality of the streaming over standard homogeneous gossip protocols, especially when the stream rate is close to the average available bandwidth.