Skip to main content


eCommons@Cornell

eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/7310
Title: GSGC: An Efficient Gossip-Style Garbage Collection Scheme for ScalableReliable Multicast
Authors: Guo, Katherine
Hayden, Mark
van Renesse, Robbert
Vogels, Werner
Birman, Kenneth P.
Keywords: computer science
technical report
Issue Date: Dec-1997
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR97-1656
Abstract: To deliver multicast messages reliably in a group, each member maintains copies of all messages it sends and receives in a buffer for potential local retransmission. The storage of these messages is costly and buffers may grow out of bound. Garbage collection is needed to address this issue. Garbage collection occurs once a process learns that a message in its buffer has been received by every process in the group. The message is declared stable and is released from the process's buffer. This paper proposes a gossip-style garbage collection scheme called GSGC for scalable reliable multicast protocols. This scheme achieves fault-tolerance and scalability without relying on the underlying multicast protocols. It collects and disseminates information in the multicast group by making each group member periodically gossip information to a random subset of the group. Extending the global gossip protocol further, this paper also investigates a local gossip scheme that achieves improved scalability and significantly better performance. Simulations conducted in a WAN environment are used to evaluate the performance of both schemes.
URI: http://hdl.handle.net/1813/7310
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
97-1656.pdf387.57 kBAdobe PDFView/Open
97-1656.ps625.81 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.

 

© 2014 Cornell University Library Contact Us