Article ID: | iaor20021510 |
Country: | United States |
Volume: | 49 |
Issue: | 1 |
Start Page Number: | 66 |
End Page Number: | 78 |
Publication Date: | Jan 2001 |
Journal: | Operations Research |
Authors: | Righter Rhonda, Liu Zhen |
Keywords: | queues: applications |
We consider policies for deciding which cells will be lost or dropped when losses occur at a finite buffer asynchronous transfer mode node. The performance criteria of interest are the delay of transmitted (nonlost) cells, the jitter (or variability in the delay of transmitted cells), and the burstiness of lost cells. We analyze the performance trade-offs for various cell dropping policies. We show that ‘rear dropping’, in which cells that arrive to a full buffer are lost, stochastically maximizes delay, whereas ‘front dropping’, in which cells at the front of the buffer are lost, stochastically minimizes delay. On the other hand, rear dropping stochastically minimizes the jitter. We also propose policies that have both stochastically smaller delay and less lost cell burstiness in a stochastic majorization sense than the rear dropping policy.