2003 International Conference on Parallel Processing, 2003. Proceedings. (2003)
Oct. 6, 2003 to Oct. 9, 2003
Danyang Zhang , University of Alabama
Sibabrata Ray , University of Alabama
Rajgopal Kannan , Louisiana State University
S. Sitharama Iyengar , Louisiana State University
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-by-one 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.
S. Ray, S. S. Iyengar, D. Zhang and R. Kannan, "A Recovery Algorithm for Reliable Multicasting in Reliable Networks," 2003 International Conference on Parallel Processing, 2003. Proceedings.(ICPP), Kaohsiung, Taiwan, 2003, pp. 493.