Modified least load multicast routings for single rate fully-connected loss networks

In this paper, we investigate the dynamic multicast routing problem and briefly discuss the common dynamic multicast routing algorithm called Least Load Multicast Routing (LLMR). We propose two new multicast routing algorithms called Least Load Multicast Routing with Maximum Occupied Circuits (LLMRMOC) and Least Load Multicast Routing with Minimum Measured Blocking Time (LLMRMMBT), both of which are based on LLMR. Simulation results show that these algorithms, compared with LLMR, not only produce a smaller network revenue loss, but also result in smaller call blocking probabilities for all classes of traffic. The moderate gain in the network performance comes only a slight additional cost. The implementation issues of the proposed algorithms are also discussed.