On power-law relationships of the internet topology

Computer Communication Review

Volumn 29, Issue 4, 1999, Pages 251-261

  Faloutsos, Michails ^a,b,c   Faloutsos, Petras ^a,b,c   Faioutsos, Christos ^a,b,c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF TORONTO   (Canada)

^c Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; ELECTRIC NETWORK TOPOLOGY; GRAPH THEORY; NETWORK PROTOCOLS;

POWER-LAWS;

INTERNET;

EID: 0033204106     PISSN: 01464833     EISSN: None     Source Type: Journal    
DOI: 10.1145/316194.316229     Document Type: Article

References (28)

1. K. Carlberg and J. Crowcroft. Building shared trees using a one-to-many joining mechanism. ACM Computer Communication Review, pages 5-11, January 1997.
2. J. Chuang and M. Sirbu. Pricing multicast communications: A cost based approach. In Proc. of the INET'98, 1998.
3. M. Crovella and A. Bestavros. Self-similarity in World Wide Web traffic, evidence and possible causes. BIOMETRICS, pages 160-169, 1996.
4. D. M. Cvetkovifc, M. Boob, and H. Sachs. Spectra of Graphs. Academic press, 1979.
5. M. Doar. A better model for generating test networks. Proc. Global Internet, IEEE, Nov. 1996.
6. Christos Faloutsos and Ibrahim Kamel. Beyond uniformity and independence: Analysis of R-trees using the concept of fractal dimension. In Proc. ACM SIGACT-SIGMODSIGART PODS, pages 4-13, Minneapolis, MN, May 24-26 1994. Also available as CS-TR-3198, UMIACS-TR-93-130.
7. M. Faloutsos, A. Banerjea, and R. Pankaj. QoSMIC: a QoS Multicast Internet protocol. ACM SIGCOMM. Computer Communication Review., Sep 2-4, Vancouver BC 1998.
8. M. Faloutsos, P. Faloutsos, and C. Faloutsos. Power-laws of the Internet topology. Technical Report UCR-CS-99-01, University of California Riverside, Computer Science, 1999.
9. National Laboratory for Applied Network Research. Routing data. Supported by NSF, http://moat.nlanr.net/Routing/rawdata/, 1998.
10. R. Govindan and A. Reddy. An analysis of internet interdomain topology and route stability. Proc. IEEE INFOCOM, Kobe, Japan, April 7-11 1997.
11. W.E. Leland, M.S. Taqqu, W. Willinger, and D.V. Wilson. On the self-similar nature of ethernet traffic. IEEE Transactions on Networking, 2(1):1-15, February 1994. (earlier version in SIGCOMM '93, pp 183-193).
12. B. Mandelbrot. Fractal Geometry of Nature. W.H. Freeman, New York, 1977.
13. J. Moy. Multicast routing extensions for OSPF. ACM Connunications, 37(8):61-66, 1994.
14. J.-J. Pansiot and D Grad. On routes and multicast trees in the Internet. ACM Computer Communication Review, 28(1):41-50, January 1998.
15. V. Paxson and S. Floyd. Wide-area traffic: The failure of poisson modeling. IEEE/ACM Transactions on Networking, 3(3):226-244, June 1995. (earlier version in SIGCOMM'94, pp. 257-268).
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.
17. G. Philips, S. Shenker, and H. Tangmunarunkit. Scaling of multicast trees: Comments on the chuang-sirbu scaling law. ACM SIGCOMM. Computer Communication Review., Sep 1999.
18. William H. Press, Saul A. Teukolsky, William T. Vetterling, and Brian P. Flannery. Numerical Recipes in C. Cambridge University Press, 2nd edition, 1992.
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.
20. S. R. Resnick. Heavy tail modeling and teletraffic data. Annals of Statistics, 25(5):1805-1869, 1997.
21. Manfred Schroeder. Fractals, Chaos, Power Laws: Minutes from an Infinite Paradise. W.H. Freeman and Company, New York, 1991.
22. D. Waitzman, C. Partridge, and S. Deering. Distance vector multicast routing protocol. IETF RFC 1075, 1998.
23. B. M. Waxman. Routing of multipoint connections. IEEE Journal of Selected Areas in Communications, pages 16171622, 1988.
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.
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. ACM SIGCOMM'95. Computer Communication Review, 25:100-113, 1995.
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.
27. E. W. Zegura, K. L. Calvert, and M. J. Donahoo. A quantitative comparison of graph-based models for internetworks. IEEE/ACM Transactions on Networking, 5(6):770-783, December 1997. http://www.cc.gatech.edu/projects/gtitmJ.
28. G.K. Zipf. Human Behavior and Principle of Least Effort: An Introduction to Human Ecology. Addison Wesley, Cambridge, Massachusetts, 1949.