A heuristic for multi-constrained multicast routing

Author

Feng, Gang

Author_Institution

Dept. of Electr. Eng., Wisconsin Univ., Platteville, WI, USA

fYear

2004

fDate

2004

Firstpage

309

Lastpage

313

Abstract

In contrast to the situation that the constrained minimum Steiner tree (CMST) problem has attracted much attention in the quality of service (QoS) routing area, little work has been done on multicast routing subject to multiple additive constraints, even though the corresponding applications are obvious. We propose a heuristic, HMCMC, to solve this problem. The basic idea of HMCMC is to construct the multicast tree step by step, which is done essentially based on the latest research results on multi-constrained unicast routing. Computer simulations demonstrate that, if there is one, the proposed heuristic can find a feasible multicast tree with a fairly high probability.

Keywords

multicast communication; quality of service; telecommunication network routing; trees (mathematics); QoS routing; constrained minimum Steiner tree; multi-constrained multicast routing; multi-constrained unicast routing; multicast tree; multiple additive constraints; quality of service routing; Additives; Application software; Costs; Delay; Multicast algorithms; NP-complete problem; Quality of service; Routing; Unicast; Upper bound;

fLanguage

English

Publisher

ieee

Conference_Titel

High Performance Switching and Routing, 2004. HPSR. 2004 Workshop on

Print_ISBN

0-7803-8375-3

Type

conf

DOI

10.1109/HPSR.2004.1303497

Filename

1303497