Least-loaded-first dynamic multicast routing for single rate loss networks

Chi Chung Cheung, Danny H.K. Tsang, Sanjay Gupta, Hon Wai Chu

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

3 Citations (Scopus)

Abstract

In this paper, a new dynamic multicast routing algorithm for single rate loss networks is proposed. The algorithm is called Least-Loaded-First Multicast Routing (LLFMR) and is based on Least Loaded Routing (LLR) concept. The basic idea is to select the least loaded links for establishing the connection. Simulation results show that the normalized revenue loss is significantly reduced when compared to the dynamic multicast routing algorithms proposed in [3]. The results also show that the connection blocking probabilities of calls of different number of destination nodes decrease as the number of destination nodes in a connection request increases.

Original languageEnglish
Pages513-517
Number of pages5
Publication statusPublished - 23 Jun 1996
Externally publishedYes
EventProceedings of the 1996 IEEE International Conference on Communications, ICC'96. Part 1 (of 3) - Dallas, TX, USA
Duration: 23 Jun 199627 Jun 1996

Conference

ConferenceProceedings of the 1996 IEEE International Conference on Communications, ICC'96. Part 1 (of 3)
CityDallas, TX, USA
Period23/06/9627/06/96

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this