閱讀全文 | |
篇名 |
Efficient Lookup Schemes Based on Splitting Name for NDN
|
---|---|
並列篇名 | Efficient Lookup Schemes Based on Splitting Name for NDN |
作者 | Qingtao Wu、Jinrong Yan、Mingchuan Zhang、Junlong Zhu、Ruijuan Zheng |
英文摘要 | Named Data Networking (NDN) is a novel networking architecture which retrieves the content by using its variable-length names. Name-based forwarding is a typical feature of NDN. Therefore, it has necessitated the design of fast forwarding lookup algorithms. In this paper, we propose an efficient name lookup scheme called SNBS (Split the Name into Basis and Suffix). In this scheme, we decompose Basis into many components. Each component of Basis is stored in a Counting Bloom Filter (CBF). In addition, we also introduce a correlation verification method to ensure inherent correlation of all components of Basis. Furthermore, Suffix is processed by tree bitmap. By simulation, we show that our proposed lookup scheme can improve the lookup rate. Moreover, our scheme also reduces the bound of false positive probability. |
起訖頁 | 195-203 |
關鍵詞 | NDN、Name lookup、Counting bloom filter、Tree bitmap |
刊名 | 網際網路技術學刊 |
期數 | 201901 (20:1期) |
出版單位 | 台灣學術網路管理委員會 |
DOI |
|
QR Code | |
該期刊 上一篇
| Mining of High Average-Utility Patterns with Item-Level Thresholds |
該期刊 下一篇
| A Further Study of Optimal Matrix Construction for Matrix Embedding Steganography |