E. Altman, T. Jimenez, and D. Kofman, DPS queues with stationary ergodic service times and the performance of TCP in overload, in: Proceedings of IEEE INFOCOM (2004).
K.E. Avrachenkov, U. Ayesta, P. Brown, and R. Núñez-Queija, Discriminatory processor sharing revisited, in: Proceedings of IEEE INFOCOM (2005).
K.E. Avrachenkov, U. Ayesta, P. Brown, and R. Núñez-Queija, Discriminatory processor sharing revisited (2006), Extended version submitted for publication.
F. Baccelli and P. Brémaud, Elements of Queuing Theory: Palm Martingale Calculus and Stochastic Recurrences (Springer, 2003).
M.J. Bach, The Design of the UNIX Operating System (Prentice-Hall, 1986).
T. Bonald and L. Massoulié, Impact of fairness on Internet performance, in: Proceedings of ACM SIGMETRICS/Performance (2001) pp. 82–91.
T. Bonald and A. Proutière, Insensitive bandwidth sharing in data networks, Queueing Systems 44 (2003) 69–100.CrossRef
T. Bonald and A. Proutière, On stochastic bounds for monotonic processor sharing networks, Queueing Systems 47 (2004) 81–106.CrossRef
S.C. Borst, R. Núñez-Queija, and A.P. Zwart, Sojourn time asymptotics in processor sharing queues, (2006), in this special issue.
S.C. Borst, D.T.M.B. van Ooteghem, and A.P. Zwart, Tail asymptotics for discriminatory processor sharing queues with heavy-tailed service requirements, Performance Evaluation 61(2–3) (2005) 281–298.CrossRef
O.J. Boxma, N. Hegde, and R. Núñez-Queija, Exact and approximate analysis of sojourn times in finite discriminatory processor sharing queues, AEU International Journal on Electronic Communication (2006) (to appear).
T. Bu and D. Towsley, Fixed point approximation for TCP behaviour in an AQM network, in: Proceedings of ACM SIGMETRICS/Performance (2001) pp. 216–225.
S.K. Cheung, J.L. van den Berg, and R.J. Boucherie, Decomposing the queue length distribution of processor sharing models into queue lengths of permanent customer queues, Performance Evaluation 62(1–4) (2005) 100–116.
S.K. Cheung, J.L. van den Berg, R.J. Boucherie, R. Litjens, and F. Roijers, An analytical packet/flow-level modelling approach for wireless LANs with quality-of-service support, in: Proceedings of ITC-19 (2005).
E.G. Coffman and I. Mitrani, A characterization of waiting time performance realizable by single-server queues, Operations Research 28(3) (1980) 810–821.
G. Fayolle, I. Mitrani, and R. Iasnogorodski, Sharing a processor among many job classes, Journal of the ACM 27(3) (1980) 519–532.CrossRef
H. Feng and V. Misra, Mixed scheduling disciplines for network flows, Performance Evaluation Review 31(2) (2003) 36–39.
T.C. Green and S. Stidham, Sample-path conservation laws, with application to scheduling queues and fluid systems, Queueing Systems 36 (2000) 175–199.CrossRef
S. Grishechkin, On a relationship between processor sharing queues and Crump-Mode-Jagers branching processes Adv. Appl. Prob. 24(3) (1992) 653–698.CrossRef
L. Guo and I. Matta, Scheduling flows with unknown sizes: Approximate analysis, in: Proceedings of ACM SIGMETRICS (Extended Abstract) (2002) 276–277. Extended version available as a Boston University Technical Report BU-CS-2002-009.
R. Hassin and M. Haviv, Who should be given priority in a queue, Operations Research Letters, 34 (2006)(2):191–198.CrossRef
R. Hassin and M. Haviv, To Queue or not to Queue: Equilibrium Behavior in Queueing Systems (Kluwer Academic Publishers, Boston etc., 2003).
M. Haviv and J. van der Wal, Equilibrium strategies for processor sharing and random queues with relative priorities, Probability in the Engineering and Informational Sciences 11 (1997) 403– 412.
M. Haviv and J. van der Wal, Waiting times in discriminatory processor sharing (2005), Submitted for publication.
Y. Hayel and B. Tuffin, Pricing for heterogeneous services at a discriminatory processor sharing queue, in: Proceedings of Networking (2005).
A. Jean-Marie and P. Robert, On the transient behavior of the processor sharing queue, Queueing Systems 17 (1994) 129–136.CrossRef
F. Kelly, Stochastic Networks and Reversibility, (Wiley, Chichester, 1979).
J. Kim and B. Kim, Sojourn time distribution in the M/M/1 queue with discriminatory processor sharing, Performance Evaluation 58(4) (2004) 341–365.CrossRef
J.F.C. Kingman, On queues in heavy traffic, Journal of the Royal Statistical Society. Series B, Methodological 24 (1962) 383–392.
L. Kleinrock, A conservation law for a wide class of queueing disciplines, Naval Research Logistics Quarterly 12(2) (1965) 181–192.
L. Kleinrock, Time-shared systems: A theoretical treatment, Journal of the ACM 14(2) (1967) 242–261.CrossRef
L. Kleinrock, Queueing Systems, vol. 2 (John Wiley and Sons, 1976).
L. Kleinrock, R.R. Muntz, and E. Rodemich, The processor sharing queueing model for time-shared systems with bulk arrivals, Networks Journal 1(1) (1971) 1–13.
L. Massoulié and J. Roberts, Bandwidth sharing and admission control for elastic traffic, Telecommunication Systems 15(1) (2000) 185–201.CrossRef
D. Mitra and A. Weiss, A closed network with a discriminatory processor sharing server, Performance Evaluation Review 17(1) (1989) 200–208.
I. Mitrani and J.H. Hine, Complete parameterized families of job scheduling strategies, Acta Informatica (8) (1977) 61–73.
I. Mitrani and T.M. O'Donovan, Private communications.
J.A. Morrison, Asymptotic analysis of a large closed queueing network with discriminatory processor sharing, Queueing Systems 9 (1991) 191–214.CrossRef
T.M. O'Donovan, Direct solutions of M/G/1 processor sharing models, Operations Research 22 (1974) 1232–1235.
A.K. Parekh and R.G. Gallager, A generalized processor sharing approach to flow control in integrated services networks: The single-node case, IEEE/ACM Transactions on Networking 1(3) (1993) 344–357.CrossRef
K.M. Rege and B. Sengupta, A decomposition theorem and related results for the discriminatory processor sharing queue, Queueing Systems 18 (1994) 333–351.CrossRef
K.M. Rege and B. Sengupta, Queue length distribution for the discriminatory processor sharing queue, Operations Research 44(4) (1996) 653–657.
R. Righter and J.G. Shanthikumar, Scheduling multiclass single server queueing systems to stochastically maximize the number of successful departures, Probability in the Engineering and Informational Sciences 3 (1989) 323–334.CrossRef
L.E. Schrage, The queue M/G/1 with feedback to lower priority queues, Management Science 13 (1967) 466–471.
J. Shanthikumar and D. Yao, Multiclass queueing systems: Polymatroidal structure and optimal scheduling control, Operations Research 40(2) (1992) 293–299.CrossRef
M. Shreedhar and G. Varghese, Efficient fair queuing using Deficit Round-Robin, IEEE/ACM Transactions on Networking 4(3) (1996) 375–385.CrossRef
A. Silberschatz, P. Galvin, and G. Gagne, Applied Operating System Concepts (John Wiley and Sons, 2000).
G. van Kessel, R. Núñez-Queija, and S.C. Borst, Asymptotic regimes and approximations for discriminatory processor sharing, Performance Evaluation Review 32(6) (2004) 44–46.
G. van Kessel, R. Núñez-Queija, and S.C. Borst, Differentiated bandwidth sharing with disparate flow sizes, in: Proceedings of IEEE INFOCOM (2005).
M.J.G. van Uitert, Generalized Processor Sharing Queues, PhD thesis, Eindhoven University of Technology (2003).
S.F. Yashkov, Processor sharing queues: Some progress in analysis, Queueing Systems 2 (1987) 1–17.CrossRef
S.F. Yashkov, Mathematical problems in the theory of processor sharing queueing systems, Journal of Soviet Mathematics 58 (1992) 101–147.CrossRef
A.P. Zwart and O.J. Boxma, Sojourn time asymptotics in the M/G/1
processor sharing queue, Queueing Systems 35 (2000) 141–166.CrossRef