Steady-state Queueing Analysis

Steady-State Queueing Analysis is a mathematical framework within queueing theory that characterizes the long-term probabilistic behavior of queueing systems under equilibrium conditions, distinguishing itself by focusing on performance metrics such as average waiting time, queue length, and server utilization as time approaches infinity.

1.1K

Publications

53.2K

Citations

1.4K

Authors

596

Institutions

Publications per year

2017–2026

106

Authors

1.4K

  1. JA
    J.R. Artalejo

    Universidad Complutense de Madrid, Spain

    14 publications · 627 citations

    14

    h-index

  2. JW
    Jinting Wang

    Beijing Jiaotong University, China

    17 publications · 606 citations

    14

    h-index

  3. WW
    Ward Whitt

    AT&T (United States), United States

    14 publications · 1.2K citations

    14

    h-index

  4. HB
    Herwig Bruneel

    Ghent University, Belgium

    21 publications · 679 citations

    13

    h-index

  5. OB
    Onno Boxma

    Eindhoven University of Technology, Netherlands

    18 publications · 469 citations

    12

    h-index

1–5 of 1.4K

Venues

  1. Operations Research

    71 publications · 6.5K citations

    37

    h-index

  2. Queueing Systems

    86 publications · 3.5K citations

    32

    h-index

  3. Journal of Applied Probability

    JAP · 78 publications · 2.8K citations

    30

    h-index

  4. European Journal of Operational Research

    50 publications · 1.9K citations

    27

    h-index

  5. Performance Evaluation

    45 publications · 2.5K citations

    26

    h-index

1–5