Multi-drop Path Model for Multicast Routing

Shuguang Yan, Maher Ali, Jitender Deogun

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

We investigate the problem of multicast routing and wavelength assignment under the multi-drop path model (MRWA-MP). In a multi-drop path model, multiple paths are employed to establish a multicast session and each path can drop signals at no more a predefined number of destination nodes. Given a network topology and a multicast session, the MRWA-MP problem is to minimize the number of wavelengths used to establish the multicast session. We derive bounds for the objective, and we also develop an efficient heuristic based on maximum flow algorithm. Through experiments, we show that the proposed heuristic achieves the lower bound on the number of wavelengths in almost all instances for real-life and randomly generated networks.

Original languageEnglish (US)
Title of host publicationProceedings of the 6th Joint Conference on Information Sciences, JCIS 2002
EditorsJ.H. Caulfield, S.H. Chen, H.D. Cheng, R. Duro, J.H. Caufield, S.H. Chen, H.D. Cheng, R. Duro, V. Honavar
Pages1283-1286
Number of pages4
StatePublished - 2002
Externally publishedYes
EventProceedings of the 6th Joint Conference on Information Sciences, JCIS 2002 - Research Triange Park, NC, United States
Duration: Mar 8 2002Mar 13 2002

Publication series

NameProceedings of the Joint Conference on Information Sciences
Volume6

Conference

ConferenceProceedings of the 6th Joint Conference on Information Sciences, JCIS 2002
Country/TerritoryUnited States
CityResearch Triange Park, NC
Period3/8/023/13/02

Keywords

  • Maximum Flow
  • Multi-drop Path Model
  • Multicast

ASJC Scopus subject areas

  • General Computer Science

Fingerprint

Dive into the research topics of 'Multi-drop Path Model for Multicast Routing'. Together they form a unique fingerprint.

Cite this