{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T04:27:45Z","timestamp":1747196865752,"version":"3.40.5"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319134871"},{"type":"electronic","value":"9783319134888"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13488-8_12","type":"book-chapter","created":{"date-parts":[[2014,12,12]],"date-time":"2014-12-12T07:50:48Z","timestamp":1418370648000},"page":"121-133","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Compressing Virtual Forwarding Information Bases Using the Trie-folding Algorithm"],"prefix":"10.1007","author":[{"given":"Bence","family":"Mih\u00e1lka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Attila","family":"K\u0151r\u00f6si","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e1bor","family":"R\u00e9tv\u00e1ri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,12,13]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Song, H., Kodialam, M., Hao, F., Lakshman, T.V.: Building scalable virtual routers with trie braiding. In: INFOCOM, 2010 Proceedings IEEE. IEEE (2010)","DOI":"10.1109\/INFCOM.2010.5461960"},{"issue":"1","key":"12_CR2","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/1613676.1613680","volume":"57","author":"P Ferragina","year":"2009","unstructured":"Ferragina, P., Luccio, F., Manzini, G., Muthukrishnan, S.: Compressing and indexing labeled trees, with applications. J. ACM (JACM) 57(1), 4 (2009)","journal-title":"J. ACM (JACM)"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Draves, R.P., et al.: Constructing optimal IP routing tables. In: INFOCOM\u201999, Proceedings of Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 1. IEEE (1999)","DOI":"10.1109\/INFCOM.1999.749256"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"R\u00e9tv\u00e1ri, G., Tapolcai, J., K\u0151r\u00f6si, A., Majd\u00e1n, A., Heszberger, Z.: Compressing IP forwarding tables: towards entropy bounds and beyond. In: Proceedings of the ACM SIGCOMM 2013 Conference on SIGCOMM. ACM (2013)","DOI":"10.1145\/2486001.2486009"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Fu, J., Jennifer, R.: Efficient IP-address lookup with a shared forwarding table for multiple virtual routers. In: Proceedings of the 2008 ACM CoNEXT Conference. ACM (2008)","DOI":"10.1145\/1544012.1544033"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"R\u00e9tv\u00e1ri, G., Csern\u00e1tony, Z., K\u00f6r\u00f6si, A., Tapolcai, J., Cs\u00e1sz\u00e1r, A., Enyedi, G., Pongr\u00e1cz, G.: Compressing IP forwarding tables for fun and profit. In: Proceedings of the 11th ACM Workshop on Hot Topics in Networks. ACM (2012)","DOI":"10.1145\/2390231.2390232"},{"issue":"5","key":"12_CR7","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1016\/j.comnet.2009.10.017","volume":"54","author":"NM Chowdhury","year":"2010","unstructured":"Chowdhury, N.M., Raouf, B.: A survey of network virtualization. Comput. Netw. 54(5), 862\u2013876 (2010)","journal-title":"Comput. Netw."},{"issue":"7","key":"12_CR8","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1109\/TC.2011.130","volume":"61","author":"H Le","year":"2012","unstructured":"Le, H., Prasanna, V.K.: Scalable tree-based architectures for IPv4\/v6 lookup using prefix partitioning. IEEE Trans. Comput. 61(7), 1026\u20131039 (2012)","journal-title":"IEEE Trans. Comput."},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Huang, K., Xie, G., Li, Y., Liu, A.X.: Offset addressing approach to memory-efficient IP address lookup. In: INFOCOM, 2011 Proceedings IEEE. IEEE (2011)","DOI":"10.1109\/INFCOM.2011.5935151"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Luo, L., Xie, G., Uhlig, S., Mathy, L., Salamatian, K., Xie, Y.: Towards TCAM-based scalable virtual routers. In: Proceedings of the 8th International Conference on Emerging Networking Experiments and Technologies. ACM (2012)","DOI":"10.1145\/2413176.2413186"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Luo, L., Xie, G., Salamatian, K., Uhlig, S., Mathy, L., Xie, Y.: A trie merging approach with incremental updates for virtual routers. In: INFOCOM, 2013 Proceedings IEEE. IEEE (2013)","DOI":"10.1109\/INFCOM.2013.6566914"},{"issue":"5","key":"12_CR12","doi-asserted-by":"publisher","first-page":"1489","DOI":"10.1109\/TNET.2011.2181412","volume":"20","author":"H Song","year":"2012","unstructured":"Song, H., Kodialam, M., Hao, F., Lakshman, T.V.: Efficient trie braiding in scalable virtual routers. IEEE\/ACM Trans. Networking (TON) 20(5), 1489\u20131500 (2012)","journal-title":"IEEE\/ACM Trans. Networking (TON)"},{"issue":"6","key":"12_CR13","first-page":"1083","volume":"17","author":"S Nilsson","year":"1999","unstructured":"Nilsson, S., Karlsson, G.: IP-address lookup using LC-tries. IEEE JSAC 17(6), 1083\u20131092 (1999)","journal-title":"IEEE JSAC"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Gupta, P., Prabhakar, B., Boyd, S.P.: Near optimal routing lookups with bounded worst case performance. In: IEEE INFOCOM, pp. 1184\u20131192 (2000)","DOI":"10.1109\/INFCOM.2000.832490"},{"issue":"2","key":"12_CR15","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.comnet.2004.12.002","volume":"49","author":"I Ioannidis","year":"2005","unstructured":"Ioannidis, I., Grama, A.: Level compressed DAGs for lookup tables. Comput. Netw. 49(2), 147\u2013160 (2005)","journal-title":"Comput. Netw."},{"issue":"8","key":"12_CR16","first-page":"1262","volume":"28","author":"X Zhao","year":"2010","unstructured":"Zhao, X., Pacella, D.J., Schiller, J.: Routing scalability: an operator\u2019s view. IEEE JSAC 28(8), 1262\u20131270 (2010)","journal-title":"IEEE JSAC"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Song, H., Kodialam, M.S., Hao, F., Lakshman, T.V.: Scalable IP lookups using shape graphs. In: IEEE ICNP, pp. 73\u201382 (2009)","DOI":"10.1109\/ICNP.2009.5339697"}],"container-title":["Lecture Notes in Computer Science","Advances in Communication Networking"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13488-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T01:01:43Z","timestamp":1747184503000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-13488-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319134871","9783319134888"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13488-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"13 December 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}