Dynamic traffic grooming in WDM mesh networks using a novel graph model

We employ a new, generic graph model for dynamic traffic grooming in WDM mesh networks. The novelty of this model is that, by only manipulating the edges of an auxiliary graph created by the model and the weights of these edges, the model can achieve various objectives using different grooming policies, while taking into account various constraints. Based on the auxiliary graph, we develop a dynamic traffic-grooming algorithm. Different grooming policies can be implemented by different weight functions assigned to the edges in the auxiliary graph. We propose four fixed grooming policies and an adaptive grooming policy (AGP), and our results show that AGP outperforms the fixed grooming policies.

[1]  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.

[2]  Adel A. M. Saleh,et al.  Quantifying the benefit of wavelength add-drop in WDM rings with distance-independent and dependent traffic , 1999 .

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

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

[5]  Peng-Jun Wan,et al.  Grooming of arbitrary traffic in SONET/WDM BLSRs , 2000, IEEE Journal on Selected Areas in Communications.

[6]  A.L. Chiu,et al.  Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks , 2000, Journal of Lightwave Technology.

[7]  Eytan Modiano,et al.  Reducing electronic multiplexing costs in SONET/WDM rings with dynamically changing traffic , 2000, IEEE Journal on Selected Areas in Communications.

[8]  George N. Rouskas,et al.  On optimal traffic grooming in WDM rings , 2001, SIGMETRICS '01.

[9]  Arun K. Somani,et al.  Capacity fairness of WDM networks with grooming capabilities , 2000, Other Conferences.

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

[11]  Jian Wang,et al.  Improved approaches for cost-effective traffic grooming in WDM ring networks: ILP formulations and single-hop and multihop connections , 2001 .

[12]  Biswanath Mukherjee,et al.  Interconnected WDM Ring Networks: Strategies for Interconnection and Traffic Grooming* , 2001 .

[13]  Eytan Modiano,et al.  Traffic grooming in WDM networks , 2001, IEEE Commun. Mag..

[14]  Biswanath Mukherjee,et al.  Optical Communication Networks , 1997 .

[15]  Ori Gerstel,et al.  Cost effective traffic grooming in WDM rings , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[16]  Biswanath Mukherjee,et al.  A Review of Traffic Grooming in WDM Optical Networks: Architectures and Challenges , 2002 .

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

[18]  Chunming Qiao,et al.  An effective and comprehensive approach for traffic grooming and wavelength assignment in SONET/WDM rings , 2000, TNET.