DSpace at EWHA: On adding bloom filters to longest prefix matching algorithms

View : 1087 Download: 0

Full metadata record

DC Field	Value	Language
dc.contributor.author	임혜숙	*
dc.date.accessioned	2016-08-28T11:08:50Z	-
dc.date.available	2016-08-28T11:08:50Z	-
dc.date.issued	2014	*
dc.identifier.issn	0018-9340	*
dc.identifier.other	OAK-11203	*
dc.identifier.uri	https://dspace.ewha.ac.kr/handle/2015.oak/227638	-
dc.description.abstract	binary search on levels; Bloom filter; Internet; IP address lookup; leaf pushing; longest prefix matching; multihashing; router	*
dc.language	English	*
dc.title	On adding bloom filters to longest prefix matching algorithms	*
dc.type	Article	*
dc.relation.issue	2	*
dc.relation.volume	63	*
dc.relation.index	SCI	*
dc.relation.index	SCIE	*
dc.relation.index	SCOPUS	*
dc.relation.startpage	411	*
dc.relation.lastpage	423	*
dc.relation.journaltitle	IEEE Transactions on Computers	*
dc.identifier.doi	10.1109/TC.2012.193	*
dc.identifier.wosid	WOS:000333469900012	*
dc.identifier.scopusid	2-s2.0-84892409793	*
dc.author.google	Lim H.	*
dc.author.google	Lim K.	*
dc.author.google	Lee N.	*
dc.author.google	Park K.-H.	*
dc.contributor.scopusid	임혜숙(7403095209)	*
dc.date.modifydate	20240419140241	*