Sciweavers

Share
SODA
2008
ACM

Competitive queue management for latency sensitive packets

8 years 3 months ago
Competitive queue management for latency sensitive packets
We consider the online problem of non-preemptive queue management. An online sequence of packets arrive, each of which has an associated intrinsic value. Packets can be accepted to a FIFO queue, or discarded. The profit gained by transmitting a packet diminishes over time and is equal to its value minus the delay. This corresponds to the well known and strongly motivated Naor's model in operations research. We give a queue management algorithm with a
Amos Fiat, Yishay Mansour, Uri Nadav
Added 30 Oct 2010
Updated 30 Oct 2010
Type Conference
Year 2008
Where SODA
Authors Amos Fiat, Yishay Mansour, Uri Nadav
Comments (0)
books