메뉴 건너뛰기




Volumn 18, Issue 1, 2014, Pages 102-105

Scalable name lookup with adaptive prefix bloom filter for named data networking

Author keywords

adaptive prefix; NDN; Scalable name lookup

Indexed keywords

ADAPTIVE PREFIX; FALSE POSITIVE RATES; LOOKUP OPERATIONS; LOOKUPS; MEMORY REQUIREMENTS; NAMED DATA NETWORKINGS; NDN; PACKET FORWARDING;

EID: 84893780075     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/LCOMM.2013.112413.132231     Document Type: Article
Times cited : (103)

References (10)
  • 1
  • 2
    • 84945709825 scopus 로고
    • Trie memory
    • E. Fredkin, Trie memory, Commun. of the ACM, vol. 3, no. 9, pp. 490-499, 1960.
    • (1960) Commun. of the ACM , vol.3 , Issue.9 , pp. 490-499
    • Fredkin, E.1
  • 3
    • 84893801129 scopus 로고    scopus 로고
    • Scalable name lookup in NDN using effective name component encoding
    • Y. Wang, K. He, et al., Scalable name lookup in NDN using effective name component encoding, 2012 IEEE ICDCS.
    • 2012 IEEE ICDCS
    • Wang, Y.1    He, K.2
  • 4
    • 0014814325 scopus 로고
    • Space/time trade-offs in hash coding with allowable errors
    • B. H. Bloom, Space/time trade-offs in hash coding with allowable errors, Commun. of the ACM, vol. 13, no. 7, pp. 422-426, 1970.
    • (1970) Commun. of the ACM , vol.13 , Issue.7 , pp. 422-426
    • Bloom, B.H.1
  • 5
    • 0034206002 scopus 로고    scopus 로고
    • Summary cache: A scalable wide-area web cache sharing protocol
    • L. Fan, P. Cao, et al., Summary cache: A scalable wide-area web cache sharing protocol, IEEE/ACM Trans. Netw., vol. 8, no. 3, pp. 281-293, 2000.
    • (2000) IEEE/ACM Trans. Netw. , vol.8 , Issue.3 , pp. 281-293
    • Fan, L.1    Cao, P.2
  • 6
    • 33645983944 scopus 로고    scopus 로고
    • Longest prefix matching using Bloom filters
    • S. Dharmapurikar, D. E. Taylor, et al., Longest prefix matching using Bloom filters, IEEE/ACM Trans. Netw., vol. 14, pp. 397-409, 2006.
    • (2006) IEEE/ACM Trans. Netw. , vol.14 , pp. 397-409
    • Dharmapurikar, S.1    Taylor, D.E.2
  • 7
    • 84883072082 scopus 로고    scopus 로고
    • NameFilter: Achieving fast name lookup with low memory cost via applying two-stage Bloom filters
    • Y. Wang, T. Pan, et al., NameFilter: Achieving fast name lookup with low memory cost via applying two-stage Bloom filters, 2013 IEEE INFOCOM Mini-Conference.
    • 2013 IEEE INFOCOM Mini-Conference
    • Wang, Y.1    Pan, T.2
  • 8
    • 84893802307 scopus 로고    scopus 로고
    • Toward fast NDN software forwarding lookup engine based on Hash tables
    • W. So, A. Narayanan, et al., Toward fast NDN software forwarding lookup engine based on Hash tables, 2012 ACM ANCS.
    • 2012 ACM ANCS
    • So, W.1    Narayanan, A.2
  • 9
    • 84871760798 scopus 로고    scopus 로고
    • A survey of naming and routing in information-centric networks
    • M. F. Bari, S. Chowdhury, et al., A survey of naming and routing in information-centric networks, IEEE Commun. Mag., vol. 50, no. 12, pp. 44-53, 2012.
    • (2012) IEEE Commun. Mag. , vol.50 , Issue.12 , pp. 44-53
    • Bari, M.F.1    Chowdhury, S.2
  • 10
    • 84904483560 scopus 로고    scopus 로고
    • CCTCP: A scalable receiver-driven congestion control protocol for CCN
    • L. Saino, C. Cocora, and G. Pavlou, CCTCP: A scalable receiver-driven congestion control protocol for CCN, 2013 IEEE ICC.
    • 2013 IEEE ICC
    • Saino, L.1    Cocora, C.2    Pavlou, G.3


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