Hierarchical Ring Network Design Using Branch-and-Price

Thomadsen, Tommy; Stidsen, Thomas Jacob Riis

doi:10.1007/s11235-005-6631-y

Cited by 22 publications

(17 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…There are few studies that consider the design of two level networks with survivability requirements in both levels. The majority of such studies are on designing ring/ring networks (Thomadsen and Stidsen [19], Carroll and Mc Garraghy [3]), and most of the approaches proposed are heuristic approaches (Shi and Fonseca [17], Balakrishnan et al [1]). The contribution of the present paper is to propose formulations and exact solution methods for the two level survivable network design problem where both rings and 2-edge connected networks are used to ensure survivability.…”

Section: Introductionmentioning

confidence: 99%

Hierarchical Survivable Network Design Problems

Rodríguez-Martín

Salazar-González

Yaman

2016

Electronic Notes in Discrete Mathematics

View full text Add to dashboard Cite

We address the problem of designing two-level networks protected against single edge failures. A set of nodes must be partitioned into terminals and hubs, hubs must be connected through a backbone network, and terminals must be assigned to hubs and connected to them through access networks, being the objective to minimize the total cost. We consider two survivable structures, two-edge connected (2EC) networks and rings, in both levels of the network. We present an integer programming formulation for these problems, solve them using a branch-and-cut algorithm, and show some computational results.

show abstract

Section: Introductionmentioning

confidence: 99%

Hierarchical Survivable Network Design Problems

Rodríguez-Martín

Salazar-González

Yaman

2016

Electronic Notes in Discrete Mathematics

View full text Add to dashboard Cite

show abstract

“…Thomadsen and Stidsen (2005) considered the same infrastructure. They provided a branch-and-price algorithm for the case when the design problems in the two levels are tackled as sequential optimization problems, hence attaining a suboptimal solution for the original problem.…”

Section: Introductionmentioning

confidence: 99%

Survivability in Hierarchical Telecommunications Networks Under Dual Homing

Karaşan

Mahjoub

Özkök

et al. 2014

INFORMS Journal on Computing

View full text Add to dashboard Cite

T he motivation behind this study is the essential need for survivability in the telecommunications networks.An optical signal should find its destination even if the network experiences an occasional fiber cut. We consider the design of a two-level survivable telecommunications network. Terminals compiling the access layer communicate through hubs forming the backbone layer. To hedge against single link failures in the network, we require the backbone subgraph to be two-edge connected and the terminal nodes to connect to the backbone layer in a dual-homed fashion, i.e., at two distinct hubs. The underlying design problem partitions a given set of nodes into hubs and terminals, chooses a set of connections between the hubs such that the resulting backbone network is two-edge connected, and for each terminal chooses two hubs to provide the dual-homing backbone access. All of these decisions are jointly made based on some cost considerations. We give alternative formulations using cut inequalities, compare these formulations, provide a polyhedral analysis of the smallsized formulation, describe valid inequalities, study the associated separation problems, and design variable fixing rules. All of these findings are then utilized in devising an efficient branch-and-cut algorithm to solve this network design problem.

show abstract

“…1b. Figure 2 illustrates an alternative two-layered hierarchical ring network architecture for connecting rings (see [12,19]), where metro rings are inter-connected by a regional ring (or mesh).…”

Section: Introductionmentioning

confidence: 99%

A traffic grooming problem of SONET-WDM rings

Han

Lee²,

Kim³

2008

Photon Netw Commun

View full text Add to dashboard Cite

In this paper, we present a traffic grooming problem of the SONET-WDM ring. The objective is to minimize the total cost of optical add-drop multiplexers (OADMs) and inter-ring hub equipment, while satisfying intra-ring and inter-ring capacities. We develop integer programming (IP) formulations for the problem and devise some reformulations for enhancing the mathematical representation of the proposed IP model. By investigating the polyhedral structure of the problem, we develop some valid inequalities that provide a tight lower bound for the problem. Dealing with the inherent computational complexity of the problem, we also devise an effective tabu search procedure for finding a feasible solution of good quality within reasonable computation time. Computational results are provided to demonstrate the relative strength of the proposed formulations, and to reveal the efficacy of the lower and upper bound procedures for solving the problem.

show abstract

Hierarchical Ring Network Design Using Branch-and-Price

Cited by 22 publications

References 15 publications

Hierarchical Survivable Network Design Problems

Hierarchical Survivable Network Design Problems

Survivability in Hierarchical Telecommunications Networks Under Dual Homing

A traffic grooming problem of SONET-WDM rings

Contact Info

Product

Resources

About