Ecien t Dynamic Trac Grooming in Service-dieren tiated WDM Mesh Networks ?

In this paper, we address the issue of trac grooming in arbitrary WDM mesh networks. We present a novel groomer architecture wherein a combination of grooming at two dieren t granularities is utilized to make the setup cost-eectiv e without compromising on eciency . We put forward an ecien t algorithm for dynamic routing and wavelength assignment of sub-wavelength connections. We also propose a means of rerouting connections dynamically to facilitate increase in the average call acceptance ratio. Rerouting in the dynamic scenario has never been considered before. The connections, which may have arbitrary bandwidth requirements, are considered to be service- dieren tiated based on the need for protection. We show the advantage of employing segmented backup in place of end-to-end backup as well as the benets of the rerouting mechanism we propose through extensive simulation results.

[1]  C. Siva Ram Murthy,et al.  Dynamic establishment of segmented protection paths in single and multi-fiber WDM mesh networks , 2002, SPIE ITCom.

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

[3]  Biswanath Mukherjee,et al.  Dynamic traffic grooming in WDM mesh networks using a novel graph model , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[4]  V. R. Konda,et al.  Algorithm for traffic grooming in optical networks to minimize the number of transceivers , 2001, 2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552).

[5]  Stéphane Pérennes,et al.  Traffic grooming in WDM networks with multi-layer switches , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[6]  Arun K. Somani,et al.  Traffic grooming for survivable WDM mesh networks , 2001, OptiComm: Optical Networking and Communications Conference.