Abstract
In this paper, we address how to construct efficient retransmission trees for reliable multicast. Efficiency of retransmission trees mainly depends on locations of repairers, which are in charge of retransmitting lost packets. We propose an algorithm for each receiver to find a repairer for efficient recovery. The resulting tree for retransmission is organized by pairs of a receiver and a repairer which is the host nearest to the receiver among the multicast group members nearer to the sender. We formally prove that the proposed algorithm realizes reliable multicast with only constant times of a lower bound cost achievable through impractical router support. We also evaluate the algorithm through extensive simulations.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
