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)
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
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
A Gossip-Style Failure Detection Service
A Gossip-Style Failure Detection Service
Lightweight probabilistic broadcast
ACM Transactions on Computer Systems (TOCS)
Vivaldi: a decentralized network coordinate system
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Locating internet bottlenecks: algorithms, measurements, and implications
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
Efficient gossip-based aggregate computation
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Computing separable functions via gossip
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Ordered Slicing of Very Large-Scale Overlay Networks
P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
ACM Transactions on Computer Systems (TOCS)
Journal of Systems and Software
Distributed content delivery using load-aware network coordinates
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
Epidemic-Style management of semantic overlays for content-based searching
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
T-Man: gossip-based overlay topology management
ESOA'05 Proceedings of the Third international conference on Engineering Self-Organising Systems
A framework for secure and private P2P publish/subscribe
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Gossiping for autonomic estimation of network-based parameters in dynamic environments
OTM'10 Proceedings of the 2010 international conference on On the move to meaningful internet systems
| Hi-index | 0.00 |
The emergence of large-scale distributed applications based on many-to-many communication models, e.g., broadcast and decentralized group communication, has an important impact on the underlying layers, notably the Internet routing infrastructure. To make an effective use of network resources, protocols should both limit the stress (amount of messages) on each infrastructure entity like routers and links, and balance as much as possible the load in the network. Most protocols use application-level metrics such as delays to improve efficiency of content dissemination or routing, but the extend to which such application-centric optimizations help reduce and balance the load imposed to the infrastructure is unclear. In this paper, we elaborate on the design of such network-friendly protocols and associated metrics. More specifically, we investigate random-based gossip dissemination. We propose and evaluate different ways of making this representative protocol network-friendly while keeping its desirable properties (robustness and low delays). Simulations of the proposed methods using synthetic and real network topologies convey and compare their abilities to reduce and balance the load while keeping good performance.