In this paper, we investigate the dynamic multicast routing problem for single rate loss network and briefly discuss the dynamic multicast routing algorithm called least load multicast routing (LLMR). We propose a new multicast routing algorithm called maximum mean number of new calls accepted before blocking multicast routing (MCBMR), which can more accurately capture the current and future loading of a network. Simulation results show that this algorithm, compared with LLMR, not only has a smaller network revenue loss, but also results in smaller call blocking probabilities for all classes of traffic. We also discuss the implementation issues of our proposed algorithm and develop two approximation methods, state approximation and curve fitting, which can reduce the measurement complexity significantly with only a slight performance degradation.
ASJC Scopus subject areas
- Computer Science Applications
- Computer Networks and Communications
- Electrical and Electronic Engineering