{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T04:30:29Z","timestamp":1773117029139,"version":"3.50.1"},"reference-count":41,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2013,12,31]],"date-time":"2013-12-31T00:00:00Z","timestamp":1388448000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/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":[[2013,12,31]]},"abstract":"<jats:p>Researchers studying the inter-domain routing system typically rely on models to fill in the gaps created by the lack of information about the business relationships and routing policies used by individual autonomous systems. To shed light on this unknown information, we asked 100 network operators about their routing policies, billing models, and thoughts on routing security. This short paper reports the survey's results and discusses their implications.<\/jats:p>","DOI":"10.1145\/2567561.2567566","type":"journal-article","created":{"date-parts":[[2014,1,21]],"date-time":"2014-01-21T13:31:00Z","timestamp":1390311060000},"page":"28-34","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":69,"title":["A survey of interdomain routing policies"],"prefix":"10.1145","volume":"44","author":[{"given":"Phillipa","family":"Gill","sequence":"first","affiliation":[{"name":"Stony Brook University, Stony Brook, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Schapira","sequence":"additional","affiliation":[{"name":"Hebrew University of 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":[[2013,12,31]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"University of oregon route views project. https:\/\/2.zoppoz.workers.dev:443\/http\/www.routeviews.org\/.  University of oregon route views project. https:\/\/2.zoppoz.workers.dev:443\/http\/www.routeviews.org\/."},{"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\/1282427.1282411"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1151659.1159946"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1452335.1452337"},{"key":"e_1_2_1_6_1","volume-title":"Bgp best path selection algorithm: How the best path algorithm works. Document ID","year":"2012","unstructured":"Cisco. Bgp best path selection algorithm: How the best path algorithm works. Document ID : 13753, May 2012 . https:\/\/2.zoppoz.workers.dev:443\/http\/www.cisco.com\/en\/US\/tech\/tk365\/technologies_tech_note09186a0080094431.shtml#bestpath. Cisco. Bgp best path selection algorithm: How the best path algorithm works. Document ID: 13753, May 2012. https:\/\/2.zoppoz.workers.dev:443\/http\/www.cisco.com\/en\/US\/tech\/tk365\/technologies_tech_note09186a0080094431.shtml#bestpath."},{"key":"e_1_2_1_7_1","volume-title":"How BGP routers use the multi-exit discriminator for best path selection. Document ID","year":"2012","unstructured":"Cisco. How BGP routers use the multi-exit discriminator for best path selection. Document ID : 13759, March 2012 . https:\/\/2.zoppoz.workers.dev:443\/http\/www.cisco.com\/en\/US\/tech\/tk365\/technologies_tech_note09186a0080094934.shtml. Cisco. How BGP routers use the multi-exit discriminator for best path selection. Document ID: 13759, March 2012. https:\/\/2.zoppoz.workers.dev:443\/http\/www.cisco.com\/en\/US\/tech\/tk365\/technologies_tech_note09186a0080094934.shtml."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1134707.1134722"},{"key":"e_1_2_1_9_1","volume-title":"Algorithmic Game Theory","author":"Feigenbaum J.","year":"2007","unstructured":"J. Feigenbaum , M. Schapira , and S. Shenker . Algorithmic Game Theory , chapter Distributed Algorithmic Mechanism Design. Cambridge University Press , 2007 . J. Feigenbaum, M. Schapira, and S. Shenker. Algorithmic Game Theory, chapter Distributed Algorithmic Mechanism Design. Cambridge University Press, 2007."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2398776.2398804"},{"key":"e_1_2_1_11_1","volume-title":"IEEE INFOCOM","author":"Gao L.","year":"2001","unstructured":"L. Gao , T. Griffin , and J. Rexford . Inherently safe backup routing with BGP . IEEE INFOCOM , 2001 . L. Gao, T. Griffin, and J. Rexford. Inherently safe backup routing with BGP. IEEE INFOCOM, 2001."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.974523"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043164.2018439"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2012.6363987"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402989"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851275.1851195"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.993304"},{"issue":"1","key":"e_1_2_1_18_1","article-title":"Peering and settlements - Part I","volume":"2","author":"Huston G.","year":"1999","unstructured":"G. Huston . Peering and settlements - Part I . The Internet Protocol Journal (Cisco) , 2 ( 1 ), March 1999 . G. Huston. Peering and settlements - Part I. The Internet Protocol Journal (Cisco), 2(1), March 1999.","journal-title":"The Internet Protocol Journal (Cisco)"},{"issue":"2","key":"e_1_2_1_19_1","article-title":"Peering and settlements - Part II","volume":"2","author":"Huston G.","year":"1999","unstructured":"G. Huston . Peering and settlements - Part II . The Internet Protocol Journal (Cisco) , 2 ( 2 ), June 1999 . G. Huston. Peering and settlements - Part II. The Internet Protocol Journal (Cisco), 2(2), June 1999.","journal-title":"The Internet Protocol Journal (Cisco)"},{"key":"e_1_2_1_20_1","volume-title":"Revisions to the bgp 'minimum route advertisement interval'. Internet-Draft: https:\/\/2.zoppoz.workers.dev:443\/http\/tools.ietf.org\/html\/draft-ietf-idr-mrai-dep-04","author":"Jakma P.","year":"2012","unstructured":"P. Jakma . Revisions to the bgp 'minimum route advertisement interval'. Internet-Draft: https:\/\/2.zoppoz.workers.dev:443\/http\/tools.ietf.org\/html\/draft-ietf-idr-mrai-dep-04 , 2012 . P. Jakma. Revisions to the bgp 'minimum route advertisement interval'. Internet-Draft: https:\/\/2.zoppoz.workers.dev:443\/http\/tools.ietf.org\/html\/draft-ietf-idr-mrai-dep-04, 2012."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486036"},{"key":"e_1_2_1_22_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_23_1","unstructured":"Juniper. Out-delay. https:\/\/2.zoppoz.workers.dev:443\/https\/www.juniper.net\/techpubs\/software\/junos\/junos57\/swconfig57-routing\/html\/bgp-summary32.htm.  Juniper. Out-delay. https:\/\/2.zoppoz.workers.dev:443\/https\/www.juniper.net\/techpubs\/software\/junos\/junos57\/swconfig57-routing\/html\/bgp-summary32.htm."},{"key":"e_1_2_1_24_1","volume-title":"Selecting the best path","year":"2005","unstructured":"Juniper. Selecting the best path , 2005 . https:\/\/2.zoppoz.workers.dev:443\/http\/www.juniper.net\/techpubs\/software\/erx\/erx51x\/swconfig-routing-vol2\/html\/bgp-config10.html. Juniper. Selecting the best path, 2005. https:\/\/2.zoppoz.workers.dev:443\/http\/www.juniper.net\/techpubs\/software\/erx\/erx51x\/swconfig-routing-vol2\/html\/bgp-config10.html."},{"key":"e_1_2_1_25_1","volume-title":"CoRR","author":"Karlin J.","year":"2009","unstructured":"J. Karlin , S. Forrest , and J. Rexford . Nation-state routing: Censorship, wiretapping, and BGP . CoRR , 2009 . J. Karlin, S. Forrest, and J. Rexford. Nation-state routing: Censorship, wiretapping, and BGP. CoRR, 2009."},{"key":"e_1_2_1_26_1","volume-title":"Internet-Draft","author":"Lepinski M.","year":"2012","unstructured":"M. Lepinski . Bgpsec protocol specification: draft-ietf-sidr-bgpsec-protocol-06 . Internet-Draft , 2012 . M. Lepinski. Bgpsec protocol specification: draft-ietf-sidr-bgpsec-protocol-06. Internet-Draft, 2012."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374388"},{"key":"e_1_2_1_28_1","volume-title":"As relationships, customer cones, and validation","author":"Luckie M.","year":"2013","unstructured":"M. Luckie , B. Huffaker , A. Dhamdhere , and V. Giotsas . As relationships, customer cones, and validation . 2013 . M. Luckie, B. Huffaker, A. Dhamdhere, and V. Giotsas. As relationships, customer cones, and validation. 2013."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486010"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/964725.633047"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2004.09.008"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2007.334"},{"key":"e_1_2_1_33_1","volume-title":"A border gateway protocol 4 BGP-4. RFC","author":"Rekhter Y.","year":"2006","unstructured":"Y. Rekhter , T. Li , and S. Hares . A border gateway protocol 4 BGP-4. RFC 4271, January 2006 . Y. Rekhter, T. Li, and S. Hares. A border gateway protocol 4 BGP-4. RFC 4271, January 2006."},{"key":"e_1_2_1_34_1","unstructured":"RIPE Network Coordination Center. RIPE Routing Information Service. https:\/\/2.zoppoz.workers.dev:443\/http\/www.ripe.net\/data-tools\/stats\/ris\/routing-information-service.  RIPE Network Coordination Center. RIPE Routing Information Service. https:\/\/2.zoppoz.workers.dev:443\/http\/www.ripe.net\/data-tools\/stats\/ris\/routing-information-service."},{"key":"e_1_2_1_35_1","article-title":"10 lessons from 10 years of measuring and modeling the internet's autonomous systems","author":"Roughan M.","year":"2011","unstructured":"M. Roughan , W. Willinger , O. Maennel , D. Perouli , and R. Bush . 10 lessons from 10 years of measuring and modeling the internet's autonomous systems . JSAC , 2011 . M. Roughan, W. Willinger, O. Maennel, D. Perouli, and R. Bush. 10 lessons from 10 years of measuring and modeling the internet's autonomous systems. JSAC, 2011.","journal-title":"JSAC"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1868447.1868450"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863970"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879151"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018459"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1555349.1555375"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1364654.1364687"}],"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/dl.acm.org\/doi\/10.1145\/2567561.2567566","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/dl.acm.org\/doi\/pdf\/10.1145\/2567561.2567566","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:34:38Z","timestamp":1750232078000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/dl.acm.org\/doi\/10.1145\/2567561.2567566"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,31]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,12,31]]}},"alternative-id":["10.1145\/2567561.2567566"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1145\/2567561.2567566","relation":{},"ISSN":["0146-4833"],"issn-type":[{"value":"0146-4833","type":"print"}],"subject":[],"published":{"date-parts":[[2013,12,31]]},"assertion":[{"value":"2013-12-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}