We introduce a combined facility location/network design problem in which facilities have constraining capacities on the amount of demand they can serve. This model has a number of applications in regional planning, distribution, telecommunications, energy management, and other areas. Our model includes the classical capacitated facility location problem (CFLP) on a network as a special case. W...

We study a capacity expansion problem that arises in telecommunication network design. Given a capacitated network and a traac demand matrix, the objective is to add capacity to the edges, in modularityes of various modularities, and route traac, so that the overall cost is minimized. We study the polyhedral structure of a mixed-integer formulation of the problem and develop a cutting-plane alg...

In a capacitated network design game, each of n players selects a path from her source to her sink. The cost of each edge is shared equally among the players using the edge. Every edge has a finite capacity that limits the number of players using the edge. We study the price of stability for such games with respect to the max-cost objective, i.e., the maximum cost paid by any player. We show th...

The existing works considering the flow-based discount factor in the hub and spoke problems, assume that increasing the amount of flow passing through each edge of network continuously decreases the unit flow transportation cost. Although a higher volume of flow allows for using wider links and consequently cheaper transportation, but the unit of flow enjoys more discounts, quite like replacing...

In this paper we present a heuristic framework that is based on mathematical programming to solve network design problems. Our techniques combine local branching with locally exact refinements. In an iterative strategy an existing solution is refined by solving restricted mixed integer programs (MIPs) to optimality. These are obtained from the master problem MIP by limiting the number of variab...

The Internet has seen a proliferation of specialized middlebox devices that carry out crucial network functionality such as load balancing, packet inspection or intrusion detection, amongst others. Traditionally, high performance network devices have been built on custom multi-core, specialized memory hierarchies, architectures which are well suited to packet processing. Recently, commodity PC ...

We focus on designing combinatorial algorithms for the CAPACITATED NETWORK DESIGN problem (CAPSNDP). The CAP-SNDP is the problem of satisfying connectivity requirements when edges have costs and hard capacities. We begin by showing that the GROUP STEINER TREE is a special case of CAP-SNDP even when there is connectivity requirement between only one source-sink pair. This implies the first poly-...

The notion of service overlay network (SON) was proposed recently to alleviate difficulties encountered in providing end-to-end quality of service (QoS) guarantees in the current Internet architecture. The SONs are able to provide QoS guarantees by purchasing bandwidth from individual network domains and building a logical end-to-end data delivery infrastructure on top of existing Internet. In ...

It is known in the telecommunications network facility design area that a transmission system cost function may be decomposed into a fixed charge part and a linear cost part. The fixed charge part represents the initial investment cost of installing a transmission system on a link and the linear cost part represents the cost of installing circuits of the system. Using the cost function of this ...