A distributed multicast routing algorithm for real-time applications in wide area networks

Author

Huang, Tzu-Lun ; Lee, D.T.

Author_Institution

Dept. of Comput. Sci. & Inf. Eng., Nat. Taiwan Univ., Taipei, Taiwan

fYear

2002

fDate

6/24/1905 12:00:00 AM

Firstpage

295

Lastpage

300

Abstract

In this paper we propose a delay-constrained distributed multicast routing algorithm based on token passing. This, algorithm is fully distributed and generates a multicast routing tree, which not only meets the realtime requirement, but also has a sub-optimal network cost. Simulations have been done and the results have shown that the multicast routing tree generated by our algorithm has better performance than previously known results

Keywords

distributed algorithms; multicast communication; protocols; real-time systems; telecommunication network routing; trees (mathematics); wide area networks; delay-constrained distributed multicast routing algorithm; multicast routing tree; real-time applications; simulations; sub-optimal network cost; token passing; wide area networks; Computer science; Data communication; Delay; Intelligent networks; Multicast algorithms; Postal services; Quality of service; Routing; Time factors; Wide area networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Architectures, Algorithms and Networks, 2002. I-SPAN '02. Proceedings. International Symposium on

Conference_Location

Makati City, Metro Manila

ISSN

1087-4089

Print_ISBN

0-7695-1579-7

Type

conf

DOI

10.1109/ISPAN.2002.1004303

Filename

1004303