Back to Search
Start Over
Approximate Performance and Sensitivity Analysis of Closed Queueing Networks
- Source :
- Advances in Simulation ISBN: 9780387970912
- Publication Year :
- 1988
- Publisher :
- Springer US, 1988.
-
Abstract
- A new heuristic algorithm called QNA (Queueing Network Analyzer), has been proposed by the authors for the evaluation of the average performance measures in a queueing network, This algorithm iteratively computes mean queue lengths, throughputs and machine utilizations by means of heuristically derived formulas. The same approach is extended to the computation of the partial derivatives of the same quantities with respect to the parameters of the routing policies. This can be accomplished by considering aside to the basic algorithm an additional set of equations which give, at convergence, the desired sensitivity coefficients.
- Subjects :
- Computer Science::Performance
Queueing theory
Computer science
Mean value analysis
Convergence (routing)
Real-time computing
Computer Science::Networking and Internet Architecture
Layered queueing network
Gordon–Newell theorem
Sensitivity (control systems)
Routing (electronic design automation)
Algorithm
Queue
Subjects
Details
- ISBN :
- 978-0-387-97091-2
- ISBNs :
- 9780387970912
- Database :
- OpenAIRE
- Journal :
- Advances in Simulation ISBN: 9780387970912
- Accession number :
- edsair.doi.dedup.....c28ba4d3fd2d692d68e417c96d54569c
- Full Text :
- https://doi.org/10.1007/978-1-4684-6389-7_62