MESH-R: large-scale, reliable multicast transport

Lucas, M.T.; Dempsey, Bert J.; Weaver, Alfred C.

doi:10.1109/icc.1999.768019

Cited by 1 publication

(1 citation statement)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The usual solution for this problem is to send request to a prioritized list of servers/proxies/source one-by-one till success. A number of server-based recovery protocols [9,10,11,12,13,14,15,16] either simply send requests to some upstream servers/source or construct a tree-based hierarchy to organize these servers. The prioritized list for the treebased hierarchy contains those nodes along the path from the requesting server to the source in such order.…”

Section: Introduction and Literature Surveymentioning

confidence: 99%

A recovery algorithm for reliable multicasting in reliable networks

Zhang

Ray

Kannan

et al. 2003

2003 International Conference on Parallel Processing, 2003. Proceedings.

View full text Add to dashboard Cite

Any reliable multicast protocol requires some recovery mechanism. A generic description of a recovery mechanism consists of a prioritized list of recovery servers/receivers (clients), hierarchically and/or geographically and/or randomly organized. Recovery requests are sent to the recovery clients on the list one-byone until the recovery effort is successful. There are many recovery strategies available in literature fitting the generic description. In this paper, we propose a polynomial time algorithm for choosing the recovery strategy with low recovery latency without sacrificing much bandwidth. We compared our method with two existing recovery methods, SRM (Scalable Reliable Multicast) and RMA (Reliable Multicast Architecture), by simulation and found that our method performs better. Although our theoretical analyses are based on a reliable network, our simulation results show that our strategy performs as well with the per link loss probability in a network up to 20% or more.

show abstract