{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:18:08Z","timestamp":1725488288330},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540442561"},{"type":"electronic","value":"9783540458036"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45803-4_20","type":"book-chapter","created":{"date-parts":[[2007,7,31]],"date-time":"2007-07-31T05:37:11Z","timestamp":1185860231000},"page":"215-225","source":"Crossref","is-referenced-by-count":0,"title":["Performance Prediction Methods for Address Lookup Algorithms of IP Routers"],"prefix":"10.1007","author":[{"given":"Ryo","family":"Kawabe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shingo","family":"Ata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masayuki","family":"Murata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,13]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"M. A. Ruiz-S\u00e1nchez, E. W. Biersack, and W. Dabbous, \u201cSurvey and taxonomy of IP address lookup algorithms,\u201d IEEE Network, vol. 15, pp. 8\u201323, Mar.\/Apr. 2001.","DOI":"10.1109\/65.912716"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Y. Rekhter and T. Li, \u201cAn architecture for IP address with CIDR.\u201d RFC1518, Sep. 1993.","DOI":"10.17487\/rfc1518"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"M. Uga and K. Shiomoto, \u201cA fast and compact longest prefix look-up method using pointer cache for very long network address,\u201d in Proceedings of IEEE ICCCN\u2019 99, pp. 595\u2013602, Oct. 1999.","DOI":"10.1109\/ICCCN.1999.805579"},{"key":"20_CR4","unstructured":"P. Gupta, B. Prabhakar, and S. Boyd, \u201cNear-optimal routing lookups with bounded worst case performance,\u201d in Proceedings of IEEE INFOCOM 2000, pp. 1184\u20131192, Mar. 2000."},{"key":"20_CR5","unstructured":"M. Aida and T. Abe, \u201cPseudo-address generation algorithm of packet destinations for Internet performance simulation,\u201d in Proceedings of IEEE INFOCOM 2001, pp. 1425\u20131433, Apr. 2001."},{"key":"20_CR6","unstructured":"S. Ata, M. Murata, and H. Miyahara, \u201cAnalysis of network traffic and its application to design of high-speed routers,\u201d IEICE Transactions on Information and Systems, vol. E83-D, pp. 988\u2013995, May 2000."},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"V. Brazauskas and R. Serfling, \u201cRobust and efficient estimation of the tail index of a one-parameter Pareto distribution,\u201d North American Actuarial Journal, pp. 12\u201327, Apr. 2000.","DOI":"10.1080\/10920277.2000.10595935"},{"key":"20_CR8","unstructured":"D. E. Knuth., The Art of Computer Programming, vol. 3. Addison-Wesley, 1973."},{"key":"20_CR9","unstructured":"A. McAuley and P. Francis, \u201cFast routing table lookup using CAMs,\u201d in Proceedings of IEEE INFOCOM\u201993, vol. 3, pp. 1382\u20131391, Mar. 1993."},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"K. Thompson, G. J. Miller, and R. Wilder, \u201cWide-area Internet traffic patterns and characteristics,\u201d IEEE Network, pp. 10\u201323, Nov. 1997.","DOI":"10.1109\/65.642356"},{"key":"20_CR11","unstructured":"Lara Network, http:\/\/www.laratech.com\/ ."},{"key":"20_CR12","unstructured":"NetLogic Microsystems, http:\/\/www.netlogicmicro.com\/ ."},{"key":"20_CR13","unstructured":"Siber Core, http:\/\/www.sibercore.com\/ ."},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"P. Warkhede, S. Suri, and G. Varghese, \u201cFast packet classification for two-dimensional conflict-free filters,\u201d in Proceedings of IEEE INFOCOM 2001, Apr. 2001.","DOI":"10.1109\/INFCOM.2001.916639"}],"container-title":["Lecture Notes in Computer Science","Information Networking: Wired Communications and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45803-4_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T15:51:09Z","timestamp":1556725869000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45803-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540442561","9783540458036"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45803-4_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}