Abstract

Compared with IP multicast, overlay multicast usually consumes more underlying network resources. Therefore, utilizing the underlying network resources effectively has some practical significance when constructing the multicast delivery tree based on overlay network. The concept of overlay cost was proposed, and the overlay multicast routing problem was defined to find a degree and delay constrained spanning tree with the minimum overlay cost for an undirected complete graph. The goal of the solution was to satisfy the applications' requirements and the end hosts' performance needs, and to make the consumption of underlying network resources minimum at the same time. A heuristic genetic algorithm for this problem was given, and the simulation results verify the effectiveness of the algorithm.

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 call

Disclaimer: 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.