{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:18:01Z","timestamp":1725520681400},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540881803"},{"type":"electronic","value":"9783540881810"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-88181-0_27","type":"book-chapter","created":{"date-parts":[[2008,10,20]],"date-time":"2008-10-20T11:31:09Z","timestamp":1224502269000},"page":"211-218","source":"Crossref","is-referenced-by-count":1,"title":["Dynamic Scheme for Packet Classification Using Splay Trees"],"prefix":"10.1007","author":[{"given":"Nizar","family":"Ben-Neji","sequence":"first","affiliation":[]},{"given":"Adel","family":"Bouhoula","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"27_CR1","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/263109.263136","volume":"27","author":"M. Waldvogel","year":"1997","unstructured":"Waldvogel, M., Varghese, G., Turner, J., Plattner, B.: Scalable High-Speed IP Routing Lookups. ACM SIGCOMM Comput. Commu. Review.\u00a027(4), 25\u201336 (1997)","journal-title":"ACM SIGCOMM Comput. Commu. Review."},{"issue":"5","key":"27_CR2","first-page":"28","volume":"6","author":"T. Srinivasan","year":"2006","unstructured":"Srinivasan, T., Nivedita, M., Mahadevan, V.: Efficient Packet Classification Using Splay Tree Models. IJCSNS International Journal of Computer Science and Network Security\u00a06(5), 28\u201335 (2006)","journal-title":"IJCSNS International Journal of Computer Science and Network Security"},{"issue":"1","key":"27_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/296502.296503","volume":"17","author":"V. Srinivasan","year":"1999","unstructured":"Srinivasan, V., Varghese, G.: Fast Address Lookups using Controlled Prefix Expansion. ACM Trans. Comput. Syst.\u00a017(1), 1\u201340 (1999)","journal-title":"ACM Trans. Comput. Syst."},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1142\/S0219265902000586","volume":"3","author":"K. Kim","year":"2002","unstructured":"Kim, K., Sahni, S.: IP Lookup by Binary Search on Prefix Length. J. Interconnect. Netw.\u00a03, 105\u2013128 (2002)","journal-title":"J. Interconnect. Netw."},{"doi-asserted-by":"crossref","unstructured":"Hamed, H., El-Atawy, A., Al-Shaer, E.: Adaptive Statistical Optimization Techniques for Firewall Packet Filtering. In: IEEE INFOCOM, Barcelona, Spain, pp. 1\u201312 (2006)","key":"27_CR5","DOI":"10.1109\/INFOCOM.2006.129"},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"D. Sleator","year":"1985","unstructured":"Sleator, D., Tarjan, R.: Self Adjusting Binary Search Trees. Journal of the ACM\u00a032, 652\u2013686 (1985)","journal-title":"Journal of the ACM"}],"container-title":["Advances in Soft Computing","Proceedings of the International Workshop on Computational Intelligence in Security for Information Systems CISIS\u201908"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88181-0_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:57:03Z","timestamp":1619524623000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88181-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540881803","9783540881810"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88181-0_27","relation":{},"ISSN":["1867-5662","1860-0794"],"issn-type":[{"type":"print","value":"1867-5662"},{"type":"electronic","value":"1860-0794"}],"subject":[]}}