Processor sharing: A survey of the mathematical theory

Automation and Remote Control

Volumn 68, Issue 9, 2007, Pages 1662-1731

  Yashkov, S F ^a   Yashkova, A S ^b  

^a INSTITUTE FOR INFORMATION TRANSMISSION PROBLEMS   (Russian Federation)

^b CENTRAL AEROHYDRODYNAMIC INSTITUTE TSAGI   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

PROBABILITY; PROGRAM PROCESSORS; QUEUEING NETWORKS; THEOREM PROVING; TIME SHARING PROGRAMS;

EGALITARIAN PROCESSOR SHARING (EPS); MATHEMATICAL THEORY; ROUND-ROBIN (RR) SCHEDULING; TIME SHARING COMPUTER SYSTEMS;

ALGORITHMS;

EID: 34948887737     PISSN: 00051179     EISSN: None     Source Type: Journal    
DOI: 10.1134/S0005117907090202     Document Type: Article

References (245)

1. Aalto, S., M/G/1/MLPS Compared with M/G/1/PS within Service Time Distribution Class IMRL, Math. Methods Oper. Research, 2006, vol. 64, no. 2, pp. 309-325.
2. Aalto, S. and Ayesta, U., On the Nonoptimality of the Foreground-Background Discipline for IMRL Service Times, J. Appl. Probab., 2006, vol. 43, no. 2, pp. 523-534.
3. Abate, J., Choudhuri, G.L., and Whitt, W., Waiting-Time Probabilities in Queues with Long-Tail Service-Time Distributions, Queueing Syst., 1994, vol. 16, no. 3-4, pp. 311-333.
4. Abate, J., Choudhuri, G.L., and Whitt, W., An Introduction to Numerical Transform Inversion and its Application to Probability Models, in Computational Probability, Grassman, W., Ed., Boston: Kluwer, 1999, pp. 257-323.
5. Abate, J., and Whitt, W., The Fourier-Series Method for Inverting Transforms of Probability Distributions, Queueing Syst., 1992, vol. 10, no. 1, pp. 5-98.
6. Abate, J. and Whitt, W., Transient Behavior of the M/G/1 Workload Process, Oper. Research, 1994, vol. 42, no. 4, pp. 751-764.
7. Abate, J. and Whitt, W., Limits and Approximations for the M/G/1 LIFO Waiting-Time Distribution, Oper. Res. Lett., 1992, vol. 20, pp. 199-206.
8. Abrahao, B., Almeida, V., Zhang, A. et al., Self-Adaptive SLA-Driven Capacity Management for Internet Services, in Proc. IEEE/IFIP Networks Operations and Manag. Symp., Vancouver, 2006.
9. Abramowitz, M. and Stegun, L.A., Handbook of Mathematical Functions, New York: Dover, 1972.
10. Adiri, I. and Avi-Itzhak, B., A Time-sharing Queue, Management Sci., 1969, vol. 15, no. 11, pp. 639-657.
11. Altman, E., Avrachenkov, K., and Ayesta, U., A Survey on Discriminatory Processor Sharing, Queueing Syst., 2006, vol. 53, no. 1-2, pp. 53-63.
12. Altman, E., Jiménez, T., and Kofman, D., DPS Queues with Stationary Ergodic Service Times and the Performance of TCP in Overload, Proc. IEEE INFOCOM'04, 2004, paper 0-783-8356-7/04.
13. Artamonov, G.T. and Brekhov, O.M., Analiticheskie veroyatnostnye modeli funktsionirovaniya EVM (Analytical Probability Models of Computer Functioning), Moscow: Energiya, 1978.
14. k /1 Queue with the Foreground-Background Processor-Sharing Discipline, Autom. Remote Control, 2006, vol. 67, no. 3, pp. 428-434.
15. Asmussen, S., Applied Probability and Queues, Heidelberg: Springer, 2003.
16. Asmussen, S., Klüppelberg, C., and Sigman, K., Sampling at Subexponential Times, with Queueing Applications, Stochastic Processes and Their Appl., 1999, vol. 79, pp. 265-286.
17. Asare, B.K. and Foster, F.G., Conditional Response Times in the M/G/1 Processor-Sharing System, J. Appl. Probab., 1983, vol. 20, no. 4, pp. 910-915.
18. Athreya, K.B. and Ney, P.E., Branching Processes. New York: Springer, 1972.
19. Avi-Itzhak, B. and Halfin, S., Server Sharing with a Limited Number of Service Positions and Symmetric Queues, J. of Appl. Probab., 1987, vol. 24, no. 4, pp. 990-1000.
20. Baccelli, F. and Brémaud, P., Elements of Queueing Theory, Heidelberg: Springer, 2003.
21. Bailey, N.T.J., A Continuous Time Treatment of a Simple Queue Using Generating Functions, J. Royal Statist. Soc., Ser. B, 1954, vol. 16, pp. 288-291.
22. Bansal, N., Analysis of the M/G/1 Processor Sharing Queue with Bulk Arrivals, Oper. Res. Lett., 2003, vol. 31, pp. 401-405.
23. Basharin, G.P. and Tolmachev, A.L., Theory of Queueing Networks and its Application to the Analysis of Information-Computing Systems, J. Soviet Math., 1985, vol. 99, no. 1, pp. 951-1050.
24. Beneš, V.E., On Queues with Poisson Arrrivals. Annals Math. Statist., 1957, vol. 28, pp. 670-677.
25. van den Berg, J.L., Sojourn Times in Feedback and Processor-Sharing Queues, PhD Dissertation, Utrecht: Rijksuniversiteit, 1990.
26. Bhat, U.N., Introduction to Queueing Theory (Draft of the Lecture Course), Dallas, 2005, Available at http://www.faculty.smu.edu/nbhat.
27. Bhat, U.N., Shalaby, M., and Fisher, M.J., Approximation Techniques in the Solution of Queueing Problems, Naval Research Logist. Quart., 1979, vol. 26, pp. 311-326.
28. Bingham, N.H., Goldie, C.M., and Teugels, J.L., Regular Variation, vol. 27 of Encycl. of Math. and Its Appl., Cambridge: Cambridge Univ. Press, 1987.
29. Bingham, N.H. and Doney, R.A., Asymptotic Properties of Super-Critical Branching Processes. I, Adv. Appl. Probab., 1974, vol. 6, no. 4, pp. 711-731.
30. Blanc, J.P.C. and van Doorn, E.A., Relaxation Times for Queuing Systems, in Mathematics and Computer Science, Hazewinkel, M. and Lenstra, J.K., Eds, Amsterdam: North Holland, 1986, pp. 139-162.
31. Blumenthal, R. and Getoor, R., Markov Processes and Potential Theory, New York: Academic, 1968.
32. Bocharov, P.P. and Pechinkin, A.V., Teoriya massovogo obsluzhivaniya (Queueing Theory), Moscow: Univ. Druzhby Narodov, 1995.
33. Borel, E., Sur l'emploi du théorème de Bernoulli pour faciliter le calcul d'une infinité de coefficients. Application au problème de l'attente à un Guichet, Comptes Rendus Hebd. des Séanc. de l'Académie des Sciences, 1942, vol. 214, pp. 452-456.
34. Borovkov, A.A., Asymptotic Methods in Queueing Theory, New York: Wiley, 1984.
35. Borst, S.C. Boxma, O.J., and Nunez-Queija, R., Heavy Tails: The Effect of the Service Discipline, in Computer Performance Evaluation-Modelling Techniques and Tools, Proc. 12th Int. Conf. (London, Apr. 2002), Field, T. et al., Eds., Berlin: Springer, 2002, pp. 1-30.
36. Brandt, A. and Brandt, M., On the Sojourn Times for Many-Queue Head-of-the-Line Processor-Sharing Systems with Permanent Customers, Math. Methods Oper. Research, 1998, vol. 47, pp. 181-220.
37. Brandt, A. and Brandt, M., A Sample Path Relation for the Sojourn Times in G/G/1-PS Systems and its Applications, Queueing Syst., 2006, vol. 52, no. 4, pp. 281-286.
38. Breiman, L., On Some Limit Theorems Similar to Arc-Sin Law, Theor. Prob. Appl., 1965, vol. 10, pp. 323-331.
39. Chen, H., Kella, O., and Weiss, G., Fluid Approximation for a Processor-Sharing Queue, Queueing Syst., 1997, vol. 27, no. 1-2, pp. 99-125.
40. Chernoff, H., A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the Sum of Observations, Ann. Math. Statist., 1952, vol. 23, no. 4, pp. 493-507.
41. Cheung, S.-K., van den Berg, J.L., and Boucherie, R.J., Decomposing the Queue Length Distribution of Processor-Sharing Models into Queue Lengths of Permanent Customer Queues, Proc. of IFIP Performance'2005, Juan-les-Pins, France, Oct. 3-7, 2005.
42. Cheung, S-K., van den Berg, J.L., and Boucherie, R.J., Insensitive Bounds for the Moments of the Sojourn Time Distribution for the M/G/1 Processor-Sharing Queue, Queueing Syst., 2006, vol. 53, no. 1-2, pp. 7-18.
43. Chistyakov, V.P., A Theorem on Sums of Independent, Positive Random Variables and its Applications to Branching Processes, Theor. Prob. Appl., 1964, vol. 9, pp. 640-648.
44. Coffman, E.G., Muntz, R., and Trotter, H., Waiting Time Distributions for Processor-Sharing Systems. J. Assoc. Comput. Mach., 1970, vol. 17, no. 1, pp. 123-130.
45. Cohen, J.W., Asymptotic Relations in Queueing Theory, Stoch. Proc. Appl., 1973, vol. 1, pp. 107-124.
46. Cohen, J.W., The Single Server Queues, Amsterdam: North-Holland, 1982.
47. Cohen, J.W., On Processor Sharing and Random Service (Letter to the Editor), J. Appl. Probab., 1984, vol. 21, no. 4, pp. 937-937.
48. Conway, R.W., Maxwell, V.L. and Miller, L.W., Theory of Scheduling. Reading: Addison-Wesley, 1967.
49. Cooper, R.B., Introduction to Queueing Theory, New York: North-Holland, 1981.
50. Cooper, R.B., Queueing Theory, in Handbooks in Oper. Res. and Manag. Sci., Heyman, D.P. and Sobel, M.J., Eds., New York: Elsevier, 1990, vol. 2, pp. 469-518.
51. Cooper, R.B. and Shun-Chen Niu, Beneš's Formula for M/G/1-FIFO "Explained" by Preemptive Resume LIFO, J. Appl. Probab., 1986, vol. 23, no. 2, pp. 550-554.
52. Cox, D.R. and Smith, W.L., Queues, London: Methuen, 1961.
53. Daduna, H., Queueing Networks with Discrete Time Scale: Explicit Expressions for the Steady State Behavior of Discrete Time Stochastic Queueing Networks, Heidelberg: Springer, 2001.
54. Daduna, H. and Schassberger, R., A Discrete-Time Round-Robin Queue with Bernoulli Input and General Arithmetic Service Time Distributions, Acta Informatica, 1981, vol. 15, no. 3, pp. 251-263.
55. Daley, D.J., Queueing Output Processes, Adv. Appl. Probab., 1976, vol. 8, pp. 395-415.
56. van Dantzig, D., Sur la méthode des fonctions génè ratrices, Colloques Internationaux du CNRS, 1948, vol. 13, pp. 29-45.
57. Davies, B., and Martin, B.L., Numerical Inversion of the Laplace Transform: A Survey and Comparison of Methods, J. Comput. Phys., 1979, vol. 33, pp. 1-32.
58. Disney, R.L. and Kiessler, P., Traffic Processes in Queueing Networks. A Markov Renewal Approach, Baltimore: John Hopkins Univ. Press, 1987.
59. Doetsch, G., Introduction to the Theory and Applications of the Laplace Transformation, New York: Springer, 1974.
60. Dshalalow, J.H., An Antology of Classical Queueing Methods, in Advances in Queueing: Theory, Methods, and Open Problems, Dhalalow, J.H., Ed., Boca Raton: CRC Press, 1995, pp. 1-42.
61. Egorova, R., Zwart, B., and Boxma, O., Sojourn Time Tails in the M/D/1 Processor Sharing Queue, Probab. Eng. Inf. Sci., 2006, vol. 20, no. 3, pp. 429-446.
62. Embrechts, P., Klüppelberg, C., and Mikosch, T., Modelling Extremal Events for Insurance and Finance. Heidelberg: Springer, 1997.
63. Esscher, F., On the Probability Function in the Collective Theory of Risk, Skandinavisk Aktuarietidskrift., 1932, vol. 15, pp. 175-195.
64. Fayolle, G., Mitrani, I., and Jasnogorodski, R., Sharing a Processor among Many Job Classes, J. Assoc. Comput. Mach., 1980, vol. 27, no. 3, pp. 519-532.
65. Feller, W., Introduction to Probability Theory and its Applications, New York: Wiley, 1966, vol. 2.
66. Flatto, L., The Waiting Time Distribution for the Random Order Service M/M/1 Queue, Ann. Appl. Probab., 1997, vol. 7, no. 2, pp. 382-409.
67. Foley, R.D. and Klutke, G.-A., Stationary Increments in the Accumulated Work Process in Processor-Sharing Queues, J. Appl. Probab., 1989, vol. 26, no. 3, pp. 671-677.
68. Foster, F.G., Stochastic Processes, Proc. 6th IFORS Int. Conf. Operational Research' 72, Ross, M., Ed., Amsterdam: North-Holland, 1973, pp. 223-239.
69. Franken, P., König, D., Arndt, U., and Schmidt, V., Queues and Point Processes, Berlin: Akademie, 1981.
70. Galambosh, J., The Asymptotic Theory of Extreme Order Statistics, New York: Wiley, 1978.
71. Gaver, D.P. and Jacobs, P.A., On Inference Concerning Time-Dependent Queue Performance (Invited paper), Queueing Syst., 1990, vol. 6, no. 3, pp. 261-276.
72. Glynn, P.W., Diffusion Approximation, in Handbooks in Oper. Res. and Manag. Sci., Heyman, D.P. and Sobel, M.J., Eds., New York: Elsevier, 1990, vol. 2, pp. 145-198.
73. Gnedenko, B.V. and Kovalenko, I.N., Introduction to Queueing Theory, Boston: Birkhäuser, 1991.
74. Grishechkin, S.A., The Crump-Mode-Jagers Branching Processes as a Method for Studying the Processor-Sharing System M/G/1, Theor. Prob. Appl., 1991, vol. 36, no. 1, pp. 19-35.
75. Grishechkin, S.A., On a Relationship between Processor Sharing Queues and Crump-Mode-Jagers Branching Processes, Adv. Appl. Probabb., 1992, vol. 24, no. 3, pp. 653-698.
76. Gromoll, H.C., Diffusion Approximation for a Processor Sharing Queue in Heavy Traffic, Annals Appl. Probab., 2004, vol. 14, no. 2, pp. 555-611.
77. Gross, D. and Harris, C.M., Fundamentals of Queueing Theory, New York: Wiley, 1998.
78. Guillemin, F. and Boyer, J., Analysis of the M/M/1 Queue with Processor Sharing via Spectral Theory, Queueing Syst., 2001, vol. 39, no. 4, pp. 377-397.
79. Haccou, P., Jagers, P., and Vatutin, V.A., Branching Processes: Variation, Growth, and Extinction of Populations, Cambridge: Cambridge Univ. Press, 2005.
80. Hampshire, R.C., Harchol-Balter, M., and Massey, W.A., Fluid and Diffusion Limits for Transient Sojourn Times of Processor Sharing Queues with Time Varying Rates, Queueing Syst., 2006, vol. 53, no. 1-2, pp. 19-30.
81. Heaviside, O., Electromagnetic Theory, London: Electrician Co., 1893, vol. 1; 1899, vol. 2; 1912, vol. 3.
82. Iglehart, D.L. and Whitt, W., Multiple Channel Queues in Heavy Traffic. I, II, Adv. Appl. Probab., 1970, vol. 2, pp. 150-177, pp. 355-369.
83. den Iseger, P., Numerical Transform Inversion Using Gaussian Quadrature, Probab. Eng. Inf. Sci., 2006, vol. 20, no. 1, pp. 1-44.
84. Jagerman, D.L., Difference Equations with Applications to Queues, New York: Marcel Dekker, 2000.
85. Jagers, P., Branching Processes with Biological Applications, London: Wiley, 1975.
86. Jaiswal, N.K., Priority Queues, New York: Academic, 1968.
87. Jaiswal, N.K., Performance Evaluation Studies for Time-Sharing Computer Systems, Performance Evaluation, 1982, vol. 2, no. 4, pp. 223-236.
88. Jansen, U., Conditional Expected Sojourn Times in Insensitive Queueing Systems and Networks, Adv. Appl. Probab., 1984, vol. 16, no. 4, pp. 906-919.
89. Jean-Marie, A., On Overloaded Queue, 30th Int. Conf. on the Mathematics of Operations Research, Netherlands: Lunteren, 2005.
90. Jean-Marie, A. and Robert, Ph., On Transient Behavior of the Processor-Sharing Queue, Queueing Syst., 1994, vol. 17, pp. 129-136.
91. Jelenković, P. and Momčilović, P., Resource Sharing with Subexponential Distributions, in Proc. IEEE INFOCOM'02, New York, 2002, vol. 3, pp. 1316-1325.
92. Jelenković, P. and Momčilović, P., Large Deviation Analysis of Subexponential Waiting Times in a Processor Sharing Queue, Math. Oper. Research, 2003, vol. 28, no. 3, pp. 587-608.
93. Jelenković, P. and Momčilović, P., Large Deviation of Square-Root Insensitive Random Sums, Math. Oper. Research, 2004, vol. 29, no. 2, pp. 398-406.
94. Kalashnikov, V., Geometric Sums: Bounds for Rare Events with Applications, Doldrecht: Kluwer, 1997.
95. Karamata, J., Sur un mode de croissance réguliére des fonctions, Mathematica Cluj, 1930, vol. 4, pp. 38-53.
96. Karpelevich, F.I. and Kreinin, A.Ya., Heavy Traffic Limits for Multiphase Queues, Providence: AMS, 1994.
97. Kelly, F.P., Reversibility and Stochastic Networks, New York: Wiley, 1979.
98. Kel'bert, M.Ya. and Sukhov, Yu.M., Mathematical Theory of Queueing Networks, J. Soviet Math., 1990, vol. 50, no. 3, pp. 1527-1600.
99. Kendall, D.G., Some Problems in the Theory of Queues, J. Roy. Statist. Soc., Ser. B, 1951, vol. 13, pp. 151-185.
100. Kendall, D.G., Some Recent Work and Further Problems in the Queueing Theory, Theor. Prob. Appl., 1964, vol. 9, no. 1, pp. 1-13.
101. Kim, J. and Kim, B., Sojourn Time Distribution in the M/M/1 Queue with Discriminatory Processor Sharing, Performance Evaluation, 2004, vol. 58, no. 4, pp. 341-365.
102. Kim, J. and Kim, B., The Processor-Sharing Queue with Bulk Arrivals and Phase-Type Service, Performance Evaluation, 2007, vol. 64, no. 4, pp. 277-287.
103. Kingman, J.F.C., The Single Server Queue in Heavy Traffic, Proc. Cambridge Philos. Soc., 1961, vol. 57, pp. 902-904.
104. Kitayev, M.Yu. and Yashkov, S.F., Distribution of the Conditional Sojourn Time in a System with Division of Time of Servicing, Eng. Cybernetics, 1978, vol. 16, no. 4, pp. 162-167.
105. Kitayev, M.Yu. and Yashkov, S.F., Analysis of Single-Channel Queueing Systems with the Discipline of Uniform Sharing of a Device, Eng. Cybernetics, 1979, vol. 17, no. 6, pp. 42-49.
106. Klar, B., A Note on the L-class of Life Distributions, J. Appl. Probab., 2002, vol. 39, no. 1, pp. 11-19.
107. Kleinrock, L., Time-Shared Systems: A Theoretical Treatment, J. Assoc. Comput. Mach., 1967, vol. 14, no. 2, pp. 242-251.
108. Kleinrock, L., Queueing Systems, vol. 1: Theory, New York: Wiley, 1975.
109. Kleinrock, L., Queueing Systems, vol. 2: Computer Applications, New York: Wiley, 1976.
110. Klimov, G.P., Lyakhu, A.K., and Matveev, V.F., Matemeticheskie modeli sistem s razdeleniem vremeni (Mathematical Models of Time Sharing Systems), Kishinev: Shtiintsa, 1983.
111. Knessl, Ch., A Diffusion Model for Two Parallel Queues with Processor Sharing: Transient Behavior and Asymptotics, J. Appl. Math. Stoch. Analysis, 1999, vol. 12, no. 4, pp. 311-338.
112. Kobayashi, H. and Konheim, A., Queueing Models of Computer Communications System Analysis, IEEE Trans. Commun., 1977, vol. 25, no. 1, pp. 2-28.
113. Kovalenko, I.N., Rare Events in Queueing Systems-A Survey, Queueing Syst., 1994, vol. 16, pp. 1-49.
114. Kovalenko, I.N., Kuznetsov, N.Yu., and Shurenkov, V.M., Models of Random Processes. A Handbook, Skorokhod, A.V., Ed., Boca Raton: CRC Press, 1996.
115. König, D., Rykov, V.V., and Schmidt, V., Stationary Queueing Systems with Dependencies, J. Soviet Math., 1983, vol. 21, no. 6, pp. 938-994.
116. Kyprianou, E.K., On the Quasi-stationary Distribution of the Virtual Waiting Time in Queues with Poisson Arivals, J. Appl. Probab., 1971, vol. 8, no. 3, pp. 494-507.
117. Li, Q.-L., Lian, Z., and Liu, L., A RG-factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue, Stochastic Models, 2005, vol. 21, no. 2-3, pp. 507-530.
118. Limic, V., On the Behavior of LIFO Preemptive Resume Queues in Heavy Traffic, Elec. Comm. Probab., 1999, vol. 4, pp. 13-27.
119. Limic, V., A LIFO Queue in Heavy Traffic, Annals Appl. Probab., 2001, vol. 11, pp. 301-331.
120. Lipayev, V.V. and Yashkov, S.F., Effektivnost' metodov organizazii vychislitel'nogo processa v ASU (Efficiency of Methods of Organizing Computation process in Automatic Control Systems), Moscow: Statistika, 1975.
121. Masuyama, H. and Takine, T., Sojourn Time Distribution in a MAP/M/1 Processor-Sharing Queue, Oper. Res. Lett., 2003, vol. 31, pp. 406-412.
122. McKinney, J., A Survey of Analytical Time-Sharing Models, Computing Surveys, 1969, vol. 1, no. 2, pp. 105-116.
123. Matveev, V.F. and Ushakov, V.G., Sistemy massovogo obsluzhivaniya (Queueing Systems), Moscow: Mosk. Gos. Univ., 1984.
124. Meyer, P., Probability and Potentials, Waltham: Blaisdell, 1966.
125. de Meyer, A. and Teugels, J.L., On the Asymptotic Behaviour of the Distributions of the Busy Period and Service-Time in M/G/1, J. Appl. Probab., 1980, vol. 17, pp. 802-813.
126. Mitrani, I., Response Time Problems in Communication Networks, J. Royal Statist. Soc., Ser. B, 1986, vol. 47, no. 3, pp. 396-406.
127. Mitrani, I., Probabilistic Modeling, Cambridge: Cambridge Univ. Press, 1997.
128. Mishkoi, G.K., Veroyatnosti sostoyaniya prioritetnykh sistem v nestatsionarnom regime (Probabilities of a State of Priority Systems in a Non-Stationary Mode), Kishinev: Shtiintsa, 1979.
129. Morrison, J., Response Time for a Processor-Sharing System, SIAM J. Appl. Math., 1985, vol. 45, no. 1, pp. 152-167.
130. Moulin, H., Minimizing the Worst Slowdown: Off-Line and On-Line, Oper. Research, 2007 (to appear).
131. Nabe, M., Murata, M., and Miyahara, H., Analysis and Modelling of World Wide Web Traffic for Capacity Dimensioning of Internet Access Lines, Performance Evaluation, 1998, vol. 34, pp. 249-271.
132. Nadarajah, S. and Kotz, S., On the Laplace Transform of the Pareto Distribution, Queueig Syst., 2006, vol. 54, pp. 243-244.
133. Nakamura, G., Murao, Y., and Tsukamoto, K., Analysis of Waiting Time Distribution for the TSS Round-robin Scheduling Scheme, Review of Electr. Commun. Lab., 1972, vol. 20, no. 3-4, pp. 210-219.
134. Neiman, V.I., Computer Communication Networks, in Progress in Sci. and Techn., Electrosvyaz', Moscow: Vses. Inst. Nauch.-Techn. Inf., 1978, vol. 9, pp. 5-119.
135. Newell, G.F., Applications of Queueing Theory, London: Chapman and Hall, 1971.
136. Núñez-Queija, R., Sojourn Times in a Processor Sharing Queue with Service interruptions, Queueing Syst., 2000, vol. 34, no. 1-4, pp. 351-386.
137. Núñez-Queija, R., Sojourn Times in Non-Homogeneous QBD Processes with Processor Sharing, Stochastic Models, 2001, vol. 17, no. 1, pp. 61-92.
138. O'Donovan, T.M., Direct Solutions of M/G/1 Processor Sharing Models, Oper. Research, 1974, vol. 22, no. 6, pp. 1232-1235.
139. O'Donovan, T.M., The Queue M/G/1 When Jobs Are Scheduled within Generations, Oper. Research, 1975, vol. 23, no. 4, pp. 821-824.
140. Olver, F.W.J., Introduction to Asymptotics and Special Functions, New York: Academic, 1974.
141. Ott, T., The Sojourn-Time Distribution in the M/G/1 Queue with Processor Sharing, J. Appl. Probab., 1984, vol. 21, no. 2, pp. 360-378.
142. Pakes, A.G., On the Tails of Waiting-Time Distributions, J. Appl. Probab., 1975, vol. 12, no. 3, pp. 555-564.
143. Pollaczek, F., La loi de l'attente des appels télé phoniques, Comptes Rendus Hebd. des Séanc. de l'Académie des Sciences, 1946, vol. 222, pp. 352-355.
144. Prabhu, N.U., Stochastic Storage Processes, New York: Springer, 1980.
145. Ramaswami, V., The Sojourn Time in the GI/M/1 Queue with Processor Sharing, J. Appl. Probab., 1984, vol. 21, no. 2, pp. 437-442.
146. Rege, K.M. and Sengupta, B., The M/G/1 Processor-Sharing Queue with Bulk Arrivals, in Modelling and Performance Evaluation of ATM Tecnology, Amsterdam: Elsevier, 1993, pp. 417-432.
147. Rege, K.M. and Sengupta, B., A Decomposition Theorem and Related Results for the Discriminatory Processor Sharing Queue, Queueing Syst., 1994, vol. 18, no. 3-4, pp. 333-351.
148. Resing, J.A.C., Hooghiemstra, G., and Keane, M.S., The M/G/1 Processor Sharing Queue as the Almost Sure Limit of Feedback Queues, J. Appl. Probab., 1990, vol. 27, no. 4, pp. 913-918.
149. Resnick, S. and Samorodnitsky, G., Performance Decay in a Single Server Exponential Queueing Model with Long Range Dependence, Oper. Research, 1997, vol. 45, pp. 235-243.
150. Rolski, T., Twisting in Applied Probability (Draft of the Lecture Course), Edinburgh: Heriot-Watt Univ., Dept. of Acturial Math. and Statistics, 2004.
151. Rosenkrantz, W.A., Calculation of the Laplace Transform of the Length of the Busy Period for the M/G/1 Queue via Martingales, Annals Probab, 1983, vol. 11, no. 3, pp. 817-818.
152. Rubalskii, G.B., Upravlenie zapasami pri sluchainom sprose (Control of Inventories under Random Demand), Moscow: Sovetskoe Radio, 1977.
153. Runnenburg, J. Th., On the Use of the Method of Collective Marks in Queueing Theory, in Proc. Symp. on Congestion Theory, Smith, W.A. and Wilkinson, W.E., Eds., Chapel Hill: Univ. of North Carolina Press, 1965, pp. 399-438.
154. Saaty, T.L., Elements of Queueing Theory with Applications, New York: McGraw-Hill, 1961.
155. Sakata, M., Noguchi, S., and Oizumi, J., Analysis of a Processor Shared Model for Time Sharing Systems, Proc. 2nd Hawaii Int. Conf. on System Sci., Honolulu: Univ. of Hawaii, 1969, pp. 625-628.
156. Schassberger, R., Warteschlangen, Wien: Springer, 1973.
157. Schassberger, R., A New Approach to the M/G/1 Processor-Sharing Queue, Adv. Appl. Probab., 1984, vol. 16, no. 1, pp. 202-213.
158. Schassberger, R., The Steady State Distribution of Spent Service Present in the M/G/1 Foreground-Background Processor-Sharing Queue, J. Appl. Probab., 1988, vol. 25, no. 1, pp. 194-203.
159. Sevast'yanov, B.A., Vetvyashchiesya protsessy (Branching Processes), Moscow: Nauka, 1971.
160. Sengupta, B., An Approximation for the Sojourn-Time Distribution for the GI/G/1 Processor-Sharing Queue, Stochastic Models, 1992, vol. 8, no. 1, pp. 35-57.
161. Sengupta, B. and Jagerman, D.L., A Conditional Response Time of the M/M/1 Processor-Sharing Queue, AT & T Techn. J., 1985, vol. 64, no. 2, pp. 409-421.
162. Sericola, B., Guillemin, F., and Boyer, J., Sojourn Times in the M/PH/1 Processor Sharing Queue, Queueing Syst., 2005, vol. 50, no. 1, pp. 109-130.
163. Shalmon, M., Analysis of the GI/G/1 Queue and Its Variations via the LCFS Preeemptive Resume Discipline and Its Random Walk Interpretation, Probab. Engrg. Inf. Sci., 1988, vol. 2, pp. 215-230.
164. Shalmon, M., Explicit Formulas for the Variance of Conditioned Sojourn Times in M/D/1-PS, Oper. Res. Lett., 2007, vol. 35, to appear.
165. Shiryaev, A.N., Essentials of Stochastic Finance: Facts, Models, Theory, Singapore: World Scientific, 1999.
166. Sigman, K., A Primer on Heavy Tailed Distributions, Queueing Syst., 1999, vol. 33, pp. 261-275.
167. Solov'yev, A.D., Analysis of an M/G/1 Queue under Various Queueing Disciplines, in Teoriya massovogo obsluzhivaniya (Queueing Theory), Gnedenko, B.V. and Kalashnikov, V.V., Eds., Moscow: VNIISI, 1981, pp. 172-178.
168. Smith, W., Regenerative Stochastic Processes, Proc. of the Royal Soc., Ser. A, 1955, vol. 232, pp. 6-31.
169. Stidham, S., Analysis, Design, and Control of Queueing Systems, Oper. Research, 2002, vol. 50, no. 1, pp. 197-216.
170. Stoyan, D., Qualitative eigenschaften und abschätzungen Stochastischer Modelle, Berlin: Akademie, 1977.
171. Stoyan, D., Comparison Methods for Queues and Other Stochastic Models, New York: Wiley, 1983.
172. B.W. Stuck E. Arthurs 1985 A Computer & Communications Network Performance Analysis Primer Englewood Cliffs Prentice-Hall Stuck, B.W. and Arthurs, E., A Computer & Communications Network Performance Analysis Primer, Englewood Cliffs: Prentice-Hall, 1985, available at http://www. signallake.com/publications/Primer.
173. Syski, R., Markov Functionals in Teletraffic Theory, in Teletraffic Analysis and Computer Performance Evaluation, Boxma, O.J. and Tijms, H.C., Eds., Amsterdam: North-Holland, 1986, pp. 303-317.
174. Syski, R., A Personal View of Queueing Theory, in Frontiers in Queueing: Models and Applications in Science and Engineering, Dshalalow, J., Ed., Boca Raton: CRC Press, 1997, pp. 3-18.
175. Takács, L., Introduction to the Theory of Queues, Oxford: Oxford Univ. Press, 1962.
176. Takács, L., Combinatorial Methods in the Theory of Stochastic Processes, New York: Wiley, 1967.
177. Takagi, H., Time-Dependent Analysis of M/G/1 Vacation Models with Exhaustive Service, Queueing Syst., 1990, vol. 6, pp. 369-390.
178. Teugels, J.L., The Average Virtual Waiting Time as a Measure of Performance, Queueing Syst., 1990, vol. 6, pp. 327-334.
179. Tripathi, S.K. and Duda, A., Time-Dependent Analysis of Queueing Systems, Inf. Syst. Oper. Research (INFOR), 1986, vol. 24, no. 3, pp. 199-219.
180. Trub, I.I., Answers to Queries to Internet: An Optimal Generation Strategy, Autom. Remote Control, 2003, vol. 64, no. 6, pp. 935-942.
181. Tsitsiashvili, G.Sh., An Ergodicity Condition for a Cyclic Queueing System, Cybern. Syst. Anal., 2001, vol. 37, no. 1, pp. 149-150.
182. Vatutin, V.A. and Zubkov, A.M., Branching Processes. II, J. Soviet Math., 1993, vol. 67, no. 6, pp. 3407-3485.
183. Vishnevsky, V.M., Teoreticheskie osnovy proektirovaniya kompyuternykh setei (The Theoretical Fundamentals for Design of Computer Networks), Moscow: Tekhnosphera, 2003.
184. Vishnevsky, V.M. and Semenova, O.V., Mathematical Methods to Study the Polling Systems, Autom. Remote Control, 2006, vol. 67, no. 2, pp. 173-220.
185. Villela, D., Pradhan, P., and Rubenstein, D., Provisioning Servers in the Application Tier for E-commerce Systems, Proc. 12th IEEE Int. Workshop on Quality of Service, Montreal, 2004, pp. 57-66.
186. Volkonskii, V.A., Random Substitution of Time in Strong Markov Processes, Theor. Prob. Appl., 1958, vol. 3, no. 3, pp. 310-325.
187. Ward, A. and Whitt, W., Predicting Response Times in Processor-Sharing Queues, in Proc. Fields Institute Conf. on Commun. Networks, Glynn, P., MacDonald, D., and Turner, S., Eds., Providence: AMS, 2000, pp. 1-29.
188. von Weizsäcker, H. and Winkler, G., Stochastic Integrals, Braunschweig: Fridr. Vieweg, 1990.
189. Wierman, A. and Harchol-Balter, M., Classifying Scheduling Policies with Respect to Higher Moments of Conditional Response Time, Proc. ACM 2005 Sigmetrics Int. Conf. on Measurement and Modeling of Computer Systems, Bannf, Canada, 2005, pp. 229-240.
190. Whitt, W., Heavy Traffic Limit Theorems for Queues: A Survey, Mathematical Methods in Queueing Theory. Proc. of a Conf. at Western Michigan Univ., May 10-12, 1973
191. (Lect. Notes in Economics and Math. Syst., vol. 98), Heidelberg: Springer, 1974, pp. 307-350.
192. Whitt, W., The M/G/1 Processor-Sharing Queue with Long and Short Jobs, Unpublished manuscript, 1998, available at http://www.research.att.com/ resourses/trs/TRs/98/98.37/98.37.1/body.ps.
193. Whitt, W., Stochastic-Process Limits: An Introduction to Stochastic-Process Limits and Their Applications to Queues, New York: Springer, 2002.
194. Widder, D.V., The Laplace Transform, Princeton: Princeton Univ. Press, 1946.
195. Wolff, R.W., Time-Sharing with Priorities, SIAM J. Appl. Math., 1970, vol. 19, no. 3, pp. 566-574.
196. Wolff, R.W., Stochastic Modeling and the Theory of Queues, Englewood Cliffs: Prentice-Hall, 1989.
197. Wu, D.-A. and Takagi, H., Processor-Sharing and Random-Service Queues with Semi-Markovian Arrivals, J. Appl. Probab., 2005, vol. 42, no. 2, pp. 478-490.
198. Yashkov, S.F., Distribution of the Conditional Waiting Time in a System with Division of Time, Eng. Cybernetics, 1977, vol. 15, no. 5, pp. 44-52.
199. Yashkov, S.F., Properties of Invariance of Probabilistic Models of Adaptive Scheduling in Shared-Use Systems, Autom. Contr. Comput. Sci., 1980, vol. 14, no. 6, pp. 46-51.
200. Yashkov, S.F., Some Results of Analyzing a Probabilistic Model of Remote Processing Systems, Autom. Contr. Comput. Sci., 1981, vol. 15, no. 4, pp. 1-8.
201. Yashkov, S.F., System with Processor-Sharing and Its Applications in the Models of Computer Networks, VIII All-Union Conf. on Coding and Information Transmission, Kuibyshev, 1981, pp. 67-72.
202. Yashkov, S.F., A Derivation of Response Time Distribution for an M/G/1 Processor-Sharing Queue, Problems of Control and Inf. Theory, 1983, vol. 12, no. 2, pp. 133-148.
203. Yashkov, S.F., Analysis of a System with Priority-Based Processor-Sharing, Autom. Contr. Comput. Sci., 1984, vol. 18, no. 3, pp. 27-36.
204. Yashkov, S.F., New Application of Random Time Change to Analysis of Processor-Sharing Queues, 4th Int. Vilnius Conf. on Prob. Theory and Math. Statistics, Vilnius: Inst. of Math. and Cybern., 1985, vol. 4, pp. 343-345.
205. Yashkov, S.F., A Note on Asymptotic Estimates of the Sojourn Time Variance in the M/G/1 Queue with Processor-Sharing, Syst. Analysis, Modelling, Simulation, 1986, vol. 3, no. 3, pp. 267-269.
206. Yashkov, S.F., New Solutions for Processor-Sharing Queues, in 1-st World Congress of Bernoulli Soc. ISI, Prokhorov, Yu.V., Ed., Moscow: Nauka, 1986, vol. 2, pp. 558-558.
207. Yashkov, S.F., Processor-Sharing Queues: Some Progress in Analysis (Invited paper), Queueing Syst., 1987, vol. 2, no. 1, pp. 1-17.
208. Yashkov, S.F., The Non-Stationary Distribution of Numbers of Calls in the M/G/1 Processor-Sharing Queue, Proc. 3rd Int. Symp. on Systems Analysis and Simulation, Berlin: Akademie, 1988, vol. 2, reprinted in Advances in Simulation, Lukar, P.A. and Schmidt, B., eds., Berlin: Springer, 1988, vol. 2, pp. 158-162.
209. Yashkov, S.F., Analiz ocheredei v EVM (Analysis of Queues in Computers), Moscow: Radio i Svyaz', 1989.
210. Yashkov, S.F., On Method of Analysis of Processor Scharing Queue, in Teoriya teletrafika v sistemakh informatiki (Teletraffic Theory in Systems of Informatics), Moscow: Nauka, 1989, pp. 38-45.
211. Yashkov, S.F., On Some Characteristics of Non-Classical Models of Processor Sharing Queue, in Modeli i metody informatsionnykh setei (Models and Methods of Information Networks), Moscow: Nauka, 1990, pp. 14-19.
212. Yashkov, S.F., Time-Dependent Analysis of Processor-Sharing Queue, Proc. ITC-13, Queueing, Performance and Control in ATM, Cohen, J.W. and Pack, C.D., Eds., Amsterdam: Elsevier, 1991, pp. 199-204.
213. Yashkov, S.F., Mathematical Problems in the Theory of Shared-Processor Systems, J. Soviet Math., 1992, vol. 58, no. 2, pp. 101-147.
214. Yashkov, S.F., Some Limit Theorems for Processor Sharing Queueing Systems, in Long-Range Tools of Telecommunication and Integrated Communication Systems, Kuznetsov, N.A., Ed., Moscow: Inst. Problem Peredachi Inf., 1992, pp. 214-220.
215. Yashkov, S.F., On a Heavy Traffic Limit Theorem for the M/G/1 Processor-Sharing Queue, Stochastic Models, 1993, vol. 9, no. 3, pp. 467-471.
216. Yashkov, S.F., Modelling Processor Sharing Queue, Proc. of the 16th IMACS World Congress 2000 on Sci. Computation, Appl. Math. and Simulation, Lausanne, 2000.
217. Yashkov, S.F., Matematicheskie modeli sistem s razdeleniem vremeni (Mathematical Models of Time-Sharing Systems), Moscow: Inst. Problem Peredachi Inf., 2002.
218. Yashkov, S.F., On Sojourn Time Problem in Processor Sharing Queue, Int. Conf. "Kolmogorov and Contemporary Mathematics," Moscow: Moscow Gos. Univ., 2003, pp. 594-595.
219. S.F. Yashkov 2006 On Random Order of Service and Processor Sharing Information Processes 6 2 160 163
220. Yashkov, S.F., On Random Order of Service and Processor Sharing, Information Processes, 2006, vol. 6, no. 2, pp. 160-163 (available at http://www.jip.ru/ ).
221. S.F. Yashkov 2006 The Moments of the Sojourn Time in the M/G/1 Processor Sharing System Information Processes 6 3 237 249
222. Yashkov, S.F., The Moments of the Sojourn Time in the M/G/1 Processor Sharing System, Information Processes, 2006, vol. 6, no. 3, pp. 237-249 (available at http://www.jip.ru/ ).
223. S.F. Yashkov 2006 Two Special Cases of the M/G/1-EPS Queue Information Processes 6 3 250 255
224. Yashkov, S.F., Two Special Cases of the M/G/1-EPS Queue. Information Processes, 2006, vol. 6, no. 3, pp. 250-255 (available at http://www.jip.ru/ ).
225. Yashkov, S.F. and Yashkova, A.S., The M/G/1 Processor-Sharing System: The Transient Solutions, Proc. 2nd Int. Conf. on Distributed Computer Commun. Networks (DCCN'97), Tel-Aviv, 1997, Moscow: Inst. Problem Peredachi Inf., 1997, pp. 261-272.
226. Yashkov, S.F. and Yashkova, A.S., Processor Sharing Queue: Additional Results, Proc. 3rd Int. Conf. on Distributed Comput. Commun. Networks (DCCN'99), Tel-Aviv, 1999, Moscow: Inst. Problem Peredachi Inf., 1999, pp. 216-221.
227. Yashkov, S.F. and Yashkova, A.S., Processor Sharing Queue: Transient Solutions, Proc. 2nd Int. Conf. on Computer Sci. and Info. Technologies, Yerevan: Nat. Acad. of Sci. of Armeniya, 1999, pp. 99-103.
228. Yashkov, S.F. and Yashkova, A.S., On Conditions of Asymptotic Equivalence
229. S.F. Yashkov A.S. Yashkova 2004 The Time-Dependent Solution of the M/G/1-FBPS Queue Information Processes 4 2 175 187
230. Yashkov, S.F. and Yashkova, A.S., The Time-Dependent Solution of the M/G/1-FBPS Queue, Information Processes, 2004, vol. 4, no. 2, pp. 175-187 (available at http://www.jip.ru/ ).
231. S.F. Yashkov A.S. Yashkova 2004 A Note on Asymptotics Associated with Limit Theorem for Terminating Renewal Process in Processor Sharing Queue Information Processes 4 3 256 260
232. Yashkov, S.F. and Yashkova, A.S., A Note on Asymptotics Associated with Limit Theorem for Terminating Renewal Process in Processor Sharing Queue, Information Processes, 2004, vol. 4, no. 3, pp. 256-260 (available at http://www.jip.ru/ ).
233. S.F. Yashkov A.S. Yashkova 2004 Some Extension of the Heavy Traffic Limit Theorem for the M/G/1-EPS Queue Information Processes 4 3 269 274
234. Yashkov, S.F. and Yashkova, A.S., Some Extension of the Heavy Traffic Limit Theorem for the M/G/1-EPS Queue, Information Processes, 2004, vol. 4, no. 3, pp. 269-274 (available at http://www.jip.ru/ ).
235. S.F. Yashkov A.S. Yashkova 2005 Some Insight to the Time-Dependent Properties of the Queue Length Process in the M/G/1-EPS and LCFS-P Queues Information Processes 5 2 102 105
236. Yashkov, S.F. and Yashkova, A.S., Some Insight to the Time-Dependent Properties of the Queue Length Process in the M/G/1-EPS and LCFS-P Queues, Information Processes, 2005, vol. 5, no. 2, pp. 102-105 (available at http://www.jip.ru/ ).
237. Yashkov, S.F. and Yashkova, A.S., Asymptotics of the Sojourn Time in the M/G/1 System with Processor Sharing in the Case of Light Tails, Obozrenie Prikl. Promyshl. Matem., 2006, vol. 13, no. 4.
238. S.F. Yashkov A.S. Yashkova 2006 Egalitarian Processor Scharing Informatsionnye Processy 6 4 396 444
239. Yashkov, S.F. and Yashkova, A.S., Egalitarian Processor Scharing, Informatsionnye Processy, 2006, vol. 6, no. 4, pp. 396-444 (available at http://www.jip.ru/ ).
240. A.S. Yashkova 2003 A Note on Limit Theorem for Overloaded Processor Sharing Queue Information Processes 3 2 151 153
241. Yashkova, A.S., A Note on Limit Theorem for Overloaded Processor Sharing Queue, Information Processes, 2003, vol. 3, no. 2, pp. 151-153 (available at http://www.jip.ru/ ).
242. A.S. Yashkova S.F. Yashkov 2003 Distribution of the Virtual Sojourn Time in the M/G/1 Processor Sharing Queue Information Processes 3 2 128 137
243. Yashkova, A.S. and Yashkov, S.F., Distribution of the Virtual Sojourn Time in the M/G/1 Processor Sharing Queue, Information Processes, 2003, vol. 3, no. 2, pp. 128-137 (available at http://www.jip.ru/ ).
244. Zwart, A.P., Queueing Systems with Heavy Tails, PhD Dissertation, Eindhoven: Univ. of Technology, 2001.
245. Zwart, A.P. and Boxma, O.J., Sojourn Time Asymptotics in the M/G/1 Processor Sharing Queue, Queueing Syst., 2000, vol. 35, pp. 141-166.