1. 1. Divya Saxena, Vaskar Raychoudhury, “Radient: Scalable memory efficient name lookup algorithm for named data networking”, Journal of Network and Computer Applications 63 (2016) 1–13.
   2. Haowei Yuan & Patrick Crowley, “Reliably Scalable Name Prefix Lookup”, Architectures for Networking and Communications Systems (2015)
   3. Huawei Yuan and Patrick Crowley, “Scalable Pending Interest Table Design: From Principles to Practice”, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications. (2014)
   4. Miguel A .Martínez-Prieto, Nieves Brisaboa, Rodrigo Cánovas, Francisco Claude, Gonzalo Navarro, Practical “practical compressed string dictionaries”, Information Systems56(2016)73–108.
   5. klaus Schneider , Lixia Zhang, “A Practical Congestion Control Scheme for Named Data Networking”, ACM-ICN ’16, September 26–28, 2016, Kyoto, Japan 2016 ACM. DOI: http://dx.doi.org/10.1145/2984356.2984369
   6. Wei You, Bertrand Mathieu, Patrick Truong, JeanFranc¸ois Peltier, Gwendal Simon, “Realistic Storage of Pending Requests in Content-Centric Network Routers” (2012).
   7. Xiaojun Nie David J. Wilson Jerome Cornet Gerard Damm Yiqiang Zhao, “IP Address Lookup Using A Dynamic Hash Function”, 0-7803-8886-0/05/2005 IEEE CCECE/CCGEI, Saskatoon, May 2005.
   8. Butler Lampson, Venkatachary Srinivasan, and George Varghese, “IP Lookups Using Multiway and Multicolumn Search”, IEEE/ACMTR ANSACTIONOSN N ETWORKINVGO, L.I , NO. 3, JUNE 1999.
   9. Stefanos Kaxiras Georgios Keramidas, “IPStash: a Power-Efficient Memory Architecture for IP-lookup” Proceedings of the 36th International Symposium on Microarchitecture (MICRO-36 2003).
   10. Matteo Virgilio, Guido Marchetto, Riccardo Sisto, “PIT Overload Analysis in Content Centric Networks”, ICN '13 Proceedings of the 3rd ACM SIGCOMM workshop on Information-centric networking August 12 - 12, 2013