{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T06:25:05Z","timestamp":1769840705295,"version":"3.49.0"},"reference-count":57,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2019,11,8]],"date-time":"2019-11-08T00:00:00Z","timestamp":1573171200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGCOMM Comput. Commun. Rev."],"published-print":{"date-parts":[[2019,11,8]]},"abstract":"<jats:p>\n            Our main purpose for this editorial is to reiterate the main message that we tried to convey in our SIGCOMM'04 paper but that got largely lost in all the hype surrounding the use of scale-free network models throughout the sciences in the last two decades. That message was that because of (1) the Internet's highly-engineered architecture, (2) a thorough understanding of its component technologies, and (3) the availability of extensive (but typically noisy) measurements, this complex man-made system affords unique opportunities to unambiguously resolve most claims about its properties, structure, and functionality. In the process, we point out the fallacy of popular approaches that consider complex systems such as the Internet from the perspective of\n            <jats:italic>disorganized complexity<\/jats:italic>\n            and argue for renewed efforts and increased focus on advancing an \"architecture first\" view with its emphasis on studying the\n            <jats:italic>organized complexity<\/jats:italic>\n            of systems such as the Internet.\n          <\/jats:p>","DOI":"10.1145\/3371934.3371964","type":"journal-article","created":{"date-parts":[[2019,11,8]],"date-time":"2019-11-08T20:27:58Z","timestamp":1573244878000},"page":"96-103","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Lessons from \"a first-principles approach to understanding the internet's router-level topology\""],"prefix":"10.1145","volume":"49","author":[{"given":"David L.","family":"Alderson","sequence":"first","affiliation":[{"name":"Naval Postgraduate School"}]},{"given":"John C.","family":"Doyle","sequence":"additional","affiliation":[{"name":"Caltech"}]},{"given":"Walter","family":"Willinger","sequence":"additional","affiliation":[{"name":"NIKSUN, Inc."}]}],"member":"320","published-online":{"date-parts":[[2019,11,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015467.1015470"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1038\/35019019"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.172501399"},{"key":"e_1_2_1_5_1","first-page":"63","article-title":"Scale-Free Networks","author":"Barabasi A.-L.","year":"2003","unstructured":"A.-L. Barabasi and E. Bonabeau , \" Scale-Free Networks ,\" Scientific American , May 2003 , 63 -- 69 . A.-L. Barabasi and E. Bonabeau, \"Scale-Free Networks,\" Scientific American, May 2003, 63--69.","journal-title":"Scientific American"},{"issue":"4","key":"e_1_2_1_6_1","article-title":"On power-law relationships of the Internet topology","volume":"29","author":"Faloutsos M.","year":"1999","unstructured":"M. Faloutsos , P. Faloutsos , and C. Faloutsos . On power-law relationships of the Internet topology , ACM Comp. Comm. Review , 29 ( 4 ), 1999 . M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the Internet topology, ACM Comp. Comm. Review, 29(4), 1999.","journal-title":"ACM Comp. Comm. Review"},{"key":"e_1_2_1_7_1","volume-title":"Contemporary Physics","author":"Newman M.E.J.","year":"2005","unstructured":"M.E.J. Newman . Power laws, Pareto distributions and Zipf's law . Contemporary Physics , 2005 . M.E.J. Newman. Power laws, Pareto distributions and Zipf's law. Contemporary Physics, 2005."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/070710111"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1216142"},{"issue":"21","key":"e_1_2_1_10_1","article-title":"A mathematical theory of evolution, based on the conclusions of Dr J. C. Willis","volume":"213","author":"Yule G. U.","year":"1924","unstructured":"G. U. Yule . A mathematical theory of evolution, based on the conclusions of Dr J. C. Willis , F.R.S. Phil. Trans. B , 213 ( 21 ), 1924 . G. U. Yule. A mathematical theory of evolution, based on the conclusions of Dr J. C. Willis, F.R.S. Phil. Trans. B, 213(21), 1924.","journal-title":"F.R.S. Phil. Trans. B"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/42.3-4.425"},{"key":"e_1_2_1_12_1","volume-title":"Haddadi","author":"Roughan W.","year":"2013","unstructured":"Willinger, W. and Roughan , M . Internet topology research redux. ACM SIGCOMM eBook: Recent Advances in Networking , Haddadi , H. and Bonaventure, O. (Eds.), 2013 . Willinger, W. and Roughan, M. Internet topology research redux. ACM SIGCOMM eBook: Recent Advances in Networking, Haddadi, H. and Bonaventure, O. (Eds.), 2013."},{"issue":"5","key":"e_1_2_1_13_1","first-page":"586","volume":"56","author":"Willinger W.","year":"2009","unstructured":"W. Willinger , D. Alderson , and J. C. Doyle . Mathematics and the Internet: A Source of Enormous Confusion and Great Potential. Not. of the AMS , 56 ( 5 ): 586 -- 599 , 2009 . W. Willinger, D. Alderson, and J. C. Doyle. Mathematics and the Internet: A Source of Enormous Confusion and Great Potential. Not. of the AMS, 56(5):586--599, 2009.","journal-title":"Not. of the AMS"},{"key":"e_1_2_1_14_1","volume-title":"Proc. ACM SIGCOMM Internet Measurement Conference 2004","year":"2004","unstructured":"Willinger, W., Alderson, D., Doyle, J., and Li, L ., 2004. A pragmatic approach to dealing with high variability in network measurements . Proc. ACM SIGCOMM Internet Measurement Conference 2004 , Taormina, Sicily, Italy, Oct. 25--27 , 2004 . Willinger, W., Alderson, D., Doyle, J., and Li, L., 2004. A pragmatic approach to dealing with high variability in network measurements. Proc. ACM SIGCOMM Internet Measurement Conference 2004, Taormina, Sicily, Italy, Oct. 25--27, 2004."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2005.861250"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1080.0606"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1880153.1880155"},{"key":"e_1_2_1_18_1","volume-title":"Proc. USENIX NSDI'12","author":"Singla A.","year":"2012","unstructured":"A. Singla , C.-Y Hong , L. Popa , and P.B. Godfrey . Jellyfish: Networking data centers randomly . Proc. USENIX NSDI'12 , San Jose, CA , 2012 . A. Singla, C.-Y Hong, L. Popa, and P.B. Godfrey. Jellyfish: Networking data centers randomly. Proc. USENIX NSDI'12, San Jose, CA, 2012."},{"key":"e_1_2_1_19_1","volume-title":"Proc. USENIX NSDI'14","author":"Singla A.","year":"2014","unstructured":"A. Singla , P.B. Godfrey , and A. Kolla . High Throughput Data Center Topology Design . Proc. USENIX NSDI'14 , Seattle, WA , 2014 . A. Singla, P.B. Godfrey, and A. Kolla. High Throughput Data Center Topology Design. Proc. USENIX NSDI'14, Seattle, WA, 2014."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2005.10129111"},{"key":"e_1_2_1_21_1","volume-title":"Princeton University Press","author":"The Best","year":"2011","unstructured":"The Best Writing on Mathematics 2010, M. Pitici (Editor). Princeton University Press , Princeton, NJ , 109--133, 2011 . The Best Writing on Mathematics 2010, M. Pitici (Editor). Princeton University Press, Princeton, NJ, 109--133, 2011."},{"key":"e_1_2_1_22_1","volume-title":"Committee on Network Science for Future Army Applications","author":"National Research Council","year":"2005","unstructured":"National Research Council , Committee on Network Science for Future Army Applications . 2005 . Network Science. The National Academies Press . National Research Council, Committee on Network Science for Future Army Applications. 2005. Network Science. The National Academies Press."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0501426102"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1173299"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2010.2048027"},{"key":"e_1_2_1_26_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-5426-1","volume-title":"How Nature Works: The Science of Self-Organized Criticality","author":"Bak P.","year":"1996","unstructured":"P. Bak . How Nature Works: The Science of Self-Organized Criticality . New York : Copernicus , 1996 . P. Bak. How Nature Works: The Science of Self-Organized Criticality. New York: Copernicus, 1996."},{"key":"e_1_2_1_27_1","volume-title":"Linked: The New Science of Networks","author":"Barab\u00e1si A.-L.","year":"2002","unstructured":"A.-L. Barab\u00e1si , Linked: The New Science of Networks . Cambridge, MA : Perseus , 2002 . A.-L. Barab\u00e1si, Linked: The New Science of Networks. Cambridge, MA: Perseus, 2002."},{"key":"e_1_2_1_28_1","volume-title":"Cours d'Economie Politique","author":"Pareto V.","year":"1896","unstructured":"V. Pareto . Cours d'Economie Politique . Geneva, Switzerland : Droz , 1896 . V. Pareto. Cours d'Economie Politique. Geneva, Switzerland: Droz, 1896."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129088"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1002\/bies.20294"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.281.5384.1840"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0508985102"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.3156832"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1401883111"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/WSC.2004.1371310"},{"key":"e_1_2_1_36_1","volume-title":"Concentration, Risk.","author":"Mandelbrot B.B.","year":"1997","unstructured":"B.B. Mandelbrot . Fractals and Scaling in Finance: Discontinuity , Concentration, Risk. New York : Springer-Verlag , 1997 . B.B. Mandelbrot. Fractals and Scaling in Finance: Discontinuity, Concentration, Risk. New York: Springer-Verlag, 1997."},{"key":"e_1_2_1_37_1","volume-title":"https:\/\/arxiv.org\/abs\/1811.02071","year":"2018","unstructured":"Scale-free networks well done ( 2018 ) https:\/\/arxiv.org\/abs\/1811.02071 Scale-free networks well done (2018) https:\/\/arxiv.org\/abs\/1811.02071"},{"key":"e_1_2_1_38_1","unstructured":"Rare and everywhere: Perspectives on scale-free networks. (2019) https:\/\/www.nature.com\/articles\/s41467-019-09038-8  Rare and everywhere: Perspectives on scale-free networks. (2019) https:\/\/www.nature.com\/articles\/s41467-019-09038-8"},{"key":"e_1_2_1_39_1","volume-title":"https:\/\/www.nature.com\/articles\/s41467-019-08746-5","year":"2019","unstructured":"Scale-free networks are rare ( 2019 ) https:\/\/www.nature.com\/articles\/s41467-019-08746-5 Scale-free networks are rare (2019) https:\/\/www.nature.com\/articles\/s41467-019-08746-5"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.80.1275"},{"key":"e_1_2_1_41_1","first-page":"536","article-title":"Science and complexity Amer","volume":"36","author":"Weaver W.","year":"1948","unstructured":"W. Weaver . Science and complexity Amer . Sci. , vol. 36 , pp. 536 -- 544 , 1948 . W. Weaver. Science and complexity Amer. Sci., vol. 36, pp. 536--544, 1948.","journal-title":"Sci."},{"key":"e_1_2_1_42_1","volume-title":"Nature","volume":"433","author":"Strogatz S. H.","year":"2005","unstructured":"S. H. Strogatz . Romanesque networks . Nature , vol. 433 , 2005 . S. H. Strogatz. Romanesque networks. Nature, vol. 433, 2005."},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.94.168101"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.febslet.2005.08.024"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1049\/ip-syb:20050042"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2006.887322"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(00)00083-9"},{"key":"e_1_2_1_48_1","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198805090.001.0001","volume-title":"Networks","author":"Newman M.","year":"2018","unstructured":"M. Newman . Networks ( 2 nd Edition). Oxford University Press , 2018 . M. Newman. Networks (2nd Edition). Oxford University Press, 2018.","edition":"2"},{"key":"e_1_2_1_49_1","unstructured":"D. Goodin. Google goes down after major BGP mishap routes traffic through China 2018. https:\/\/arstechnica.com\/information-technology\/2018\/11\/major-bgp-mishap-takes-down-google-as-traffic-improperly-travels-to-china\/  D. Goodin. Google goes down after major BGP mishap routes traffic through China 2018. https:\/\/arstechnica.com\/information-technology\/2018\/11\/major-bgp-mishap-takes-down-google-as-traffic-improperly-travels-to-china\/"},{"key":"e_1_2_1_50_1","unstructured":"KrebsOnSecurity hit with record DDoS 2016. https:\/\/krebsonsecurity.com\/tag\/dns-amplification-attack\/  KrebsOnSecurity hit with record DDoS 2016. https:\/\/krebsonsecurity.com\/tag\/dns-amplification-attack\/"},{"key":"e_1_2_1_51_1","unstructured":"DDoS attack against Spamhaus was reportedly the largest in history 2013. https:\/\/www.networkworld.com\/article\/2164810\/ddos-attack-against-spamhaus-was-reportedly-the-largest-in-history.html  DDoS attack against Spamhaus was reportedly the largest in history 2013. https:\/\/www.networkworld.com\/article\/2164810\/ddos-attack-against-spamhaus-was-reportedly-the-largest-in-history.html"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tics.2010.01.008"},{"key":"e_1_2_1_53_1","doi-asserted-by":"crossref","unstructured":"N. Feamster and J. Rexford. Why (and How) Networks Should Run Themselves. http:\/\/arxiv.org\/abs\/1710.11583 2017.  N. Feamster and J. Rexford. Why (and How) Networks Should Run Themselves. http:\/\/arxiv.org\/abs\/1710.11583 2017.","DOI":"10.1145\/3232755.3234555"},{"key":"e_1_2_1_54_1","volume-title":"ACM SIGCOMM","author":"Gupta A.","year":"2018","unstructured":"A. Gupta , R. Harrison , M. Canini , N. Feamster , J. Rexford , and W. Willinger . Sonata: Query-Driven Network Telemetry . ACM SIGCOMM , 2018 . A. Gupta, R. Harrison, M. Canini, N. Feamster, J. Rexford, and W. Willinger. Sonata: Query-Driven Network Telemetry. ACM SIGCOMM, 2018."},{"key":"e_1_2_1_55_1","volume-title":"Fitts' law for speed-accuracy trade-off is a diversity sweet spot in sensorimotor control. https:\/\/arxiv.org\/pdf\/1906.00905.pdf","author":"Y.","year":"2019","unstructured":"Y. Nakahira1, Q. Liu , T. J. Sejnowski , and J. C. Doyle . Fitts' law for speed-accuracy trade-off is a diversity sweet spot in sensorimotor control. https:\/\/arxiv.org\/pdf\/1906.00905.pdf , 2019 . Y. Nakahira1, Q. Liu, T. J. Sejnowski, and J. C. Doyle. Fitts' law for speed-accuracy trade-off is a diversity sweet spot in sensorimotor control. https:\/\/arxiv.org\/pdf\/1906.00905.pdf, 2019."},{"key":"e_1_2_1_56_1","volume-title":"Preprint","author":"Doyle J. C.","year":"2019","unstructured":"J. C. Doyle Diversity sweet spots in layered architectures and speed-accuracy trade-offs in sensorimotor control . Preprint , 2019 . J. C. Doyle et al. Diversity sweet spots in layered architectures and speed-accuracy trade-offs in sensorimotor control. Preprint, 2019."},{"key":"e_1_2_1_57_1","volume-title":"The Fever: How Malaria Has Ruled Humankind for 500,000 Years","author":"Shah S.","year":"2010","unstructured":"S. Shah . The Fever: How Malaria Has Ruled Humankind for 500,000 Years . Sarah Crichton Books , 2010 . S. Shah. The Fever: How Malaria Has Ruled Humankind for 500,000 Years. Sarah Crichton Books, 2010."}],"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3371934.3371964","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3371934.3371964","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:44:19Z","timestamp":1750203859000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3371934.3371964"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,8]]},"references-count":57,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,11,8]]}},"alternative-id":["10.1145\/3371934.3371964"],"URL":"https:\/\/doi.org\/10.1145\/3371934.3371964","relation":{},"ISSN":["0146-4833"],"issn-type":[{"value":"0146-4833","type":"print"}],"subject":[],"published":{"date-parts":[[2019,11,8]]},"assertion":[{"value":"2019-11-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}