A Lagrangian-Relaxation Based Network Profit Optimization For Mesh SONET-Over-WDM Networks |
| |
Authors: | Yiming?Zhang Jing?Wu Email author" target="_blank">Oliver?W?W?YangEmail author Michel?Savoie |
| |
Affiliation: | (1) CCNR (Computer Communication Network Research) Lab, School of Information Technology and Engineering, University of Ottawa, Ottawa, K1N 6N5, Ont, Canada;(2) Communications Research Centre Canada, Ottawa, K2H 8S2, Ont, Canada |
| |
Abstract: | In Wavelength Division Multiplexing (WDM) networks, the huge capacity of wavelength channels is generally much larger than the bandwidth requirement of individual traffic streams from network users. Traffic grooming techniques aggregate low-bandwidth traffic streams onto high-bandwidth wavelength channels. In this paper, we study the optimization problem of grooming the static traffic in mesh Synchronous Optical Network (SONET) over WDM networks. The problem is formulated as a constrained integer linear programming problem and an innovative optimization objective is developed as network profit optimization. The routing cost in the SONET and WDM layers as well as the revenue generated by accepting SONET traffic demands are modelled. Through the optimization process, SONET traffic demands will be selectively accepted based on the profit (i.e., the excess of revenue over network cost) they generate. Consiering the complexity of the network optimization problem, a decomposition approach using Lagrangian relaxation is proposed. The overall relaxed dual problem is decomposed into routing and wavelength assignment and SONET traffic routing sub-problems. The subgradient approach is used to optimize the derived dual function by updating the Lagrange multipliers. To generate a feasible network routing scheme, a heuristic algorithm is proposed based on the dual solution. A systematic approach to obtain theoretical performance bounds is presented for an arbitrary topology mesh network. This is the first time that such theoretical performance bounds are obtained for SONET traffic grooming in mesh topology networks. The optimization results of sample networks indicate that the roposed algorithm achieves good sub-optimal solutions. Finally, the influence of various network parameters is studied. |
| |
Keywords: | WDM networks SONET-over-WDM networks traffic grooming traffic engineering routing and wavelength assignment network profit optimization Lagrangian relaxation |
本文献已被 SpringerLink 等数据库收录! |
|