Competitive Management of Non-preemptive Queues with Multiple Values

@inproceedings{Andelman2003CompetitiveMO,
  title={Competitive Management of Non-preemptive Queues with Multiple Values},
  author={Nir Andelman and Yishay Mansour},
  booktitle={DISC},
  year={2003}
}
We consider the online problem of active queue management. In our model, the input is a sequence of packets with values v ∈ [1, α] that arrive to a queue that can hold up to B packets. Specifically, we consider a FIFO non-preemptive queue, where any packet that is accepted into the queue must be sent, and packets are sent by the order of arrival. The benefit of a scheduling policy, on a given input, is the sum of values of the scheduled packets. Our aim is to find an online policy that… CONTINUE READING
Highly Cited
This paper has 35 citations. REVIEW CITATIONS