An optimal buffer management policy for high-performance packet switching

Abstract

An imbalanced traffic model is presented, and the performance of completely shared buffering and output queuing under imbalanced traffic is studied. It is found that shared buffering does not perform as well as than output queuing under this traffic condition. A buffer management policy, called drop on demand, is proposed which yields a greater switch throughput and lower packet loss probability than previously proposed policies for all input traffic rates. The optimal buffer management policy is studied for a class of dynamic allocation schemes with packet purging action. It is found that there exists an optimal stationary policy which can be obtained by solving a linear programming problem.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>