Analysis of multi-hop traffic grooming in WDM mesh networks

Traffic grooming is an essential functionality of WDM optical networks to provision multi-granularity subwavelength connections. Depending on the number of lightpaths allowed in a connection route, traffic grooming can be classified as single-hop traffic grooming (SH-TG) and multi-hop traffic grooming (MH-TG). MH-TG is more general and resource-efficient than SH-TG, because it allows connections from different source-destination pairs to share the bandwidth of a lightpath. In this paper, we propose a MH-TG algorithm, namely the fixed-order multi-hop (FOMH) grooming algorithm, based on the fixed-alternate routing approach. We introduce the grooming node selection (GNS) problem in MH-TG and propose three grooming policies, namely exhaustive sequential (ES), limited-hop sequential (LHS) and load sharing (LS) policies, to address the GNS problem. These policies represent different trade-offs among blocking probability, computational complexity and transceiver requirements. Given that the analysis of MH-TG is a relatively unexplored area, we propose an analytical model to evaluate the blocking performance of MH-TG using FOMH and the LS grooming policy. To address the multi-layered routing and multi-rate connection characteristics of traffic grooming, we introduce a novel multi-level decomposition approach in our analytical model which decomposes traffic at four different levels, namely alternate path, connection route, lightpath and link levels. The model also addresses various factors that affect connection blocking probability. These factors include wavelength continuity constraint, channel continuity constraint and route dependence. The Erlang fixed-point approximation method is used to solve the analytical model. Numerical results show that analytical results match well with simulation results. We also evaluate the effect of the grooming policies, the number of virtual hops (lightpaths) within a connection route and the number of alternate paths on the performance of the grooming algorithm.

[1]  Ezhan Karasan,et al.  Effects of wavelength routing and selection algorithms on wavelength conversion gain in WDM optical networks , 1996, Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference.

[2]  Andre Girard,et al.  Routing and Dimensioning in Circuit-Switched Networks , 1990 .

[3]  Arun K. Somani,et al.  Analysis of multi-rate traffic in WDM grooming networks , 2002, Proceedings. Eleventh International Conference on Computer Communications and Networks.

[4]  F. P. Kelly,et al.  Routing and Capacity Allocation in Networks with Trunk Reservation , 1990, Math. Oper. Res..

[5]  Arun K. Somani,et al.  A generalized framework for analyzing time-space switched optical networks , 2002, IEEE J. Sel. Areas Commun..

[6]  George N. Rouskas,et al.  Traffic grooming in WDM networks: past and future , 2002, IEEE Netw..

[7]  Kumar N. Sivarajan,et al.  Blocking in all-optical networks , 2004, IEEE/ACM Transactions on Networking.

[8]  Masayuki Murata,et al.  Performance of alternate routing methods in all-optical switching networks , 1997, Proceedings of INFOCOM '97.

[9]  Chunming Qiao,et al.  An integrated lightpath provisioning approach in mesh optical networks , 2002, Optical Fiber Communication Conference and Exhibit.

[10]  Chunming Qiao,et al.  Traffic grooming in mesh WDM optical networks - performance analysis , 2004, IEEE Journal on Selected Areas in Communications.

[11]  Arun K. Somani,et al.  A capacity correlation model for WDM networks with constrained grooming capabilities , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[12]  B. Ramamurthy,et al.  A link bundled auxiliary graph model for constrained dynamic traffic grooming in WDM mesh networks , 2005, IEEE Journal on Selected Areas in Communications.

[13]  Chunming Qiao,et al.  Performance analysis of multihop traffic grooming in mesh WDM optical networks , 2003, Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712).

[14]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[15]  Biswanath Mukherjee,et al.  Traffic grooming in an optical WDM mesh network , 2002, IEEE J. Sel. Areas Commun..

[16]  Suresh Subramaniam,et al.  All-optical networks with sparse wavelength conversion , 1996, TNET.

[17]  Ahmed Mokhtar,et al.  Adaptive wavelength routing in all-optical networks , 1998, TNET.

[18]  Arun K. Somani,et al.  Analysis of optical networks with heterogeneous grooming architectures , 2004, IEEE/ACM Transactions on Networking.

[19]  George N. Rouskas,et al.  A path decomposition approach for computing blocking probabilities in wavelength-routing networks , 2000, TNET.

[20]  Ezhan Karasan,et al.  Performance of WDM transport networks , 1998, IEEE J. Sel. Areas Commun..

[21]  Biswanath Mukherjee,et al.  On-line approaches for provisioning connections of different bandwidth granularities in WDM mesh networks , 2002, Optical Fiber Communication Conference and Exhibit.

[22]  Biswanath Mukherjee,et al.  A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks , 2003, TNET.

[23]  Keith W. Ross,et al.  Computing approximate blocking probabilities for large loss networks with state-dependent routing , 1993, TNET.