Bounded Delay Packet Scheduling in a Bounded Buffer

Details Bounded Delay Packet Scheduling in a Bounded Buffer Bounded Delay Packet Scheduling in a Bounded Buffer

2009-07-16

arxiv.org/abs/0907.2741v1

Computer Science

Data Structures and Algorithms

5 pages, 0 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Bounded Delay Packet Scheduling in a Bounded Buffer does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bounded Delay Packet Scheduling in a Bounded Buffer, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bounded Delay Packet Scheduling in a Bounded Buffer will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-621012