New state dependent multicast routing for single rate loss networks

Chi Chung Cheung, Danny H.K. Tsang, Sanjay Gupta

Research output: Unpublished conference presentation (presented paper, abstract, poster)Conference presentation (not published in journal/proceeding/book)Academic researchpeer-review


In this paper, we investigate the dynamic multicast routing problem for single rate loss networks 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 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.

Original languageEnglish
Number of pages6
Publication statusPublished - 8 Nov 1998
Externally publishedYes
EventProceedings of the IEEE GLOBECOM 1998 - The Bridge to the Global Integration - Sydney, NSW, Aust
Duration: 8 Nov 199812 Nov 1998


ConferenceProceedings of the IEEE GLOBECOM 1998 - The Bridge to the Global Integration
CitySydney, NSW, Aust

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Global and Planetary Change

Cite this