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

Authors

91

  1. UG
    Umesh Gupta

    Indian Institute of Technology Kharagpur, India

    5 publications · 95 citations

    5

    h-index

  2. JN
    John N. Daigle

    University of Mississippi, United States

    3 publications · 95 citations

    3

    h-index

  3. HW
    Ho Woo Lee

    Sungkyunkwan University, South Korea

    3 publications · 83 citations

    3

    h-index

  4. ML
    M. L. Chaudhry

    Royal Military College of Canada, Canada

    3 publications · 57 citations

    3

    h-index

  5. YL
    Y. Lee

    Mitre (United States), United States

    2 publications · 66 citations

    2

    h-index

1–5 of 91

Venues

  1. Journal of Applied Probability

    JAP · 6 publications · 174 citations

    6

    h-index

  2. Queueing Systems

    4 publications · 86 citations

    4

    h-index

  3. Stochastic Models

    4 publications · 114 citations

    4

    h-index

  4. Operations Research

    3 publications · 111 citations

    3

    h-index

  5. European Journal of Operational Research

    3 publications · 227 citations

    3

    h-index

1–5