Implementation and performance testing of a gossip-based communication system

Authors:
Kim P. Kihlstrom;Joel L. Stewart;N. Tobias Lounsbury;Adrian J. Rogers;Michael C. Magnuson
Affiliations:
Westmont College, Santa Barbara, CA;Westmont College, Santa Barbara, CA;Westmont College, Santa Barbara, CA;Westmont College, Santa Barbara, CA;Westmont College, Santa Barbara, CA
Venue:
PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
Year:
2007

Citing 8
Cited 0

On spreading a rumor

SIAM Journal on Applied Mathematics
Bimodal multicast

ACM Transactions on Computer Systems (TOCS)
Peer-to-Peer Membership Management for Gossip-Based Protocols

IEEE Transactions on Computers
A Low Latency, Loss Tolerant Architecture and Protocol for Wide Area Group Communication

DSN '00 Proceedings of the 2000 International Conference on Dependable Systems and Networks (formerly FTCS-30 and DCCA-8)
Probabilistic Multicast

DSN '02 Proceedings of the 2002 International Conference on Dependable Systems and Networks
Probabilistic Reliable Dissemination in Large-Scale Systems

IEEE Transactions on Parallel and Distributed Systems
Scalable Atomic Multicast

IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
An integrated experimental environment for distributed systems and networks

OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading

Quantified Score

Hi-index	0.00

Visualization

Abstract

Computer systems today are increasingly complex, employing vast numbers of nodes connected over large geographic areas. As these types of systems become more pervasive and integral to a variety of services, there is a heightened need for scalability and reliability in the underlying communication system. We present an implementation of a gossip-based, wide-area group communication system that is resilient to process and communication failures and is scalable to a very large number of nodes. We provide implementation details and describe our performance tests. The results are presented and analyzed.