An algorithm based on Voronoi diagrams for the multi-stream multi-source multicast routing problem
by Romerito Campos De Andrade; Marco César Goldbarg; Elizabeth Ferreira Gouvêa Goldbarg
International Journal of Innovative Computing and Applications (IJICA), Vol. 9, No. 4, 2018

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.

Online publication date: Mon, 22-Oct-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Innovative Computing and Applications (IJICA):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com