earticle

논문검색

Steerable Name Lookup based on Classified Prefixes and Scalable One Memory Access Bloom Filter for Named Data Networking

원문정보

Sheng Huang, Jianghua Xu, Xiaofei Yang, Zhen Wu, Cuicui Niu

보안공학연구지원센터(IJFGCN) International Journal of Future Generation Communication and Networking Vol.9 No.7 2016.07 pp.87-100
피인용수 : 0건 (자료제공 : 네이버학술정보)

목차

Abstract
 1. Introduction
 2. Steerable Name Lookup based on Classified Prefixes
  2.1. 3M Prefix Table
  2.2. Classified Prefixes
  2.3. The Structure of Hash Table and NCS
  2.4. The Aggregation of Prefixes in NCS
 3. Scalable One Memory Access Bloom Filter
 4. Theory Analysis
  4.1. The False Positive Rate of SBF Analysis
  4.2. Time Complexity Analysis
 5. Simulation Results and Analysis
  5.1. Experimental Setup
  5.2. Name Trace
  5.3. Experimental Result
 6. Conclusion
 Acknowledgements
 References

키워드

저자정보

  • Sheng Huang Key Laboratory of Optical Communication and Networks, Chongqing University of Posts and Telecommunications, Chongqing, 400065, China
  • Jianghua Xu Key Laboratory of Optical Communication and Networks, Chongqing University of Posts and Telecommunications, Chongqing, 400065, China
  • Xiaofei Yang Key Laboratory of Optical Communication and Networks, Chongqing University of Posts and Telecommunications, Chongqing, 400065, China
  • Zhen Wu Key Laboratory of Optical Communication and Networks, Chongqing University of Posts and Telecommunications, Chongqing, 400065, China
  • Cuicui Niu Key Laboratory of Optical Communication and Networks, Chongqing University of Posts and Telecommunications, Chongqing, 400065, China

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.