Show simple item record

dc.contributor.authorXiao, Zhenen_US
dc.contributor.authorBirman, Kenen_US
dc.date.accessioned2007-04-09T19:49:15Z
dc.date.available2007-04-09T19:49:15Z
dc.date.issued2000-10-02en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR2000-1815en_US
dc.identifier.urihttps://hdl.handle.net/1813/5805
dc.description.abstractReliable multicast delivery requires that a multicast message be received by all members in a group. Hence certain or all members need to buffer messages for possible retransmissions. Designing an efficient buffer management algorithm is challenging in large multicast groups where no member has complete group membership information and the delivery latency to different members could differ by orders of magnitude. We propose an innovative two-phase buffering algorithm, which explicitly addresses variations in delivery latency seen in large multicast groups. The algorithm effectively reduces buffer requirements by adaptively allocating buffer space to messages most needed in the system and by spreading the load of buffering among all members in the group. Simulation results demonstrate that the algorithm has good performance.en_US
dc.format.extent174048 bytes
dc.format.extent372152 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleOptimizing Buffer Management for Reliable Multicasten_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics