92 research outputs found
Online Admission Control and Embedding of Service Chains
The virtualization and softwarization of modern computer networks enables the
definition and fast deployment of novel network services called service chains:
sequences of virtualized network functions (e.g., firewalls, caches, traffic
optimizers) through which traffic is routed between source and destination.
This paper attends to the problem of admitting and embedding a maximum number
of service chains, i.e., a maximum number of source-destination pairs which are
routed via a sequence of to-be-allocated, capacitated network functions. We
consider an Online variant of this maximum Service Chain Embedding Problem,
short OSCEP, where requests arrive over time, in a worst-case manner. Our main
contribution is a deterministic O(log L)-competitive online algorithm, under
the assumption that capacities are at least logarithmic in L. We show that this
is asymptotically optimal within the class of deterministic and randomized
online algorithms. We also explore lower bounds for offline approximation
algorithms, and prove that the offline problem is APX-hard for unit capacities
and small L > 2, and even Poly-APX-hard in general, when there is no bound on
L. These approximation lower bounds may be of independent interest, as they
also extend to other problems such as Virtual Circuit Routing. Finally, we
present an exact algorithm based on 0-1 programming, implying that the general
offline SCEP is in NP and by the above hardness results it is NP-complete for
constant L.Comment: early version of SIROCCO 2015 pape
Vector Bin Packing with Multiple-Choice
We consider a variant of bin packing called multiple-choice vector bin
packing. In this problem we are given a set of items, where each item can be
selected in one of several -dimensional incarnations. We are also given
bin types, each with its own cost and -dimensional size. Our goal is to pack
the items in a set of bins of minimum overall cost. The problem is motivated by
scheduling in networks with guaranteed quality of service (QoS), but due to its
general formulation it has many other applications as well. We present an
approximation algorithm that is guaranteed to produce a solution whose cost is
about times the optimum. For the running time to be polynomial we
require and . This extends previous results for vector
bin packing, in which each item has a single incarnation and there is only one
bin type. To obtain our result we also present a PTAS for the multiple-choice
version of multidimensional knapsack, where we are given only one bin and the
goal is to pack a maximum weight set of (incarnations of) items in that bin
An EPTAS for scheduling jobs on uniform processors using an MILP relaxation with a constant number of integral variables
We present an efficient polynomial time approximation scheme (EPTAS) for scheduling on uniform processors, i.e. finding a minimum length schedule for a set of n independent jobs on m processors with different speeds (a fundamental NP-hard scheduling problem). The previous best polynomial time approximation scheme (PTAS) by Hochbaum and Shmoys has a running time of (n/\epsilon)^{O(1/\epsilon^2)}. Our algorithm, based on a new mixed integer linear programming (MILP) formulation with a constant number of integral variables and an interesting rounding method, finds a schedule whose length is within a relative error of the optimum, and has running time 2^{O(1/\epsilon^2 \log(1/\epsilon)^3)} + poly(n)
The balance of power: accretion and feedback in stellar mass black holes
In this review we discuss the population of stellar-mass black holes in our
galaxy and beyond, which are the extreme endpoints of massive star evolution.
In particular we focus on how we can attempt to balance the available accretion
energy with feedback to the environment via radiation, jets and winds,
considering also possible contributions to the energy balance from black hole
spin and advection. We review quantitatively the methods which are used to
estimate these quantities, regardless of the details of the astrophysics close
to the black hole. Once these methods have been outlined, we work through an
outburst of a black hole X-ray binary system, estimating the flow of mass and
energy through the different accretion rates and states. While we focus on
feedback from stellar mass black holes in X-ray binary systems, we also
consider the applicability of what we have learned to supermassive black holes
in active galactic nuclei. As an important control sample we also review the
coupling between accretion and feedback in neutron stars, and show that it is
very similar to that observed in black holes, which strongly constrains how
much of the astrophysics of feedback can be unique to black holes.Comment: To be published in Haardt et al. Astrophysical Black Holes. Lecture
Notes in Physics. Springer 201
- âŠ