Wavelength Assignment in Waveband Switching Networks with Wavelength

Wavelength Assignment in Waveband Switching Networks with Wavelength Conversion Xiaojun Cao; Chunming Qiao; Anand, V. Jikai LI GLOBECOM '04. IEEE Volume 3, 29 Nov. -3 Dec. 2004 Page(s): 1943 - 1947 Vol. 3 Reporter: Chia-Nung Wang

Outline n n n Introduction Wavelength conversion in WBS networks Waveband Assignment with Path-Graph (WAPG) Performance evaluation Conclusion 2

Introduction (1/5) n n Optical network employ WDM to meet the high bandwidth requirement. Waveband switching (WBS) n n n Wherein wavelengths are grouped in to band switched as a single entity. Demultiplex the band to switch individual wavelength only when some traffic needs to be added/dropped. It can reduce cost and complexity of switching nodes by minimizing the port count. 3

Introduction (2/5) n n n Recently, WBS in conjunction with new Multi-Granular Optical Cross-connection (MG-OXCs). An MG-OXCs that can switch traffic at fiber, waveband wavelength granularities. The overall port counts of the MG-OXCs can reduced by using WBS. 4

Introduction (3/5) n n n Wavelength converter can efficiently reduce the blocking probability of Wavelength routed networks. But wavelength converter is expensive and can result in degradation of signal quality. Hence, sparse placement of limited number of wavelength converters and limited-range wavelength converters is recently researches. 5

Introduction (4/5) n There are three unique issues related to wavelength conversion in WBS networks. n n n Request blocking may come from not only the limited number of wavelengths, but also the limited number of ports at the MG-OXCs. One may use intra-band wavelength conversion which is different from limited-range wavelength conversion. Performing wavelength conversion requires all the wavelengths in a band to be demultiplexed and hence consuming more ports, which in turn, may result in blocking of future requests. 6

Introduction (5/5) n n In this paper, author develop a novel algorithm called Waveband Assignment with Path-Graph (WAPG). Author also apply the WAPG algorithm to WBS networks using MG-OXCs with varying port count and Wavelength Conversion capability. 7

Wavelength Conversion in WBS networks n n Describe the architecture of MG-OXC and discuss different wavelength conversion technologies. Reconfigurable (Flexible) MG-OXC architecture: n n Similar to a static (non-reconfigurable) MG-OXC, it includes: Fiber cross-connect (FXC). Band cross-connect (BXC). Wavelength cross-connect (WXC). 8

Reconfigurable MG-OXC architecture (1/2) B Bdrop Fadd Wdrop Fdrop Wavelength to Band OUTPUT multiplexers Band to Wavelength INPUT demultiplexers Band to Fiber. OUTPUT multiplexers add INPUT Fiber to Band demultiplexers Y: The number of BXC ports from FTB INPUT OUTPUT Z: The number of incoming fibers 9

Reconfigurable MG-OXC architecture (2/2) n This MG-OXC architecture is reconfigurable (and hence flexible) in that : n n any [αZ] fibers can be demultiplexed into bands. any [βY] of these bands can be demultiplexed into wavelengths. n Here, we set: n n α=1 to allow any fiber to be demultiplexed to bands. Β<1 allowing only a limited number of bands to be demultiplexed into wavelengths simultaneously. 10

Wavelength Conversion (1/2) n n Wavelength conversion can be full or limited-ranged. In original limited-range wavelength conversion: n n A wavelength can be converted only to a subset of wavelength. e. g, wavelength λ can only be converted to the wavelength within the range [λ-δ, λ+δ]. 11

Wavelength Conversion (2/2) n n A dedicated number (d≦X) of wavelength converters are associated with each outgoing link. (For WBS networks) Intra-band wavelength conversion: n n Where a wavelength can only be converted to any other wavelengths in the same band. For example, if band size is 3, w 1, w 2, w 3 are in the same band b 1, then w 3 can only be converted to w 1 or w 2. 12

Waveband Assignment with Path-Graph (WAPG) n At first, we assume that: n n The existing connection are not re-arrangeable. The heuristic algorithm is base on the layergraph approach. Fixed routing (shortest path first), is used in WBS networks with intra-band wavelength conversion. The algorithm can be applied to different wavelength conversion and routing scheme. 13

WAPG n Parameter setting: n n n A lightpath request using path l that s=s 0 s 1 s 2, … si si+1, … sn=d. H is the number of hops along the path. Each link has X wavelength, partition into B bands, each consisting of W wavelength. b is the index of waveband set £ ={1, 2, . . . [X/B]}. Then wavelength 1≦λ ≦X belongs to band b=[λ/B]. 14

WAPG algorithm (1/5) 15

WAPG algorithm (2/5) 16

WAPG algorithm (3/5) 17

WAPG algorithm (4/5) 18

WAPG algorithm (5/5) n According to the way we set the weight of each link, Dijkstra algorithm will: n n n First try to find a wavelength-continuous lightpath. Then try to find a non wavelength continuous path using minimum number of wavelength converter. Here will compare WAPG with First. Fit and Random. Fit algorithm. 19

Performance evaluation (1/5) n Assume that the traffic and topology is : n n Uniformly distributed to all node pairs In the USANet topology with 46 nodes and 76 links. The lightpath requests arrive according to Poisson process. Every link has one bi-directional fiber, each fiber has 20 bands and each band has 4 wavelength. 20

Performance evaluation (2/5) n n Focus on the blocking probability and the number of used wavelength converters. Above USANet with or without wavelength converter, we use: n n NWC: Without any wavelength converter. IWC: Maximum number of intra-band wavelength converters. FWC: Maximum number of full wavelength converters. LWC: Limited number of full wavelength converters. 21

Performance evaluation (3/5) n When β=1 : 22

Performance evaluation (4/5) n When β=0. 75 : 23

Performance evaluation (5/5) n Random. Fit is ill-suited for this networks: n n n It assign the wavelength randomly and does not take waveband grouping into consideration. It consumes a large number of wavelength converter. First. Fit : n n The sequentially assignment helps in wavebanding and reducing the number of used ports and blocking probability. But it does not minimize the number of wavelength conversion. 24

Conclusion n In this work, author have developed an efficient heuristic algorithm call WAPG. The WAPG has been applied to the case with full WC, intra-band WC and limited WC to accommodate fully dynamic traffic. WAPG is significant better in terms of minimizing the number of used wavelength converters and outperforms than others in terms of blocking probability. 25

Thanks for listening!! 26