Abstract
This paper introduces a multicast routing technique that is suitable for multimedia collaborative applications. Typically, the multicast groups for such applications are small and of slow membership dynamics. Moreover, the group members are not assumed to be located in a single domain; rather, they may span a global inter-network. An important requirement for multimedia collaborative applications is the delivery time—a shortest path delivery tree is of a major interest in constructing the multicast tree. Our routing technique constructs a distribution tree per source and it uses explicit membership messages to build and maintain the tree. Thus, it combines the advantages of both broadcast and prune (BAP) and shared tree techniques; that is, it produces shortest path trees, yet the bandwidth consumed in building and maintaining such trees is minimal. We present a simulation study to compare the performance of our technique against BAP and shared tree techniques. Results of the simulation show that our technique outperforms previous ones.
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.
