Processor Sharing Discipline
Processor Sharing Discipline is a service discipline in queueing theory where the server capacity is equally shared among all jobs present in the system, allowing all customers to receive simultaneous service at a rate inversely proportional to the total number of customers.
148
Publications
12.4K
Citations
235
Authors
141
Institutions
Publications per year
2017–2026
6
Variants
Processor Sharing
Parents
148
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
Efficient network QoS provisioning based on per node traffic shaping
L. Georgiadis, R. Guérin, V. Peris et al. · IEEE/ACM Transactions on Networking · 1996 · 311 citations
1–5 of 148
235
11
h-index
9
h-index
6
h-index
6
h-index
6
h-index
1–5 of 235
141
Centrum Wiskunde & Informatica
Amsterdam, The Netherlands
12 h-index
23 publications
779 citations
Eindhoven University of Technology
Eindhoven, The Netherlands
11 h-index
20 publications
789 citations
Orange (France)
Paris, France
11 h-index
19 publications
905 citations
AT&T (United States)
Bedminster, United States
11 h-index
16 publications
382 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
10 h-index
15 publications
859 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
6 h-index
9 publications
5.3K citations
Nokia (United States)
Coppell, United States
6 h-index
7 publications
187 citations

University of Waterloo
Waterloo, Canada
5 h-index
9 publications
283 citations
1–8 of 141
14 publications · 764 citations
12
h-index
AAP · 7 publications · 381 citations
7
h-index
TON · 7 publications · 5K citations
7
h-index
7 publications · 303 citations
7
h-index
JAP · 6 publications · 253 citations
6
h-index
1–5