Competitive Buffer Management with Stochastic Packet Arrivals (original) (raw)

paper cover icon

Competitive Buffer Management with Stochastic Packet Arrivals

2009

Abstract

We study a variant of Naor’s [23] online packet buffering model: We are given a (non-preemptive) fifo buffer (e.g., in a network switch or a router) and packets that request transmission arrive over time. Any packet has an intrinsic value R and we have to decide whether to accept or reject it. In each time-step, the first packet in the buffer

alexander souza hasn't uploaded this paper.

Let alexander know you want this paper to be uploaded.

Ask for this paper to be uploaded.