An admission control scheme for repair server in a tree-based reliable multicast
Jinsuk Baek, Munene W. Kanampiu · 2007
Tree-Based multicast protocols improved scalability, reliability, and error recovery using an efficiently constructed logical tree at the transport layer. Our research, however, discovered that the existing tree construction schemes need some improvement in the admission control by the repair server. In accepting new clients the existing schemes only consider their capacity as the criterion. This has resulted in logical trees comprised of widely diverse node characteristics including loss probabilities. Consequently these schemes consume more error recovery time than they would if the admission criterion was improved. We propose a new tree construction scheme that only accepts closely related loss probability receiver nodes in a group. When our scheme is simulated in comparison with the best known existing scheme, it shows a great deal of improvement in the average error recovery time ranging from an individual packet to the whole multicast session.