Grade-of-service differentiated static resource allocation schemes in WDM networks

Zhang, James Yiming; Wu, Jing; Bochmann, Gregor von; Savoie, Michel

doi:10.1016/j.osn.2008.01.003

Cited by 5 publications

(3 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…After removing the terms that are independent of the decision variables, the dual function becomes equation (12). Refer to Zhang et al (2004, 2008) for the mathematical details. The second fact is that the resource allocation to each lightpath is independent, because the resource usage constraints in equations (4)‐(7) are relaxed.…”

Section: Computation Methodsmentioning

confidence: 99%

“…We adopt a penalty‐based objective function as in Zhang et al (2008), wherein the rejection of demands and the use of network resources are penalized. Since a certain amount of potential revenue is lost when a request is rejected, the rejection penalty equals the amount of its potential revenue.…”

Section: An Integer Linear Programming Formulation Of the Static Rwa Problemmentioning

confidence: 99%

“…In this paper, we present the benefits of using the Lagrangian relaxation (LR) and subgradient methods in scenario studies for WDM network planning. The LR‐based method has shown its advantages in computing a near‐optimal solution for a single case WDM network planning problem (Zhang et al , 2004, 2008; Lee et al , 2004; Luh et al , 1990; Lucena, 2006; Saad and Luo, 2004; Guan et al , 2007). We use the Lagrange multipliers that are obtained from previous scenarios as initial Lagrange multiplier values for other related scenarios.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A computation method for scenario studies in WDM network planning

Zhang

Bochmann

et al. 2009

COMPEL - The International Journal for Computation and Mathematics in Electrical and Electronic Engineering

Self Cite

View full text Add to dashboard Cite

PurposeThe 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/approachA 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.FindingsThis 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 implicationsThe 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/valueUnlike 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.

show abstract

Section: Computation Methodsmentioning

confidence: 99%

Section: An Integer Linear Programming Formulation Of the Static Rwa Problemmentioning

confidence: 99%