Abstract
Traditional IP multicast faces a serious state scalability problem when there are a large number of groups in the network. Recently, a novel approach called aggregated multicast was proposed [6], in which multiple groups share one delivery tree. A key problem in aggregated multicast is group-tree matching (i.e., assigning groups to trees). In this paper, we formally study the dynamic version of the group-tree matching problem. We propose a generic dynamic on-line algorithm (GDOA) and provide an approach to determine the upper bound on its performance. We quantitatively compare the performance of GDOA and other existing on-line heuristics. Extensive simulations demonstrate that GDOA is a very practical solution with promising performance and reasonable computation requirement.
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.
