Bounded gossip: a gossip protocol for large-scale datacenters

Authors:
Miguel Branco;João Leitão;Luís Rodrigues
Affiliations:
Universidade Técnica de Lisboa;Universidade Técnica de Lisboa;Universidade Técnica de Lisboa
Venue:
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Year:
2013

Citing 11
Cited 0

Bimodal multicast

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
Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining

ACM Transactions on Computer Systems (TOCS)
A Gossip-Style Failure Detection Service

A Gossip-Style Failure Detection Service
HiScamp: self-organizing hierarchical membership protocol

EW 10 Proceedings of the 10th workshop on ACM SIGOPS European workshop
Efficient and Adaptive Epidemic-Style Protocols for Reliable and Scalable Multicast

IEEE Transactions on Parallel and Distributed Systems
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
Dynamo: amazon's highly available key-value store

Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Epidemic Information Dissemination in Distributed Systems

Computer
CLON: Overlay Networks and Gossip Protocols for Cloud Environments

OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part I
Network traffic characteristics of data centers in the wild

IMC '10 Proceedings of the 10th ACM SIGCOMM conference on Internet measurement

Quantified Score

Hi-index	0.00

Visualization

Abstract

Gossip-based protocols are very robust and are able to distribute the load uniformly among all nodes. Furthermore, gossip-protocols circumvent the oscillatory phenomena that are known to occur with other forms of reliable multicast. As a result, they are excellent candidates to support the dissemination of information in large-scale datacenters. However, in this context, topology oblivious approaches may easily saturate the switches in the highest level of the datacenter network fabric. This paper presents and evaluates a novel gossip protocol for datacenters, named Bounded Gossip, that provides an adequate load distribution among the different layers of the switching fabric of the datacenter, avoiding being a source of network bottlenecks.