@techreport{,
TITLE = {Selfish traffic allocation for server farms},
AUTHOR = {Krysta, Piotr and Czumaj, Artur and V{\"o}cking, Berthold},
LANGUAGE = {eng},
URL = {http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/2003-1-011},
NUMBER = {MPI-I-2003-1-011},
INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {2003},
DATE = {2003},
ABSTRACT = {We study the price of selfish routing in non-cooperative<br>networks like the Internet. In particular, we investigate the<br>price of selfish routing using the coordination ratio and<br>other (e.g., bicriteria) measures in the recently introduced game<br>theoretic network model of Koutsoupias and Papadimitriou. We generalize<br>this model towards general, monotone families of cost functions and <br>cost functions from queueing theory. A summary of our main results <br>for general, monotone cost functions is as follows.},
TYPE = {Research Report / Max-Planck-Institut für Informatik},
}