A distributed algorithm of delay bounded multicast routing for multimedia applications

Author

Jia, Xiaohua ; Pissinou, Niki ; Makki, Kia

Author_Institution

Dept. of Comput. Sci., City Univ. of Hong Kong, Hong Kong

fYear

1997

fDate

22-25 Sep 1997

Firstpage

208

Lastpage

213

Abstract

The aim of multicast routing is to find a tree which is rooted from the source node and contains all the multicast destinations. A delay bounded routing tree, is a tree where the accumulated delay from the source node to any destination along the tree shall not exceed a pre-specified bound. This paper presents a distributed heuristic algorithm which generates routing trees with sub-optimal network cost under the delay bound constraint. The proposed algorithm is fully distributed, efficient in terms of the number of messages required, and flexible in multicast membership changes. A large amount of simulations have been done to show that the network cost of the routing trees generated by our algorithm is better than the major existing algorithms

Keywords

delays; distributed algorithms; multimedia communication; telecommunication channels; telecommunication network routing; trees (mathematics); delay bound constraint; delay bounded multicast routing; distributed heuristic algorithm; multicast destinations; multicast membership changes; multimedia applications; routing trees; simulations; source node; sub-optimal network cost; Application software; Cities and towns; Computer science; Costs; Delay effects; Distributed algorithms; Multicast algorithms; Quality of service; Routing; Videoconference;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Communications and Networks, 1997. Proceedings., Sixth International Conference on

Conference_Location

Las Vegas, NV

ISSN

1095-2055

Print_ISBN

0-8186-8186-1

Type

conf

DOI

10.1109/ICCCN.1997.623314

Filename

623314