Heavy-traffic Approximations

Heavy-Traffic Approximations is a mathematical modeling technique in queuing theory that characterizes the asymptotic behavior of queueing systems under conditions of near-saturation by approximating their stochastic processes with diffusion processes when traffic intensity approaches unity.

475

Publications

22.6K

Citations

772

Authors

357

Institutions

Publications per year

2017–2026

50

Authors

772

  1. WW
    Ward Whitt

    AT&T (United States), United States

    20 publications · 1.2K citations

    17

    h-index

  2. JM
    J. Michael Harrison

    Stanford University, United States

    11 publications · 1.2K citations

    10

    h-index

  3. MI
    Martin I. Reiman

    AT&T (United States), United States

    9 publications · 614 citations

    9

    h-index

  4. LM
    Lawrence M. Wein

    Stanford University, United States

    8 publications · 699 citations

    8

    h-index

  5. BZ
    Bert Zwart

    Centrum Wiskunde & Informatica, Netherlands

    7 publications · 218 citations

    7

    h-index

1–5 of 772

Venues

  1. Operations Research

    26 publications · 1.8K citations

    22

    h-index

  2. Queueing Systems

    29 publications · 1K citations

    18

    h-index

  3. Journal of Applied Probability

    JAP · 27 publications · 891 citations

    16

    h-index

  4. The Annals of Applied Probability

    19 publications · 1.8K citations

    16

    h-index

  5. Performance Evaluation

    27 publications · 793 citations

    16

    h-index

1–5