English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Report

Selfish traffic allocation for server farms

MPS-Authors
/persons/resource/persons44853

Krysta,  Piotr
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44276

Czumaj,  Artur
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45673

Vöcking,  Berthold
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

2003-1-011
(Any fulltext), 12KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Krysta, P., Czumaj, A., & Vöcking, B.(2003). Selfish traffic allocation for server farms (MPI-I-2003-1-011). Saarbrücken: Max-Planck-Institut für Informatik.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-6B33-E
Abstract
We study the price of selfish routing in non-cooperative networks like the Internet. In particular, we investigate the price of selfish routing using the coordination ratio and other (e.g., bicriteria) measures in the recently introduced game theoretic network model of Koutsoupias and Papadimitriou. We generalize this model towards general, monotone families of cost functions and cost functions from queueing theory. A summary of our main results for general, monotone cost functions is as follows.