Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem

2002 ◽  
pp. 973-984 ◽  
Author(s):  
Artur Czumaj ◽  
Andrzej Lingas ◽  
Hairong Zhao
Keyword(s):  
Network Design ◽  
Polynomial Time ◽  
Design Problem ◽  
Network Design Problem ◽  
Approximation Schemes ◽  
Time Approximation ◽  
Survivable Network Design ◽  
Survivable Network ◽  
Polynomial Time Approximation

APPROXIMATION ALGORITHMS FOR BUY-AT-BULK GEOMETRIC NETWORK DESIGN

2011 ◽  
Vol 22 (08) ◽  
pp. 1949-1969 ◽  
Author(s):  
ARTUR CZUMAJ ◽  
JUREK CZYZOWICZ ◽  
LESZEK GĄSIENIEC ◽  
JESPER JANSSON ◽  
ANDRZEJ LINGAS ◽  
...  
Keyword(s):  
Approximation Algorithms ◽  
Network Design ◽  
Polynomial Time ◽  
Design Problem ◽  
Graph Model ◽  
Network Design Problem ◽  
Approximation Schemes ◽  
Network Nodes ◽  
Time Approximation ◽  
General Graph

The buy-at-bulk network design problem has been extensively studied in the general graph model. In this paper, we consider geometric versions of the problem, where all points in a Euclidean space are candidates for network nodes, and present the first general approach for solving them. It enables us to obtain quasi-polynomial-time approximation schemes for basic variants of the buy-at-bulk geometric network design problem with polynomial total demand. Then, for instances with a single sink and low capacity links, we design fast polynomial-time, low-constant approximation algorithms.

Tabu Search Algorithm for Survivable Network Design Problem with Simultaneous Unicast and Anycast Flows

2010 ◽  
Vol 56 (1) ◽  
pp. 41-48 ◽  
Author(s):  
Jakub Gładysz ◽  
Krzysztof Walkowiak
Keyword(s):  
Tabu Search ◽  
Network Design ◽  
Design Problem ◽  
Search Algorithm ◽  
Branch And Cut ◽  
Network Design Problem ◽  
Tabu Search Algorithm ◽  
Survivable Network Design ◽  
Network Cost ◽  
Survivable Network

Tabu Search Algorithm for Survivable Network Design Problem with Simultaneous Unicast and Anycast FlowsIn this work we focus on the problem of survivable network design for simultaneous unicast and anycast flows. This problem follows from the growing popularity of network services applying the anycast paradigm. The anycasting is defined as one-to-one-of-many transmission and is applied in Domain Name Service (DNS), peer-to-peer (P2P) systems, Content Delivery Networks (CDN). In this work we formulate two models that enables joint optimization of network capacity, working and backup connections for both unicast and anycast flows. The goal is to minimize the network cost required to protect the network against failures using the single backup path approach. In the first model we consider modular link cost, in the second we are given a set of link proposal and we must select only one of them. Because these problems are NP-hard, therefore optimal solutions of branch-and-bounds or branch-and-cut methods can be generated for relatively small networks. Consequently, we propose a new heuristic algorithm based on Tabu Search method. We present results showing the effectiveness the proposed heuristic compared against optimal results. Moreover, we report results showing that the use of anycast paradigm can reduce the network cost.

Sign in / Sign up

Export Citation Format

Share Document