Least-loaded-first dynamic multicast routing for single rate loss networks

Author

Cheung, Chi-Chung ; Tsang, Dann H k ; Gupta, Sanjay ; Chu, Hon-Wai

Author_Institution

Dept. of Electr. & Electron. Eng., Hong Kong Univ. of Sci. & Technol., Hong Kong

Volume

1

fYear

1996

Firstpage

513

Abstract

A new dynamic multicast routing algorithm for single rate loss networks is proposed. The algorithm is called least-loaded-first multicast routing (LLFMR) and is based on the least loaded routing (LLR) concept. The basic idea is to select the least loaded links for establishing the connection. Simulation results show that the normalized revenue loss is significantly reduced when compared to the dynamic multicast routing algorithms proposed by Hwang (see Proceedings of IEEE INFOCOM 95, p. 571, 1995). The results also show that the connection blocking probabilities of calls of a number of destination nodes decrease as the number of destination nodes in a connection request increases

Keywords

channel capacity; probability; telecommunication congestion control; telecommunication links; telecommunication network routing; call blocking probabilities; connection blocking probabilities; destination nodes; dynamic multicast routing algorithm; least loaded first dynamic multicast routing; least loaded links; least loaded routing; link connection; normalized revenue loss; simulation results; single rate loss networks; Asynchronous transfer mode; Bandwidth; Broadcasting; Heuristic algorithms; Multicast algorithms; Multimedia communication; Packet switching; Routing; Switching circuits; Telecommunication switching;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications, 1996. ICC '96, Conference Record, Converging Technologies for Tomorrow's Applications. 1996 IEEE International Conference on

Conference_Location

Dallas, TX

Print_ISBN

0-7803-3250-4

Type

conf

DOI

10.1109/ICC.1996.542249

Filename

542249