Abstract
In this study, we present a new heuristic for the multi-stream multi-source multicast routing problem. The core of the heuristic proposed in this study is based on a generalisation of Voronoi diagrams in graphs. It allows building the trees needed to serve the demands of multiple sessions efficiently. Also, the proposed algorithm supports multiple sources. We performed an extensive experimental analysis of different network and problem configurations such as the number of sessions, nodes, sources and participants per session. We compare the proposed algorithm to heuristics proposed previously. The results of the experiments showed that the heuristic proposed in this study finds high-quality solutions efficiently.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Innovative Computing and Applications
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.