DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ho, QD | ko |
dc.contributor.author | Lee, Man Seop | ko |
dc.date.accessioned | 2013-03-07T18:38:43Z | - |
dc.date.available | 2013-03-07T18:38:43Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2006-03 | - |
dc.identifier.citation | IEEE COMMUNICATIONS LETTERS, v.10, pp.198 - 200 | - |
dc.identifier.issn | 1089-7798 | - |
dc.identifier.uri | http://hdl.handle.net/10203/90959 | - |
dc.description.abstract | In wavelength-routed optical networks (WRONs), a wavelength assignment algorithm which can optimally utilize wavelength converters is strongly desired. In this letter, for the first time, we propose a novel graph constructed with groups of available wavelengths, called lambda-runs, to obtain the least-conversion lightpaths easily by applying the shortest-path routing Dijkstra's algorithm. Simulations show that our algorithm is much more scalable than an existing optimal algorithm, and significantly improves the blocking performance, compared to modified first-fit algorithm. | - |
dc.language | English | - |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
dc.title | Time-efficient optimal wavelength assignment in optical WDM networks with conversion capability | - |
dc.type | Article | - |
dc.identifier.wosid | 000237547000024 | - |
dc.identifier.scopusid | 2-s2.0-33644911167 | - |
dc.type.rims | ART | - |
dc.citation.volume | 10 | - |
dc.citation.beginningpage | 198 | - |
dc.citation.endingpage | 200 | - |
dc.citation.publicationname | IEEE COMMUNICATIONS LETTERS | - |
dc.identifier.doi | 10.1109/LCOMM.2006.03014 | - |
dc.contributor.localauthor | Lee, Man Seop | - |
dc.contributor.nonIdAuthor | Ho, QD | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | routing and wavelength assignment | - |
dc.subject.keywordAuthor | wavelength conversion | - |
dc.subject.keywordAuthor | lightpath | - |
dc.subject.keywordAuthor | WDM | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.