DSpace at EWHA: Binary search on trie levels with a bloom filter for longest prefix match

View : 643 Download: 0

Full metadata record

DC Field	Value	Language
dc.contributor.author	임혜숙	*
dc.date.accessioned	2016-08-29T12:08:39Z	-
dc.date.available	2016-08-29T12:08:39Z	-
dc.date.issued	2014	*
dc.identifier.isbn	9781479916337	*
dc.identifier.other	OAK-14436	*
dc.identifier.uri	https://dspace.ewha.ac.kr/handle/2015.oak/230330	-
dc.description.sponsorship	IEEE Communications Society;IEEE Vancouver Section	*
dc.language	English	*
dc.publisher	Institute of Electrical and Electronics Engineers Inc.	*
dc.title	Binary search on trie levels with a bloom filter for longest prefix match	*
dc.type	Conference Paper	*
dc.relation.index	SCOPUS	*
dc.relation.startpage	38	*
dc.relation.lastpage	43	*
dc.relation.journaltitle	2014 IEEE 15th International Conference on High Performance Switching and Routing, HPSR 2014	*
dc.identifier.doi	10.1109/HPSR.2014.6900879	*
dc.identifier.scopusid	2-s2.0-84908599713	*
dc.author.google	Lee J.	*
dc.author.google	Lim H.	*
dc.contributor.scopusid	임혜숙(7403095209)	*
dc.date.modifydate	20240419140241	*