Convergence of a dynamic policy for buffer management in shared buffer ATM switches

Lack of effective buffer management can lead to severe cell loss in shared buffer ATM switches. With the aim of reducing cell loss, we study a class of non-anticipative buffer management policies that always admit cells to the buffer while there is space in it and may pushout a cell when the buffer becomes full. We propose a dynamic algorithm that operates without any knowledge of the arrival process; we consider a two-class system and show that the algorithm is optimal when the arrivals to each class are a superposition of identically distributed and independent Bernoulli processes. (C) 1999 Published by Elsevier Science B.V. All rights reserved.