On the power-law random graph model of massive data networks

Performance Evaluation

Volumn 55, Issue 1-2, 2004, Pages 3-23

  Reittu, Hannu ^a   Norros, Ilkka ^a  

^a VTT TECHNICAL RESEARCH CENTRE OF FINLAND   (Finland)

Author keywords

Data networks; Power law; Stochastic models

Indexed keywords

APPROXIMATION THEORY; ELECTRIC NETWORK TOPOLOGY; FINITE DIFFERENCE METHOD; GRAPH THEORY; RANDOM PROCESSES;

INFINITE VARIANCE; INTERNET TOPOLOGY;

INTERNET;

EID: 0242526824     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-5316(03)00097-X     Document Type: Conference Paper

References (19)

1. C. Adjih, L. Georgiadis, P. Jacquet, W. Szpankowski, Is the Internet fractal: the multicast power law revisited, in: Proceedings of the SODA 2002, San Francisco, 2002, pp. 338-345.
2. W. Aiello, F. Chung, L. Lu, A random graph model for massive graphs, in: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, 2000, pp. 171-180.
3. Albert R., Jeong H., Barabási A.-L., Error and attack tolerance of complex networks. Nature. 406:2000;378-381.
4. A.-L. Barabási, R. Albert, Emergence of scaling in random networks, Science 286 (1999) 509-512.
5. Beran J., Statistical methods for data with long-range dependence. Stat. Sci. 7(4):1992;404-427.
6. B. Bollobás, O. Riordan, The diameter of a scale-free random graph, Combinatorica, in press.
7. A. Broido, K.C. Claffy, Internet topology: connectivity of IP graphs, in: Proceedings of the SPIE ITCom, August 2001.
8. F. Chung, L. Lu, The average distance in a random graph with given expected degrees (full version), Internet Math. 1 (1) (2003) 91-114.
9. M. Faloutsos, P. Faloutsos, C. Faloutsos, On power-law relationships of the Internet topology, in: Proceedings of the ACM/SIGCOMM'99, 1999, pp. 251-261.
10. R. Govindan, H. Tangmunarunkit, Heuristics for Internet map discovery, in: Proceedings of the IEEE Infocom 2000. http://www.icsi.berkeley.edu/̃ramesh/papers.html.
11. S. Janson, T. Lłuczak, A. Ruciński, Random Graphs, Wiley, New York, 2000.
12. Newman M.E.J., Strogatz S.H., Watts D.J., Random graphs with arbitrary degree distribution and their applications. Phys. Rev. E. 64:2001;026118.
13. K. Park, H. Lee, On the effectiveness of route-based packet filtering for distributed DoS attack prevention in power-law internets, in: Proceedings of the SIGCOMM'01, 2001, pp. 15-26.
14. K. Park, W. Willinger (Eds.), Self-similar Network Traffic and Performance Evaluation, Wiley, New York, 2000.
15. G. Phillips, S. Shenker, H. Tangmunarunkit, Scaling of multicast trees: comments on the Chuang-Sirbu scaling law, in: Proceedings of the ACM SIGCOMM'99, 1999, pp. 41-52.
16. H. Reittu, I. Norros, On the effect of very large nodes in Internet graphs, in: Globecom, Taipei, Taiwan, 2002.
17. H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, W. Willinger, Network topologies, power laws, and hierarchy, Technical Report 01-746, Computer Science Department, University of Southern California, 2001. http://www.icsi.berkeley.edu/̃ramesh/papers.html.
18. H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, W. Willinger, Network topology generators: degree-based vs. structural, in: Proceedings of the SIGCOMM'02, Pittsburgh, USA, 2002.
19. van Mieghem P., Hooghiemstra G., van der Hofstad R., On the efficiency of multicast. IEEE/ACM Trans. Network. 9(6):2001;719-732.