SONET/SDH ring assignment with capacity constraints

Goldschmidt, Olivier; Laugier, Alexandre; Olinick, Eli V.

doi:10.1016/s0166-218x(02)00236-6

Cited by 60 publications

(87 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Having determined which combination of strategies seems to result in the most efficient overall algorithm, we validate our conclusions by testing them on the GOLDGL data set adapted from Goldschmidt et al (2003b).…”

Section: Empirical Experimentationmentioning

confidence: 69%

“…To test the computational efficacy of the procedures developed in this paper, we generated two groups of test data: one generated randomly according to graph generation policies for SONET problems given in the literature, and one adopted from the study of Goldschmidt et al (2003b). The first group contains three sets (Sets 1, 2, and 3), each containing ten stochastic SONET instances, resulting in 30 total demand graphs.…”

Section: Test Instance Generationmentioning

confidence: 99%

“…The second group of problems, GOLDGL, was adapted from a class of ten test instances used by Goldschmidt et al (2003b). Each of these instances contains 15 nodes, and has an edge density of approximately 45%, with the exact number of edges varying from 34 to 62 in this set.…”

Section: Test Instance Generationmentioning

confidence: 99%

“…Laguna (1994) develops a mixed-integer programming model to solve a SONET design problem that permits inter-ring traffic (for example, by DCS), subject to various ring capacity restrictions. Goldschmidt et al (2003b), who also consider inter-ring traffic, minimize the number of rings necessary to satisfy a given set of demands.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A stochastic integer programming approach to solving a synchronous optical network ring design problem

2004

View full text Add to dashboard Cite

We develop stochastic integer programming techniques tailored toward solving a Synchronous Optical Network (SONET) ring design problem with uncertain demands.Our approach is based on an L-shaped algorithm, whose (integer) master program prescribes a candidate network design, and whose (continuous) subproblems relay information regarding potential shortage penalty costs to the ring design decisions. This naive implementation performs very poorly due to two major problems: (1) the weakness of the master problem relaxations, and (2) the limited information passed to the master problem by the optimality cuts. Accordingly, we enforce certain necessary conditions regarding shortage penalty contributions to the objective function within the master problem, along with a corresponding set of valid inequalities that improve the solvability of the master problem. We also detail how a nonlinear reformulation of the model can be used to capture an exponential number of optimality cuts generated by the linear model. We augment these techniques with a powerful upper-bounding heuristic to further accelerate the convergence of the algorithm, and demonstrate the effectiveness of our methodologies on a test bed of randomly generated stochastic SONET instances.

show abstract

Section: Empirical Experimentationmentioning

confidence: 69%

Section: Test Instance Generationmentioning

confidence: 99%

Section: Test Instance Generationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A stochastic integer programming approach to solving a synchronous optical network ring design problem

2004

View full text Add to dashboard Cite

show abstract

“…Another type of the hierarchical network design problem is suggested in [7]. The focus in this article is the clustering problem.…”

Section: Previous Workmentioning

confidence: 99%

Hierarchical Ring Network Design Using Branch-and-Price

Thomadsen

Stidsen

2005

Telecommun Syst

View full text Add to dashboard Cite

Abstract. We consider the problem of designing hierarchical two layer ring networks. The top layer consists of a federal-ring which establishes connection between a number of node disjoint metro-rings in a bottom layer. The objective is to minimize the costs of links in the network, taking both the fixed link establishment costs and the link capacity costs into account.Hierarchical ring network design problems combines the following optimization problems: Clustering, hub selection, metro ring design, federal ring design and routing problems. In this paper a branch-and-price algorithm is presented for jointly solving the clustering problem, the metro ring design problem and the routing problem. Computational results are given for networks with up to 36 nodes.

show abstract

A directed cycle‐based column‐and‐cut generation method for capacitated survivable network design

Rajan

Atamtürk

2004

Networks

View full text Add to dashboard Cite

A network is said to be survivable if it has sufficient capacity for rerouting all of its flow under the failure of any one of its edges. Here, we present a polyhedral approach for designing survivable networks. We describe a mixed-integer programming model, in which sufficient slack is explicitly introduced on the directed cycles of the network while flow routing decisions are made. In case of a failure, flow is rerouted along the slacks reserved on directed cycles. We give strong valid inequalities that use the survivability requirements. We present a computational study with a column-and-cut generation algorithm for designing capacitated survivable networks.

show abstract

SONET/SDH ring assignment with capacity constraints

Cited by 60 publications

References 12 publications

A stochastic integer programming approach to solving a synchronous optical network ring design problem

A stochastic integer programming approach to solving a synchronous optical network ring design problem

Hierarchical Ring Network Design Using Branch-and-Price

A directed cycle‐based column‐and‐cut generation method for capacitated survivable network design

Contact Info

Product

Resources

About