|
Showing 1 - 1 of
1 matches in All Departments
This book deals with the performance analysis of closed queueing
networks with general processing times and finite buffer spaces. It
offers a detailed introduction to the problem and a comprehensive
literature review. Two approaches to the performance of closed
queueing networks are presented. One is an approximate
decomposition approach, while the second is the first exact
approach for finite-capacity networks with general processing
times. In this Markov chain approach, queueing networks are
analyzed by modeling the entire system as one Markov chain. As this
approach is exact, it is well-suited both as a reference quantity
for approximate procedures and as extension to other queueing
networks. Moreover, for the first time, the exact distribution of
the time between processing starts is provided.
|
|
Email address subscribed successfully.
A activation email has been sent to you.
Please click the link in that email to activate your subscription.