Processor-Shared Buffers with Reneging

Motivated by buffer design questions in data networks, we consider a processor shared queue with finite buffer capacity and reneging. Reneging models events such as the timing-out of a communication path due to excessive delays, or decisions to preempt a path in order to re-route it according to some congestion control mechanism. The focus of the paper is on the asymptotic behavior of this system in a variety of regimes that correspond to large service rates (bandwidths).