New state dependent multicast routing for single rate loss networks

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

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 research › peer-review

Abstract

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 language	English
Pages	1030-1035
Number of pages	6
Publication status	Published - 8 Nov 1998
Externally published	Yes
Event	Proceedings of the IEEE GLOBECOM 1998 - The Bridge to the Global Integration - Sydney, NSW, Aust Duration: 8 Nov 1998 → 12 Nov 1998

Conference

Conference	Proceedings of the IEEE GLOBECOM 1998 - The Bridge to the Global Integration
City	Sydney, NSW, Aust
Period	8/11/98 → 12/11/98

ASJC Scopus subject areas

Electrical and Electronic Engineering
Global and Planetary Change

Cite this

@conference{402769b1152f412e94a3c50003620fe4,

title = "New state dependent multicast routing for single rate loss networks",

abstract = "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.",

author = "Cheung, {Chi Chung} and Tsang, {Danny H.K.} and Sanjay Gupta",

year = "1998",

month = nov,

day = "8",

language = "English",

pages = "1030--1035",

note = "Proceedings of the IEEE GLOBECOM 1998 - The Bridge to the Global Integration ; Conference date: 08-11-1998 Through 12-11-1998",

}

New state dependent multicast routing for single rate loss networks. / Cheung, Chi Chung; Tsang, Danny H.K.; Gupta, Sanjay.
1998. 1030-1035 Paper presented at Proceedings of the IEEE GLOBECOM 1998 - The Bridge to the Global Integration, Sydney, NSW, Aust.

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

TY - CONF

T1 - New state dependent multicast routing for single rate loss networks

AU - Cheung, Chi Chung

AU - Tsang, Danny H.K.

AU - Gupta, Sanjay

PY - 1998/11/8

Y1 - 1998/11/8

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0032260014&partnerID=8YFLogxK

M3 - Conference presentation (not published in journal/proceeding/book)

AN - SCOPUS:0032260014

SP - 1030

EP - 1035

T2 - Proceedings of the IEEE GLOBECOM 1998 - The Bridge to the Global Integration

Y2 - 8 November 1998 through 12 November 1998

ER -

New state dependent multicast routing for single rate loss networks

Abstract

Conference

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this