Queueing Delay Bounds

Queueing Delay Bounds is a performance metric in queueing theory that characterizes the maximum allowable delay a job or packet may experience in a queuing system under specified service constraints, distinguishing it from related metrics by providing deterministic or probabilistic upper limits on waiting times.

174

Publications

7.6K

Citations

318

Authors

159

Institutions

Publications per year

2017–2026

20

Authors

318

  1. MJ
    Michael J. Neely

    University of Southern California, United States

    6 publications · 513 citations

    6

    h-index

  2. MF
    Markus Fidler

    Leibniz University Hannover, Germany

    6 publications · 190 citations

    6

    h-index

  3. FC
    Florin Ciucu

    Technische Universität Berlin, Germany

    5 publications · 168 citations

    5

    h-index

  4. JL
    Jörg Liebeherr

    University of Virginia, United States

    5 publications · 231 citations

    5

    h-index

  5. AE
    Anthony Ephremides

    University of Maryland, College Park, United States

    4 publications · 127 citations

    4

    h-index

1–5 of 318

Venues

  1. IEEE/ACM Transactions on Networking

    TON · 13 publications · 1.3K citations

    11

    h-index

  2. Operations Research

    7 publications · 396 citations

    7

    h-index

  3. IEEE Transactions on Information Theory

    6 publications · 325 citations

    6

    h-index

  4. Journal of Applied Probability

    JAP · 6 publications · 252 citations

    6

    h-index

  5. IEEE Communications Letters

    5 publications · 109 citations

    5

    h-index

1–5