Multi Criterion Multicast Routing Algorithm Comparison for Large Networks

QoS enabled multicast routing is known to be of non-polynominal complexity, which leads to the necessity of using heuristic algorithms to find sub-optimal solutions to the problems of this class. The evaluation of such algorithms requires the use of the simulation techniques as the heuristics’ resul...

Full description

Saved in:
Bibliographic Details
Published in:Image processing & communications (Versita) 2017-03, Vol.22 (1), p.49-56
Main Author: Stachowiak, Krzysztof
Format: Article
Language:English
Subjects:
Algorithms
Complexity
Computer simulation
Decision trees
Multicast
Quality of service architectures
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:QoS enabled multicast routing is known to be of non-polynominal complexity, which leads to the necessity of using heuristic algorithms to find sub-optimal solutions to the problems of this class. The evaluation of such algorithms requires the use of the simulation techniques as the heuristics’ results are of stochastic nature. Because of the problem complexity the simulation times increase significantly in the function of the network size, therefore the results presented in the literature are often limited to only small models. In this article the results of the evaluation of different multicast QoS routing algorithms (further referred to as the Multi-Constrained Minimum Steiner Tree Problem - ) have been presented for a wide range of network sizes reaching thousands of nodes.
ISSN:2300-8709
1425-140X
2300-8709
DOI:10.1515/ipc-2017-0005