Dynamic Multicast Routing in Circuit-Switched Networks
C.C. Cheung, Danny H. K. Tsang, Santosh Kumar Gupta · 1997
In this paper, we investigate the well-known state dependent multicast routing algorithm called Least Load Multicast Routing (LLMR), for single rate loss networks. The algorithm is based on the Least Load Routing (LLR) concept and the approach is to select the least load links for establishing connections. We propose a modified version, called Aggregated Least Load Multicast Routing (ALLMR), which can reduce the implementation complexity with only a slight performance degradation. 1 Introduction Multicasting refers to the ability of a set of more than two nodes or end-users in a communication network to communicate simultaneously with each other. Applications that require multicast capability (either point-to-multipoint (PTM) as in distributional video or multipoint-to-multipoint (MTM) as in video conferencing, online collaboration and others) will be an integral part of future broadband services. Given the popularity of multicast This research was supported in part by Hongkong Tel...