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.
Research supported in part by NSF and the IST Program.
Research supported in part by an NSF ITR grant, and an IBM faculty development award.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
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.
Colin Cooper and Alan M. Frieze. A general model of undirected web graphs. In ESA, pages 500–511, 2001.
C. Faloutsos, M. Faloutsos, and P. Faloutsos. On power-law relationships of the internet topology. In Proc. SIGCOMM, 1999.
X. Gabaix. Zipf’s law for cities: an explanation. Quarterly Journal of Economics, 114:739–767, 1999.
R. Govindan. Private communication.
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.
R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Extracting large scale knowledge bases from the Web. In Proceedings of the 25th VLDB Conference, 1999.
B. Mandlebrot. An informational theory of the statistical structure of languages. In W. Jackson, editor, Communication theory, pages 486–502. Betterworth, 1953.
M. Mihail and C. Papadimitriou. Power law distribution of the Internet eigenvalues: An explanation. Unpublished.
M. Mitzenmacher. A brief history of generative models for power law and lognormal distributions. Manuscript.
V. Pareto. Cours d’Economie Politique. Dronz, Geneva Switzerland, 1896.
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.
G. Zipf. Human behavior and the principle of least effort. Addison-Wesley, Cambridge MA, 1949.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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. https://doi.org/10.1007/3-540-45465-9_11
Download citation
DOI: https://doi.org/10.1007/3-540-45465-9_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43864-9
Online ISBN: 978-3-540-45465-6
eBook Packages: Springer Book Archive