{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T10:06:55Z","timestamp":1767262015094,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,11,30]],"date-time":"2010-11-30T00:00:00Z","timestamp":1291075200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["NETSE-1017064NECO-0831848"],"award-info":[{"award-number":["NETSE-1017064NECO-0831848"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["NETSE-1017064NECO-0831848"],"award-info":[{"award-number":["NETSE-1017064NECO-0831848"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,11,30]]},"DOI":"10.1145\/1921168.1921196","type":"proceedings-article","created":{"date-parts":[[2010,12,22]],"date-time":"2010-12-22T14:41:30Z","timestamp":1293028890000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":124,"title":["The Internet is flat"],"prefix":"10.1145","author":[{"given":"Amogh","family":"Dhamdhere","sequence":"first","affiliation":[{"name":"CAIDA"}]},{"given":"Constantine","family":"Dovrolis","sequence":"additional","affiliation":[{"name":"Georgia Tech"}]}],"member":"320","published-online":{"date-parts":[[2010,11,30]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1145\/948205.948219"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/780542.780617"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1109\/FOCS.2006.72"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1145\/1644893.1644934"},{"key":"e_1_3_2_1_5_1","first-page":"509512","volume":"286","author":"Barabasi A. L.","year":"1999","unstructured":"A. L. Barabasi and R. Albert . Emergence of Scaling in Random Networks. Science 286 509512 , 1999 . A. L. Barabasi and R. Albert. Emergence of Scaling in Random Networks. Science 286 509512, 1999.","journal-title":"Emergence of Scaling in Random Networks. Science"},{"unstructured":"CAIDA. AS Rank. http:\/\/as-rank.caida.org\/.  CAIDA. AS Rank. http:\/\/as-rank.caida.org\/.","key":"e_1_3_2_1_6_1"},{"unstructured":"CAIDA and Georgia Tech. The Economics of Internet Interconnection. Ongoing project http:\/\/www.caida.org\/funding\/netse-econ\/.  CAIDA and Georgia Tech. The Economics of Internet Interconnection. Ongoing project http:\/\/www.caida.org\/funding\/netse-econ\/.","key":"e_1_3_2_1_7_1"},{"key":"e_1_3_2_1_8_1","first-page":"60","author":"Carlson J. M.","year":"1999","unstructured":"J. M. Carlson and J. Doyle . Highly Optimized Tolerance: A Mechanism for Power Laws in Designed Systems. Physical Review E 60 , 1999 . J. M. Carlson and J. Doyle. Highly Optimized Tolerance: A Mechanism for Power Laws in Designed Systems. Physical Review E 60, 1999.","journal-title":"Physical Review E"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.5555\/1251086.1251098"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/944773.944780"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1109\/INFOCOM.2006.236"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1109\/CISS.2006.286698"},{"unstructured":"Cogent Communications Group. Q3 2009 Earnings Call Transcript. http:\/\/seekingalpha.com\/article\/172306-cogent-communications-group-q3-2009-earnings-call-transcript?page=9 Nov 2009.  Cogent Communications Group. Q3 2009 Earnings Call Transcript. http:\/\/seekingalpha.com\/article\/172306-cogent-communications-group-q3-2009-earnings-call-transcript?page=9 Nov 2009.","key":"e_1_3_2_1_13_1"},{"key":"e_1_3_2_1_14_1","volume-title":"Proc. NetEcon","author":"Corbo J.","year":"2007","unstructured":"J. Corbo , S. Jain , M. Mitzenmacher , and D. Parkes . An Economically Principled Generative Model of AS Graph Connectivity . In Proc. NetEcon , 2007 . J. Corbo, S. Jain, M. Mitzenmacher, and D. Parkes. An Economically Principled Generative Model of AS Graph Connectivity. In Proc. NetEcon, 2007."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1145\/1452520.1452543"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.5555\/1702135.1702197"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.5555\/646255.684438"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1145\/316188.316229"},{"key":"e_1_3_2_1_19_1","volume-title":"Proc. IEEE GLOBECOM","author":"Gao L.","year":"2002","unstructured":"L. Gao and F. Wang . The Extent of AS Path Inflation by Routing Policies . In Proc. IEEE GLOBECOM , 2002 . L. Gao and F. Wang. The Extent of AS Path Inflation by Routing Policies. In Proc. IEEE GLOBECOM, 2002."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.5555\/1791949.1791951"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1098\/rsif.2007.1229"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1145\/1384609.1384611"},{"key":"e_1_3_2_1_23_1","volume-title":"A Survey of Network Models of Network Formation: Stability and Efficiency","author":"Jackson M. O.","year":"2003","unstructured":"M. O. Jackson . A Survey of Network Models of Network Formation: Stability and Efficiency . Group Formation in Economics : Networks , Clubs and Coalitions, 2003 . M. O. Jackson. A Survey of Network Models of Network Formation: Stability and Efficiency. Group Formation in Economics: Networks, Clubs and Coalitions, 2003."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1145\/1851182.1851194"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1145\/1217299.1217301"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1145\/1544012.1544019"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1145\/1364654.1364662"},{"key":"e_1_3_2_1_28_1","volume-title":"Transit Cost Survey. www.nanog.org\/mtg-0606\/pdf\/bill.norton.2.pdf","author":"Norton W. B.","year":"2006","unstructured":"W. B. Norton . Transit Cost Survey. www.nanog.org\/mtg-0606\/pdf\/bill.norton.2.pdf , 2006 . W. B. Norton. Transit Cost Survey. www.nanog.org\/mtg-0606\/pdf\/bill.norton.2.pdf, 2006."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_29_1","DOI":"10.1145\/1375457.1375482"},{"key":"e_1_3_2_1_30_1","volume-title":"Proc. IEEE Infocom","author":"Park S.","year":"2004","unstructured":"S. Park , D. M. Pennock , and C. L. Giles . Comparing Static and Dynamic Measurements and Models of the Internet's AS Topology . In Proc. IEEE Infocom , 2004 . S. Park, D. M. Pennock, and C. L. Giles. Comparing Static and Dynamic Measurements and Models of the Internet's AS Topology. In Proc. IEEE Infocom, 2004."},{"key":"e_1_3_2_1_31_1","volume-title":"August","author":"Johari Ramesh","year":"2006","unstructured":"Ramesh Johari and Shie Mannor and John Tsitsiklis . A Contract-based Model for Directed Network Formation. Games and Economic Behavior, 56(2) , August 2006 . Ramesh Johari and Shie Mannor and John Tsitsiklis. A Contract-based Model for Directed Network Formation. Games and Economic Behavior, 56(2), August 2006."},{"unstructured":"Renesys. Market Intelligence. http:\/\/www.renesys.com\/products_services\/market_intel\/.  Renesys. Market Intelligence. http:\/\/www.renesys.com\/products_services\/market_intel\/.","key":"e_1_3_2_1_32_1"},{"key":"e_1_3_2_1_33_1","volume-title":"The European Physics Journal B","author":"Serrano M. A.","year":"2006","unstructured":"M. A. Serrano , M. Boguna , and A. D. Guilera . Modeling the Internet . The European Physics Journal B , 2006 . M. A. Serrano, M. Boguna, and A. D. Guilera. Modeling the Internet. The European Physics Journal B, 2006."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_34_1","DOI":"10.1109\/INFOCOM.2006.235"},{"key":"e_1_3_2_1_35_1","volume-title":"Modeling the Internet's Large-scale Topology","author":"Yook S. H.","year":"2002","unstructured":"S. H. Yook , H. Jeong , and A. L. Barabasi . Modeling the Internet's Large-scale Topology . National Academy of Sciences , 2002 . S. H. Yook, H. Jeong, and A. L. Barabasi. Modeling the Internet's Large-scale Topology. National Academy of Sciences, 2002."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_36_1","DOI":"10.1103\/PhysRevE.74.016124"}],"event":{"sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"],"acronym":"Co-NEXT '10","name":"Co-NEXT '10: Conference on emerging Networking EXperiments and Technologies","location":"Philadelphia Pennsylvania"},"container-title":["Proceedings of the 6th International COnference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1921168.1921196","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1921168.1921196","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:59:44Z","timestamp":1750244384000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1921168.1921196"}},"subtitle":["modeling the transition from a transit hierarchy to a peering mesh"],"short-title":[],"issued":{"date-parts":[[2010,11,30]]},"references-count":36,"alternative-id":["10.1145\/1921168.1921196","10.1145\/1921168"],"URL":"https:\/\/doi.org\/10.1145\/1921168.1921196","relation":{},"subject":[],"published":{"date-parts":[[2010,11,30]]},"assertion":[{"value":"2010-11-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}