{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:20:27Z","timestamp":1740133227653,"version":"3.37.3"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000161","name":"U.S. Department of Commerce, National Institute of Standards and Technology","doi-asserted-by":"publisher","award":["70NANB17H188"],"award-info":[{"award-number":["70NANB17H188"]}],"id":[{"id":"10.13039\/100000161","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"U.S. National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1818971"],"award-info":[{"award-number":["CNS-1818971"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1109\/tnet.2021.3050769","type":"journal-article","created":{"date-parts":[[2021,1,28]],"date-time":"2021-01-28T21:00:51Z","timestamp":1611867651000},"page":"848-861","source":"Crossref","is-referenced-by-count":4,"title":["Name Space Analysis: Verification of Named Data Network Data Planes"],"prefix":"10.1109","volume":"29","author":[{"given":"Mohammad","family":"Jahanian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. K.","family":"Ramakrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3357150.3357400"},{"journal-title":"Regular Expression","year":"2019","key":"ref38"},{"journal-title":"ICN Ping Protocol Draft-Mastorakis-Icnrg-Icnping-00","year":"2017","author":"mastorakis","key":"ref33"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2018.2868050"},{"key":"ref31","first-page":"1","article-title":"NDNconf: Network management framework for named data networking","author":"afanasyev","year":"2020","journal-title":"Proc IEEE Int Conf Commun Workshops (ICC Workshops)"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2413176.2413205"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3125719.3125738"},{"journal-title":"Traceroute for Named Data Networking","year":"2017","author":"shannigrahi","key":"ref36"},{"journal-title":"ICN Traceroute","year":"2017","author":"mastorakis","key":"ref35"},{"journal-title":"Contrace Traceroute Facility for Content-Centric Network","year":"2018","author":"asaeda","key":"ref34"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCN.2017.8038461"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3357150.3357406"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2984356.2984377"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2043164.2018470"},{"key":"ref13","first-page":"113","article-title":"Header space analysis: Static checking for networks","author":"kazemian","year":"2012","journal-title":"Proc USENIX Symp Netw Syst Design Implement (NSDI)"},{"key":"ref14","first-page":"99","article-title":"Real time network policy checking using header space analysis","author":"kazemian","year":"2013","journal-title":"Proc USENIX Symp Netw Syst Design Implement (NSDI)"},{"key":"ref15","first-page":"87","article-title":"Libra: Divide and conquer to verify forwarding tables in huge networks","author":"zeng","year":"2014","journal-title":"Proc USENIX Symp Netw Syst Design Implement (NSDI)"},{"key":"ref16","first-page":"15","article-title":"Veriflow: Verifying network-wide invariants in real time","author":"khurshid","year":"2013","journal-title":"Proc USENIX Symp Netw Syst Design Implement (NSDI)"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098834"},{"key":"ref18","first-page":"499","article-title":"Checking beliefs in dynamic networks","author":"lopes","year":"2015","journal-title":"Proc USENIX Symp Netw Syst Design Implement (NSDI)"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934881"},{"journal-title":"Essential SNMP Help for System and Network Administrators","year":"2005","author":"mauro","key":"ref28"},{"key":"ref4","first-page":"1","article-title":"Interest flooding attack and countermeasures in named data networking","author":"afanasyev","year":"2013","journal-title":"Proc IFIP Netw Conf"},{"key":"ref27","first-page":"699","article-title":"Verifying reachability in networks with mutable datapaths","author":"panda","year":"2017","journal-title":"Proc USENIX Symp Netw Syst Design Implement (NSDI)"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2015.7179398"},{"article-title":"Nfd developer’s guide","year":"2016","author":"afanasyev","key":"ref6"},{"journal-title":"Network Configuration","year":"2020","key":"ref29"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/IWQoS.2016.7590394"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2984356.2984360"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3125719.3125721"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2656877.2656887"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2810156.2810171"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1658939.1658941"},{"key":"ref20","first-page":"683","article-title":"Dataplane equivalence and its applications","author":"dumitrescu","year":"2019","journal-title":"Proc USENIX Symp Netw Syst Design Implement (NSDI)"},{"journal-title":"NDN Packet Format Specification 0 3 Documentation","year":"2019","key":"ref22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3341302.3342094"},{"article-title":"Packet fragmentation in NDN: Why NDN uses hop-by-hop fragmentation","year":"2015","author":"afanasyev","key":"ref42"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3357150.3357401"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2016.7562050"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3125719.3125725"},{"journal-title":"NDN Testbed","year":"2019","key":"ref26"},{"journal-title":"NdnSIM","year":"2019","key":"ref43"},{"journal-title":"Name Space Analysis","year":"2020","author":"jahanian","key":"ref25"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/90\/9405508\/9339871-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/9405508\/09339871.pdf?arnumber=9339871","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T19:57:31Z","timestamp":1649188651000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9339871\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4]]},"references-count":43,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2021.3050769","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"type":"print","value":"1063-6692"},{"type":"electronic","value":"1558-2566"}],"subject":[],"published":{"date-parts":[[2021,4]]}}}