Computing Blocking Probability of Dynamic Traffic Grooming in Mesh WDM Optical Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Cross-layer path computation for dynamic traffic grooming: in mesh WDM optical networks
Proceedings of the 43rd annual Southeast regional conference - Volume 2
A network flow approach for static and dynamic traffic grooming in WDM networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Blocking analysis of dynamic traffic grooming in mesh WDM optical networks
IEEE/ACM Transactions on Networking (TON)
MICRON: a framework for connection establishment in optical networks
IEEE/ACM Transactions on Networking (TON)
Photonic Network Communications
Distributed dynamic grooming routing and wavelength assignment in WDM optical mesh networks
Photonic Network Communications
Analysis of multi-hop traffic grooming in WDM mesh networks
Optical Switching and Networking
Hi-index | 0.07 |
Traffic grooming is an important task in interworking between the wavelength-division multiplexing (WDM) optical network that supplies "pipes" at the wavelength granularity, and the attached client networks that usually require connections of subwavelength granularity. The focus of this paper is to conduct performance analysis of grooming dynamic client traffic in WDM optical networks with a mesh topology. This paper first briefly introduces the traffic grooming problem in WDM optical networks and the issues related to performance analysis. It then develops two link blocking models, an exact model based on the stochastic knapsack problem and an approximation model based on an approximate continuous time Markov chain (CTMC). The end-to-end performance analysis is conducted using the reduced load approximation. The result obtained from analysis is shown to be accurate compared with the numerical result obtained from simulation.