Least-loaded-first dynamic multicast routing for single rate loss networks
Tsang, Danny H.K.
|Source||IEEE International Conference on Communications, v. 1, 1996, p. 513-517|
|Summary||In this paper, 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 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 in . The results also show that the connection blocking probabilities of calls of different number of destination nodes decrease as the number of destination nodes in a connection request increases.|
|Rights||© 1996 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.|
View full-text via Scopus
View full-text via Web of Science
Files in this item: