메뉴 건너뛰기




Volumn , Issue , 2012, Pages

DiPIT: A distributed bloom-filter based PIT table for CCN nodes

Author keywords

[No Author keywords available]

Indexed keywords

BLOOM FILTERS; CONTENT DISSEMINATION; FALSE POSITIVE; HASH TABLE; INCOMING PACKETS; INTERNET ARCHITECTURE; INTERNET USAGE; MEMORY SPACE; TABLE SIZE;

EID: 84867767067     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCCN.2012.6289282     Document Type: Conference Paper
Times cited : (81)

References (22)
  • 1
    • 84867811361 scopus 로고    scopus 로고
    • Project CCNx. http://www.ccnx.org/.
  • 3
    • 70450232823 scopus 로고    scopus 로고
    • Network applications of bloom filters: A survey
    • A. Broder and M. Mitzenmacher. Network applications of bloom filters: A survey. Internet Mathematics, 1(4):485-509, 2004.
    • (2004) Internet Mathematics , vol.1 , Issue.4 , pp. 485-509
    • Broder, A.1    Mitzenmacher, M.2
  • 4
    • 80052180954 scopus 로고    scopus 로고
    • Experimental evaluation of memory management in content-centric networking
    • G. Carofiglio, V. Gehlen, and D. Perino. Experimental evaluation of memory management in content-centric networking. In Proc. of IEEE ICC, 2011.
    • Proc. of IEEE ICC, 2011
    • Carofiglio, G.1    Gehlen, V.2    Perino, D.3
  • 8
    • 39049092006 scopus 로고    scopus 로고
    • Theory and network applications of dynamic bloom filters
    • D. Guo, J. Wu, H. Chen, and X. Luo. Theory and network applications of dynamic bloom filters. In IEEE INFOCOM, 2006.
    • (2006) IEEE INFOCOM
    • Guo, D.1    Wu, J.2    Chen, H.3    Luo, X.4
  • 9
    • 84855723651 scopus 로고    scopus 로고
    • Realization of name lookup table in routers towards content-centric networks
    • H. Hwang, S. Ata, and M. Murata. Realization of name lookup table in routers towards content-centric networks. In Proc. of CNSM, 2011.
    • Proc. of CNSM, 2011
    • Hwang, H.1    Ata, S.2    Murata, M.3
  • 11
    • 84867821216 scopus 로고    scopus 로고
    • Bloom filter based routing for content-based publish/subscribe
    • Z. Jerzak and C. Fetzer. Bloom filter based routing for content-based publish/subscribe. In ACM DEBS, 2008.
    • (2008) ACM DEBS
    • Jerzak, Z.1    Fetzer, C.2
  • 17
    • 79960879420 scopus 로고    scopus 로고
    • One memory access bloom filters and their generalization
    • Y. Qiao, T. Li, and S. Chen. One memory access bloom filters and their generalization. In IEEE INFOCOM, 2011.
    • (2011) IEEE INFOCOM
    • Qiao, Y.1    Li, T.2    Chen, S.3
  • 18
    • 3042576209 scopus 로고    scopus 로고
    • TCAM architecture for IP lookup using prefix properties
    • V. Ravikumar and R. Mahapatra. TCAM architecture for IP lookup using prefix properties. IEEE Micro, 24(2):60-69, 2004.
    • (2004) IEEE Micro , vol.24 , Issue.2 , pp. 60-69
    • Ravikumar, V.1    Mahapatra, R.2
  • 19
    • 70349653166 scopus 로고    scopus 로고
    • Ipv6 lookups using distributed and load balanced bloom filters for 100gbps core router line cards
    • H. Song, F. Hao, M. Kodialam, and T. Lakshman. Ipv6 lookups using distributed and load balanced bloom filters for 100gbps core router line cards. In IEEE INFOCOM, 2009.
    • (2009) IEEE INFOCOM
    • Song, H.1    Hao, F.2    Kodialam, M.3    Lakshman, T.4
  • 21
    • 76749169068 scopus 로고    scopus 로고
    • Buffalo: Bloom filter forwarding architecture for large organizations
    • M. Yu, A. Fabrikant, and J. Rexford. Buffalo: bloom filter forwarding architecture for large organizations. In ACM CoNEXT, 2009.
    • (2009) ACM CoNEXT
    • Yu, M.1    Fabrikant, A.2    Rexford, J.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.