Close category search window
 

Evaluate the blocking performance for “all optical wavelength routed WDM networks with and without wavelength converters” using the iterative path decomposition algorithm

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)
El-Khamy, F.E. ; Nat. Telecommun. Inst., Cairo, Egypt ; Nasr, M. ; Shalaby, H.M.H. ; Mouftah, H.T.

Wavelength-routed networks can effectively utilize the bandwidth of the optical fibers. Wavelength converters help to reduce the blocking probability of the network and enhance the fiber utilization. We use the iterative path decomposition algorithm to evaluate accurately and efficiently the blocking performance of 14-node NSFNet with and without wavelength converters. The iterative algorithm analyzes the original network by decomposing it into single-path subsystems. These subsystems are analyzed in isolation, and the individual results are appropriately combined to obtain a solution for the overall network.

Published in:
High-Capacity Optical Networks and Enabling Technologies (HONET), 2009 6th International Symposium on

Date of Conference: 28-30 Dec. 2009

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.