Please use this identifier to cite or link to this item:
Title: Waveband grooming based on layered auxiliary graph in multi-domain optical networks
Authors: Guo, L
Cao, J 
Wang, X
Jiang, D
Yang, T
Keywords: Grooming
Layered Auxiliary Graph
Optical networks
Waveband switching
Issue Date: 2010
Publisher: Academic Press
Source: Optical fiber technology, 2010, v. 16, no. 3, p. 162-171 How to cite?
Journal: Optical fiber technology 
Abstract: With the number of wavelengths on fibers keeps increasing, the size and the cost of Optical Cross-Connect (OXC) are greatly enhanced and then the control and management of optical switches become more and more complicated. Therefore, the technique called waveband switching is proposed to reduce the size and the cost of OXC; that is, to save the All-Optical (OOO) switching ports in OXC. However, the existing waveband switching algorithms are all limited in single-domain optical networks. Actually, with the scale of optical backbone keeps enlarging, the network is divided to multiple independent domains to perform the hierarchy routing for achieving the scalability. In order to reduce the size and the cost of OXC meanwhile to achieve the scalability in multi-domains, in this paper we propose a new heuristic algorithm called Waveband Grooming with Layered Auxiliary Graph (WGLAG) since the waveband grooming problem is the NP-hard to perform the inter-domain routing based on the virtual topology of multi-domain network and the intra-domain routing based on the physical topology of single-domain network. In intra-domain routing with waveband grooming of each single-domain, we propose the Layered Auxiliary Graph (LAG) that includes one virtual topology layer and multiple waveband-plane layers to compute a single-hop, or multi-hop or hybrid waveband route for each connection request based on the sub-path waveband grooming scheme. Simulation results show that, WGLAG not only can effectively save more switching ports to reduce the cost of OXC but also can obtain lower blocking probability than other algorithm.
ISSN: 1068-5200
EISSN: 1095-9912
DOI: 10.1016/j.yofte.2010.02.006
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Dec 4, 2018


Last Week
Last month
Citations as of Sep 28, 2018

Page view(s)

Last Week
Last month
Citations as of Dec 9, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.