The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Approximate Analysis of General Queuing Networks by Decomposition
Abstract
In this paper an approximate method for the analysis of general queuing networks is proposed. The queuing network is of the open network type, havingNsingle server queuing stations with arbitrary interconnections. Customers may enter the network at any queuing station. The interarrival times of the exogenous arrival processes and the service times at the queuing stations are generally distributed. The analysis is based on the method of decomposition where the total network is broken up into subsystems; e.g., queuing stations of the typeGI/G/1or subnets. The subsystems are analyzed individually by assuming renewal arrival and departure processes. All related processes are considered with respect to their first two moments only. An analysis procedure is reported which reduces the total problem to a number of elementary operations which can be performed efficiently with the aid of a computer. Numerical results are reported together with simulation results to demonstrate the accuracy of the new method. The paper concludes with a short discussion of possible extensions of the method.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Theory of Stochastic Processes
Cox, D. R., Miller, H. D., Weiss, G., & Shuler, K. (1966) · Physics Today · doi:10.1063/1.3047872 · Cited by 3,324
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Baskett, F., Chandy, K. M., Muntz, R. R., & Palacios, F. G. (1975) · Journal of the ACM · doi:10.1145/321879.321887 · Cited by 2,409
Jackson, J. R. (1957) · Operations Research · doi:10.1287/opre.5.4.518 · Cited by 1,213
The Theory of Stochastic Processes.
Bartholomew, D. J., Cox, D. R., & Miller, H. D. (1966) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2343509 · Cited by 1,193
The Output of a Queuing System
Burke, P. J. (1956) · Operations Research · doi:10.1287/opre.4.6.699 · Cited by 689
Communication Nets: Stochastic Message Flow and Delay
Mullin, A. A., & Kleinrock, L. (1966) · Mathematics of Computation · doi:10.2307/2004303 · Cited by 616
Application of the Diffusion Approximation to Queueing Networks I: Equilibrium Queue Distributions
Kobayashi, H. (1974) · Journal of the ACM · doi:10.1145/321812.321827 · Cited by 258
Accuracy of the Diffusion Approximation for Some Queuing Systems
Reiser, M. P., & Kobayashi, H. (1974) · IBM Journal of Research and Development · doi:10.1147/rd.182.0110 · Cited by 135
A diffusion approximate solution to the g/g/k queueing system
Halachimi, B., & Franta, W. R. (1977) · Computers & Operations Research · doi:10.1016/0305-0548(77)90006-5 · Cited by 11
Cited by
Whitt, W. (1983) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1983.tb03204.x · Cited by 1,029
Strategic Analysis of Integrated Production-Distribution Systems: Models and Methods
Cohen, M. A., & Lee, H. L. (1988) · Operations Research · doi:10.1287/opre.36.2.216 · Cited by 619
Metadata
- Authors
- Kuehn, P.
- Venue
- IEEE Transactions on Communications
- Published
- 1979-01
- Volume
- 27
- Issue
- 1
- Pages
- 113-126
- ISSN
- 0096-2244 (ISSN-L)
- OpenAlex
- W2117369804
- Cited by
- 412
- References
- 9
- FWCI
- 19.03
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Approximate Analysis of General Queuing Networks by Decomposition. https://app.cochat.ai/papers/10.1109/tcom.1979.1094270
- The paper
- Kuehn, P. (1979). Approximate Analysis of General Queuing Networks by Decomposition. IEEE Transactions on Communications. https://doi.org/10.1109/tcom.1979.1094270
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.