Queues with equally heavy sojourn time and service requirement distributions

Annals of Operations Research

Volumn 113, Issue 1-4, 2002, Pages 101-117

  Núñez Queija, Rudesindo ^a,b  

^a CWI   (Netherlands)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

(Intermediate) regular variation; Foreground background processor sharing; Processor sharing; Queues with heavy tails; Shortest remaining processing time; Telecommunications

Indexed keywords

EID: 0141794201     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/A:1020905810996     Document Type: Conference Paper

References (27)

1. V. Anantharam, Scheduling strategies and long-range dependence, Technical Report, University of California, Berkeley, CA (1997).
2. S. Asmussen, Applied Probability and Queues (Wiley, Chichester, 1987).
3. N. Bansal and M. Harchol-Balter, Analysis of SRPT scheduling: investigating unfairness, Performance Evaluation Review 29 (2001) 279-290.
4. N.H. Bingham, C.M. Goldie and J.L. Teugels, Regular Variation (Cambridge University Press, Cambridge, 1987).
5. S.C. Borst, O.J. Boxma, J.A. Morrison and R. Núñez-Queija, The equivalence between processor sharing and service in random order, SPOR Report 2002-01, Eindhoven University of Technology (2002).
6. D.B.H. Cline, Intermediate regular and II variation, Proceedings of the London Mathematical Society (3) 68 (1994) 594-616.
7. J.W. Cohen, Some results on regular variation in queueing and fluctuation theory, Journal of Applied Probability 10 (1973) 343-353.
8. J.W. Cohen, The Single Server Queue, 2nd ed. (North-Holland, Amsterdam, 1982).
9. S.A. Grishechkin, Crump-Mode-Jagers branching processes as a method of investigating M/G/1 systems with processor sharing, Theory of Probability and Its Applications 36 (1991) 19-35; translated from Teoriya Veroyatnostei i ee Primeneniya 36 (1991) 16-33 (in Russian).
10. S.A. Grishechkin, Crump-Mode-Jagers branching processes as a method of investigating M/G/1 systems with processor sharing, Theory of Probability and Its Applications 36 (1991) 19-35; translated from Teoriya Veroyatnostei i ee Primeneniya 36 (1991) 16-33 (in Russian).
11. S.A. Grishechkin, On a relationship between processor sharing queues and Crump-Mode-Jagers branching processes, Advances in Applied Probability 24 (1992) 653-698.
12. M. Harchol-Balter, N. Bansal and B. Schroeder, Implementation of SRPT Scheduling in Web Servers, Technical Report CMU-CS-00-170, Carnegie Mellon University (2001).
13. P. Jelenković and P. Momcilović, Resource sharing with subexponential distributions, in: Proc. IEEE INFOCOM, New York (2002).
14. L. Kleinrock, Queueing Systems, Vol. II: Computer Applications (Wiley, New York, 1976).
15. W.E. Leland, M.S. Taqqu, W. Willinger and D.V. Wilson, On the self-similar nature of Ethernet traffic (extended version), IEEE/ACM Transactions on Networking 2 (1994) 1-15.
16. L. Massoulié and J.W. Roberts, Arguments in favour of admission control for TCP flows, in: Teletraffic Engineering in a Competitive World, Proc. ITC 16, Edinburgh, eds. D. Smith and P. Key (Elsevier, Amsterdam, 1999) pp. 33-44.
17. R. Núñez-Queija, Sojourn times in a processor-sharing queue with service interruptions, Queueing Systems 34 (2000) 351-386.
18. R. Núñez-Queija, Processor-sharing models for integrated-services networks, Ph.D. thesis, Eindhoven University of Technology (2000), ISBN 90-646-4667-8 (also available from the author upon request).
19. K.M. Rege and B. Sengupta, A decomposition theorem and related results for the discriminatory processor sharing queue, Queueing Systems 18 (1994) 333-351.
20. M. Sakata, S. Noguchi and J. Oizumi, Analysis of a processor-shared queueing model for time-sharing systems, in: Proc. 2nd Hawaii International Conference on System Sciences (1969) pp. 625-628.
21. M. Sakata, S. Noguchi and J. Oizumi, An analysis of the M/G/1 queue under round-robin scheduling, Operations Research 19 (1971) 371-385.
22. L.E. Schrage and L.W. Miller, The queue M/G/1 with the shortest remaining processing time discipline, Operations Research 14 (1966) 670-684.
23. D. Williams, Probability with Martingales (Cambridge University Press, Cambridge, 1991).
24. S.F. Yashkov, A derivation of response time distribution for a M/G/1 processor-sharing queue, Problems of Control and Information Theory 12 (1983) 133-148.
25. S.F. Yashkov, Processor-sharing queues: Some progress in analysis, Queueing Systems 2 (1987) 1-17.
26. S.F. Yashkov, Mathematical problems in the theory of processor-sharing queueing systems, Journal of Soviet Mathematics 58 (1992) 101-147.
27. A.P. Zwart and O.J. Boxma, Sojourn time asymptotics in the M/G/1 processor-sharing queue, Queueing Systems 35 (2000) 141-166.