Please use this identifier to cite or link to this item:

New state dependent multicast routing for single rate loss networks

Authors Cheung, Chi-Chung
Tsang, Danny H.K. View this author's profile
Gupta, Sanjay
Issue Date 1998
Source Conference Record / IEEE Global Telecommunications Conference , v. 2, 1998, p. 1030-1035
Summary In this paper, we investigate the dynamic multicast routing problem for single rate loss networks and briefly discuss the dynamic multicast routing algorithm called Least Load Multicast Routing (LLMR). We propose a new multicast routing algorithm called Maximum Mean Number of New Calls Accepted Before Blocking Multicast Routing (MCBMR), which can more accurately reflect the current and future loading of a network. Simulation results show that this algorithm, compared with LLMR, not only has a smaller network revenue loss, but also results in smaller call blocking probabilities for all classes of traffic.
ISBN 0-7803-4984-9
Rights © 1998 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
Language English
Format Article
Access View full-text via DOI
View full-text via Scopus
View full-text via Web of Science
Files in this item:
File Description Size Format
cccglobecom98.pdf 156921 B Adobe PDF