{"@context":{"@vocab":"https://cir.nii.ac.jp/schema/1.0/","rdfs":"http://www.w3.org/2000/01/rdf-schema#","dc":"http://purl.org/dc/elements/1.1/","dcterms":"http://purl.org/dc/terms/","foaf":"http://xmlns.com/foaf/0.1/","prism":"http://prismstandard.org/namespaces/basic/2.0/","cinii":"http://ci.nii.ac.jp/ns/1.0/","datacite":"https://schema.datacite.org/meta/kernel-4/","ndl":"http://ndl.go.jp/dcndl/terms/","jpcoar":"https://github.com/JPCOAR/schema/blob/master/2.0/"},"@id":"https://cir.nii.ac.jp/crid/1361699994136048896.json","@type":"Article","productIdentifier":[{"identifier":{"@type":"DOI","@value":"10.1109/tnet.2007.893156"}},{"identifier":{"@type":"URI","@value":"http://xplorestaging.ieee.org/ielx5/90/4237134/04237157.pdf?arnumber=4237157"}}],"dc:title":[{"@value":"ClassBench: A Packet Classification Benchmark"}],"creator":[{"@id":"https://cir.nii.ac.jp/crid/1381699994136048897","@type":"Researcher","foaf:name":[{"@value":"David E. Taylor"}]},{"@id":"https://cir.nii.ac.jp/crid/1381699994136048896","@type":"Researcher","foaf:name":[{"@value":"Jonathan S. Turner"}]}],"publication":{"publicationIdentifier":[{"@type":"PISSN","@value":"10636692"}],"prism:publicationName":[{"@value":"IEEE/ACM Transactions on Networking"}],"dc:publisher":[{"@value":"Institute of Electrical and Electronics Engineers (IEEE)"}],"prism:publicationDate":"2007-06","prism:volume":"15","prism:number":"3","prism:startingPage":"499","prism:endingPage":"511"},"reviewed":"false","dc:rights":["https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html"],"url":[{"@id":"http://xplorestaging.ieee.org/ielx5/90/4237134/04237157.pdf?arnumber=4237157"}],"createdAt":"2007-06-20","modifiedAt":"2021-11-29","relatedProduct":[{"@id":"https://cir.nii.ac.jp/crid/1360294643790119296","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Accelerating Packet Classification via Direct Dependent Rules"}]},{"@id":"https://cir.nii.ac.jp/crid/1360567185347605376","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"A Method to Detect Bit Flips in a Soft-Error Resilient TCAM"}]},{"@id":"https://cir.nii.ac.jp/crid/1360849945135367168","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Acceleration of Packet Classification Using Adjacency List of Rules"}]},{"@id":"https://cir.nii.ac.jp/crid/1360853567503243136","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"A Rule Reordering Method via Pairing Dependent Rules"}]},{"@id":"https://cir.nii.ac.jp/crid/1361694370097947008","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Traffic-aware Access Control List Reconstruction"}]},{"@id":"https://cir.nii.ac.jp/crid/1390001204379067904","@type":"Article","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"An Efficient Conflict Detection Algorithm for Packet Filters"}]},{"@id":"https://cir.nii.ac.jp/crid/1390001204379696128","@type":"Article","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Towards Dynamic and Scalable High-Speed IP Address Lookup Based on B+ Tree"}]},{"@id":"https://cir.nii.ac.jp/crid/1390001277344825600","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"A Packet Classification Method via Cascaded Circular-Run-Based Trie"}]},{"@id":"https://cir.nii.ac.jp/crid/1390306440178239744","@type":"Article","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"An efficient algorithm for reordering rules based on latency differences"}]},{"@id":"https://cir.nii.ac.jp/crid/1390578780305781248","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Computational Complexity of Allow Rule Ordering and Its Greedy Algorithm"}]},{"@id":"https://cir.nii.ac.jp/crid/1390846609809155328","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Simulated Annealing Method for Relaxed Optimal Rule Ordering"}]}],"dataSourceIdentifier":[{"@type":"CROSSREF","@value":"10.1109/tnet.2007.893156"},{"@type":"CROSSREF","@value":"10.1587/transinf.e95.d.472_references_DOI_R2Fe9HcVHTaL4kJgSWKa7V3uZJ8"},{"@type":"CROSSREF","@value":"10.1109/cns48642.2020.9162170_references_DOI_R2Fe9HcVHTaL4kJgSWKa7V3uZJ8"},{"@type":"CROSSREF","@value":"10.1587/transfun.2022dmp0006_references_DOI_R2Fe9HcVHTaL4kJgSWKa7V3uZJ8"},{"@type":"CROSSREF","@value":"10.1587/transinf.e95.d.2277_references_DOI_R2Fe9HcVHTaL4kJgSWKa7V3uZJ8"},{"@type":"CROSSREF","@value":"10.1109/nof52522.2021.9609820_references_DOI_R2Fe9HcVHTaL4kJgSWKa7V3uZJ8"},{"@type":"CROSSREF","@value":"10.1109/tcad.2017.2748019_references_DOI_R2Fe9HcVHTaL4kJgSWKa7V3uZJ8"},{"@type":"CROSSREF","@value":"10.1109/icccn.2019.8846923_references_DOI_R2Fe9HcVHTaL4kJgSWKa7V3uZJ8"},{"@type":"CROSSREF","@value":"10.1587/transfun.e102.a.1171_references_DOI_R2Fe9HcVHTaL4kJgSWKa7V3uZJ8"},{"@type":"CROSSREF","@value":"10.23919/comex.2025col0010_references_DOI_9V5IkscobqoedJEPnQFsyM4Voi8"},{"@type":"CROSSREF","@value":"10.1109/icoin48656.2020.9016512_references_DOI_R2Fe9HcVHTaL4kJgSWKa7V3uZJ8"},{"@type":"CROSSREF","@value":"10.1587/transinf.2019fcp0006_references_DOI_R2Fe9HcVHTaL4kJgSWKa7V3uZJ8"}]}