영역 분할 사분 트라이에 블룸 필터 선 검색을 사용한 패킷 분류 알고리즘

논문상세정보
' 영역 분할 사분 트라이에 블룸 필터 선 검색을 사용한 패킷 분류 알고리즘' 의 주제별 논문영향력
논문영향력 선정 방법
논문영향력 요약
주제
  • area-based quad-trie
  • bloom filter
  • leaf-pushing
  • packet classification
  • 리프-푸싱
  • 블룸 필터
  • 영역분할 사분 트라이
  • 패킷분류
동일주제 총논문수 논문피인용 총횟수 주제별 논문영향력의 평균
50 0

0.0%

' 영역 분할 사분 트라이에 블룸 필터 선 검색을 사용한 패킷 분류 알고리즘' 의 참고문헌

  • The Source Code of Packet Classification Bench
  • Succinct Representation of Static Packet Classifiers
    W. Lu IEEE/ACM Transactions on Networking 17 (3) : 803 ~ 816 [2009]
  • Space/Time Trade-offs in Hash Coding with Allowable Errors
    B. Bloom Commun. ACM 13 (7) : 422 ~ 426 [1970]
  • Space Decomposition Techniques for Fast Layer-4Switching
    M. M. Buddhikot Proc. of Protocols for High Speed Networks : 25 ~ 41 [1999]
  • Packet Classification Using Tuple Space Search
    V. Srinivasan Proc. of ACM SIGCOMM Computer Communication Review 29 (4) : 135 ~ 146 [1999]
  • On adding bloom filters to longest prefix matching algorithms
    H. Lim IEEE Trans. on Computers 63 (2) : 411 ~ 423 [2012]
  • Next Generation Routers
    H. Jonathan Chao Proc. of the IEEE 90 (9) : 1518 ~ 1588 [2002]
  • Longest Prefix Matching Using Bloom Filters
    S. Dharmapurikar IEEE/ACM Trans on Networking 14 : 397 ~ 409 [2006]
  • Hierarchical Packet Classification Using a Bloom Filter and Rule-Priority Tries
    A. G. Alagu Priya Computer Communications 33 (10) : 1215 ~ 1226 [2010]
  • Fast Address Lookups Using Controlled Prefix Expansion
    V. Srinuvasan ACM Trans on Computer Systems 17 (1) : 1 ~ 40 [1999]
  • Efficient Packet Classification for Network Intrusion Detection Using FPGA
    H. Song Proc. of ACM SIGDA FPGA : 238 ~ 245 [2005]
  • Boundary Cutting for Packet Classification
    H. Lim IEEE/ACM Trans. Networking 22 (2) : 443 ~ 456 [2014]
  • Binary Search on Prefix Lengths for IP Address Lookup
    J. Mun IEEE Communications Letters 10 (6) : 492 ~ 494 [2006]
  • Algorithms for Packet Classification
    P. Gupta IEEE Network 15 (2) : 24 ~ 32 [2001]
  • A Quad영역Trie Conditionally Merged with a Decision Tree for Packet Classification
    H. Lim IEEE Communications Letters 18 (4) : 676 ~ 679 [2014]
  • A Memory-Efficient Hashing by Multi-Predicate Bloom Filters for Packet Classification
    H. Yu Proc. of IEEE INFOCOM : 2467 ~ 2475 [2008]