Please use this identifier to cite or link to this item:

Dynamic multicast routing based on mean number of new calls accepted before blocking for single rate loss networks

Authors Cheung, Chi-Chung
Tsang, Danny H.K.
Gupta, Sanjay
Issue Date 1997
Source Proceedings of 6th Open Workshop on High Speed Networks, Stuttgart, Germany , .1997, Oct
Summary In this paper, we investigate the dynamic multicast routing problem and briefly discuss the we-llknown 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 (MCB) multicast routing, which can more accurately reflect 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.
Language English
Format Conference paper
Files in this item:
File Description Size Format
cccstuttgart97.pdf pre-published version 140832 B Adobe PDF