e-approximations with minimum packing constraint violation (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Approximation algorithms for geometric median problems
Information Processing Letters
A primal-dual approximation algorithm for generalized Steiner network problems
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Approximating the tree and tour covers of a graph
Information Processing Letters
On the design of approximation algorithms for a class of graph problems
On the design of approximation algorithms for a class of graph problems
Communications of the ACM
Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Virtual private networks
Buy-at-bulk network design: approximating the single-sink edge installation problem
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Improved approximation algorithms for network design problems
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A flexible model for resource management in virtual private networks
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A 3-approximation algorithm for the k-level uncapacitated facility location problem
Information Processing Letters
Improved Steiner tree approximation in graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
MPLS: technology and applications
MPLS: technology and applications
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
The Access Network Design Problem
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Improved Combinatorial Algorithms for the Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Building Steiner trees with incomplete global knowledge
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Hierarchical placement and network design problems
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
The general Steiner tree-star problem
Information Processing Letters
Building Edge-Failure Resilient Networks
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Primal-Dual Algorithms for Connected Facility Location Problems
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Simpler and better approximation algorithms for network design
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Meet and merge: approximation algorithms for confluent flows
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
(Almost) tight bounds and existence theorems for confluent flows
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
An improved approximation algorithm for virtual private network design
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Meet and merge: Approximation algorithms for confluent flows
Journal of Computer and System Sciences - Special issue on network algorithms 2005
Multi-path routing versus tree routing for VPN bandwidth provisioning in the hose model
Computer Networks: The International Journal of Computer and Telecommunications Networking
Approximation via cost sharing: Simpler and better approximation algorithms for network design
Journal of the ACM (JACM)
(Almost) Tight bounds and existence theorems for single-commodity confluent flows
Journal of the ACM (JACM)
Extensions to P2MP RSVP-TE for VPN-specific state provisioning with fair resource sharing
Computer Communications
Approximating connected facility location problems via random facility sampling and core detouring
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Rethinking virtual network embedding: substrate support for path splitting and migration
ACM SIGCOMM Computer Communication Review
Measurement-based characterization of IP VPNs
IEEE/ACM Transactions on Networking (TON)
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Latency equalization: a programmable routing service primitive
Proceedings of the ACM workshop on Programmable routers for extensible services of tomorrow
New architecture and algorithms for fast construction of hose-model VPNs
IEEE/ACM Transactions on Networking (TON)
Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Resource optimization algorithms for virtual private networks using the hose model
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the Complexity of the Asymmetric VPN Problem
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
A survey of network virtualization
Computer Networks: The International Journal of Computer and Telecommunications Networking
Valiant load balancing, capacity provisioning and resilient backbone design
CAAN'07 Proceedings of the 4th conference on Combinatorial and algorithmic aspects of networking
Pricing tree access networks with connected backbones
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Improved approximation algorithm for connected facility location problems
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
An improved LP-based approximation for steiner tree
Proceedings of the forty-second ACM symposium on Theory of computing
Approximability and inapproximability of the minimum certificate dispersal problem
Theoretical Computer Science
Market-based cooperative resource allocation for overlay networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Connected facility location via random facility sampling and core detouring
Journal of Computer and System Sciences
Approximability of robust network design
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Tree embeddings for two-edge-connected network design
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Dual-Based Local Search for the Connected Facility Location and Related Problems
INFORMS Journal on Computing
Network design via core detouring for problems without a core
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
INFORMS Journal on Computing
The VPN Problem with Concave Costs
SIAM Journal on Discrete Mathematics
Virtual network embedding through topology-aware node ranking
ACM SIGCOMM Computer Communication Review
Computers and Operations Research
From Uncertainty to Nonlinearity: Solving Virtual Private Network via Single-Sink Buy-at-Bulk
Mathematics of Operations Research
Approximation algorithms for single and multi-commodity connected facility location
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Branch-and-Cut-and-Price for Capacitated Connected Facility Location
Journal of Mathematical Modelling and Algorithms
An exact algorithm for robust network design
INOC'11 Proceedings of the 5th international conference on Network optimization
Introducing the virtual network mapping problem with delay, routing and location constraints
INOC'11 Proceedings of the 5th international conference on Network optimization
Traffic-oblivious routing in the hose model
IEEE/ACM Transactions on Networking (TON)
Black-box reductions for cost-sharing mechanism design
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
New approaches for virtual private network design
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Virtual private network design: a proof of the tree routing conjecture on ring networks
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Provisioning a virtual private network under the presence of non-communicating groups
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Topology-awareness and reoptimization mechanism for virtual network embedding
NETWORKING'10 Proceedings of the 9th IFIP TC 6 international conference on Networking
Virtual network embedding through topology awareness and optimization
Computer Networks: The International Journal of Computer and Telecommunications Networking
Improved approximation for single-sink buy-at-bulk
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Latency equalization as a new network service primitive
IEEE/ACM Transactions on Networking (TON)
ViNEYard: virtual network embedding algorithms with coordinated node and link mapping
IEEE/ACM Transactions on Networking (TON)
EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part I
A short proof of the VPN Tree Routing Conjecture on ring networks
Operations Research Letters
Design of trees in the hose model: The balanced case
Operations Research Letters
Static and dynamic routing under disjoint dominant extreme demands
Operations Research Letters
Surviving failures in bandwidth-constrained datacenters
Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
Surviving failures in bandwidth-constrained datacenters
ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12
Steiner Tree Approximation via Iterative Randomized Rounding
Journal of the ACM (JACM)
The robust network loading problem with dynamic routing
Computational Optimization and Applications
EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization
High-performance routing for hose-based VPNs in multi-domain backbone networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Journal of the ACM (JACM)
International Journal of Web and Grid Services
Topology-aware virtual network embedding based on closeness centrality
Frontiers of Computer Science: Selected Publications from Chinese Universities
Resource allocation with multi-factor node ranking in data center networks
Future Generation Computer Systems
A new approximation algorithm for the Selective Single-Sink Buy-at-Bulk problem in network design
Journal of Combinatorial Optimization
Hi-index | 0.00 |
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs) are services that support such a construct; rather than building a new physical network on the group of nodes that must be connected, bandwidth in the underlying network is reserved for communication within the group, forming a virtual “sub-network.”Provisioning a virtual private network over a set off terminals gives rise to the following general network design problem. We have bounds on the cumulative amount of traffic each terminal can send and receive; we must choose a path for each pair of terminals, and a bandwidth allocation for each edge of the network, so that any traffic matrix consistent with the given upper bounds can be feasibly routed. Thus, we are seeking to design a network that can support a continuum of possible traffic scenarios.We provide optimal and approximate algorithms for several variants of this problem, depending on whether the traffic matrix is required to be symmetric, and on whether the designed network is required to be a tree (a natural constraint in a number of basic applications). We also establish a relation between this collection of network design problems and a variant of the facility location problem introduced by Karger and Minkoff; we extend their results by providing a stronger approximation algorithm for this latter problem.