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)
SCAMP: Peer-to-Peer Lightweight Membership Service for Large-Scale Group Communication
NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
ACM Transactions on Computer Systems (TOCS)
Structured Superpeers: Leveraging Heterogeneity to Provide Constant-Time Lookup
WIAPP '03 Proceedings of the The Third IEEE Workshop on Internet Applications
The peer sampling service: experimental evaluation of unstructured gossip-based implementations
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
Fireflies: scalable support for intrusion-tolerant network overlays
Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006
Peer-to-peer communication across network address translators
ATEC '05 Proceedings of the annual conference on USENIX Annual Technical Conference
HyParView: A Membership Protocol for Reliable Gossip-Based Broadcast
DSN '07 Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
NAT-resilient Gossip Peer Sampling
ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems
Proceedings of the 10th ACM/IFIP/USENIX International Conference on Middleware
Set reconciliation with nearly optimal communication complexity
IEEE Transactions on Information Theory
Gozar: NAT-friendly peer sampling with one-hop distributed NAT traversal
Proceedings of the 11th IFIP WG 6.1 international conference on Distributed applications and interoperable systems
Usurp: distributed NAT traversal for overlay networks
Proceedings of the 11th IFIP WG 6.1 international conference on Distributed applications and interoperable systems
On the performance and fairness of BitTorrent-like data swarming systems with NAT devices
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
Gossip protocols are an important building block of many large-scale systems. They have inherent load-balancing properties as long as nodes are deployed over a network with a "flat" topology, that is, a topology where any pair of nodes may engage in a gossip exchange. Unfortunately, the Internet is not flat in the sense that firewalls and NAT boxes block many peer-wise interactions. In particular, nodes that are behind a firewall can initiate communication with nodes on the public Internet, but not vice versa. This may easily unbalance the number of gossip exchanges in which nodes are involved. In particular, nodes in well connected regions of the network tend to participate in many more interactions than other nodes and may suffer from resource exhaustion. In this paper we present and evaluate a new approach to balance gossip exchanges in networks with firewalls. Our solution requires only local information and has no coordination overhead, allowing nodes to participate in a similar number of gossip exchanges independent of the network topology.