Queueing Network Approximation
Queueing Network Approximation is a mathematical modeling technique that distinguishes itself by simplifying complex queueing network systems through analytical or computational methods to estimate performance metrics such as throughput, latency, and congestion, while preserving essential structural and stochastic characteristics of the original system.
437
Publications
19.9K
Citations
640
Authors
289
Institutions
Publications per year
2017–2026
28
Variants
Queuing Network Approximation
Parents
437
Mean-Value Analysis of Closed Multichain Queuing Networks
M. Reiser, S. S. Lavenberg · Journal of the ACM · 1980 · 1.2K citations · Full text
Queueing networks with blocking
Harry G. Perros · ACM SIGMETRICS Performance Evaluation Review · 1984 · 308 citations · Full text
1–5 of 437
640
15
h-index
11
h-index
10
h-index
9
h-index
9
h-index
1–5 of 640
289
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
16 h-index
22 publications
2.5K citations
AT&T (United States)
Bedminster, United States
15 h-index
18 publications
936 citations
North Carolina State University
Raleigh, United States
14 h-index
34 publications
1.4K citations
The University of Texas at Austin
Austin, United States
13 h-index
24 publications
1.2K citations
Massachusetts Institute of Technology
Cambridge, United States
11 h-index
15 publications
1.6K citations

Sorbonne Université
Paris, France
10 h-index
17 publications
611 citations

Imperial College London
London, United Kingdom
10 h-index
20 publications
397 citations
University of Maryland, College Park
College Park, United States
10 h-index
16 publications
687 citations
1–8 of 289
22 publications · 2K citations
18
h-index
27 publications · 860 citations
17
h-index
PER · 22 publications · 674 citations
14
h-index
12 publications · 504 citations
14
h-index
15 publications · 846 citations
14
h-index
1–5