Survivability in hierarchical telecommunications networks

Fouilhoux, Pierre; Karaşan, Oya Ekin; Mahjoub, Ali Ridha; Özkök, Onur; Yaman, Hande

doi:10.1002/net.20479

Cited by 12 publications

(24 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The cut inequalities of all the formulations can be separated exactly in polynomial time by solving a series of minimum cut problems similar to the ones employed in the literature such as Labbé et al (2004), Fouilhoux et al (2012) and Karasan et al (2014). Even though our cut inequalities can be separated exactly by solving minimum cut (maximum flow) problems as typically done in the literature, since the design of the hub network is induced by the design of the hub nodes, we can employ very effective heuristic separation procedures that are particular to our problems.…”

Section: Separation Algorithmsmentioning

confidence: 99%

Regenerator Location Problem and survivable extensions: A hub covering location perspective

Yıldız

Karaşan

2015

Transportation Research Part B: Methodological

View full text Add to dashboard Cite

Survivable network design Branch and cut a b s t r a c tIn a telecommunications network the reach of an optical signal is the maximum distance it can traverse before its quality degrades. Regenerators are devices to extend the optical reach. The regenerator placement problem seeks to place the minimum number of regenerators in an optical network so as to facilitate the communication of a signal between any node pair. In this study, the Regenerator Location Problem is revisited from the hub location perspective directing our focus to applications arising in transportation settings. Two new dimensions involving the challenges of survivability are introduced to the problem. Under partial survivability, our designs hedge against failures in the regeneration equipment only, whereas under full survivability failures on any of the network nodes are accounted for by the utilization of extra regeneration equipment. All three variations of the problem are studied in a unifying framework involving the introduction of individual flow-based compact formulations as well as cut formulations and the implementation of branch and cut algorithms based on the cut formulations. Extensive computational experiments are conducted in order to evaluate the performance of the proposed solution methodologies and to gain insights from realistic instances.

show abstract

Section: Separation Algorithmsmentioning

confidence: 99%

Regenerator Location Problem and survivable extensions: A hub covering location perspective

Yıldız

Karaşan

2015

Transportation Research Part B: Methodological

View full text Add to dashboard Cite

show abstract

“…The cut inequalities of the two-index formulation can be separated exactly in polynomial time (see Labbé et al 2004, Fouilhoux et al 2012) by solving a series of minimum cut problems.…”

Section: The Two-index Formulationmentioning

confidence: 99%

“…A similar extension was performed by Fouilhoux et al (2012) for the single assignment version of the problem. Let V 0 V p be a partition of V such that V l = , for l = 0 p and 0 ∈ V 0 .…”

Section: Dual-homing and Extended F -Partitionmentioning

confidence: 99%

“…To speed up the separation of cut inequalities, we use heuristics similar to those presented by Fouilhoux et al (2012). For a given connected component G j = V j E j with j = 0 and a fixed node i ∈ V j , let S = V j ∪ k ∈V * y * ik > 0 .…”

Section: Cut Inequalitiesmentioning

confidence: 99%

“…Labbé et al (2004) performed a facial study of the ring/star network design problems and provided an efficient branch-and-cut algorithm. Fouilhoux et al (2012) considered the two-edge-connected/star survivable network design problem, which has a close relationship to the problem under consideration. They provided a 0-1 integer programming model and a detailed analysis of the associated polytope.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Survivability in Hierarchical Telecommunications Networks Under Dual Homing

Karaşan

Mahjoub

Özkök

et al. 2014

INFORMS Journal on Computing

Self Cite

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

Editorial

Gouveia¹,

Scutellà²

2011

Networks

View full text Add to dashboard Cite

EditorialThis special issue of Networks is dedicated to the INOC 2009 Conference, held in Pisa, Italy, April 26-29, 2009. As with the previous editions, this fourth edition of the conference has received great interest within the network optimization community, with a large number of participants from some 30 countries. The conference program reached a high scientific level including four plenary talks by invited speakers of international stature on relevant network optimization themes, and 106 talks across 24 contributed sessions and five invited sessions. The Scientific and the Organizing Committees of INOC 2009 were chaired

show abstract

Survivability in hierarchical telecommunications networks

Cited by 12 publications

References 31 publications

Regenerator Location Problem and survivable extensions: A hub covering location perspective

Regenerator Location Problem and survivable extensions: A hub covering location perspective

Survivability in Hierarchical Telecommunications Networks Under Dual Homing

Editorial

Contact Info

Product

Resources

About