On shortest-path all-optical networks without wavelength conversion requirements
Open access
Date
2002-10Type
- Report
ETH Bibliography
yes
Altmetrics
Abstract
In all-optical networks with wavelength division multiplexing, every connection is routed along a certain path and assigned a wavelength such that no two connections use the same wavelength on the same link. For a given set $calP$ of paths (a routing), let $chi(calP)$ denote the minimum number of wavelengths in a valid wavelength assignment and let $L(P)$ denote the maximum link load. We always have $L(calP)le chi(calP)$. Motivated by practical concerns, we consider routings containing only shortest paths. We give a complete characterization of undirected networks for which any set $calP$ of shortest paths admits a wavelength assignment with $L(calP)$ wavelengths. These are exactly the networks that do not benefit from the use of (expensive) wavelength converters if shortest-path routing is used. We also give an efficient algorithm for computing a wavelength assignment with $L(calP)$ wavelengths in these networks. Show more
Permanent link
https://doi.org/10.3929/ethz-a-004446054Publication status
publishedJournal / series
TIK ReportVolume
Publisher
ETH Zurich, Computer Engineering and Networks LaboratoryEdition / version
Version 2Organisational unit
02640 - Inst. f. Technische Informatik und Komm. / Computer Eng. and Networks Lab.
Related publications and datasets
Is previous version of: http://hdl.handle.net/20.500.11850/55993
Notes
Version 2 (Revised: 14.11.2002)More
Show all metadata
ETH Bibliography
yes
Altmetrics