Multicasting and broadcasting in large WDM networks

Weifa Liang, Hong Shen

Research output: Contribution to journalConference articlepeer-review

19 Citations (Scopus)


The issue of multicasting and broadcasting in wide area wavelength division multiplexing (WDM) networks in which a source broadcasts a message to all members in S (⊂V) is addressed. The optimal multicast tree problem is formalized. Given a directed network G = (V, E) with a given source s and a set S of nodes, |V| = n and |E| = m. Associated with every link e∈E, there is a set Λ(e) of available wavelengths on it. Assume that every node in S is reachable from s, the problem is to find a multicast tree rooted at s including all nodes and the cost of using wavelengths conversion at nodes and the cost of using wavelengths on links.

Original languageEnglish
Pages (from-to)365-369
Number of pages5
JournalProceedings of the International Parallel Processing Symposium, IPPS
Publication statusPublished - 1998
Externally publishedYes
EventProceedings of the 1998 12th International Parallel Processing Symposium and 9th Symposium on Parallel and Distributed Processing - Orlando, FL, USA
Duration: 30 Mar 19983 Apr 1998


Dive into the research topics of 'Multicasting and broadcasting in large WDM networks'. Together they form a unique fingerprint.

Cite this