{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T18:23:17Z","timestamp":1778178197654,"version":"3.51.4"},"reference-count":19,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Performance Evaluation"],"published-print":{"date-parts":[[2004,1]]},"DOI":"10.1016\/s0166-5316(03)00097-x","type":"journal-article","created":{"date-parts":[[2003,11,19]],"date-time":"2003-11-19T15:20:47Z","timestamp":1069255247000},"page":"3-23","source":"Crossref","is-referenced-by-count":58,"title":["On the power-law random graph model of massive data networks"],"prefix":"10.1016","volume":"55","author":[{"given":"Hannu","family":"Reittu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilkka","family":"Norros","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-5316(03)00097-X_BIB1","unstructured":"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\u2013345."},{"key":"10.1016\/S0166-5316(03)00097-X_BIB2","doi-asserted-by":"crossref","unstructured":"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\u2013180.","DOI":"10.1145\/335305.335326"},{"key":"10.1016\/S0166-5316(03)00097-X_BIB3","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1038\/35019019","article-title":"Error and attack tolerance of complex networks","volume":"406","author":"Albert","year":"2000","journal-title":"Nature"},{"key":"10.1016\/S0166-5316(03)00097-X_BIB4","doi-asserted-by":"crossref","unstructured":"A.-L. Barab\u00e1si, R. Albert, Emergence of scaling in random networks, Science 286 (1999) 509\u2013512.","DOI":"10.1126\/science.286.5439.509"},{"issue":"4","key":"10.1016\/S0166-5316(03)00097-X_BIB5","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1214\/ss\/1177011122","article-title":"Statistical methods for data with long-range dependence","volume":"7","author":"Beran","year":"1992","journal-title":"Stat. Sci."},{"key":"10.1016\/S0166-5316(03)00097-X_BIB6","unstructured":"B. Bollob\u00e1s, O. Riordan, The diameter of a scale-free random graph, Combinatorica, in press."},{"key":"10.1016\/S0166-5316(03)00097-X_BIB7","doi-asserted-by":"crossref","unstructured":"A. Broido, K.C. Claffy, Internet topology: connectivity of IP graphs, in: Proceedings of the SPIE ITCom, August 2001.","DOI":"10.1117\/12.434393"},{"key":"10.1016\/S0166-5316(03)00097-X_BIB8","doi-asserted-by":"crossref","unstructured":"F. Chung, L. Lu, The average distance in a random graph with given expected degrees (full version), Internet Math. 1 (1) (2003) 91\u2013114.","DOI":"10.1080\/15427951.2004.10129081"},{"key":"10.1016\/S0166-5316(03)00097-X_BIB9","doi-asserted-by":"crossref","unstructured":"M. Faloutsos, P. Faloutsos, C. Faloutsos, On power-law relationships of the Internet topology, in: Proceedings of the ACM\/SIGCOMM\u201999, 1999, pp. 251\u2013261.","DOI":"10.1145\/316188.316229"},{"key":"10.1016\/S0166-5316(03)00097-X_BIB10","doi-asserted-by":"crossref","unstructured":"R. Govindan, H. Tangmunarunkit, Heuristics for Internet map discovery, in: Proceedings of the IEEE Infocom 2000. http:\/\/www.icsi.berkeley.edu\/\u223cramesh\/papers.html.","DOI":"10.1109\/INFCOM.2000.832534"},{"key":"10.1016\/S0166-5316(03)00097-X_BIB11","doi-asserted-by":"crossref","unstructured":"S. Janson, T. \u0141uczak, A. Ruci\u0144ski, Random Graphs, Wiley, New York, 2000.","DOI":"10.1002\/9781118032718"},{"key":"10.1016\/S0166-5316(03)00097-X_BIB12","doi-asserted-by":"crossref","first-page":"026118","DOI":"10.1103\/PhysRevE.64.026118","article-title":"Random graphs with arbitrary degree distribution and their applications","volume":"64","author":"Newman","year":"2001","journal-title":"Phys. Rev. E"},{"key":"10.1016\/S0166-5316(03)00097-X_BIB13","doi-asserted-by":"crossref","unstructured":"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\u201901, 2001, pp. 15\u201326.","DOI":"10.1145\/964723.383061"},{"key":"10.1016\/S0166-5316(03)00097-X_BIB14","doi-asserted-by":"crossref","unstructured":"K. Park, W. Willinger (Eds.), Self-similar Network Traffic and Performance Evaluation, Wiley, New York, 2000.","DOI":"10.1002\/047120644X"},{"key":"10.1016\/S0166-5316(03)00097-X_BIB15","doi-asserted-by":"crossref","unstructured":"G. Phillips, S. Shenker, H. Tangmunarunkit, Scaling of multicast trees: comments on the Chuang\u2013Sirbu scaling law, in: Proceedings of the ACM SIGCOMM\u201999, 1999, pp. 41\u201352.","DOI":"10.1145\/316188.316205"},{"key":"10.1016\/S0166-5316(03)00097-X_BIB16","doi-asserted-by":"crossref","unstructured":"H. Reittu, I. Norros, On the effect of very large nodes in Internet graphs, in: Globecom, Taipei, Taiwan, 2002.","DOI":"10.1109\/GLOCOM.2002.1189105"},{"key":"10.1016\/S0166-5316(03)00097-X_BIB17","unstructured":"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\/\u223cramesh\/papers.html."},{"key":"10.1016\/S0166-5316(03)00097-X_BIB18","doi-asserted-by":"crossref","unstructured":"H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, W. Willinger, Network topology generators: degree-based vs. structural, in: Proceedings of the SIGCOMM\u201902, Pittsburgh, USA, 2002.","DOI":"10.1145\/633025.633040"},{"issue":"6","key":"10.1016\/S0166-5316(03)00097-X_BIB19","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1109\/90.974526","article-title":"On the efficiency of multicast","volume":"9","author":"van Mieghem","year":"2001","journal-title":"IEEE\/ACM Trans. Network."}],"container-title":["Performance Evaluation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016653160300097X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016653160300097X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,27]],"date-time":"2020-03-27T03:45:20Z","timestamp":1585280720000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S016653160300097X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S016653160300097X"],"URL":"https:\/\/doi.org\/10.1016\/s0166-5316(03)00097-x","relation":{},"ISSN":["0166-5316"],"issn-type":[{"value":"0166-5316","type":"print"}],"subject":[],"published":{"date-parts":[[2004,1]]}}}