{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T08:50:00Z","timestamp":1767084600339},"reference-count":49,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2015,8,1]],"date-time":"2015-08-01T00:00:00Z","timestamp":1438387200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"European Commission within the framework of the CONGAS","award":["FP7-ICT-2011-8-317672"],"award-info":[{"award-number":["FP7-ICT-2011-8-317672"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1109\/tnet.2014.2323128","type":"journal-article","created":{"date-parts":[[2014,5,26]],"date-time":"2014-05-26T18:02:17Z","timestamp":1401127337000},"page":"1314-1327","source":"Crossref","is-referenced-by-count":18,"title":["A Novel Methodology to Address the Internet AS-Level Data Incompleteness"],"prefix":"10.1109","volume":"23","author":[{"given":"Enrico","family":"Gregori","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandro","family":"Improta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luciano","family":"Lenzini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lorenzo","family":"Rossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Sani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/0167-9260(94)00007-7"},{"key":"ref38","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/3-540-36478-1_17","article-title":"Exact algorithms for NP-hard problems: A survey","volume":"2570","author":"woeginger","year":"2003","journal-title":"Combinat Optim Eureka You Shrink! LNCS"},{"key":"ref33","first-page":"54","article-title":"BGP and inter-AS economic relationships","volume":"2","author":"gregori","year":"2011","journal-title":"Proc IFIP-TC6 NETWORKING"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2504730.2504735"},{"key":"ref31","year":"0","journal-title":"?Maxmind GeoLite database ?"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30054-7_11"},{"key":"ref37","author":"hochbaum","year":"1997","journal-title":"Approximation Algorithms for NP-Hard Problems"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2185376.2185384"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2010.09.002"},{"key":"ref34","year":"0","journal-title":"?IIT-CNR isolario project ?"},{"key":"ref28","year":"2014","journal-title":"?Tier 1 network ?"},{"key":"ref27","author":"blunk","year":"2011","journal-title":"?RFC 6396?Multi-threaded routing toolkit (MRT) routing information export format ?"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1644893.1644934"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.17487\/rfc4271"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2398776.2398803"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/90.974527"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.111006"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1452520.1452558"},{"key":"ref24","year":"0","journal-title":"?Packet Clearing House ?"},{"key":"ref23","year":"0","journal-title":"?BGPmon ?"},{"key":"ref26","year":"0","journal-title":"?University of Oregon Route Views project ?"},{"key":"ref25","year":"0","journal-title":"?RIPE NCC routing information service ?"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.926512"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.234"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2012.6193493"},{"key":"ref12","author":"garey","year":"1990","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1956.tb03835.x"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.2307\/2307285"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.2307\/2310460"},{"key":"ref16","author":"cormen","year":"2001","journal-title":"Introduction to Algorithms"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1997.644557"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2003.03.001"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2009.5425389"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060693"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1672308.1672318"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12334-4_10"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12334-4_11"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1198255.1198259"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2009.2020798"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/IFIPNetworking.2014.6857118"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2342356.2342393"},{"key":"ref46","year":"0","journal-title":"?University of Pisa Portolan project ?"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/1658939.1658964"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.111003"},{"key":"ref47","year":"2009","journal-title":"?DIMES project ?"},{"key":"ref42","author":"coudert","year":"2001","journal-title":"Two-Level Logic Minimization Logic Synthesis and Verification"},{"key":"ref41","author":"norton","year":"2011","journal-title":"The Internet Peering Playbook Connecting to the Care of the Internet"},{"key":"ref44","author":"gregori","year":"2012","journal-title":"?An enhancement for Networking '11 Tagging Algorithm ?"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1965.263993"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/7203177\/06821271.pdf?arnumber=6821271","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T15:59:00Z","timestamp":1642003140000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6821271\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8]]},"references-count":49,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2014.2323128","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"value":"1063-6692","type":"print"},{"value":"1558-2566","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8]]}}}