Heuristically optimized trade-offs: A new paradigm for power laws in the Internet

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2380 LNCS, Issue , 2002, Pages 110-122

  Fabrikant, Alex ^a   Koutsoupias, Elias ^b,c   Papadimitriou, Christos H ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF ATHENS   (Greece)

^c University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CARLSON; CONNECTION-COSTS; FILE SIZES; INTERNET GROWTH; INTERNET TOPOLOGIES; LAST MILE; MULTI OBJECTIVE OPTIMIZATIONS (MOO); POWER LAW DISTRIBUTION; POWER-LAW; TOY MODELS; TRANSMISSION DELAYS;

AUTOMATA THEORY; MULTIOBJECTIVE OPTIMIZATION; TOPOLOGY;

INTERNET;

EID: 84869169288     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (15)

1. Béla Bollobás, Oliver Riordan, Joel Spencer, and Gábor Tusnády. The degree sequence of a scale-free random graph process. Random Structures and Algorithms, 18(3):279-290, 2001.
2. J. M. Carlson and J. Doyle. Highly optimized tolerance: a mechanism for power laws in designed systems. Physics Review E, 60(2):1412-1427, 1999.
3. Manuel Castells. The Internet Galaxy: Re ections on the Internet, Business, and Society. Oxford, 2001. http://www.oup.co.uk/isbn/0-19-924153-8.
4. Colin Cooper and Alan M. Frieze. A general model of undirected web graphs. In ESA, pages 500-511, 2001.
5. C. Faloutsos, M. Faloutsos, and P. Faloutsos. On power-law relationships of the internet topology. In Proc. SIGCOMM, 1999.
6. X. Gabaix. Zipf's law for cities: an explanation. Quarterly Journal of Economics, 114:739-767, 1999.
7. R. Govindan. Private communication.
8. R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal. Stochastic models for the web graph. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science, pages 57-65, 2000.
9. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Extracting large scale knowledge bases from theWeb. In Proceedings of the 25th VLDB Conference, 1999.
10. B. Mandlebrot. An informational theory of the statistical structure of languages. In W. Jackson, editor, Communication theory, pages 486-502. Betterworth, 1953.
11. M. Mihail and C. Papadimitriou. Power law distribution of the Internet eigenvalues: An explanation. Unpublished.
12. M. Mitzenmacher. A brief history of generative models for power law and lognormal distributions. Manuscript.
13. V. Pareto. Cours d'Economie Politique. Dronz, Geneva Switzerland, 1896.
14. H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, and W. Willinger. Network topologies, power laws, and hierarchy. Technical Report 01-746, Computer Science Department, University of Southern California, 2001. To appear in Computer Communication Review.
15. G. Zipf. Human behavior and the principle of least effort. Addison-Wesley, Cambridge MA, 1949.