Selfish Traffic Allocation for Server Farms

DOI10.1137/070693862MaRDI QIDQ3053156zbMATH OpenOpenAlexFDO

Authors Piotr Krysta, Berthold Vöcking, 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 anarchyrejection of customersselfish routingserver farmstraffic allocation

Mathematics Subject Classification ID

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

Recommendations

• Selfish load balancing
• Distributed Selfish Load Balancing
• Distributed selfish load balancing on networks
• Distributed selfish load balancing on networks
• Routing selfish unsplittable traffic
• Distributed selfish load balancing with weights and speeds
• Selfish Load Balancing Under Partial Knowledge
• Optimal adaptive server allocation in a network
• Selfish load balancing and atomic congestion games
• Selfish load balancing for jobs with favorite machines

Cited in

(10)

• Inefficiency in stochastic queueing systems with strategic customers
• Some anomalies of farsighted strategic behavior
• Decentralized bandwidth control subject to two-layer constraints
• The price of anarchy in an exponential multi-server
• Self-interested routing in queueing networks
• Reducing price of anarchy of selfish task allocation with more selfishness
• Performance of non-cooperative routing over parallel non-observable queues
• Fair and efficient router congestion control
• The price of anarchy in loss systems
• Game-theoretic analysis of Internet switching with selfish users

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3053156)