Transient Analysis of a Finite-Source Computer Queueing Network: An Analytical Approach
摘要
This article investigates the transient probabilities associated with the number of users’ requests in a service facility for a finite-source computer queueing network, employing a novel analytic approach. Key real-time performance metrics such as the mean and variance pertaining to the number of requests in the service facility are obtained, along with average measures for virtual waiting time and system throughput. Further, the stationary probability distribution for the proposed queueing system has been deduced and verified with the existing result. Finally, numerical examples have been provided to demonstrate how system parameters affect the performance characteristics.