Comparative Analysis of Approximation Algorithms for Queueing Networks
Author:
Vikas Shinde*, Mukta Kalra** and Kamal Wadhwa
Affiliation:
*Department of Applied Mathematics, Madhav Institute of Technology & Science, Gwalior MP India
**Department of Mathematics, Govt Narmada P.G. College Hoshangabad Mp India
Keyword:
queueing networks
Issue Date:
December 2011
Abstract:
In present paper, we analyze four approximation algorithms for prooducts from queueing networks i.e Self Correcting Approximation Technique (SCAT), Summation method (SUM) and BOTTAPPROX. We have carried out various performance indices viz. response time,throughput, utilization and mean number of jobs for single server nodes, and also compare these results with Exact Mean Value Analysis technique. For illustration purpose, tables and graphs are also provided.
Pages:
159-166
ISSN:
2455-9997 (Online) - 2229-3531 (Print)
Source:
DOI:
jucit
Copy the following to cite this article:
Copy the following to cite this URL:
Available from: http://www.compitjournal.org/paper/330/
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License
