Least-loaded-first dynamic multicast routing for single rate loss networks
Chi-Chung Cheung, Danny H. K. Tsang, S. Gupta, Hon‐Wai Chu · 2002
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.