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/7411
Title: Efficient Buffering in Reliable Multicast Protocols
Authors: Ozkasap, Oznur
Van Renesse, Robbert van
Birman, Kenneth P.,
Xiao, Zhen
Keywords: computer science
technical report
Issue Date: Jul-1999
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR99-1757
Abstract: Reliable multicast protocols provide all-or-none delivery to participants. Traditionally, such protocols suffer from large buffering requirements, as receivers have to buffer messages, and buffer sizes grow with the number of participants. In this paper, we describe an optimization that allows such protocols to reduce the amount of buffering drastically at the cost of a very small probability that all-or-none delivery is violated. We analyze this probability, and simulate an optimized version of an epidemic multicast protocol to validate the effectiveness of the optimization. We find that the buffering requirements are sub-constant, that is, the requirements shrink with group size, while the probability of all-or-none violation can be set to very small values.
URI: http://hdl.handle.net/1813/7411
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
99-1757.pdf125.47 kBAdobe PDFView/Open
99-1757.ps306.65 kBPostscriptView/Open

Refworks Export

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

 

© 2014 Cornell University Library Contact Us