The price of forgetting in parallel and non-observable queues

Performance Evaluation

Volumn 68, Issue 12, 2011, Pages 1291-1311

  Anselmi, J ^a,b   Gaujal, B ^a  

^a UNIV GRENOBLE ALPES   (France)

^b BCAM BASQUE CENTER FOR APPLIED MATHEMATICS   (Spain)

Author keywords

Minimum mean response time; Optimal routing; Parallel queues; Price of forgetting; Revisited price of anarchy

Indexed keywords

MEAN RESPONSE TIME; OPTIMAL ROUTING; PARALLEL QUEUES; PRICE OF FORGETTING; REVISITED PRICE OF ANARCHY;

GAME THEORY; NETWORK ROUTING; OPTIMIZATION; PROBABILITY DISTRIBUTIONS; QUEUEING THEORY;

COSTS;

EID: 80054850283     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.peva.2011.07.023     Document Type: Article

References (34)

1. V. Berten, and B. Gaujal Brokering strategies in computational grids using stochastic prediction models Parallel Comput. 33 2007 238 249 (Pubitemid 46590436)
2. J. Nio-Mora Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach Math. Program. 93 2002 361 413
3. R. Weber, and G. Weiss On an index policy for restless bandits J. Appl. Probab. 27 1990 637 648
4. M. Mitzenmacher How useful is old information? IEEE Trans. Parallel Distrib. Syst. 11 2000 6 20 (Pubitemid 32132996)
5. C.H. Bell, and S. Stidham Individual versus social optimization in the allocation of customers to alternative servers Manage. Sci. 29 1983 831 839
6. M.B. Combé, and O.J. Boxma Optimization of static traffic allocation policies Theoret. Comput. Sci. 125 1994 17 43
7. X. Guo, Y. Lu, and M.S. Squillante Optimal probabilistic routing in distributed parallel queues SIGMETRICS Perform. Eval. Rev. 32 2004 53 54
8. J. Walrand An Introduction to Queueing Networks 1988 Prentice-Hall
9. B. Hajek Extremal splitting of point processes Math. Oper. Res. 10 1986 543 556
10. A. Bar-Noy, R. Bhatia, J.S. Naor, and B. Schieber Minimizing service and operation costs of periodic scheduling Math. Oper. Res. 27 2002 518 544 (Pubitemid 35022958)
11. B. Gaujal, E. Hyon, and A. Jean-Marie Optimal routing in two parallel queues with exponential service times Discrete Event Dyn. Syst. 16 2006 71 107 (Pubitemid 43261385)
12. T. Thanalapati, and S. Dandamudi An efficient adaptive scheduling scheme for distributed memory multicomputers IEEE Trans. Parallel Distrib. Syst. 12 2001 758 768 (Pubitemid 32720359)
13. I. Al-Azzoni, and D.G. Down Dynamic scheduling for heterogeneous desktop grids GRID'08: Proceedings of the 2008 9th IEEE/ACM International Conference on Grid Computing 2008 IEEE Computer Society Washington, DC, USA 136 143
14. B. Javadi, D. Kondo, J.-M. Vincent, D. Anderson, Discovering statistical models of availability in large distributed systems: An empirical study of SETI@home. IEEE Trans. Parallel Distrib. Syst. (2011) (in press).
15. B. Schroeder, and M. Harchol-Balter Evaluation of task assignment policies for supercomputing servers: the case for load unbalancing and fairness Cluster Computing 7 2004 151 161
16. M. Harchol-Balter Task assignment with unknown duration J. ACM 49 2002 260 288 (Pubitemid 44159322)
17. Y. Arian, and Y. Levy Algorithms for generalized round robin routing Oper. Res. Lett. 12 1992 313 319
18. A. Hordijk, and D. van der Laan Periodic routing to parallel queues and billiard sequences Math. Methods Oper. Res. 59 2004 173 192 (Pubitemid 40877443)
19. E. Koutsoupias, and C. Papadimitriou Worst-case equilibria STACS Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science vol. 1563 1999 Springer Verlag Berlin 404 413
20. J. Anselmi, and B. Gaujal The price of anarchy in parallel queues revisited SIGMETRICS Perform. Eval. Rev. 38 2010 353 354
21. J. Anselmi, B. Gaujal, Optimal routing in parallel, non-observable queues and the price of anarchy revisited, in: 22nd International Teletraffic Congress, ITC-22, pp. 18.
22. E. Altman, B. Gaujal, and A. Hordijk Discrete-Event Control of Stochastic Networks: Multimodularity and Regularity LNM vol. 1829 2003 Springer-Verlag
23. B. Hajek The proof of a folk theorem on queueing delay with applications to routing in networks J. ACM 30 1983 834 851 (Pubitemid 14468703)
24. L. Kleinrock Queueing Systems, Volume 2: Computer Applications 1976 Wiley
25. S. Boyd, and L. Vandenberghe Convex Optimization 2004 Cambridge University Press
26. U.N. Bhat An Introduction to Queueing Theory: Modeling and Analysis in Applications 2008 Birkhauser Verlag
27. R.M. Corless, G.H. Gonnet, D.E.G. Hare, D.J. Jerey, and D.E. Knuth On the Lambert w function Adv. Comput. Math. 1996 329 359 (Pubitemid 126729167)
28. M. Haviv, and T. Roughgarden The price of anarchy in an exponential multi-server Oper. Res. Lett. 35 2007 421 426 (Pubitemid 46755919)
29. J.F.C. Kingman Some inequalities for the queue gi/g/1 Biometrika 49 1962 315 324
30. N. Nisan, T. Roughgarden, E. Tardos, and V.V. Vazirani Algorithmic Game Theory 2007 Cambridge University Press New York, NY, USA
31. T. Roughgarden The price of anarchy is independent of the network topology J. Comput. System Sci. 67 2003 341 364
32. T. Wu, and D. Starobinski A comparative analysis of server selection in content replication networks IEEE/ACM Trans. Netw. 16 2008 1461 1474
33. H.-L. Chen, J.R. Marden, and A. Wierman The effect of local scheduling in load balancing designs SIGMETRICS Perform. Eval. Rev. 36 2008 110 112
34. U. Ayesta, O. Brun, and B.J. Prabhu Price of anarchy in non-cooperative load balancing INFOCOM'10 2010 IEEE Press Piscataway, NJ, USA 436 440