Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A computation method for scenario studies in WDM network planning

A computation method for scenario studies in WDM network planning Purpose – The purpose of this paper is to present the benefits of using the Lagrangian relaxation (LR) and subgradient methods in scenario studies for wavelength division multiplexing (WDM) network planning. The problem of WDM network planning for a given set of lightpath demands in a mesh topology network is to select lightpath routes and then allocate wavelength channels to the lightpaths. In WDM network planning, a scenario study is to find out the network performance under different lightpath demands and/or different network resource configurations. Design/methodology/approach – A scenario study must solve a series of related static WDM network planning problems. Each static WDM network planning problem is an optimization problem, and may be formulated as an integer linear programming problem, which can be solved by the proposed Lagrangian relaxation and subgradient methods. This paper uses the Lagrange multipliers that are obtained from previous scenarios as initial Lagrange multiplier values for other related scenarios. Findings – This approach dramatically reduces the computation time for related scenarios. For small to medium variations of scenarios, the method reduces the computation time by several folds. The proposed method is the first method that effectively considers the relations between related scenarios, and uses such relations to improve the computation efficiency of scenario studies in WDM network planning. Practical implications – The method improves the efficiency of a scenario study in WDM network planning. By using it, many “what‐if” type of scenario study questions can be answered quickly. Originality/value – Unlike other existing methods that treat each scenario individually, this method effectively uses the information of the relation between different scenarios to improve the overall computation efficiency. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering Emerald Publishing

A computation method for scenario studies in WDM network planning

Download PDF
15 pages

Loading next page...
 
/lp/emerald-publishing/a-computation-method-for-scenario-studies-in-wdm-network-planning-q2pEGoYO9n
Publisher
Emerald Publishing
Copyright
Copyright © 2009 Emerald Group Publishing Limited. All rights reserved.
ISSN
0332-1649
DOI
10.1108/03321640910999914
Publisher site
See Article on Publisher Site

Abstract

Purpose – The purpose of this paper is to present the benefits of using the Lagrangian relaxation (LR) and subgradient methods in scenario studies for wavelength division multiplexing (WDM) network planning. The problem of WDM network planning for a given set of lightpath demands in a mesh topology network is to select lightpath routes and then allocate wavelength channels to the lightpaths. In WDM network planning, a scenario study is to find out the network performance under different lightpath demands and/or different network resource configurations. Design/methodology/approach – A scenario study must solve a series of related static WDM network planning problems. Each static WDM network planning problem is an optimization problem, and may be formulated as an integer linear programming problem, which can be solved by the proposed Lagrangian relaxation and subgradient methods. This paper uses the Lagrange multipliers that are obtained from previous scenarios as initial Lagrange multiplier values for other related scenarios. Findings – This approach dramatically reduces the computation time for related scenarios. For small to medium variations of scenarios, the method reduces the computation time by several folds. The proposed method is the first method that effectively considers the relations between related scenarios, and uses such relations to improve the computation efficiency of scenario studies in WDM network planning. Practical implications – The method improves the efficiency of a scenario study in WDM network planning. By using it, many “what‐if” type of scenario study questions can be answered quickly. Originality/value – Unlike other existing methods that treat each scenario individually, this method effectively uses the information of the relation between different scenarios to improve the overall computation efficiency.

Journal

COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering – Emerald Publishing

Published: Nov 13, 2009

Keywords: Wavelengths; Network analysis; Resource allocation; Communication technologies; Telecommunication network routing

References

  • Heuristics for fiber installation in optical network optimisation
    Antonakopoulos, S.; Zhang, L.
  • Wavelength‐routed optical networks: linear formulation, resource budgeting tradeoffs, and a reconfiguration study
    Banerjee, D.; Mukherjee, B.
  • Nonlinear Programming
    Bertsekas, D.P.
  • Survey of virtual topology design algorithm for wavelength‐routed optical networks
    Dutta, R.; Rouskas, G.N.
  • A new method for solving routing and wavelength assignment problems in optical networks
    Guan, X.; Guo, S.; Zhai, Q.; Gong, W.; Qiao, C.
  • Comparison of ILP formulations for the RWA problem
    Jaumard, B.; Meyer, C.; Thiongane, B.
  • Algorithms for routing and wavelength assignment based on solutions of LP‐relaxations
    Krishnaswamy, R.M.; Sivarajan, K.N.
  • A Lagrangean relaxation‐based approach for routing and wavelength assignment in multigranularity optical WDM networks
    Lee, S.S.W.; Yuang, M.C.; Tien, P.L.; Lin, S.H.
  • Lagrangian relax‐and‐cut algorithms
    Lucena, A.
  • Schedule generation and reconfiguration for parallel machines
    Luh, P.B.; Hoitomt, D.J.; Max, E.; Pattipati, K.R.
  • Optical WDM Networks
    Mukherjee, B.
  • Routing and wavelength assignment in optical networks
    Ozdaglar, A.; Bersekas, D.
  • Optical Networks: A Practical Perspective (Networking)
    Ramaswami, R.; Sivarajan, K.N.
  • On the routing and wavelength assignment in multifiber WDM networks
    Saad, M.; Luo, Z.Q.
  • WDM network optimization by ILP based on source formulation
    Tornatore, M.; Maier, G.; Pattavina, A.
  • A Tabu search algorithm for static routing and wavelength assignment problem
    Wang, Y.; Cheng, T.H.; Lim, M.H.
  • A review of routing and wavelength assignment approaches for wavelength‐routed optical WDM networks
    Zang, H.; Jue, J.P.; Mukherjee, B.
  • Grade‐of‐service differentiated static resource allocation schemes in WDM networks
    Zhang, J.Y.; Wu, J.; Bochmann, G.; Savoie, M.
  • A Lagrangean relaxation and subgradient framework for the routing and wavelength assignment problem in WDM networks
    Zhang, Y.; Yang, O.; Liu, H.
  • Optical WDM Networks: Concepts and Design Principles
    Zheng, J.; Mouftah, H.T.