论文信息 - On Sharing an FIB Table in Named Data Networking - 字舞流文

On Sharing an FIB Table in Named Data Networking

Hyesook Lim | Ju Hyoung Mun

[1] Hyesook Lim,et al. Bitmap-based priority-NPT for packet forwarding at named data network , 2018, Comput. Commun..

[2] Burton H. Bloom,et al. Space/time trade-offs in hash coding with allowable errors , 1970, CACM.

[3] Jungwon Lee,et al. Name prefix matching using bloom filter pre-searching , 2015, 2015 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS).

[4] Alexander Afanasyev,et al. journal homepage: www.elsevier.com/locate/comcom , 2022 .

[5] Sasu Tarkoma,et al. Theory and Practice of Bloom Filters for Distributed Systems , 2012, IEEE Communications Surveys & Tutorials.

[6] David E. Taylor,et al. Longest prefix matching using bloom filters , 2006, TNET.

[7] Gaogang Xie,et al. A Shifting Bloom Filter Framework for Set Queries , 2015, Proc. VLDB Endow..

[8] HyunYong Lee,et al. Improving Bloom Filter Forwarding Architectures , 2014, IEEE Communications Letters.

[9] Hyesook Lim,et al. Cache sharing using bloom filters in named data networking , 2017, J. Netw. Comput. Appl..

[10] Hongke Zhang,et al. Scalable Name Lookup with Adaptive Prefix Bloom Filter for Named Data Networking , 2014, IEEE Communications Letters.

[11] Andrei Broder,et al. Network Applications of Bloom Filters: A Survey , 2004, Internet Math..

[12] Masayuki Murata,et al. Potential based routing as a secondary best-effort routing for Information Centric Networking (ICN) , 2013, Comput. Networks.