File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1002/1097-0037(200007)35:4<248::AID-NET2>3.0.CO;2-9
- Scopus: eid_2-s2.0-0034215884
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Article: Wavelength allocation on trees of rings
Title | Wavelength allocation on trees of rings |
---|---|
Authors | |
Keywords | Approxi Mation Algorithm Optical Network Wavelength Allocation |
Issue Date | 2000 |
Publisher | John 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? |
Abstract | We 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 Identifier | http://hdl.handle.net/10722/156082 |
ISSN | 2023 Impact Factor: 1.6 2023 SCImago Journal Rankings: 0.908 |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Deng, X | en_US |
dc.contributor.author | Li, G | en_US |
dc.contributor.author | Zang, W | en_US |
dc.date.accessioned | 2012-08-08T08:40:19Z | - |
dc.date.available | 2012-08-08T08:40:19Z | - |
dc.date.issued | 2000 | en_US |
dc.identifier.citation | Networks, 2000, v. 35 n. 4, p. 248-252 | en_US |
dc.identifier.issn | 0028-3045 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/156082 | - |
dc.description.abstract | We 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.language | eng | en_US |
dc.publisher | John Wiley & Sons, Inc. The Journal's web site is located at http://www.interscience.wiley.com/jpages/0028-3045/ | en_US |
dc.relation.ispartof | Networks | en_US |
dc.rights | Networks. Copyright © John Wiley & Sons, Inc. | - |
dc.subject | Approxi | en_US |
dc.subject | Mation Algorithm | en_US |
dc.subject | Optical Network | en_US |
dc.subject | Wavelength Allocation | en_US |
dc.title | Wavelength allocation on trees of rings | en_US |
dc.type | Article | en_US |
dc.identifier.email | Zang, W:wzang@maths.hku.hk | en_US |
dc.identifier.authority | Zang, W=rp00839 | en_US |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.doi | 10.1002/1097-0037(200007)35:4<248::AID-NET2>3.0.CO;2-9 | - |
dc.identifier.scopus | eid_2-s2.0-0034215884 | en_US |
dc.identifier.hkuros | 52982 | - |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-0034215884&selection=ref&src=s&origin=recordpage | en_US |
dc.identifier.volume | 35 | en_US |
dc.identifier.issue | 4 | en_US |
dc.identifier.spage | 248 | en_US |
dc.identifier.epage | 252 | en_US |
dc.publisher.place | United States | en_US |
dc.identifier.scopusauthorid | Deng, X=7401768881 | en_US |
dc.identifier.scopusauthorid | Li, G=8835970900 | en_US |
dc.identifier.scopusauthorid | Zang, W=7005740804 | en_US |
dc.identifier.issnl | 0028-3045 | - |