Selfish Traffic Allocation for Server Farms

DOI10.1137/070693862zbMath1208.60089OpenAlexW1980762603MaRDI QIDQ3053156

Berthold Vöcking, Piotr Krysta, Artur Czumaj

Publication date: 4 November 2010

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: http://wrap.warwick.ac.uk/3319/1/WRAP_Cjumaz_Selfish_traffic.pdf

zbMATH Keywords

game theorynon-cooperative gamesprice of anarchyselfish routingtraffic allocationrejection of customersserver farms

Mathematics Subject Classification ID

Noncooperative games (91A10) Applications of game theory (91A80) Stochastic network models in operations research (90B15) Queueing theory (aspects of probability theory) (60K25)

Related Items (5)

Reducing price of anarchy of selfish task allocation with more selfishness ⋮ PERFORMANCE OF NON-COOPERATIVE ROUTING OVER PARALLEL NON-OBSERVABLE QUEUES ⋮ Decentralized bandwidth control subject to two-layer constraints ⋮ Inefficiency in stochastic queueing systems with strategic customers ⋮ Some anomalies of farsighted strategic behavior

This page was built for publication: Selfish Traffic Allocation for Server Farms