{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T23:21:54Z","timestamp":1777591314922,"version":"3.51.4"},"reference-count":33,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2012,1,16]],"date-time":"2012-01-16T00:00:00Z","timestamp":1326672000000},"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":[[2012,1,16]]},"abstract":"<jats:p>Researchers studying the interdomain routing system, its properties and new protocols, face many challenges in performing realistic evaluations and simulations. Modeling decisions with respect to AS-level topology, routing policies and traffic matrices are complicated by a scarcity of ground truth for each of these components. Moreover, scalability issues arise when attempting to simulate over large (although still incomplete) empirically-derived AS-level topologies. In this paper, we discuss our approach for analyzing the robustness of our results to incomplete empirical data. We do this by (1) developing fast simulation algorithms that enable us to (2) running multiple simulations with varied parameters that test the sensitivity of our research results.<\/jats:p>","DOI":"10.1145\/2096149.2096155","type":"journal-article","created":{"date-parts":[[2012,1,17]],"date-time":"2012-01-17T17:21:44Z","timestamp":1326820904000},"page":"40-46","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":40,"title":["Modeling on quicksand"],"prefix":"10.1145","volume":"42","author":[{"given":"Phillipa","family":"Gill","sequence":"first","affiliation":[{"name":"University of Toronto, Toronto, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Schapira","sequence":"additional","affiliation":[{"name":"Hebrew University at Jerusalem, Jerusalem, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sharon","family":"Goldberg","sequence":"additional","affiliation":[{"name":"Boston University, Boston, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,1,16]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1644893.1644934"},{"key":"e_1_2_1_2_1","volume-title":"How small groups can secure interdomain routing. Technical report","author":"Avramopoulos I.","year":"2007","unstructured":"I. Avramopoulos , M. Suchara , and J. Rexford . How small groups can secure interdomain routing. Technical report , Princeton University Comp . Sci., 2007 . I. Avramopoulos, M. Suchara, and J. Rexford. How small groups can secure interdomain routing. Technical report, Princeton University Comp. Sci., 2007."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159913.1159946"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1251086.1251098"},{"key":"e_1_2_1_5_1","volume-title":"ACM SIGCOMM CCR","author":"Chi Y.-J.","year":"2008","unstructured":"Y.-J. Chi , R. Oliveira , and L. Zhang . Cyclops: The Internet AS-level observatory . ACM SIGCOMM CCR , 2008 . Y.-J. Chi, R. Oliveira, and L. Zhang. Cyclops: The Internet AS-level observatory. ACM SIGCOMM CCR, 2008."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1198255.1198259"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2005.09.033"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1005686.1005726"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.974523"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018439"},{"key":"e_1_2_1_11_1","volume-title":"Let the market drive deployment: A strategy for transitioning to BGP security. Full version. Technical report","author":"Gill P.","year":"2011","unstructured":"P. Gill , M. Schapira , and S. Goldberg . Let the market drive deployment: A strategy for transitioning to BGP security. Full version. Technical report , 2011 . P. Gill, M. Schapira, and S. Goldberg. Let the market drive deployment: A strategy for transitioning to BGP security. Full version. Technical report, 2011."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851195"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.993304"},{"key":"e_1_2_1_14_1","volume-title":"UM","author":"Jin C.","year":"2000","unstructured":"C. Jin , Q. Chen , and S. Jamin . Inet: Internet topology generator. Technical report , UM , 2000 . C. Jin, Q. Chen, and S. Jamin. Inet: Internet topology generator. Technical report, UM, 2000."},{"key":"e_1_2_1_15_1","volume-title":"NSDI","author":"John J.","year":"2008","unstructured":"J. John , E. Katz-Bassett , A. Krishnamurthy , T. Anderson , and A. Venkataramani . Consensus routing: The Internet as a distributed system . In NSDI , 2008 . J. John, E. Katz-Bassett, A. Krishnamurthy, T. Anderson, and A. Venkataramani. Consensus routing: The Internet as a distributed system. In NSDI, 2008."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2008.06.012"},{"key":"e_1_2_1_17_1","volume-title":"Nation-state routing: Censorship, wiretapping, and BGP. CoRR, abs\/0903.3218","author":"Karlin J.","year":"2009","unstructured":"J. Karlin , S. Forrest , and J. Rexford . Nation-state routing: Censorship, wiretapping, and BGP. CoRR, abs\/0903.3218 , 2009 . J. Karlin, S. Forrest, and J. Rexford. Nation-state routing: Censorship, wiretapping, and BGP. CoRR, abs\/0903.3218, 2009."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2010.09.014"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2007.06.004"},{"key":"e_1_2_1_20_1","unstructured":"C. Labovitz. Arbor blog: Battle of the hyper giants. http:\/\/asert.arbornetworks.com\/2010\/04\/ the-battle-of-the-hyper-giants-part-i-2\/.  C. Labovitz. Arbor blog: Battle of the hyper giants. http:\/\/asert.arbornetworks.com\/2010\/04\/ the-battle-of-the-hyper-giants-part-i-2\/."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851194"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/882459.882563"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375457.1375482"},{"key":"e_1_2_1_25_1","unstructured":"F. Orbit. http:\/\/www.fixedorbit.com\/metrics.htm.  F. Orbit. http:\/\/www.fixedorbit.com\/metrics.htm."},{"key":"e_1_2_1_26_1","volume-title":"Dartmouth College","author":"Premore B. J.","year":"2003","unstructured":"B. J. Premore . An analysis of convergence properties of the border gateway protocol usingdiscrete event simulation. PhD thesis , Dartmouth College , 2003 . B. J. Premore. An analysis of convergence properties of the border gateway protocol usingdiscrete event simulation. PhD thesis, Dartmouth College, 2003."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2005.1541716"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.111006"},{"key":"e_1_2_1_29_1","unstructured":"Sandvine. Fall 2010 global Internet phenomena 2010.  Sandvine. Fall 2010 global Internet phenomena 2010."},{"key":"e_1_2_1_30_1","volume-title":"Notices of the American Mathematical Society","author":"Willinger W.","year":"2009","unstructured":"W. Willinger , D. Alderson , and J. Doyle . Mathematics and the Internet: A source of enourmous confusion and great potential . Notices of the American Mathematical Society , 2009 . W. Willinger, D. Alderson, and J. Doyle. Mathematics and the Internet: A source of enourmous confusion and great potential. Notices of the American Mathematical Society, 2009."},{"key":"e_1_2_1_31_1","volume-title":"Border gateway protocol modeling and simulation. Master's thesis","author":"Wojciechowski M.","year":"2008","unstructured":"M. Wojciechowski . Border gateway protocol modeling and simulation. Master's thesis , University of Warsaw , 2008 . M. Wojciechowski. Border gateway protocol modeling and simulation. Master's thesis, University of Warsaw, 2008."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1364654.1364687"},{"key":"e_1_2_1_33_1","volume-title":"Usenix OSDI","author":"Yu Y.","year":"2008","unstructured":"Y. Yu , M. Isard , D. Fetterly , M. Budiu , U. Erlingsson , P. K. Gunda , and J. Currey . Dryadlinq: a system for general-purpose distributed data-parallel computing using a high-level language . In Usenix OSDI , 2008 . Y. Yu, M. Isard, D. Fetterly, M. Budiu, U. Erlingsson, P. K. Gunda, and J. Currey. Dryadlinq: a system for general-purpose distributed data-parallel computing using a high-level language. In Usenix OSDI, 2008."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/1895868.1895900"}],"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2096149.2096155","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2096149.2096155","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:54:34Z","timestamp":1750240474000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2096149.2096155"}},"subtitle":["dealing with the scarcity of ground truth in interdomain routing data"],"short-title":[],"issued":{"date-parts":[[2012,1,16]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1,16]]}},"alternative-id":["10.1145\/2096149.2096155"],"URL":"https:\/\/doi.org\/10.1145\/2096149.2096155","relation":{},"ISSN":["0146-4833"],"issn-type":[{"value":"0146-4833","type":"print"}],"subject":[],"published":{"date-parts":[[2012,1,16]]},"assertion":[{"value":"2012-01-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}