3 research outputs found
Bounded Delay Packet Scheduling in a Bounded Buffer
We study the problem of buffer management in QoS-enabled network switches in
the bounded delay model where each packet is associated with a weight and a
deadline. We consider the more realistic situation where the network switch has
a finite buffer size. A 9.82-competitive algorithm is known for the case of
multiple buffers (Azar and Levy, SWAT'06). Recently, for the case of a single
buffer, a 3-competitive deterministic algorithm and a 2.618-competitive
randomized algorithm was known (Li, INFOCOM'09). In this paper we give a simple
deterministic 2-competitive algorithm for the case of a single buffer.Comment: 5 pages, 0 figure
Packet Scheduling in a Size-Bounded Buffer
We consider algorithms to schedule packets with values and deadlines in a
size-bounded buffer. At any time, the buffer can store at most B packets.
Packets arrive over time. Each packet has a non-negative value and an integer
deadline. In each time step, at most one packet can be sent. Packets can be
dropped at any time before they are sent. The objective is to maximize the
total value gained by delivering packets no later than their respective
deadlines. This model generalizes the well-studied bounded-delay model (Hajek.
CISS 2001. Kesselman et al. STOC 2001). We first provide an optimal offline
algorithm for this model. Then we present an alternative proof of the
2-competitive deterministic online algorithm (Fung. arXiv July 2009). We also
prove that the lower bound of competitive ratio of a family of (deterministic
and randomized) algorithms is 2 - 1 / B.Comment: 6 page
Bounded delay packet scheduling in a bounded buffer. arXiv:0907.2741v1[cs.DS
We study the problem of buffer management in QoS-enabled network switches in the bounded delay model where each packet is associated with a weight and a deadline. We consider the more realistic situation where the network switch has a finite buffer size. A 9.82-competitive algorithm is known for the case of multiple buffers (Azar and Levy, SWAT’06). Recently, for the case of a single buffer, a 3-competitive deterministic algorithm and a 2.618-competitive randomized algorithm was known (Li, INFOCOM’09). In this paper we give a simple deterministic 2-competitive algorithm for the case of a single buffer.