Referenced Items are not available for this document.
Routing and wavelength assignment (RWA) is an important issue in the design of routing protocols in an all-optical network. A solution for the RWA problem should determine the least possible number of wavelengths, also known as the chromatic number. In this letter, we introduce the concept of cutset congestion, and show that the congestion of the most congested cutset of a graph representing the network is a tight lower bound for the chromatic number in the RWA problem. In contrast to other existing techniques, our method can be applied to any network and any traffic pattern.
Published in:
Communications Letters, IEEE
(Volume:8
,
Issue:
7
)
Date of Publication: July 2004
- Page(s):
- 473 - 475
- ISSN :
- 1089-7798
- INSPEC Accession Number:
- 8112004
- Digital Object Identifier :
- 10.1109/LCOMM.2004.832765
- Date of Current Version :
- 19 July 2004
- Issue Date :
- July 2004
- Sponsored by :
- IEEE Communications Society
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.
