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
Parents
174
Hierarchical packet fair queueing algorithms
J.C.R. Bennett, Hui Zhang · IEEE/ACM Transactions on Networking · 1997 · 422 citations
Maximum allowable delay bounds of networked control systems
Dong-Sung Kim, Young Sam Lee, Wook Hyun Кwon et al. · Control Engineering Practice · 2003 · 365 citations
Hierarchical packet fair queueing algorithms
J.C.R. Bennett, Hui Zhang · 1996 · 214 citations
K. T. Marshall · Operations Research · 1968 · 200 citations
1–5 of 174
318
6
h-index
6
h-index
5
h-index
5
h-index
4
h-index
1–5 of 318
159
Massachusetts Institute of Technology
Cambridge, United States
8 h-index
12 publications
570 citations
University of California, Berkeley
Berkeley, United States
8 h-index
9 publications
513 citations
École Polytechnique Fédérale de Lausanne
Lausanne, Switzerland
7 h-index
16 publications
525 citations
Carnegie Mellon University
Pittsburgh, United States
7 h-index
9 publications
1.2K citations
University of Southern California
Los Angeles, United States
7 h-index
9 publications
692 citations
University of Kaiserslautern
Kaiserslautern, Germany
6 h-index
13 publications
416 citations
University of Maryland, College Park
College Park, United States
5 h-index
6 publications
323 citations
Georgia Institute of Technology
Atlanta, United States
5 h-index
10 publications
411 citations
1–8 of 159
TON · 13 publications · 1.3K citations
11
h-index
7 publications · 396 citations
7
h-index
6 publications · 325 citations
6
h-index
JAP · 6 publications · 252 citations
6
h-index
5 publications · 109 citations
5
h-index
1–5