What is the Internet like, and how do we know? Less tendentiously, how can we make general statements about the Internet without reference to alternatives that help us to understand what the space of network design possibilities might be? This paper presents a series of cases of network alternatives which provide a vantage point from which to reflect upon the ways that the Internet does or does...

Network Design problems concern the selection of arcs in a graph in order to satisfy, at minimum cost, some flow requirements, usually expressed in the form of origin-destination pair demands. Benders decomposition methods, based on the idea of partition and delayed constraint generation, have been successfully applied to many of these problems. This article presents a review of these applicati...

The objective of this paper is to study how important it is to take uncertainty into account in a service network design problem during the planning phase. We look at how a solution based on uncertain demand differs from a solution based on deterministic demand and show that there can be important structural differences between them. Some of these structural differences help hedge against uncer...

We consider the Degree-Bounded Survivable Network Design Problem: the objective is to find a minimum cost subgraph satisfying the given connectivity requirements as well as the degree bounds on the vertices. If we denote the upper bound on the degree of a vertex v by b(v), then we present an algorithm that finds a solution whose cost is at most twice the cost of the optimal solution while the d...

Optimal planning of cellular networks is one of the most fundamental problems in network design. This paper discusses cell planning problems for the fourth generation (4G) cellular networks. We describe important planning aspects derived by the anticipated 4G technologies and model several relevant cell planning problems. We then review several algorithmic techniques for solving these problems.

The objective of this paper is to emphasize a clear and natural distinction in strategies of sensor network design. In order to display different architectural paradigms in today’s wireless sensor networking, the classification of sensor networks as intensive and extensive ones is introduced and explained. Main paradigms representative for both technologies are compared. As follows from the dis...

We present several classes of facet-deening inequalities to strengthen polyhedra arising as subsystems of network design problems with survivability constraints. These problems typically involve assigning capacities to a network with multicommodity demands, such that after a vertex-or edge-deletion at least some prescribed fraction of each demand can be routed.

We consider the Tree Augmentation problem: given a graph G = (V,E) with edge-costs and a tree T on V disjoint to E, find a minimum-cost edge-subset F ⊆ E such that T ∪ F is 2-edge-connected. Tree Augmentation is equivalent to the problem of finding a minimumcost edge-cover F ⊆ E of a laminar set-family. The best known approximation ratio for Tree Augmentation is 2, even for trees of radius 2. A...