Show simple item record

dc.contributor.author
Erlebach, Thomas
dc.contributor.author
Stefanakos, Stamatis
dc.date.accessioned
2022-08-10T12:23:18Z
dc.date.available
2017-06-10T09:16:53Z
dc.date.available
2022-08-10T12:23:18Z
dc.date.issued
2003
dc.identifier.isbn
978-3-540-00623-7
en_US
dc.identifier.isbn
978-3-540-36494-8
en_US
dc.identifier.issn
0302-9743
dc.identifier.issn
1611-3349
dc.identifier.other
10.1007/3-540-36494-3_13
en_US
dc.identifier.uri
http://hdl.handle.net/20.500.11850/55993
dc.description.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 P of paths (a routing), let χ(P) denote the minimum number of wavelengths in a valid wavelength assignment and let L(P) denote the maximum link load. We always have L(P)/<-χ(P). Motivated by practical concerns, we consider routings containing only shortest paths. We give a complete characterization of undirected networks for which any set P of shortest paths admits a wavelength assignment with L(P) 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 awavelength assignment with L(P) wavelengths in these networks.
en_US
dc.language.iso
en
en_US
dc.publisher
Springer
en_US
dc.title
On shortest-path all-optical networks without wavelength conversion requirements
en_US
dc.type
Conference Paper
ethz.book.title
STACS 2003
en_US
ethz.journal.title
Lecture Notes in Computer Science
ethz.journal.volume
2607
en_US
ethz.journal.abbreviated
LNCS
ethz.pages.start
133
en_US
ethz.pages.end
144
en_US
ethz.event
20th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2003)
en_US
ethz.event.location
Berlin, Germany
en_US
ethz.event.date
February 27-March 1, 2003
en_US
ethz.identifier.wos
ethz.publication.place
Berlin
en_US
ethz.publication.status
published
en_US
ethz.relation.isNewVersionOf
10.3929/ethz-a-004446054
ethz.date.deposited
2017-06-10T09:18:59Z
ethz.source
ECIT
ethz.identifier.importid
imp59364fc98226317909
ethz.ecitpid
pub:90118
ethz.eth
yes
en_US
ethz.availability
Metadata only
en_US
ethz.rosetta.installDate
2017-07-12T17:19:12Z
ethz.rosetta.lastUpdated
2021-02-14T09:23:31Z
ethz.rosetta.exportRequired
true
ethz.rosetta.versionExported
true
ethz.COinS
ctx_ver=Z39.88-2004&amp;rft_val_fmt=info:ofi/fmt:kev:mtx:journal&amp;rft.atitle=On%20shortest-path%20all-optical%20networks%20without%20wavelength%20conversion%20requirements&amp;rft.jtitle=Lecture%20Notes%20in%20Computer%20Science&amp;rft.date=2003&amp;rft.volume=2607&amp;rft.spage=133&amp;rft.epage=144&amp;rft.issn=0302-9743&amp;1611-3349&amp;rft.au=Erlebach,%20Thomas&amp;Stefanakos,%20Stamatis&amp;rft.isbn=978-3-540-00623-7&amp;978-3-540-36494-8&amp;rft.genre=proceeding&amp;rft_id=info:doi/10.1007/3-540-36494-3_13&amp;rft.btitle=STACS%202003
 Search print copy at ETH Library

Files in this item

FilesSizeFormatOpen in viewer

There are no files associated with this item.

Publication type

Show simple item record