Systems with multiple servers under heavy-tailed workloads

Performance Evaluation

Volumn 62, Issue 1-4, 2005, Pages 456-474

  Psounis, Konstantinos ^a   Molinero Fernández, Pablo ^b,e   Prabhakar, Balaji ^c   Papadopoulos, Fragkiskos ^d  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^b Stanford University   (United States)

^c STANFORD UNIVERSITY   (United States)

^d NONE   (United States)

^e NetSpira Networks   (Spain)

Author keywords

Blocking probability; Expected delay; Heavy tailed size distribution; M G K queue; Multi server computer systems; Practical approximation formula

Indexed keywords

APPROXIMATION THEORY; COMMUNICATION SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; PROBABILITY; REAL TIME SYSTEMS; RESPONSE TIME (COMPUTER SYSTEMS); SCHEDULING; SERVERS; SUPERCOMPUTERS; WEBSITES;

BLOCKING PROBABILITY; EXPECTED DELAY; HEAVY-TAILED SIZE DISTRIBUTION; M/G/K QUEUE; MULTI-SERVER COMPUTER SYSTEMS; PRACTICAL APPROXIMATION FORMULA;

COMPUTER SYSTEMS;

EID: 24144501279     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.peva.2005.07.030     Document Type: Conference Paper

References (39)

1. R.W. Wolff, Stochastic, Modelling and the Theory of Queues, Prentice Hall, New Jersey, 1989.
2. M. Harchol-Balter, A. Downey, Exploiting process lifetime distributions for dynamic load balancing, ACM Trans. Comput. Syst. 15 (3) (1996).
3. W. Leland, and T. Ott Load-balancing heuristics and process behavior Proceedings of the ACM SIGMETRICS Conference 1986
4. W. Willinger, M.S. Taqqu, R. Sherman, and D.V. Wilson Self-similarity through high-variability: statistical analysis of Ethernet LAN traffic at the source level IEEE/ACM Trans. Network. 5 1 1997 71 86
5. B. Krishnamurthy, J. Rexford, Web Protocols and Practice, Addison Wesley, Boston, MA, 2001 (Chapter 10).
6. L. Schrage A proof of the optimality of the shortest remaining processing time discipline Oper. Res. 16 3 May-June 1968 687 690
7. M. Harchol-Balter, M. Crovella, and C. Murta On choosing a task assignment policy for a distributed server system J. Parallel Distrib. Comput. 59 2 November 1999 204 228
8. M. Halchol-Balter, Task assignment with unknown durations, J. ACM 49 (2) (2002).
9. J. Kollerstrom Heavy traffic theory for queues with several servers J. Appl. Prob. 11 1974 544 552
10. T. Kimura Diffusion approximation for an M/G/m queue Oper. Res. 31 2 1983 304 321
11. D.D. Yao Refining the diffusion approximation for the M/G/m queue Oper. Res. 33 6 1985 1266 1277
12. M. Miyazawa Approximation of the queue-length distribution of an M/GI/s queue by the basic equations J. Appl. Prob. 23 1986 443 458
13. W. Whitt Approximations for the GI/G/m queue Prod. Oper. Manage. 2 2 1993 114 161
14. T. Kimura Approximations for the delay probability in the M/G/s queue Math. Comput. Modell. 22 10-12 1995 157 165
15. B.N.W. Ma, and J.W. Mark Approximation of the mean queue length of an M/G/c queueing system Oper. Res. 43 1 1995 158 165
16. C.L. Wang, and R.W. Wolff The M/G/c queue in light traffic Queueing Syst. 29 1998 17 34
17. W. Whitt The impact of a heavy-tailed service-time distribution upon the M/GI/s waiting-time distribution Queueing Syst. 36 2000 71 87
18. A. Scheller-Wolf, and K. Sigman New bounds for expected delay in FIFO GI/GI/c queues Queueing Syst. 26 1997 169 186
19. D. Stoyan, Comparison Methods for Queues and Other Stochastic Models, Wiley Series in Probability and Mathematical Statistics, 1983.
20. P. Hokstad Approximations for the M/G/m queue Oper. Res. 26 3 1978 510 523
21. A.M. Lee, and P.A. Longton Queueing processes associated with airline passenger check-in Oper. Res. Quart. 10 1957 56 71
22. D. Stoyan Approximations for M/G/s queues Mathematische Operationsforschung und Statistik 7 4 1976 587 594
23. S. Nozaki, and R. Ross Approximations in finite capacity multiserver queues with Poisson Arrivals J. Appl. Prob. 13 1978 826 834
24. O.J. Boxma, J.W. Cohen, and N. Huffels Approximations of the mean waiting time in an M/G/s queueing system Oper. Res. 27 6 1979 1115 1127
25. G.P. Cosmetatos Some approximate equilibrium results for the multiserver queue M/G/r Oper. Res. Quart. 27 1976 615 620
26. H.C. Tijms, M.H. van Hoorn, and A. Federgruen Approximations for the steady-state probabilities in the M/G/c queue Adv. Appl. Prob. 13 1981 186 206
27. D. Burman, and D.R. Smith A light-traffic theorem for multi-server queues Math. Oper. Res. 8 1 1983 15 24
28. P. Barford, A. Bestavros, A. Bradley, and M. Crovella Changes in web client access patterns: characteristics and caching implications WWW J. 2 1-2 June 1999 15 28
29. P. Barford, M. Crovella, Generating representative web workloads for network and server performance evaluation, Proceedings of ACM SIGMETRIGS Conference, 1998, pp. 151-160.
30. A. Feldmann Characteristics of TCP connection arrivals K. Park W. Willinger Self-Similar Network Traffic and Performance Evaluation 2000 Wiley
31. A. Feldmann, A.C. Gilbert, W. Willinger, Data networks as cascades: investigating the multifractal nature of Internet WAN traffic, Proceedings of ACM SIGCOMM, 1998, pp. 42-55.
32. C.J. Nuzman, I. Saniee, W. Sweldens, and A. Weiss A compound model for TCP connection arrivals Proceedings of ITC Seminar on IP Traffic Modeling 2000 Monterey
33. V. Paxson, and S. Floyd Wide area traffic: the failure of Poisson modeling IEEE/ACM Trans. Network. 3 3 1995 226 244
34. W.S. Cleveland, D. Lin, and D.X. Sun IP packet generation: statistical models for TCP start times based on connection-rate superposition Proceedings of ACM SIGMETRICS 2000 166 177
35. S.B. Fredj, T. Bonalds, A. Prutiere, G. Gegnie, J. Roberts, Statistical bandwidth sharing: a study of congestion at flow level, Proceedings of ACM SIGCOMM, 2001, pp. 111-120.
36. Sprint ATL, Sprint network traffic flow traces, 2002, http://www.sprintlabs.com/Department/IP-Interworking/Monitor/.
37. L. Kleinrock, Queueing Systems Volume II: Computer Applications, John Wiley and Sons, New Jersey, 1976, pp. 15-19.
38. Y. Takahashi An approximation formula for the mean waiting time of an m/g/c queue J. Oper. Res. Soc. Japan 20 1977 150 163
39. M. Abramowitz, I.A. Stegun, Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables, Dover, New York, 1972, 11 pp.