Quantitative comparison of multicast heuristic algorithms
[ 1 ] Instytut Elektroniki i Telekomunikacji (IEt), Wydział Elektryczny, Politechnika Poznańska | [ P ] pracownik
2005
referat
angielski
- multicast routing
- heuristic algorithms
- network topology
- graphs
EN The article investigates representative heuristic algorithms finding the cheapest spanning trees between a source node and a group of destination nodes (multicast connections). An algorithm that solves the Steiner problem, i.e., minimal spanning tree is also presented. The presented solutions are grouped into: i. unconstrained algorithms and ii. constrained algorithms. The key part of the article includes the efficiency analysis and a comparison of the solutions against their time complexity and the influence of the parameters of a given structure (network model generated by BRITE tool) upon the efficiency of the algorithms under scrutiny.
101 - 110