Queue Length Generating Functions
Queue Length Generating Functions is a mathematical formalism in queueing theory that belongs to the class of generating functions and is specifically characterized by its ability to encode the probability distribution of the number of customers in a queue as a power series, thereby enabling the derivation of key performance metrics through analytic methods.
56
Publications
2K
Citations
91
Authors
59
Institutions
Publications per year
2017–2026
1
Parents
56
1–5 of 56
91
5
h-index
3
h-index
3
h-index
3
h-index
2
h-index
1–5 of 91
59
Indian Institute of Technology Kharagpur
Kharagpur, India
5 h-index
9 publications
172 citations
Sungkyunkwan University
Seoul, South Korea
3 h-index
5 publications
120 citations

Royal Military College of Canada
Kingston, Canada
3 h-index
3 publications
57 citations
Korea Advanced Institute of Science and Technology
Daejeon, South Korea
2 h-index
4 publications
102 citations

Keele University
Newcastle-under-Lyme, United Kingdom
2 h-index
2 publications
21 citations
Virginia Tech
Blacksburg, United States
2 h-index
4 publications
137 citations
Electronics and Telecommunications Research Institute
Daejeon, South Korea
2 h-index
2 publications
77 citations
AT&T (United States)
Bedminster, United States
2 h-index
3 publications
222 citations
1–8 of 59
JAP · 6 publications · 174 citations
6
h-index
4 publications · 86 citations
4
h-index
4 publications · 114 citations
4
h-index
3 publications · 111 citations
3
h-index
3 publications · 227 citations
3
h-index
1–5