{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T05:34:56Z","timestamp":1740548096410,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540235514"},{"type":"electronic","value":"9783540301974"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30197-4_47","type":"book-chapter","created":{"date-parts":[[2010,9,22]],"date-time":"2010-09-22T20:28:51Z","timestamp":1285187331000},"page":"473-482","source":"Crossref","is-referenced-by-count":0,"title":["Accelerating Computation Bounded IP Lookup Methods by Adding Simple Instructions"],"prefix":"10.1007","author":[{"given":"Hossein","family":"Mohammadi","sequence":"first","affiliation":[]},{"given":"Nasser","family":"Yazdani","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"47_CR1","unstructured":"Yazdani, N., Min, P.S.: Fast and Salable Schemes for IP Lookup Problem. In: Proc. of IEEE Conf. on High Performance Switching and Routing, Heidelberg Germany (June 2000)"},{"key":"47_CR2","doi-asserted-by":"crossref","unstructured":"Mohammadi, H., Yazdani, N., Robatmili, B., Nourani, M.: HASIL: Hardware Assisted Software-based IP Lookup for Large Routing Tables. In: Proceeding of the 11th IEEE International conference on networks (ICON) 2003, Sydney \u2013 Australia, pp. 99\u2013105 (2003)","DOI":"10.1109\/ICON.2003.1266174"},{"key":"47_CR3","unstructured":"Yazdani, N., Mohammadi, H.: IP Lookup in Software for Large Routing Tables Using DMP-Tree Data Structure. In: Proc. of the 9th Asia Pacific Conference on Communications, APCC (2003)"},{"key":"47_CR4","unstructured":"Mohammadi, H., Robatmili, B., Ghasemi, H.R., Yazdani, N., Nourani, M.: Line-speed IP Lookup Using Improved Functional Units. In: Proc. Of the 9th Iranian Conference of Computer Science (CSICC) 2004, Tehran, Iran, pp. 97\u2013102 (2004)"},{"key":"47_CR5","unstructured":"Robatmili, B., Mohammadi, H., Ghasemi, H.R., Yazdani, N.: Augmenting General Purpose Processors for Network Processing. In: Proc. Of the 2nd Conf. of Field Programmable Technology, 2003, Tokyo, Japan (2003)"},{"key":"47_CR6","doi-asserted-by":"crossref","unstructured":"Waldvogel, M., Varghese, G., et al.: Scalable High Speed IP Routing Lookups. In: Proc. of ACM SIGCOM 1997, Cannes, France, pp. 25\u201335 (1997)","DOI":"10.1145\/263109.263136"},{"key":"47_CR7","doi-asserted-by":"crossref","unstructured":"Degermark, M., Brodnik, A., Carlsson, S., Pink, S.: Small Forwarding Tables for Fast Routing Lookups. In: Proceeding of ACM SIGCOM 1997 Conf., Cannes, France, pp. 3\u201314 (1997)","DOI":"10.1145\/263109.263133"},{"key":"47_CR8","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1109\/90.503764","volume":"4","author":"W. Doeringer","year":"1996","unstructured":"Doeringer, W., Karjoth, G., Nassehi, M.: Routing On Longest Matching Prefixes. IEEE\/ACM Trans. Net.\u00a04, 86\u201397 (1996)","journal-title":"IEEE\/ACM Trans. Net."},{"key":"47_CR9","doi-asserted-by":"crossref","unstructured":"Lampson, B., Srinivasan, V., Varghese, G.: IP Lookups Using Multiway and Multicolumn Search. Proc. IEEE Infocom (1998)","DOI":"10.1109\/90.779199"},{"key":"47_CR10","unstructured":"Sahni, S., Kim, K.S.: Efficient Construction of Variable-Stride Multibit Tries For IP Lookup. In: Proceedings IEEE Symposium on Applications and the Internet, SAINT (2002)"},{"issue":"6","key":"47_CR11","first-page":"1083","volume":"17","author":"S. Nilsson","year":"1999","unstructured":"Nilsson, S., Karlsson, G.: IP Address Lookups Using LC-Tries. IEEE JSAC\u00a017(6), 1083\u20131092 (1999)","journal-title":"IEEE JSAC"},{"key":"47_CR12","doi-asserted-by":"crossref","unstructured":"Yazdani, N., Salimi, N.: Performing IP Lookup on Very High Line Speed.In: Proceeding of ICT 2002, Shiraz, Iran (2002)","DOI":"10.1007\/3-540-36087-5_60"},{"key":"47_CR13","unstructured":"McKeown, N., Gupta, P., Lin, S.: Routing Lookups in Hardware at Memory Access Speeds. In: Proceeding of IEEE Infocom 1998 Conf., pp. 1240\u20131247 (1998)"},{"key":"47_CR14","unstructured":"Chen, W.E., Tsai, C.J.: A fast and scalable IP lookup scheme for high-speed networks .Proceedings of IEEE ICON (1999)"},{"key":"47_CR15","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"2001","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein: Introduction to Algorithms. MIT Univ. Press, Cambridge (2001)"},{"key":"47_CR16","unstructured":"Tzeng, H.Y.: Longest Prefix Search Using Compressed Trees. In: proceeding of IEEE GlobCom 1998 Conf., Sydney, Australia (1998)"},{"key":"47_CR17","unstructured":"Lampson, B., Srinivasan, V., Varghese, G.: IP Lookups Using Multiway and Multicolumn Search. In: Proceeding of IEEE Infocom 1998 Conf., San Francisco, CA, pp. 1247\u20131256 (1998)"},{"key":"47_CR18","doi-asserted-by":"crossref","unstructured":"Chiueh, T.-C., Pradhan, P.: High Performance IP Routing Lookup Using CPU Caching. In: Proceeding of IEEE Infocom (1999)","DOI":"10.1109\/INFCOM.1999.752162"},{"key":"47_CR19","unstructured":"Liu, H.: Routing Prefix Caching in Network Processor Design. In: Proc. International Conference on Computer Communications and networks (ICCCN), Phoenix, AZ (2001)"},{"key":"47_CR20","unstructured":"McKeown, N., Gupta, P., Lin, S.: Routing Lookups in Hardware at Memory Access Speeds. In: Proceeding of IEEE Infocom 1998 Conf., pp. 1240\u20131247 (1998)"},{"key":"47_CR21","unstructured":"Yazdani, N., Mohammadi, H.: DMP-Tree: A Dynamic M-way Tree Data Structure for String Matching. Elsevier Journal of Algorithms (submitted to)"}],"container-title":["Lecture Notes in Computer Science","Universal Multiservice Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30197-4_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T00:22:09Z","timestamp":1740529329000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30197-4_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540235514","9783540301974"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30197-4_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}