Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet

  • Alex Fabrikant
  • Elias Koutsoupias
  • Christos H. Papadimitriou
Conference paper

DOI: 10.1007/3-540-45465-9_11

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2380)
Cite this paper as:
Fabrikant A., Koutsoupias E., Papadimitriou C.H. (2002) Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet. In: Widmayer P., Eidenbenz S., Triguero F., Morales R., Conejo R., Hennessy M. (eds) Automata, Languages and Programming. ICALP 2002. Lecture Notes in Computer Science, vol 2380. Springer, Berlin, Heidelberg

Abstract

We propose a plausible explanation of the power law distributions of degrees observed in the graphs arising in the Internet topology [Faloutsos, Faloutsos, and Faloutsos, SIGCOMM 1999] based on a toy model of Internet growth in which two objectives are optimized simultaneously: “last mile” connection costs, and transmission delays measured in hops. We also point out a similar phenomenon, anticipated in [Carlson and Doyle, Physics Review E 1999], in the distribution of file sizes. Our results seem to suggest that power laws tend to arise as a result of complex, multi-objective optimization.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Alex Fabrikant
    • 1
  • Elias Koutsoupias
    • 2
  • Christos H. Papadimitriou
    • 1
  1. 1.Computer Science DivisionUniversity of California at BerkeleyBerkeleyUSA
  2. 2.Computer Science DepartmentUniversity of Athens and UCLALos AngelesUSA

Personalised recommendations