Algorithms for provisioning virtual private networks in the hose model

Kumar, Amit; Rastogi, Rajeev; Silberschatz, Abraham; Yener, Bülent

doi:10.1109/tnet.2002.802141

Cited by 139 publications

(99 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [15], the authors have proposed an integer programming model to solve the VPN tree computation problem for bandwidth provisioning in VPNs. Techniques of randomized rounding for linear programming relaxations to obtain approximation algorithms was first introduced in [16].…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Virtual Network Embedding with Coordinated Node and Link Mapping

2009

View full text Add to dashboard Cite

Abstract-Recently network virtualization has been proposed as a promising way to overcome the current ossification of the Internet by allowing multiple heterogeneous virtual networks (VNs) to coexist on a shared infrastructure. A major challenge in this respect is the VN embedding problem that deals with efficient mapping of virtual nodes and virtual links onto the substrate network resources. Since this problem is known to be N P-hard, previous research focused on designing heuristic-based algorithms which had clear separation between the node mapping and the link mapping phases. This paper proposes VN embedding algorithms with better coordination between the two phases. We formulate the VN embedding problem as a mixed integer program through substrate network augmentation. We then relax the integer constraints to obtain a linear program, and devise two VN embedding algorithms D-ViNE and R-ViNE using deterministic and randomized rounding techniques, respectively. Simulation experiments show that the proposed algorithms increase the acceptance ratio and the revenue while decreasing the cost incurred by the substrate network in the long run.

show abstract

Section: Related Workmentioning

confidence: 99%

“…• Finally, constraint sets (15) and (16) denote the real and binary domain constraints on the variables f i uv and x uv , respectively.…”

Section: Constraintsmentioning

confidence: 99%

Virtual Network Embedding with Coordinated Node and Link Mapping

2009

View full text Add to dashboard Cite

show abstract

“…Previously these were the best known guarantees. Kumar et al [17] implemented a heuristic for the rent-or-buy problem and used it to construct VPN trees. They report that the algorithm outperforms standard heuristics over a wide range of parameter values.…”

Section: Introductionmentioning

confidence: 99%

Primal-Dual Algorithms for Connected Facility Location Problems

Swamy

Kumar

2002

Approximation Algorithms for Combinatorial Optimization

View full text Add to dashboard Cite

We consider the Connected Facility Location problem. We are given a graph G = (V, E) with costs {c e } on the edges, a set of facilities F ⊆ V , and a set of clients D ⊆ V . Facility i has a facility opening cost f i and client j has d j units of demand. We are also given a parameter M ≥ 1. A solution opens some facilities, say F , assigns each client j to an open facility i(j), and connects the open facilities by a Steiner tree T . The total cost incurred is i∈F f i + j∈D d j c i(j)j + M e∈T c e . We want a solution of minimum cost.A special case of this problem is when all opening costs are 0 and facilities may be opened anywhere, i.e., F = V . If we know a facility v that is open, then the problem becomes a special case of the singlesink buy-at-bulk problem with two cable types, also known as the rent-or-buy problem.We give the first primal-dual algorithms for these problems and achieve the best known approximation guarantees. We give a 8.55-approximation algorithm for the connected facility location problem and a 4.55-approximation algorithm for the rent-or-buy problem. Previously the best approximation factors for these problems were 10.66 and 9.001 respectively [8]. Further, these results were not combinatorial -they were obtained by solving an exponential size linear programming relaxation. Our algorithm integrates the primal-dual approaches for the facility location problem [11] and the Steiner tree problem [1,3]. We also consider the connected k-median problem and give a constant-factor approximation by using our primal-dual algorithm for connected facility location. We generalize our results to an edge capacitated variant of these problems and give a constant-factor approximation for these variants.

show abstract

“…More information on virtual network provisioning with respect to theoretical, as well as computational aspects, can be found, e.g., in [10,18]. Examples of efficient resource assignment algorithms can be in turn found in [8,17,23,24].…”

Section: Introductionmentioning

confidence: 99%

Methods of Network Resource Provisioning for the Future Internet IIP Initiative

et al. 2015

View full text Add to dashboard Cite

In this paper, we present specification, design and implementation aspects of a network resource provisioning module introduced for the Polish Initiative of Future Internet called System IIP. In particular, we propose a set of novel LP optimization models of network resource provisioning designed to minimize the network resource consumption, either bandwidth or node's computational power, as well as to maximize the residual capacity. Next, we analyze characteristics of the proposed models, outline the most important implementation aspects of our network resource provisioning module, as well as the issues of integration of this module with the respective network management module of System IIP.

show abstract

Algorithms for provisioning virtual private networks in the hose model

Cited by 139 publications

References 5 publications

Virtual Network Embedding with Coordinated Node and Link Mapping

Virtual Network Embedding with Coordinated Node and Link Mapping

Primal-Dual Algorithms for Connected Facility Location Problems

Methods of Network Resource Provisioning for the Future Internet IIP Initiative

Contact Info

Product

Resources

About