{"title":"内容中心网络中使用Bloom过滤器压缩待处理兴趣表","authors":"Zhaogeng Li, J. Bi, Sen Wang, Xiaoke Jiang","doi":"10.1145/2377310.2377326","DOIUrl":null,"url":null,"abstract":"We propose compressed PIT structure based on Bloom Filter. And we argue that United Bloom Filter is better than Counting Bloom Filter in the PIT compression.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"110 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":"{\"title\":\"Compression of pending interest table with Bloom filter in content centric network\",\"authors\":\"Zhaogeng Li, J. Bi, Sen Wang, Xiaoke Jiang\",\"doi\":\"10.1145/2377310.2377326\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose compressed PIT structure based on Bloom Filter. And we argue that United Bloom Filter is better than Counting Bloom Filter in the PIT compression.\",\"PeriodicalId\":409750,\"journal\":{\"name\":\"International Conference of Future Internet\",\"volume\":\"110 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-09-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"23\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference of Future Internet\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2377310.2377326\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference of Future Internet","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2377310.2377326","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Compression of pending interest table with Bloom filter in content centric network
We propose compressed PIT structure based on Bloom Filter. And we argue that United Bloom Filter is better than Counting Bloom Filter in the PIT compression.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
