107,539 research outputs found
Survivability in hierarchical telecommunications networks under dual homing
Cataloged from PDF version of article.The 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
The Multilayer Capacitated Survivable IP Network Design Problem : valid inequalities and Branch-and-Cut
Telecommunication networks can be seen as the stacking of several layers like, for instance, IP-over-Optical networks. This infrastructure has to be sufficiently survivable to restore the traffic in the event of a failure. Moreover, it should have adequate capacities so that the demands can be routed between the origin-destinations. In this paper we consider the Multilayer Capacitated Survivable IP Network Design problem. We study two variants of this problem with simple and multiple capacities. We give two multicommodity flow formulations for each variant of this problem and describe some valid inequalities. In particular, we characterize valid inequalities obtained using Chvatal-Gomory procedure from the well known Cutset inequalities. We show that some of these inequalities are facet defining. We discuss separation routines for all the valid inequalities. Using these results, we develop a Branch-and-Cut algorithm and a Branch-and-Cut-and-Price algorithm for each variant and present extensive computational results
Survivability in hierarchical telecommunications networks under dual homing
The 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. © 2014 INFORMS
Robust capacitated trees and networks with uniform demands
We are interested in the design of robust (or resilient) capacitated rooted
Steiner networks in case of terminals with uniform demands. Formally, we are
given a graph, capacity and cost functions on the edges, a root, a subset of
nodes called terminals, and a bound k on the number of edge failures. We first
study the problem where k = 1 and the network that we want to design must be a
tree covering the root and the terminals: we give complexity results and
propose models to optimize both the cost of the tree and the number of
terminals disconnected from the root in the worst case of an edge failure,
while respecting the capacity constraints on the edges. Second, we consider the
problem of computing a minimum-cost survivable network, i.e., a network that
covers the root and terminals even after the removal of any k edges, while
still respecting the capacity constraints on the edges. We also consider the
possibility of protecting a given number of edges. We propose three different
formulations: a cut-set based formulation, a flow based one, and a bilevel one
(with an attacker and a defender). We propose algorithms to solve each
formulation and compare their efficiency
- …