{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:32:08Z","timestamp":1725582728142},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642207563"},{"type":"electronic","value":"9783642207570"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20757-0_32","type":"book-chapter","created":{"date-parts":[[2011,4,28]],"date-time":"2011-04-28T01:49:00Z","timestamp":1303955340000},"page":"406-419","source":"Crossref","is-referenced-by-count":6,"title":["A Novel Scalable IPv6 Lookup Scheme Using Compressed Pipelined Tries"],"prefix":"10.1007","author":[{"given":"Michel","family":"Hanna","sequence":"first","affiliation":[]},{"given":"Sangyeun","family":"Cho","sequence":"additional","affiliation":[]},{"given":"Rami","family":"Melhem","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","unstructured":"Arano, T.: IPv4 Address Report. Potaroo Projection (2010), \n                    \n                      http:\/\/www.potaroo.net\/tools\/ipv4\/index.html"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Baboescu, F., Tullsen, D., Rosu, G., Singh, S.: A Tree Based Router Search Engine Architecture with Single Port Memories. ACM Sigarch Com. Arch.\u00a033(2) (2005)","DOI":"10.1145\/1080695.1069979"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"Bando, M., Chao, J.: Flashtrie: Hash-based Prefix-Compressed Trie for IP Route Lookup Beyond 100Gbps. In: IEEE Infocom (2010)","DOI":"10.1109\/INFCOM.2010.5462142"},{"key":"32_CR4","doi-asserted-by":"publisher","DOI":"10.1002\/0470113952","volume-title":"High Performance Switches and Routers","author":"H.J. Chao","year":"2007","unstructured":"Chao, H.J., Liu, B.: High Performance Switches and Routers. Wiley, Chichester (2007)"},{"key":"32_CR5","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"2003","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stien, C.: Introduction to Algorithms. McGraw-Hill, New York (2003)"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Degermark, M., Brodnik, A., Carlsson, S., Pink, S.: Small forwarding tables for fast routing lookups. ACM Sigcomm (1997)","DOI":"10.1145\/263105.263133"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Eatherton, W., Varghese, G., Dittia, Z.: Tree Bitmap: Hardware\/Software IP Lookups with Incremental Updates. ACM Sigcomm Comp. Rev.\u00a034(2) (2004)","DOI":"10.1145\/997150.997160"},{"key":"32_CR8","unstructured":"Gupta, P., Lin, S., Mckeown, N.: Routing Lookups in Hardware at Memory Access Speeds. In: IEEE Infocom (1998)"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"Hanna, M., Demetriades, S., Cho, S., Melhem, R.: CHAP: Enabling Efficient Hardware-based Multiple Hash Schemes for IP Lookup. In: IFIP Networking (2009)","DOI":"10.1007\/978-3-642-01399-7_59"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Hanna, M., Demetriades, S., Cho, S., Melhem, R.: Progressive Hashing for Packet Processing Using Set Associative Memory. In: IEEE\/ACM ANCS (2009)","DOI":"10.1145\/1882486.1882521"},{"key":"32_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jpdc.2010.10.006","volume":"71","author":"M. Hanna","year":"2011","unstructured":"Hanna, M., Demetriades, S., Cho, S., Melhem, R.: Advanced Hashing Schemes for Packet Forwarding Using Set-Associative Memory Architectures. Journal of Distributed and Parallel Computing (JPDC)\u00a071, 1\u201315 (2011)","journal-title":"Journal of Distributed and Parallel Computing (JPDC)"},{"key":"32_CR12","doi-asserted-by":"crossref","unstructured":"Jiang, W., Prasanna, V.: Multi-Terabit IP Lookup Using Parallel Bidirectional Pipelines. In: ACM Computing Frontiers (2008)","DOI":"10.1145\/1366230.1366273"},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"Kim, K.S., Sahni, S.: Efficient Construction of Pipelined Multibit-Trie Router-Tables. IEEE Trans. on Comp.\u00a056(1) (2007)","DOI":"10.1109\/TC.2007.250621"},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"Li, Y.K., Pao, D.: Comparative Studies of Address Lookup Algorithms for IPv6. In: IEEE ICACT (2006)","DOI":"10.1049\/ip-com:20050652"},{"key":"32_CR15","doi-asserted-by":"crossref","unstructured":"Li, Z., Zheng, D., Ma, Y.: Tree, Segment Table, and Route Bucket: A Multistage Algorithm for IPv6 Routing Table Lookup. In: IEEE Infocom (2007)","DOI":"10.1109\/INFCOM.2007.294"},{"key":"32_CR16","doi-asserted-by":"crossref","unstructured":"Nilsson, S., Karlsson, G.: IP-Address Lookup Using LC-Tries. IEEE J. on Sel. Areas in Comm.\u00a017(6) (1999)","DOI":"10.1109\/49.772439"},{"key":"32_CR17","unstructured":"RIS. Routing Information Service, \n                    \n                      http:\/\/www.ripe.net\/ris\/"},{"key":"32_CR18","doi-asserted-by":"crossref","unstructured":"Ruiz-snchez, M., Biersack, E., Dabbous, W.: Survey and Taxonomy of IP Address Lookup Algorithms. IEEE Network\u00a015(2) (2001)","DOI":"10.1109\/65.912716"},{"key":"32_CR19","doi-asserted-by":"crossref","unstructured":"Shah, D., Gupta, P.: Fast Updating Algorithms for TCAMs. IEEE Micro Mag.\u00a021(1) (2001)","DOI":"10.1109\/40.903060"},{"key":"32_CR20","doi-asserted-by":"crossref","unstructured":"Srinivasan, V., Varghese, G.: Fast Address Lookups Using Controlled Prefix Expansion. ACM Trans. Comp. Sys.\u00a017(1) (1999)","DOI":"10.1145\/296502.296503"},{"key":"32_CR21","unstructured":"Thoziyoor, S., Muralimanohar, N., Ahn, J.H., Jouppi, N.P.: CACTI 5.1: An Integrated Cache Timing, Power, and Area Model. Technical report, HP Labs"},{"key":"32_CR22","volume-title":"Network Algorithmics: An Interdisciplinary Approach to Designing Fast Networked Devices","author":"G. Varghese","year":"2005","unstructured":"Varghese, G.: Network Algorithmics: An Interdisciplinary Approach to Designing Fast Networked Devices. Morgan Kaufmann, San Francisco (2005)"},{"key":"32_CR23","doi-asserted-by":"crossref","unstructured":"Wang, G., Tzeng, N.-F.: TCAM-Based Forwarding Engine with Minimum Independent Prefix Set (MIPS) for Fast Updating. In: IEEE ICC (2006)","DOI":"10.1109\/ICC.2006.254712"}],"container-title":["Lecture Notes in Computer Science","NETWORKING 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20757-0_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:00:19Z","timestamp":1606186819000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20757-0_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642207563","9783642207570"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20757-0_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}