By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Chi-Chung Cheung ; Dept. of Electr. & Electron. Eng., Hong Kong Univ. of Sci. & Technol., Hong Kong ; Tsang, D.H.K. ; Gupta, S. ; Hon-Wai Chu

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

Published in:

Communications, 1996. ICC '96, Conference Record, Converging Technologies for Tomorrow's Applications. 1996 IEEE International Conference on  (Volume:1 )

Date of Conference:

23-27 Jun 1996