An algorithm based on Voronoi diagrams for the multi-stream multi-source multicast routing problem

摘要

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.