A note on hierarchical hubbing for a generalization of the VPN problem

  title={A note on hierarchical hubbing for a generalization of the VPN problem},
  author={Neil Olver},
  journal={Oper. Res. Lett.},
  • Neil Olver
  • Published 2016
  • Computer Science, Mathematics
  • Oper. Res. Lett.
Robust network design refers to a class of optimization problems that occur when designing networks to efficiently handle variable demands. In this context, Frechette et?al. (2013) recently explored hierarchical hubbing: a routing strategy involving a multiplicity of "hubs" connected to terminals and each other in a treelike fashion. For a natural generalization of the VPN problem, we prove a structural characterization implying that the optimal hierarchical hubbing solution can be found… Expand
Shortest Path Versus Multihub Routing in Networks With Uncertain Demand
Designs based on multihub routing are often preferable to both hub and shortest path; it may be possible for a carrier to sample their traffic in order to determine which type of routing is most cost-effective for their network. Expand
Exploring the Tractability of the Capped Hose Model
This work uncovers further tractable cases of the capped hose model, and involves optimally embedding a certain auxiliary graph into the network, and has a connection to a heuristic suggested by Frechette et al. Expand


Hub routing for the robust network design problem
Conditions under which multi-hub routings, that is HH, gives improvements over single-hub and shortest path routings are revealed, and a heuristic algorithm for RNDHH is developed and provided. Expand
Shortest path versus multi-hub routing in networks with uncertain demand
By adding peak capacities into the hose model, the single-hub tree-routing template is no longer cost-effective and this initiates the study of a class of robust network design (RND) problems restricted to these templates. Expand
Provisioning a virtual private network: a network design problem for multicommodity flow
This work establishes a relation between this collection of network design problems and a variant of the facility location problem introduced by Karger and Minkoff, and provides optimal and approximate algorithms for several variants of this problem, depending on whether the traffic matrix is required to be symmetric. Expand
Approximability of robust network design
This paper establishes that the general robust design is hard to approximate to within polylogarithmic factors, and gives a constant factor approximation algorithm for this problem that achieves factor 8 in general, and 2 for the case where the tree has unit capacities. Expand
Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups
A variant of the virtual private network design problem which generalizes the previously studied symmetric and asymmetric case, where the terminal set is partitioned into a number of groups, where terminals of each group do not communicate with each other. Expand
Robust network design
Robust network design takes the very successful framework of robust optimization and applies it to the area of network design, motivated by applications in communication networks. The main premise isExpand
Designing Least-Cost Nonblocking Broadband Networks
This paper proposes a new model for broadband networks and investigates the question of their optimal topology from a worst-case performance point of view, and shows that a minimum-cost nonblockingstarnetwork achieves near-optimal cost. Expand
Selective randomized load balancing and mesh networks with changing demands
Of these three networks, SRLB maintains the resilience properties of RLB while achieving a significant cost reduction over all other architectures, including RLB and multihop Internet protocol/multiprotocol label switching (IP/MPLS) networks using VPN-tree routing. Expand
A flexible model for resource management in virtual private networks
A new service interface is proposed, termed a hose, to provide the appropriate performance abstraction to manage network resources in the face of increased uncertainty, and the statistical multiplexing and resizing techniques deal effectively with uncertainties about the traffic. Expand
Approximation algorithms for the 0-extension problem
It is proved that the integrality ratio of the metric relaxation is at least c√lgk for a positive c for infinitely many k and the results improve some of the results of Kleinberg and Tardos and they further the understanding on how to use metric relaxations. Expand