Sensitivity analysis of Markov chains for M/G/1queueing systems

In this paper, we consider the problems of sensitivity analysis and estimates of the steady-state performance for an M/G/1 queueing system. By studying its embedded Markov chain, we give the sensitivity formulas expressed by the potentials of the embedded Markov chain. note that Non-Markov-type queueing systems are often used as mathematical models in studying some practical engineering problems, such as communication networks. we study an M/G/1 queue with equal classes of customers, the server selects a customer to serve from among all customers waiting in the system with equal probability, Specifically, if there are n customers waiting in the system when the server selects a customer to serve, each customer is selected with probability 1/n. we give the sensitivity formulas expressed by the potentials of the embedded Markov chain. Based on the performance potential theory and these formulas, we propose an algorithm to compute system potentials and performance derivatives for M/G/1 queueing systems. [Esfandyar Ataei and Alireza Ataei. Sensitivity analysis of Markov chains for M/G/1queueing systems. Life Sci J 2012; 9(4): 2041-2045] (ISSN: 1097-8135). http://www.lifesciencesite.com. 305