Cross-layer path computation for dynamic traffic grooming: in mesh WDM optical networks

Authors:
Chunsheng Xin;Feng He
Affiliations:
Norfolk State University, Norfolk, VA;Norfolk State University, Norfolk, VA
Venue:
Proceedings of the 43rd annual Southeast regional conference - Volume 2
Year:
2005

Citing 5
Cited 1

A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks

IEEE/ACM Transactions on Networking (TON)
Blocking analysis of dynamic traffic grooming in mesh WDM optical networks

IEEE/ACM Transactions on Networking (TON)
Design of logical topologies for wavelength-routed optical networks

IEEE Journal on Selected Areas in Communications
A practical approach for routing and wavelength assignment in large wavelength-routed optical networks

IEEE Journal on Selected Areas in Communications
Traffic grooming in mesh WDM optical networks - performance analysis

IEEE Journal on Selected Areas in Communications

Traffic grooming, routing, and wavelength assignment in WDM transport networks with sparse grooming resources

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Traffic grooming in wavelength division multiplexing (WDM) optical networks is an operation to consolidate multiple low-speed traffic streams onto high-speed lightpaths. Traffic grooming of dynamic traffic over a dynamic logical topology, where lightpaths (logical links) are dynamically set up and torn down, is called dynamic traffic grooming, where a major task is to find a path (a list of adjacent lightpaths) in the dynamic logical topology to carry an incoming call. Dynamic traffic grooming is a significant issue in WDM optical networks due to the customer's need of the "bandwidth-on-demand" service. This paper studies path computation in dynamic traffic grooming, using various link cost functions. We propose a path computation approach utilizing the resource usage information in both logical and physical layers. We have evaluated the performance of this cross layer path computation approach, compared with the approach using the resource usage information in the logical layer only. The numerical results show that the cross layer path computation approach can achieve 10% - 20% lower blocking probability.