Optimization of loss-balanced multicast in all-optical WDM networks

Yuan Cao () and Oliver Yu ()
Additional contact information
Yuan Cao: University of Illinois at Chicago
Oliver Yu: University of Illinois at Chicago

Journal of Combinatorial Optimization, 2006, vol. 12, issue 1, No 5, 82 pages

Abstract: Abstract In wavelength-division multiplexing (WDM) optical networks, multicast is implemented by constructing a light-forest, which is a set of light-trees with each light-tree rooted from the multicast source and terminated at a partition subset of the destination nodes. Multicast routing scenario has considerable impact on the quality of optical signal received at each destination. To guarantee the fairness of signal quality at different destinations in a multicast session, it is desirable to construct a loss-balanced light-forest to deliver the multicast traffic. A loss-balanced light-forest is composed of a set of light-trees bounded in size (number of destinations per multicast tree), in size variation (difference in the number of destinations among different multicast trees), and in dimension (maximum source-to-destination distance on each multicast tree). This paper investigates the multicast routing and wavelength assignment (MC-RWA) problem under the loss-balance constraint. The problem is formulated as an optimization model using integer linear programming (ILP). Numerical solutions to the optimization model can supply useful performance benchmarks for loss-balance-constrained optical multicast in WDM networks.

Keywords: Multicast Tree; Wavelength Conversion; Wavelength Assignment; Wavelength Channel; Wavelength Converter (search for similar items in EconPapers)
Date: 2006
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-006-8905-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:12:y:2006:i:1:d:10.1007_s10878-006-8905-z

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-006-8905-z

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().