Processor-sharing queues and resource sharing in wireless LANs

In the past few decades, the processor-sharing (PS) model has received considerable attention in the queueing theory community and in the field of performance evaluation of computer and communication systems. The scarce resource is simultaneously shared among all users in these systems. PS models are used for modeling resource sharing mechanisms and have many applications in communication networks, as well as in logistics and manufacturing.

[1]  R. Núñez Queija,et al.  Discriminatory processor sharing revisited , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[2]  B. Harshbarger.  An Introduction to Probability Theory and its Applications, Volume I , 1958 .

[3]  Leonard Kleinrock,et al.  Analysis of A time‐shared processor , 1964 .

[4]  Qian Zhang,et al.  Performance study of MAC for service differentiation in IEEE 802.11 , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[5]  Casey A. Volino,et al.  A First Course in Stochastic Models , 2005, Technometrics.

[6]  Marcel F. Neuts,et al.  Matrix-geometric solutions in stochastic models - an algorithmic approach , 1982 .

[7]  Bara Kim,et al.  Comparison of DPS and PS systems according to DPS weights , 2006, IEEE Communications Letters.

[8]  S. Ross.  Average delay in queues with non-stationary Poisson arrivals , 1978, Journal of Applied Probability.

[9]  Michel Mandjes,et al.  Large deviations of sojourn times in processor sharing queues , 2006, Queueing Syst. Theory Appl..

[10]  Lin Gwo Dong,et al.  Characterizations of the L-class of life distributions , 1998 .

[11]  Leonard Kleinrock,et al.  Time-shared Systems: a theoretical treatment , 1967, JACM.

[12]  B. Sengupta,et al.  A conditional response time of the M/M/1 processor-sharing queue , 1985, AT&T Technical Journal.

[13]  Alexandre Proutière,et al.  Insensitivity in processor-sharing networks , 2002, Perform. Evaluation.

[14]  Tom Burr,et al.  Introduction to Matrix Analytic Methods in Stochastic Modeling , 2001, Technometrics.

[15]  Moshe Shaked,et al.  Stochastic orders and their applications , 1994 .

[16]  S. Grishechkin.  On a relationship between processor-sharing queues and Crump–Mode–Jagers branching processes , 1992, Advances in Applied Probability.

[17]  Adam Wierman,et al.  Classifying scheduling policies with respect to unfairness in an M/GI/1 , 2003, SIGMETRICS '03.

[18]  Sem C. Borst.  User-level performance of channel-aware scheduling algorithms in wireless data networks , 2005, IEEE/ACM Transactions on Networking.

[19]  Laurent Massoulié,et al.  Impact of fairness on Internet performance , 2001, SIGMETRICS '01.

[20]  Eitan Altman,et al.  DPS queues with stationary ergodic service times and the performance of TCP in overload , 2004, IEEE INFOCOM 2004.

[21]  Yezekael Hayel,et al.  Pricing for Heterogeneous Services at a Discriminatory Processor Sharing Queue , 2005, NETWORKING.

[22]  L. Schrage,et al.  Queueing systems, Vol. I: Theory , 1977, Proceedings of the IEEE.

[23]  Misja Nuyens.  The Foregound-Background Processor-Sharing Queue: a survey , 2004 .

[24]  Hans van den Berg,et al.  TheM/G/1 queue with processor sharing and its relation to a feedback queue , 1991, Queueing Syst. Theory Appl..

[25]  S. Wittevrongel,et al.  Queueing Systems , 2019, Introduction to Stochastic Processes and Simulation.

[26]  W. R. Scheinhardt,et al.  Markov-modulated and feedback fluid queues , 1998 .

[27]  Ward Whitt,et al.  Predicting Response Times in Processor-Sharing Queues , 2000 .

[28]  F. G. Foster,et al.  Conditional response times in the M / G /1 processor-sharing system , 1983 .

[29]  Alexandre Proutière,et al.  Modeling integration of streaming and data traffic , 2004, Perform. Evaluation.

[30]  Vincent Hodgson,et al.  The Single Server Queue. , 1972 .

[31]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the single node case , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[32]  William A. Massey,et al.  Asymptotic Analysis of the Time Dependent M/M/1 Queue , 1985, Math. Oper. Res..

[33]  S. F. Yashkov.  On a heavy traffic limit theorem for the M/G/1 processor-sharing queue , 1993 .

[34]  T. M. O'Donovan.  Direct Solutions of M/G/1 Processor-Sharing Models , 1974, Oper. Res..

[35]  A. K. Erlang.  The theory of probabilities and telephone conversations , 1909 .

[36]  D. Kendall.  Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov Chain , 1953 .

[37]  Sem C. Borst,et al.  Asymptotic regimes and approximations for discriminatory processor sharing , 2004, PERV.

[38]  Richard J. Boucherie,et al.  An analytical packet/flow-level modelling approach for wireless LANs with Quality-of-Service support , 2005 .

[39]  Benjamin Avi-Itzhak,et al.  SQF: A slowdown queueing fairness measure , 2007, Perform. Evaluation.

[40]  Vaidyanathan Ramaswami,et al.  Introduction to Matrix Analytic Methods in Stochastic Modeling , 1999, ASA-SIAM Series on Statistics and Applied Mathematics.

[41]  Frank E. Grubbs,et al.  An Introduction to Probability Theory and Its Applications , 1951 .

[42]  Isi Mitrani,et al.  Sharing a Processor Among Many Job Classes , 1980, JACM.

[43]  N. L. Lawrie,et al.  Comparison Methods for Queues and Other Stochastic Models , 1984 .

[44]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[45]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[46]  H. L. Truong,et al.  The IEEE 802.11e MAC for Quality of Service in Wireless LANs , 2002 .

[47]  Alan Scheller-Wolf,et al.  Fundamental characteristics of queues with fluctuating load , 2006, SIGMETRICS '06/Performance '06.

[48]  Mor Harchol-Balter,et al.  Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates , 2006, Queueing Syst. Theory Appl..

[49]  Ward Whitt,et al.  THE M/G/1 PROCESSOR-SHARING QUEUE WITH LONG and SHORT JOBS , 1998 .

[50]  Richard J. Boucherie,et al.  Decomposing the queue length distribution of processor-sharing models into queue lengths of permanent customer queues , 2005, Perform. Evaluation.

[51]  Anthony Unwin,et al.  Reversibility and Stochastic Networks , 1980 .

[52]  Laurent Massoulié,et al.  Bandwidth sharing and admission control for elastic traffic , 2000, Telecommun. Syst..

[53]  J. Morrison.  Response-Time Distribution for a Processor-Sharing System , 1985 .

[54]  R. Núñez Queija,et al.  Processor-Sharing Models for Integrated-Services Networks , 2000 .

[55]  Nikhil Bansal.  Analysis of the M/G/1 processor-sharing queue with bulk arrivals , 2003, Oper. Res. Lett..

[56]  Sunghyun Choi,et al.  IEEE 802.11e Wireless LAN for Quality of Service , 2001 .

[57]  Ward Whitt,et al.  Comparison methods for queues and other stochastic models , 1986 .

[58]  M. Yu. Kitaev,et al.  The M/G/1 processor-sharing model: transient behavior , 1993, Queueing Syst. Theory Appl..

[59]  A. Girotra,et al.  Performance Analysis of the IEEE 802 . 11 Distributed Coordination Function , 2005 .

[60]  R. Doney,et al.  Moments of ladder heights in random walks , 1980, Journal of Applied Probability.

[61]  van Miranda Uitert,et al.  Generalized processor sharing queues , 2003 .

[62]  Sem C. Borst,et al.  Sojourn time asymptotics in processor-sharing queues , 2006, Queueing Syst. Theory Appl..

[63]  B. Klefsjö.  A useful ageing property based on the Laplace transform , 1983, Journal of Applied Probability.

[64]  Edward G. Coffman,et al.  Waiting Time Distributions for Processor-Sharing Systems , 1970, JACM.

[65]  Awi Federgruen,et al.  Queueing Systems with Service Interruptions , 1986, Oper. Res..

[66]  Kiran M. Rege,et al.  Queue-Length Distribution for the Discriminatory Processor-Sharing Queue , 1996, Oper. Res..

[67]  Thomas Bonald,et al.  Statistical bandwidth sharing: a study of congestion at flow level , 2001, SIGCOMM.

[68]  Moshe Zukerman,et al.  Performance Analysis of the IEEE 802.11 MAC Protocol , 2007 .

[69]  Bara Kim,et al.  Slowdown in the M/M/1 discriminatory processor-sharing queue , 2008, Perform. Evaluation.

[70]  W. D. Ray.  Queueing Systems. Vol. II—Computer Applications , 1977 .

[71]  M.J.G. vanUitert,et al.  Generalized processor sharing queues , 2003 .

[72]  J. W. Cohen,et al.  The multiple phase service network with generalized processor sharing , 1979, Acta Informatica.

[73]  S. F. Yashkov,et al.  Processor-sharing queues: Some progress in analysis , 1987, Queueing Syst. Theory Appl..

[74]  Andreas Brandt,et al.  A sample path relation for the sojourn times in G/G/1−PS systems and its applications , 2006, Queueing Syst. Theory Appl..

[75]  Bara Kim,et al.  Sojourn time distribution in the M/M/1 queue with discriminatory processor-sharing , 2004, Perform. Evaluation.

[76]  FABRICE GUILLEMIN,et al.  Analysis of the M/M/1 Queue with Processor Sharing via Spectral Theory , 2001, Queueing Syst. Theory Appl..

[77]  W. A. Massey,et al.  Uniform acceleration expansions for Markov chains with time-varying rates , 1998 .

[78]  Leonard Carlitz.  Eulerian numbers and polynomials of higher order , 1960 .

[79]  Sem C. Borst,et al.  Differentiated bandwidth sharing with disparate flow sizes , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[80]  Van Jacobson,et al.  Congestion avoidance and control , 1988, SIGCOMM '88.

[81]  Bara Kim,et al.  The processor-sharing queue with bulk arrivals and phase-type services , 2007, Perform. Evaluation.

[82]  A. P. Zwart,et al.  Sojourn time asymptotics in the M/G/1 processor sharing queue , 1998, Queueing Syst. Theory Appl..

[83]  Avishai Mandelbaum,et al.  Strong Approximations for Time-Dependent Queues , 1995, Math. Oper. Res..

[84]  D. Mitra,et al.  Stochastic theory of a data-handling system with multiple sources , 1982, The Bell System Technical Journal.

[85]  R. Núñez Queija,et al.  Centrum Voor Wiskunde En Informatica Reportrapport Sojourn times in a Processor Sharing Queue with Service Interruptions Sojourn times in a Processor Sharing Queue with Service Interruptions , 2022 .

[86]  R. Butterworth,et al.  Queueing Systems, Vol. II: Computer Applications. , 1977 .

[87]  Onno Boxma,et al.  SOJOURN TIME TAILS IN THE M/D/1 PROCESSOR SHARING QUEUE , 2006, Probability in the Engineering and Informational Sciences.

[88]  Richard J. Boucherie,et al.  Insensitive bounds for the moments of the sojourn time distribution in the M/G/1 processor-sharing queue , 2006, Queueing Syst. Theory Appl..

[89]  R. Schassberger,et al.  A new approach to the M/G/1 processor-sharing queue , 1984, Advances in Applied Probability.

[90]  B. Klar.  A note on the ℒ-class of life distributions , 2002, Journal of Applied Probability.

[91]  J. L. van deBerg.  Sojourn times in feedback and processor sharing queues , 1993 .

[92]  Adam Wierman,et al.  Asymptotic convergence of scheduling policies with respect to slowdown , 2002, Perform. Evaluation.

[93]  Shoichi Noguchi,et al.  An Analysis of the M/G/1 Queue Under Round-Robin Scheduling , 1971, Oper. Res..

[94]  Alexandre Proutière,et al.  Statistical bandwidth sharing: a study of congestion at flow level , 2001, SIGCOMM.

[95]  Ronald L. Graham,et al.  Concrete Mathematics, a Foundation for Computer Science , 1991, The Mathematical Gazette.

[96]  Shang Zhi,et al.  A proof of the queueing formula: L=λW , 2001 .

[97]  K. Mani Chandy,et al.  Open, Closed, and Mixed Networks of Queues with Different Classes of Customers , 1975, JACM.

[98]  Chong-kwon Kim,et al.  Performance analysis and evaluation of IEEE 802.11e EDCF , 2004, Wirel. Commun. Mob. Comput..

[99]  Onno Boxma,et al.  Sojourn times in feedback and processor sharing queues , 1988 .

[100]  Eitan Altman,et al.  A survey on discriminatory processor sharing , 2006, Queueing Syst. Theory Appl..

[101]  T. Ott.  THE SOJOURN-TIME DISTRIBUTION IN THE M/G/1 QUEUE , 1984 .