Sojourn times in non-homogeneous QBD processes with processor sharing

Communications in Statistics. Part C: Stochastic Models

Volumn 17, Issue 1, 2001, Pages 61-92

  Núñez Queija, Rudesindo ^a  

^a CWI   (Netherlands)

Author keywords

(Discriminatory) processor sharing; Quasi birth death process; Random environment; Random time change; Sojourn time; Varying service rate

Indexed keywords

EID: 0012881675     PISSN: 08820287     EISSN: None     Source Type: Journal    
DOI: 10.1081/stm-100001400     Document Type: Article

References (39)

1. ATM Forum Technical Committee. Traffic Management Specification; Version 4.0; April, 1996.
2. Van der Wal, K.; Mandjes, M.R.H.; Bastiaansen, H. Delay Performance Analysis of the new Internet Services with Guaranteed QoS. Proc. of the IEEE 1997, 85, 1947-1957.
3. White, P.; Crowcroft, J. The Integrated Services in the Internet: State of the Art. Proc. of the IEEE 1997, 85, 1934-1946.
4. Núñez Queija, R.; Van den Berg, J.L.; Mandjes, M.R.H. Performance Evaluation of Strategies for Integration of Elastic and Stream Traffic. In Teletraffic Engineering in a Competitive World, Proceedings of the 16th International Teletraffic Congress, Edinburgh; Key, P., Smith, D., Eds.; Elsevier: Amsterdam, 1999.
5. Kleinrock, L. Analysis of a Time-Shared Processor. Naval Res. Logistics Quarterly 1964, 11, 59-73.
6. Kleinrock, L. Time-Shared Systems: A Theoretical Treatment. J. Assoc. Comput. Mach. 1967, 14, 242-261.
7. Sakata, M.; Noguchi, S.; Oizumi, J. Analysis of a Processor Shared Queueing Model for Time Sharing Systems. In Proc. 2nd Int. Conf. on System Sciences, Hawaii, 1969, 625-628.
8. Kleinrock, L. Queueing Systems, Vol. II: Computer Applications; Wiley: New York, 1976.
9. Cohen, J.W. The Multiple Phase Service Network with Generalized Processor Sharing. Acta Informatica 1979, 12, 245-284.
10. Núñez Queija, R. Sojourn Times in a Processor Sharing Queue with Service Interruptions. Queueing Syst. 2000, 34, 351-386.
11. Yashkov, S.F. A Derivation of Response Time Distribution for a M/G/1 Processor Sharing Queue. Probl. Control and Inf. Theory 1983, 12, 133-148.
12. Neuts, M.F. Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach; Johns Hopkins: Baltimore, U.S., 1981.
13. De Nitto Personè, V.; Grassi, V. Solution of Finite QBD Processes. J. Appl. Probab. 1996, 33, 1003-1010.
14. Li, S.-Q.; Sheng, H.-D. Generalized Folding-Algorithm for Sojourn Time Analysis of Finite QBD Processes and its Queueing Applications. Comm. Statist. Stochastic Models 1996, 12, 507-522.
15. Iyer, B.R.; Donatiello, L.; Heidelberger, P. Analysis of Performability for Stochastic Models of Fault-Tolerant Systems. IEEE Trans. on Comp. 1986, C-35, 902-907.
16. Smith, R.M.; Trivedi, K.S.; Ramesh, A.V. Performability Analysis: Measures, an Algorithm, and a Case Study. IEEE Trans. on Comp. 1988, 37, 406-417.
17. Reibman, A.; Smith, R.M.; Trivedi, K.S. Markov and Markov Reward Model Transient Analysis: An Overview of Numerical Approaches. Eur. J. Oper. Res. 1989, 40, 257-267.
18. Howard, R.A. Dynamic Programming and Markov Processes; M.I.T. Press: New York, 1960.
19. Tijms, H.C. Stochastic Models: An Algorithmic Approach; Wiley: Chichester, England, 1994.
20. Zijm, W.H.M. Exponential Convergence in Undiscounted Continuous-Time Markov Decision Chains. Math. of Operations Res. 1987, 12, 700-717.
21. Coffman, E.G.; Muntz, R.R.; Trotter, H. Waiting Time Distributions for Processor-Sharing Systems. J. Assoc. Comput. Mach. 1970, 17, 123-130.
22. Yashkov, S.F. New Applications of Random Time Change to the Analysis of Processor-Sharing Queues. In Proceedings of the 4th International Conference on Probability Theory and Mathematical Statistics, Vilnius, 1985, 343-345.
23. Foley, R.D.; Klutke, G.-A. Stationary Increments in the Accumulated Work Process in Processor-Sharing Queues. J. Appl. Probab. 1989, 26, 671-677.
24. Grishechkin, S.A. Crump-Mode-Jagers Branching Processes as a Method of Investigating M/G/1 Systems with Processor Sharing. Theory Probab. Appl. 1991, 36, 19-35;
25. translated from Teor. Veroyatnost. i Primenen. 1991, 36, 16-33 (in Russian).
26. Grishechkin, S.A. On a Relationship between Processor-Sharing Queues and Crump-Mode-Jagers Branching Processes. Adv. in Appl. Probab. 1992, 24, 653-698.
27. Yashkov, S.F. Mathematical Problems in the Theory of Processor-Sharing Queueing Systems. J. Soviet Math. 1992, 58, 101-147.
28. Ross, S.M. Applied Probability Models with Optimization Applications; Holden-Day: San Francisco, 1970.
29. Wolff, R.W. Time Sharing with Priorities. SIAM J. Appl. Math. 1970, 19, 566-574.
30. Van den Berg, J.L. Sojourn Times in Feedback and Processor Sharing Queues, Ph.D. Thesis; Rijksuniversiteit Utrecht, 1990.
31. Van den Berg, J.L.; Boxma, O.J. The M/G/1 Queue with Processor Sharing and its Relation to a Feedback Queue. Queueing Syst. 1991, 9, 365-401.
32. Donatiello, L.; Grassi, V. On Evaluating the Cumulative Performance Distribution of Fault-Tolerant Computer Systems. IEEE. Trans. on Comp. 1991, 40, 1301-1307.
33. Nabli, H.; Sericola, B. Performability Analysis: A New Algorithm. IEEE Trans. on Comp. 1996, 45, 491-494.
34. De Souza e Silva, E.; Gail, H.R. An Algorithm to Calculate Transient Distributions of Cumulative Rate and Impulse Based Reward. Comm. Statist. Stochastic Models 1998, 14, 509-536.
35. Sennott, L.I. Value Iteration in Countable State Average Cost Markov Decision Processes with Unbounded Costs. Ann. Oper. Res. 1991, 28, 261-271.
36. Krieger, U.R.; Naoumov, V.; Wagner, D. Analysis of a Versatile Multi-Class Delay-Loss System with a Superimposed Markovian Arrival Process. Eur. J. Oper. Res. 1998, 108, 425-437.
37. Núñez Queija, R. Processor-Sharing Models for Integrated-Services Networks, Ph.D. Thesis; Eindhoven University of Technology, 2000; ISBN 90-646-4667-8, http://www.cwi.nl/∼sindo.
38. Puterman, M.L. Markov Decision Processes: Discrete Stochastic Dynamic Programming; Wiley: New York, 1994.
39. Yashkov, S.F. Processor-Sharing Queues: Some Progress in Analysis. Queueing Syst. 1987, 2, 1-17.