By Topic

Performance analysis of least load 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
$33 $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 Comput. Sci., Hong Kong Univ., Hong Kong ; D. H. K. Tsang ; S. Gupta ; Hon-Wai Chu

We investigate a state dependent multicast routing algorithm called least load multicast routing (LLMR), for single rate loss networks. The algorithm is based on least load routing (LLR) concept and the approach is to select the least load links for establishing connections. The networks considered are assumed fully connected. In addition, connection requests are Poisson arrival and the holding times of accepted calls are exponentially distributed. The analytical model that we developed for calculating the blocking probabilities is based on the link independence assumption and the reduced load approximation (RLA). Analytical results are compared with simulation results and the agreement is surprisingly good. We find that the effect of link independence assumption is insignificant for the analytical model

Published in:

Communications, 1999. ICC '99. 1999 IEEE International Conference on  (Volume:3 )

Date of Conference: