Michalis Faloutsos
Christos Faloutsos
Abstract
Despite the apparent randomness of the Internet, we discover some surprisingly simple power-laws of the Internet topology. These power-laws hold for three snapshots of the Internet, between November 1997 and December 1998, despite a 45% growth of its size during that period. We show that our power-laws fit the real data very well resulting in correlation coefficients of 96% or higher.Our observations provide a novel perspective of the structure of the Internet. The power-laws describe concisely skewed distributions of graph properties such as the node outdegree. In addition, these power-laws can be used to estimate important parameters such as the average neighborhood size, and facilitate the design and the performance analysis of protocols. Furthermore, we can use them to generate and select realistic topologies for simulation purposes.
- 1 K. Carlberg and J. Crowcroft. Building shared trees using a one-to-many joining mechanism. A CM Computer Communication Review, pages 5-ll, January 1997.]] Google Scholar
Digital Library
- 2 J. Chuang and M. Sirbu. Pricing multicast communications: A cost based approach. In Proc. of the {NET'98, 1998.]]Google Scholar
- 3 M. Crovella and A. Bestavros. Self-similarity in World Wide Web traffic, evidence and possible causes. SIGMETRICS, pages 160-169, 1996.]] Google ScholarDigital Library
- 4 D. M. Cvetkovii~, M. Boob, and H. Sachs. Spectra of Graphs. Academic press, 1979.]]Google Scholar
- 5 M. Doar. A better model for generating test networks. Proc. Global Internet, IEEE, Nov. 1996.]]Google ScholarCross Ref
- 6 Christos Faloutsos and Ibrahim Kamel. Beyond uniformity and independence: Analysis of R-trees using the concept of fractaI dimension. In Proc. A CM SIGACT-SIGMOD- SIGART PODS, pages 4-13, Minneapolis, MN, May 24-26 1994. Also available as CS-TR-3198, UMIACS-TR-93-130.]] Google ScholarDigital Library
- 7 M. Faloutsos, A. Banerjea, and R. Pankaj. QoSMIC: a QoS Multicast Internet protocol. A CM SIGCOMM. Computer Communication Review., Sep 2-4, Vancouver BC 1998.]] Google ScholarDigital Library
- 8 M. Faloutsos, P. FaIoutsos, and C. Faloutsos. Power-laws of the Internet topology. Technical Report UCR-CS-99-01, University of California Riverside, Computer Science, 1999.]]Google Scholar
- 9 National Laboratory for Applied Network Research. Routing data. Supported by NSF, http://moat.nlanr.net/Routing/rawdata/, 1998.]]Google Scholar
- 10 R. Govindan and A. Reddy. An analysis of internet interdomain topology and route stability. Proc. IEEE INFO- COM, Kobe, Japan, April 7-11 1997.]] Google ScholarDigital Library
- 11 W.E. Leland, M.S. Taqqu, W. Willinger, and D.V. Wilson. On the self-similar nature of ethernet traffic. IEEE 2~ansactions on Networking, 2(1):1-15, February 1994. (earlier version in SIGCOMM '93, pp 183-193).]] Google ScholarDigital Library
- 12 B. Mandelbrot. Fractal Geometry of Nature. W.H. Freeman, New York, I977.]]Google Scholar
- 13 J. Moy. Multicast routing extensions for OSPF. ACM Uonnunications, 37(8):61-66, 1994.]] Google ScholarDigital Library
- 14 J.-J. Pansiot and D Grad. On routes and multicast trees in the Internet. A CM Computer Communication Review, 28(1):41-50, January 1998.]] Google ScholarDigital Library
- 15 V. Paxson and S. Floyd. Wide-area traffic: The failure of poisson modeling. IEEB/A CM Transactions on Networking, 3(3):226-244, June 1995. (earlier version in SIGCOMM'94, pp. 257- 268).]] Google ScholarDigital Library
- 16 V. Paxson and S. Floyd. Why we don't know how to simulate the internet. Proceedings of the 1997 Winter Simulation Conference, December 1997.]] Google ScholarDigital Library
- 17 G. Philips, S. Shenker, and H. Tangmunarunkit. Scaling of multicast trees: Comments on the chuang-sirbu scaling law. A CM SIGCOMM. Computer Communication Review., Sep 1999.]] Google ScholarDigital Library
- 18 William H. Press, Saul A. Teukolsky, William T. Vetterling, and Brian P. Flannery. Numerical Recipes in C. Cambridge University Press, 2nd edition, 1992.]]Google Scholar
- 19 Y. Rekhter and T. Li (Eds). A Border Gateway Protocol 4 (BGP-4). Internet-Draft:draft-ietf-idr-bgp4-08.txt available from ftp://ftp.ietf, org/internet-drafts/, 1998.]] Google ScholarDigital Library
- 20 S. R. Resnick. Heavy tail modeling and teletraffic data. Annals of Statistics, 25(5):1805-1869, 1997.]]Google ScholarCross Ref
- 21 Manfred Schroeder. Fructals, Chaos. Power Laws: Minutes from an Infinite Paradise. W.H. Freeman and Company, New York, 1991.]]Google Scholar
- 22 D. Waitzman, C. Partridge, and S. Deering. Distance vector multicast routing protocol. IETF RFC 1075, 1998.]] Google ScholarDigital Library
- 23 B. M. Waxman. Routing of multipoint connections. IEEE Journal of Selected Areas in Communications, pages 1617- 1622, 1988.]]Google ScholarDigital Library
- 24 W. Willinger, V. Paxson, and M.S. Taqqu. Self-similarity and heavy tails: Structural modeling of network traffic. In A Practical Guide to Heavy Tails: Statistical Techniques and Applications, 1998. Adler, R., Feldman, R., and Taqqu, M.S., editors, Birkhauser.]] Google ScholarDigital Library
- 25 Walter Willinger, Murad Taqqu, Robert Sherman, and Daniel V. Wilson. Self-similarity through high variability: statistical analysis of ethernet LAN traffic at the source level. A CM SIGCOMM'95. Computer Communication Review, 25:100-113, 1995.]] Google ScholarDigital Library
- 26 D. Zappala, D. Estrin, and S. Shenker. Alternate path routing and pinning for interdomain multicast routing. Technical Report USC CS TR 97-655, U. of South California, 1997.]]Google Scholar
- 27 E. W. Zegura, K. L. Calvert, and M. J. Donahoo. A quantitative comparison of graph-based models for internetworks. IEEE/A CM 7bansactions on Networking, 5(6):770-783, December 1997. http: //www.cc.gatech.edu/projects/gtitm/.]] Google ScholarDigital Library
- 28 G.K. Zipf. Human Behavior and Principle of Least Effort: An Introduction to Human Ecology. Addison Wesley, Cambridge, Massachusetts, 1949.]]Google Scholar
Index Terms
-
On power-law relationships of the Internet topology
-
Recommendations
-
On power-law relationships of the Internet topology
SIGCOMM '99: Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communicationDespite the apparent randomness of the Internet, we discover some surprisingly simple power-laws of the Internet topology. These power-laws hold for three snapshots of the Internet, between November 1997 and December 1998, despite a 45% growth of its ...
-
On an IBA Topology Model for Internet Topology Structure
NSWCTC '10: Proceedings of the 2010 Second International Conference on Networks Security, Wireless Communications and Trusted Computing - Volume 02Modeling of Internet topology structure is studied in this paper. First, measuring results of Internet topology from CAIDA monitors were handled to produce a complete topology sample. With this sample, research approaches of the frequency-degree power-...
-
On the Packet Delay Distribution in Power-Law Networks
INTERNET '09: Proceedings of the 2009 First International Conference on Evolving InternetMeasurement studies of the Internet topology have revealed that the degree distribution exhibits a power-law attribute. That is, the probability P(k) that a node has k outgoing links follows P(k) ~ k^{γ}. However, it is known that the power-law degree ...
Comments