3,212 research outputs found
The Minimum Backlog Problem
We study the minimum backlog problem (MBP). This online problem arises, e.g.,
in the context of sensor networks. We focus on two main variants of MBP.
The discrete MBP is a 2-person game played on a graph . The player
is initially located at a vertex of the graph. In each time step, the adversary
pours a total of one unit of water into cups that are located on the vertices
of the graph, arbitrarily distributing the water among the cups. The player
then moves from her current vertex to an adjacent vertex and empties the cup at
that vertex. The player's objective is to minimize the backlog, i.e., the
maximum amount of water in any cup at any time.
The geometric MBP is a continuous-time version of the MBP: the cups are
points in the two-dimensional plane, the adversary pours water continuously at
a constant rate, and the player moves in the plane with unit speed. Again, the
player's objective is to minimize the backlog.
We show that the competitive ratio of any algorithm for the MBP has a lower
bound of , where is the diameter of the graph (for the discrete
MBP) or the diameter of the point set (for the geometric MBP). Therefore we
focus on determining a strategy for the player that guarantees a uniform upper
bound on the absolute value of the backlog.
For the absolute value of the backlog there is a trivial lower bound of
, and the deamortization analysis of Dietz and Sleator gives an
upper bound of for cups. Our main result is a tight upper
bound for the geometric MBP: we show that there is a strategy for the player
that guarantees a backlog of , independently of the number of cups.Comment: 1+16 pages, 3 figure
Content Based Traffic Engineering in Software Defined Information Centric Networks
This paper describes a content centric network architecture which uses
software defined networking principles to implement efficient metadata driven
services by extracting content metadata at the network layer. The ability to
access content metadata transparently enables a number of new services in the
network. Specific examples discussed here include: a metadata driven traffic
engineering scheme which uses prior knowledge of content length to optimize
content delivery, a metadata driven content firewall which is more resilient
than traditional firewalls and differentiated treatment of content based on the
type of content being accessed. A detailed outline of an implementation of the
proposed architecture is presented along with some basic evaluation
The BAT-Swift Science Software
The BAT instrument tells the Swift satellite where to point to make immediate
follow-up observations of GRBs. The science software on board must efficiently
process gamma-ray events coming in at up to 34 kHz, identify rate increases
that could be due to GRBs while disregarding those from known sources, and
produce images to accurately and rapidly locate new Gamma-ray sources.Comment: 4 pages, no figures, to appear in Santa Fe proceedings "Gamma-Ray
Bursts: 30 Years of Discovery", Fenimore and Galassi (eds), AIP, 200
- …