Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
