Show simple item record

dc.contributor.authorBirman, Kenneth P.en_US
dc.contributor.authorHayden, Marken_US
dc.contributor.authorOzkasap, Oznuren_US
dc.contributor.authorXiao, Zhenen_US
dc.contributor.authorBudiu, Mihaien_US
dc.contributor.authorMinsky, Yaronen_US
dc.description.abstractThere are many methods for making a multicast protocol "reliable". At one end of the spectrum, a reliable multicast protocol might offer atomicity guarantees, such as all-or-nothing delivery, delivery ordering, and perhaps additional properties such as virtually synchronous addressing. At the other are protocols that use local repair to overcome transient packet loss in the network, offering 'best effort' reliability. Yet none of this prior work has treated stability of multicast delivery as a basic reliability property, such as might be needed in an internet radio, TV, or conferencing application. This paper looks at reliability with a new goal: development of a multicast protocol which is reliable in a sense that can be rigorously quantified and includes throughput stability guarantees. We characterize this new protocol as a "bimodal multicast" in reference to its reliability model, which corresponds to a family of bimodal probability distributions. Here, we introduce the protocol, provide a theoretical analysis of its behavior, review experimental results, and discuss some candidate applications. These confirm that bimodal multicast is reliable, scalable, and that the protocol provides remarkably stable delivery throughput.en_US
dc.format.extent394591 bytes
dc.format.extent2237785 bytes
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleBimodal Multicast (revised)en_US
dc.typetechnical reporten_US

Files in this item


This item appears in the following Collection(s)

Show simple item record