HKUST Library Institutional Repository Banner

HKUST Institutional Repository >
Electronic and Computer Engineering  >
ECE Conference Papers >

Please use this identifier to cite or link to this item:
Title: 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
Keywords: Dynamic multicast routing
Dynamic multicast routing algorithm
Least load multicast routing
Maximum mean number of new calls accepted before blocking (MCB) multicast routing
Single rate loss networks
Issue Date: 1997
Citation: Proceedings of 6th Open Workshop on High Speed Networks, Stuttgart, Germany, Oct. 1997
Abstract: 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.
Appears in Collections:ECE Conference Papers

Files in This Item:

File Description SizeFormat
cccstuttgart97.pdfpre-published version137KbAdobe PDFView/Open

All items in this Repository are protected by copyright, with all rights reserved.