research-article

An Approximate Analytical Method for General Queueing Networks

Author:

R. A. MarieAuthors Info & Claims

IEEE Transactions on Software Engineering, Volume 5, Issue 5

Pages 530 - 538

https://doi.org/10.1109/TSE.1979.234214

Published: 01 September 1979 Publication History

Publisher Site

Abstract

In this paper, we present an approximate solution for the asymptotic behavior of relatively general queueing networks. In the particular case of networks with general service time distributions (i.e., fixed routing matrix, one or many servers per station, FIFO discipline), the application of the method gives relatively accurate results in a very short time. The approximate stationary state probabilities are identified with the solution of a nonlinear system. The proposed method is applicable to a larger class of queueing networks (dependent routing matrix, stations with fimite capacity, etc.). In this case, the structure of the network studied must satisfy certain decomposability conditions.

Cited By

View all

Gorbunova AVishnevsky V(2021)Evaluation of the Performance Parameters of a Closed Queuing Network Using Artificial Neural NetworksDistributed Computer and Communication Networks: Control, Computation, Communications10.1007/978-3-030-92507-9_22(265-278)Online publication date: 20-Sep-2021
https://dl.acm.org/doi/10.1007/978-3-030-92507-9_22
van der Gaast Jde Koster MAdan I(2018)Conveyor Merges in Zone Picking SystemsTransportation Science10.1287/trsc.2017.078252:6(1428-1443)Online publication date: 1-Dec-2018
https://dl.acm.org/doi/10.1287/trsc.2017.0782
Sönmez EScheller-Wolf ASecomandi N(2017)An Analytical Throughput Approximation for Closed Fork/Join NetworksINFORMS Journal on Computing10.5555/3215299.321530029:2(251-267)Online publication date: 1-May-2017
https://dl.acm.org/doi/10.5555/3215299.3215300
Show More Cited By

An Approximate Analytical Method for General Queueing Networks
1. General and reference
  1. Cross-computing tools and techniques

Recommendations

Approximate Analysis of Load Dependent General Queueing Networks

A method for obtaining approximate solutions to load-dependent closed queueing networks containing general service-time distributions and first-come-first-served scheduling disciplines is presented. The technique demonstrated is an extension of the well-...
Some Equivalence Results for Load-Independent Exponential Queueing Networks

In this paper we derive a number of results concerning the behavior of closed load-independent exponential queueing networks. It is shown that if the service rate of any station is increased (decreased), then the throughput of the network itself also ...
Multiserver Queueing Models of Multiprocessing Systems

Conventional time sharing and multiprogramming systems have been extensively modeled as single-server queues. In contrast, multiprocessing systems must be modeled as multiserver queueing systems. This paper investigates the effect of the scheduling ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image IEEE Transactions on Software Engineering

IEEE Transactions on Software Engineering Volume 5, Issue 5

September 1979

115 pages

ISSN:0098-5589

Issue’s Table of Contents

Publisher

IEEE Press

Publication History

Published: 01 September 1979

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

24
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 06 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Gorbunova AVishnevsky V(2021)Evaluation of the Performance Parameters of a Closed Queuing Network Using Artificial Neural NetworksDistributed Computer and Communication Networks: Control, Computation, Communications10.1007/978-3-030-92507-9_22(265-278)Online publication date: 20-Sep-2021
https://dl.acm.org/doi/10.1007/978-3-030-92507-9_22
van der Gaast Jde Koster MAdan I(2018)Conveyor Merges in Zone Picking SystemsTransportation Science10.1287/trsc.2017.078252:6(1428-1443)Online publication date: 1-Dec-2018
https://dl.acm.org/doi/10.1287/trsc.2017.0782
Sönmez EScheller-Wolf ASecomandi N(2017)An Analytical Throughput Approximation for Closed Fork/Join NetworksINFORMS Journal on Computing10.5555/3215299.321530029:2(251-267)Online publication date: 1-May-2017
https://dl.acm.org/doi/10.5555/3215299.3215300
Begin TBrandwajn AAvritzer AIosup AZhu XBecker S(2016)Predicting the System Performance by Combining Calibrated Performance Models of its ComponentsProceedings of the 7th ACM/SPEC on International Conference on Performance Engineering10.1145/2851553.2858658(95-100)Online publication date: 12-Mar-2016
https://dl.acm.org/doi/10.1145/2851553.2858658
Bouillard ABušić ARovetta C(2015)Perfect Sampling for Multiclass Closed Queueing NetworksProceedings of the 12th International Conference on Quantitative Evaluation of Systems - Volume 925910.1007/978-3-319-22264-6_17(263-278)Online publication date: 1-Sep-2015
https://dl.acm.org/doi/10.1007/978-3-319-22264-6_17
Satyam KKrishnamurthy AKamath M(2013)Solving general multi-class closed queuing networks using parametric decompositionComputers and Operations Research10.1016/j.cor.2013.01.01440:7(1777-1789)Online publication date: 1-Jul-2013
https://dl.acm.org/doi/10.1016/j.cor.2013.01.014
Park CLee H(2011)A multi-class closed queueing maintenance network model with a parts inventory systemComputers and Operations Research10.1016/j.cor.2011.01.02038:11(1584-1595)Online publication date: 1-Nov-2011
https://dl.acm.org/doi/10.1016/j.cor.2011.01.020
Jia JHeragu S(2009)Solving Semi-Open Queuing NetworksOperations Research10.1287/opre.1080.062757:2(391-401)Online publication date: 1-Mar-2009
https://dl.acm.org/doi/10.1287/opre.1080.0627
Sadre RHaverkort BReinelt P(2007)A fixed-point algorithm for closed queueing networksProceedings of the 4th European performance engineering conference on Formal methods and stochastic models for performance evaluation10.5555/1779905.1779922(154-170)Online publication date: 27-Sep-2007
https://dl.acm.org/doi/10.5555/1779905.1779922
Balsamo SMarin A(2007)Queueing networksProceedings of the 7th international conference on Formal methods for performance evaluation10.5555/1768017.1768019(34-82)Online publication date: 28-May-2007
https://dl.acm.org/doi/10.5555/1768017.1768019
Show More Cited By

Abstract

Cited By

Recommendations

Approximate Analysis of Load Dependent General Queueing Networks

Some Equivalence Results for Load-Independent Exponential Queueing Networks

Multiserver Queueing Models of Multiprocessing Systems

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations