Optimal Space Priority Policies for Shared Memory ATM Systems
Rajarshi Roy, Shivendra S. Panwar · 1997
In this paper we study the problem of the optimal design of buffer management policies for a shared memory ATM switchordemultiplexer. A system with cells of two different space priorities is considered. Our objective is to determine the optimal policy that minimizes the total weighted cell loss. The problem of finding the optimal policy within the class of pushout and expelling policies is considered. Using sample path techniques the search space for the optimal policy is reduced to a subset of the entire policy set for each policy class. A numerical study based on value iteration technique is used to investigate the structure of the optimal policy. This technique is also used to calculate the loss probabilities for different classes of cells for a system with small buffer size. Keywords: Markov Decision Theory, Sample path techniques, Shared Memory Switch, Buffer Management, ATM. 1