Traffic grooming in mesh WDM optical networks - performance analysis

The paper develops a theoretical performance analysis model for the online single-hop traffic grooming algorithm in the mesh topology wavelength division multiplexing (WDM) optical network. This is done by developing a link blocking model for traffic grooming based on the continuous time Markov chain and queueing theory, and by extending the Erlang fixed-point approximation for traffic grooming analysis. The results obtained from the analytic model are shown to match well with the numerical results obtained from simulations.

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

[2]  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).

[3]  Keith W. Ross,et al.  Reduced load approximations for multirate loss networks , 1993, IEEE Trans. Commun..

[4]  Chunming Qiao,et al.  Optical network control, engineering and switching , 2002 .

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

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

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

[8]  Keith W. Ross,et al.  Multiservice Loss Models for Broadband Telecommunication Networks , 1997 .

[9]  Gunter Bolch,et al.  Queueing Networks and Markov Chains , 2005 .

[10]  F. Kelly.  Blocking probabilities in large circuit-switched networks , 1986, Advances in Applied Probability.

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

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

[13]  Keith W. Ross,et al.  The stochastic knapsack problem , 1989, IEEE Trans. Commun..

[14]  Leonard Kleinrock,et al.  Queueing Systems: Volume I-Theory , 1975 .

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

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

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

[18]  Deying Li,et al.  Traffic grooming for minimizing wavelength usage in WDM networks , 2002, Proceedings. Eleventh International Conference on Computer Communications and Networks.

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

[20]  J. Kaufman,et al.  Blocking in a Shared Resource Environment , 1981, IEEE Trans. Commun..

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

[22]  Robert G. Gallager,et al.  Discrete Stochastic Processes , 1995 .

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

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

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

[26]  Chunming Qiao,et al.  An agent-based traffic grooming and management mechanism for IP over optical networks , 2002, Proceedings. Eleventh International Conference on Computer Communications and Networks.