File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Wavelength allocation on trees of rings

TitleWavelength allocation on trees of rings
Authors
KeywordsApproxi
Mation Algorithm
Optical Network
Wavelength Allocation
Issue Date2000
PublisherJohn Wiley & Sons, Inc. The Journal's web site is located at http://www.interscience.wiley.com/jpages/0028-3045/
Citation
Networks, 2000, v. 35 n. 4, p. 248-252 How to Cite?
AbstractWe consider a problem that arises from communication in all-optical networks. Data are transmitted from source nodes to destination nodes via fixed routes. The high bandwidth of the optic fiber allows for wavelength-division multiplexing so that a single physical optical link can carry several logical signals of different wavelengths. The problem is to carry out a set of requests using a limited number of wavelengths so that different routes using the same wavelength never use the same physical link. We focus on trees of rings which are constructed as follows: Start from a tree and replace each node of the tree by a cycle. Each edge in the tree corresponds to the corresponding cycles sharing a common node. We design an approximation algorithm that routes any set of requests on the tree of rings using no more than 2.5wopt wavelengths, where wopt is the minimum possible number of wavelengths for that set of requests. This improves a 3-approximation solution of Raghavan and Upfal. © 2000 John Wiley & Sons, Inc.
Persistent Identifierhttp://hdl.handle.net/10722/156082
ISSN
2015 Impact Factor: 0.943
2015 SCImago Journal Rankings: 1.043
References

 

DC FieldValueLanguage
dc.contributor.authorDeng, Xen_US
dc.contributor.authorLi, Gen_US
dc.contributor.authorZang, Wen_US
dc.date.accessioned2012-08-08T08:40:19Z-
dc.date.available2012-08-08T08:40:19Z-
dc.date.issued2000en_US
dc.identifier.citationNetworks, 2000, v. 35 n. 4, p. 248-252en_US
dc.identifier.issn0028-3045en_US
dc.identifier.urihttp://hdl.handle.net/10722/156082-
dc.description.abstractWe consider a problem that arises from communication in all-optical networks. Data are transmitted from source nodes to destination nodes via fixed routes. The high bandwidth of the optic fiber allows for wavelength-division multiplexing so that a single physical optical link can carry several logical signals of different wavelengths. The problem is to carry out a set of requests using a limited number of wavelengths so that different routes using the same wavelength never use the same physical link. We focus on trees of rings which are constructed as follows: Start from a tree and replace each node of the tree by a cycle. Each edge in the tree corresponds to the corresponding cycles sharing a common node. We design an approximation algorithm that routes any set of requests on the tree of rings using no more than 2.5wopt wavelengths, where wopt is the minimum possible number of wavelengths for that set of requests. This improves a 3-approximation solution of Raghavan and Upfal. © 2000 John Wiley & Sons, Inc.en_US
dc.languageengen_US
dc.publisherJohn Wiley & Sons, Inc. The Journal's web site is located at http://www.interscience.wiley.com/jpages/0028-3045/en_US
dc.relation.ispartofNetworksen_US
dc.rightsNetworks. Copyright © John Wiley & Sons, Inc.-
dc.subjectApproxien_US
dc.subjectMation Algorithmen_US
dc.subjectOptical Networken_US
dc.subjectWavelength Allocationen_US
dc.titleWavelength allocation on trees of ringsen_US
dc.typeArticleen_US
dc.identifier.emailZang, W:wzang@maths.hku.hken_US
dc.identifier.authorityZang, W=rp00839en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1002/1097-0037(200007)35:4<248::AID-NET2>3.0.CO;2-9-
dc.identifier.scopuseid_2-s2.0-0034215884en_US
dc.identifier.hkuros52982-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0034215884&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume35en_US
dc.identifier.issue4en_US
dc.identifier.spage248en_US
dc.identifier.epage252en_US
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridDeng, X=7401768881en_US
dc.identifier.scopusauthoridLi, G=8835970900en_US
dc.identifier.scopusauthoridZang, W=7005740804en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats