Bimodal multicast Export

@article{citeulike:332687, abstract = {There are many methods for making a multicast protocol \“reliable.\” At one end of the spectrum, a reliable multicast protocol might offer tomicity 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, television, or conferencing application. This article 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.}, address = {New York, NY, USA}, author = {Birman, Kenneth P. and Hayden, Mark and Ozkasap, Oznur and Xiao, Zhen and Budiu, Mihai and Minsky, Yaron}, citeulike-article-id = {332687}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=312207}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/312203.312207}, doi = {10.1145/312203.312207}, issn = {0734-2071}, journal = {ACM Trans. Comput. Syst.}, keywords = {gossiping, multicast}, month = {May}, number = {2}, pages = {41--88}, posted-at = {2006-05-20 10:25:46}, priority = {3}, publisher = {ACM}, title = {Bimodal multicast}, url = {http://dx.doi.org/10.1145/312203.312207}, volume = {17}, year = {1999} }

TY - JOUR ID - citeulike:332687 L3 - citeulike-article-id:332687 N2 - There are many methods for making a multicast protocol “reliable.” At one end of the spectrum, a reliable multicast protocol might offer tomicity 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, television, or conferencing application. This article 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. IS - 2 JF - ACM Trans. Comput. Syst. SN - 0734-2071 AD - New York, NY, USA EP - 88 TI - Bimodal multicast PB - ACM VL - 17 SP - 41 KW - gossiping KW - multicast AU - Birman, Kenneth AU - Hayden, Mark AU - Ozkasap, Oznur AU - Xiao, Zhen AU - Budiu, Mihai AU - Minsky, Yaron PY - 1999/05// UR - http://dx.doi.org/10.1145/312203.312207 ER -