Abstract
Many practical queuing situations with congestion control mechanism due to high throughput demands in telecommunication systems, computer network and production systems can be formulated as finite queues with setup time and state dependent arrivals. This chapter deals with computational scheme to compute the exact stationary queue length distribution. In this chapter an efficient iterative algorithm is developed for computing the stationary queue length distribution in M/G/K/N queues with setup time and arbitrary state dependent arrival rates. The overall computation of the algorithm is O(N2) is complexicity. It can be of great use in application since it is easy to implement fast and quite accurate.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
