Abstract
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 [3]. 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.
Original language | English |
---|---|
Pages | 513-517 |
Number of pages | 5 |
Publication status | Published - 23 Jun 1996 |
Externally published | Yes |
Event | Proceedings of the 1996 IEEE International Conference on Communications, ICC'96. Part 1 (of 3) - Dallas, TX, USA Duration: 23 Jun 1996 → 27 Jun 1996 |
Conference
Conference | Proceedings of the 1996 IEEE International Conference on Communications, ICC'96. Part 1 (of 3) |
---|---|
City | Dallas, TX, USA |
Period | 23/06/96 → 27/06/96 |
ASJC Scopus subject areas
- Computer Networks and Communications
- Electrical and Electronic Engineering