Approximate Method For Performance Analysis And Optimization Of Partial Buffer Sharing In Atm Switches

Performance evaluations of the buffer allocation strategies are computationally difficult problems due to the complexity of the large state space when the number of traffics and/or the buffer size is large. In this paper, we propose the approach based on the state space merging to avoid these difficulties for the systems supporting two types of services, namely, real-time and nonreal-time services in ATM networks when buffer size is large enough. For this type of systems, the efficiency in regard of low computational complexity approximate formulae to calculation of the system behavior for the Partial Buffer Sharing (PBS) strategy are obtained. The results of appropriate numerical experiments are carried out