Close category search window
 

Power Optimal Design of Multicast Light-Trees in WDM Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Fen Zhou ; Telecom Bretagne, Brest, France ; Molnar, M. ; Cousin, B. ; Simon, G.

Given a multicast session in Wavelength Division Multiplexing (WDM) networks, we try to find the multicast light-trees with the minimum power budget while taking into account the optical power loss as light splitting loss, node tapping loss and light attenuation loss. Although light splitting causes non-linear power relationship, we succeed to formulate this problem as a Mixed-Integer Linear Programming (MILP) by developing a set of equivalent linear equations to replace the non-linear ones. The distribution of power loss is analyzed by simulations, which suggests to bound the combined power loss ratio of the node tapping loss and the light attenuation in each source-destination path, and make power-symmetric light-trees by properly using light-splitters in order to minimize the overall power loss.

Published in:
Communications Letters, IEEE  (Volume:15 ,  Issue: 11 )

Date of Publication: November 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.