Delay-constrained localized multicast routing

Author

Ying, LIU ; Sanyang, Liu

Author_Institution

Dept. of Math., Xidian Univ., Xi´´an, China

Volume

1

fYear

2000

fDate

2000

Firstpage

845

Abstract

Delay-constrained multicasting is a fundamental issue in distributed computing and networking. It can be formulated as that of finding a minimum-cost Steiner tree with bounded end-to-end delay along the path from the source node to each destination node and is known to be NP-complete. Several heuristics have been presented for this problem, but most of them require global information in order to construct a multicast tree. Our algorithm uses information only from neighboring nodes, which makes it more practical. The algorithm performs as well as some heuristics using global information

Keywords

delays; minimisation; multicast communication; telecommunication network routing; tree searching; trees (mathematics); NP-completeness; bounded end-to-end delay; delay-constrained localized multicast routing; distributed computing; minimum-cost Steiner tree; multicast tree; multicasting; neighboring nodes; networking; Costs; Delay; Distributed computing; Electronic mail; Multicast algorithms; Multimedia computing; Multimedia systems; Routing; Steiner trees; Unicast;

fLanguage

English

Publisher

ieee

Conference_Titel

Communication Technology Proceedings, 2000. WCC - ICCT 2000. International Conference on

Conference_Location

Beijing

Print_ISBN

0-7803-6394-9

Type

conf

DOI

10.1109/ICCT.2000.889325

Filename

889325