Processor Sharing Queues
Processor Sharing Queues is a queueing model in which the server capacity is equally shared among all jobs present in the system, distinguishing it from other service disciplines by allowing simultaneous service of multiple customers with instantaneous rate allocation inversely proportional to the number of active jobs.
195
Publications
9.6K
Citations
250
Authors
155
Institutions
Publications per year
2017–2026
9
Variants
Processor Sharing Queueing Models
Parents
195
WF/sup 2/Q: worst-case fair weighted fair queueing
J.C.R. Bennett, Hui Zhang · 2002 · 1.1K citations
Leonard Kleinrock · Journal of the ACM · 1967 · 368 citations · Full text
Analysis on Cache-Enabled Wireless Heterogeneous Networks
Chenchen Yang, Yao Yao, Zhiyong Chen et al. · IEEE Transactions on Wireless Communications · 2015 · 338 citations
1–5 of 195
250
11
h-index
11
h-index
10
h-index
9
h-index
8
h-index
1–5 of 250
155
Eindhoven University of Technology
Eindhoven, The Netherlands
17 h-index
33 publications
1.1K citations
Centrum Wiskunde & Informatica
Amsterdam, The Netherlands
16 h-index
36 publications
1.2K citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
11 h-index
16 publications
679 citations
AT&T (United States)
Bedminster, United States
10 h-index
15 publications
433 citations
Orange (France)
Paris, France
9 h-index
13 publications
625 citations

University of Twente
Enschede, The Netherlands
8 h-index
13 publications
307 citations
Carnegie Mellon University
Pittsburgh, United States
7 h-index
10 publications
1.6K citations

University of Waterloo
Waterloo, Canada
7 h-index
14 publications
693 citations
1–8 of 155
23 publications · 996 citations
16
h-index
JAP · 14 publications · 533 citations
12
h-index
11 publications · 461 citations
10
h-index
AAP · 9 publications · 451 citations
9
h-index
9 publications · 140 citations
9
h-index
1–5