Priority Queue Delay Bounds

Priority Queue Delay Bounds is a theoretical construct in queueing theory that specifies the upper limits on the waiting time of prioritized tasks in a priority queue, distinguished by its focus on deterministic or probabilistic guarantees for delay according to priority levels and scheduling policies.

18

Publications

435

Citations

46

Authors

19

Institutions

Publications per year

2017–2026

3

Authors

46

  1. RG
    Reinhard German

    Friedrich-Alexander-Universität Erlangen-Nürnberg, Germany

    1 publications · 35 citations

    1

    h-index

  2. MZ
    Moshe Zukerman

    City University of Hong Kong, Hong Kong SAR China

    1 publications · 27 citations

    1

    h-index

  3. PM
    Petteri Mannersalo

    VTT Technical Research Centre of Finland, Finland

    1 publications · 17 citations

    1

    h-index

  4. JN
    John N. Daigle

    University of Mississippi, United States

    1 publications · 18 citations

    1

    h-index

  5. BN
    Borislav Nikolić

    Polytechnic Institute of Porto, Portugal

    1 publications · 26 citations

    1

    h-index

1–5 of 46

Venues

  1. UvA-DARE (University of Amsterdam)

    Repository · 1 publications · 17 citations

    1

    h-index

  2. IEEE Transactions on Consumer Electronics

    1 publications · 10 citations

    1

    h-index

  3. Wireless Networks

    1 publications · 12 citations

    1

    h-index

  4. SIAM Journal on Applied Mathematics

    1 publications · 15 citations

    1

    h-index

  5. Computer Communications

    1 publications · 37 citations

    1

    h-index

1–5