Optimal routing in parallel, non-observable queues and the price of anarchy revisited

2010 22nd International Teletraffic Congress - Proceedings, ITC 22

Volumn , Issue , 2010, Pages

  Anselmi, Jonatha ^a,b   Gaujal, Bruno ^a  

^a INRIA   (France)

^b BCAM BASQUE CENTER FOR APPLIED MATHEMATICS   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

BERNOULLI; CONVEX PROGRAMMING; DECENTRALIZED SYSTEM; LOWER BOUNDS; NETWORK CAPACITY; NETWORK LOAD; NETWORK SIZE; NON-COOPERATIVE; NON-OBSERVABLE; OPTIMAL RESPONSE; OPTIMAL ROUTING; PRICE OF ANARCHY; PRICE OF FORGETTING; RESPONSE TIME; ROUTING SCHEME; UPPER BOUND; WORST-CASE PERFORMANCE;

NETWORK ROUTING; OPTIMIZATION; ROUTERS;

COSTS;

EID: 78650136544     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITC.2010.5608745     Document Type: Conference Paper

References (26)

1. E. Altman, U. Ayesta, and B. Prabhu. Optimal load balancing in processor sharing systems. In Telecomm. Syst. (to appear), 2010.
2. E. Altman, B. Gaujal, and A. Hordijk. Discrete-Event Control of Stochastic Networks: Multimodularity and Regularity. Number 1829 in LNM. Springer-Verlag, 2003.
3. J. Anselmi and B. Gaujal. On the price of anarchy and the optimal routing of parallel non-observable queues. Technical report, INRIA, 2010.
4. U. Ayesta, O. Brun, and B. Prabhu. Price of anarchy in non-cooperative load balancing. Technical report, INRIA, 2009.
5. A. Bar-Noy, R. Bhatia, J. S. Naor, and B. Schieber. Minimizing service and operation costs of periodic scheduling. Math. Oper. Res., 27(3):518-544, 2002. (Pubitemid 35022958)
6. C. H. Bell and S. Stidham. Individual versus social optimization in the allocation of customers to alternative servers. Management Science, pages 29:83-839, 1983.
7. U. N. Bhat. An Introduction to Queueing Theory: Modeling and Analysis in Applications. Birkhauser Verlag, 2008.
8. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, March 2004.
9. H.-L. Chen, J. R. Marden, and A. Wierman. The effect of local scheduling in load balancing designs. SIGMETRICS Perf. Eval. Rev., 36(2):110-112, 2008.
10. M. B. Combé and O. J. Boxma. Optimization of static traffic allocation policies. Theor. Comput. Sci., 125(1):17-43, 1994.
11. 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, pages 329-359, 1996. (Pubitemid 126729167)
12. S. C. Dafermos and F. T. Sparrow. The traffic assignment problem for a general network. J. Res. Nat. Bureau Standards,B, 73(2):91-118, 1969.
13. E. J. Friedman. Genericity and congestion control in selfish routing. In 43rd IEEE Conf. on Decision and Control, pages 4667-4672, 2003.
14. B. Gaujal, E. Hyon, and A. Jean-Marie. Optimal routing in two parallel queues with exponential service times. Discrete Event Dynamic Systems, 16(1):71-107, 2006. (Pubitemid 43261385)
15. B. Hajek. The proof of a folk theorem on queueing delay with applications to routing in networks. J. ACM, 30:834-851, 1983. (Pubitemid 14468703)
16. B. Hajek. Extremal splitting of point processes. Math. Oper. Res., 10:543-556, 1986.
17. M. Haviv and T. Roughgarden. The price of anarchy in an exponential multi-server. Op. Res. Lett., 35(4):421-426, 2007. (Pubitemid 46755919)
18. A. Hordijk and D. van der Laan. Periodic routing to parallel queues and billiard sequences. Mathematical Methods of Operations Research, 59(2):173-192, 2004. (Pubitemid 40877443)
19. F. Kelly. Network routing. Philosophical Transactions of the Royal Society A337, pages 343-367, 1991.
20. L. Kleinrock. Queueing Systems, Volume 2: Computer Applications. Wiley, 1976.
21. E. Koutsoupias and C. Papadimitriou. Worst-case equilibria. In STACS, volume 1563 of LNCS, pages 404-413, January 1999.
22. N. Nisan, T. Roughgarden, E. Tardos, and V. V. Vazirani. Algorithmic Game Theory. Cambridge University Press, New York, NY, USA, 2007.
23. T. Roughgarden. The price of anarchy is independent of the network topology. In J. of Computer and System Sciences, pages 428-437, 2002. (Pubitemid 35009403)
24. R. Subrata and A. Y. Zomaya. Game-theoretic approach for load balancing in computational grids. IEEE Trans. Parallel Distrib. Syst., 19(1):66-76, 2008. (Pubitemid 350253596)
25. J. Walrand. An Introduction to Queueing Networks. Prentice-Hall, 1988.
26. T. Wu and D. Starobinski. On the price of anarchy in unbounded delay networks. In GameNets, page 13, New York, NY, USA, 2006. ACM.