Skip to content
Free planNo credit card requiredStart writing

article · 2008

A Randomized Error Recovery Algorithm for Reliable Multicast

Zhen Xiao , Kenneth P. Birman

Cited by 0Abstract and details only

Abstract

An efficient error recovery algorithm is essential for reliable multicast in large groups. Tree-based protocols (RMTP, TMTP, LBRRM) group receivers into local regions and select a repair server for performing error recovery in each region. Hence a single server bears the entire responsibility of error recovery for a region. In addition, the deployment of repair servers requires topological information of the underlying multicast tree, which is generally not available at the transport layer. This paper presents RRMP, a randomized reliable multicast protocol which improves the robustness of tree-based protocols by diffusing the responsibility of error recovery among all members in a group. The protocol works well within the existing IP multicast framework and does not require additional support from routers. Both analysis and simulation results show that the performance penalty due to randomization is low and can be tuned according to application requirements.

Cite this paper

APA 7

Zhen Xiao, K. P. B. (2008). A Randomized Error Recovery Algorithm for Reliable Multicast.

MLA 9

Zhen Xiao, Kenneth P. Birman. “A Randomized Error Recovery Algorithm for Reliable Multicast.” 2008.

Chicago

Zhen Xiao, Kenneth P. Birman. 2008. “A Randomized Error Recovery Algorithm for Reliable Multicast.”

Harvard

Zhen Xiao, K.P.B. (2008) ‘A Randomized Error Recovery Algorithm for Reliable Multicast’.

BibTeX
@article{zhenxiao2008randomized,
  title = {{A Randomized Error Recovery Algorithm for Reliable Multicast}},
  author = {Zhen Xiao, Kenneth P. Birman},
  year = {2008}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.