Bottom-up construction of dynamic multicast trees in WDM networks

Guoliang Xue, Rakesh Banka

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


The high throughput provided by WDM technology in fiber optic networks has made WDM networks the choice of future high speed networks. Many efficient routing and wavelength assignment algorithms have been proposed in the literature. However, efficient construction of multicast trees in all-optical WDM networks is still a challenging problem. Due to the difficulty of partitioning the destinations into different wavelength groups, minimizing the network usage of a multicast tree in all-optical WDM network is much harder than its counterpart in IP networks. In this paper, we present a simple greedy heuristic for constructing a dynamic multicast tree in an all-optical WDM network. Our algorithm can establish a multicast tree as long as all destinations are reachable from the source node. Computational results show that (1) The blocking probability of our algorithm is considerably lower than other known WDM multicast algorithms. (2) The network usage required by our multicast tree is less than that of the multicast tree induced from minimum cost unicasts. (3) The time required to establish a multicast tree is very short.

Original languageEnglish (US)
Title of host publicationIEEE International Performance, Computing and Communications Conference, Proceedings
EditorsA.D. George, E. Johnson, G.G. Richard III, G. Xue
Number of pages8
StatePublished - 2003
Event22nd IEEE International Performance, Computing, and Communications Conference - Phoenix, AZ, United States
Duration: Apr 9 2003Apr 11 2003


Other22nd IEEE International Performance, Computing, and Communications Conference
Country/TerritoryUnited States
CityPhoenix, AZ


  • Multicast routing
  • Performance evaluation
  • WDM all-optical networks

ASJC Scopus subject areas

  • Media Technology


Dive into the research topics of 'Bottom-up construction of dynamic multicast trees in WDM networks'. Together they form a unique fingerprint.

Cite this