An efficient pending interest table control management in named data network

Named Data Networking (NDN) is an emerging Internet architecture that employs a new network communication model based on the identity of Internet content. Its core component, the Pending Interest Table (PIT) serves a significant role of recording Interest packet information which is ready to be sent...

Full description

Saved in:

Bibliographic Details
Main Author:	Alubady, Raaid Nasur Kadham
Format:	Thesis
Language:	eng eng
Published:	2017
Subjects:	TK7885-7895 Computer engineering Computer hardware
Online Access:	https://etd.uum.edu.my/7050/1/s94192_01.pdf https://etd.uum.edu.my/7050/2/s94192_02.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-uum-etd.7050
record_format	uketd_dc
institution	Universiti Utara Malaysia
collection	UUM ETD
language	eng eng
advisor	Hassan, Suhaidi Habbal, Adib
topic	TK7885-7895 Computer engineering Computer hardware TK7885-7895 Computer engineering Computer hardware
spellingShingle	TK7885-7895 Computer engineering Computer hardware TK7885-7895 Computer engineering Computer hardware Alubady, Raaid Nasur Kadham An efficient pending interest table control management in named data network
description	Named Data Networking (NDN) is an emerging Internet architecture that employs a new network communication model based on the identity of Internet content. Its core component, the Pending Interest Table (PIT) serves a significant role of recording Interest packet information which is ready to be sent but in waiting for matching Data packet. In managing PIT, the issue of flow PIT sizing has been very challenging due to massive use of long Interest lifetime particularly when there is no flexible replacement policy, hence affecting PIT performance. The aim of this study is to propose an efficient PIT Control Management (PITCM) approach to be used in handling incoming Interest packets in order to mitigate PIT overflow thus enhancing PIT utilization and performance. PITCM consists of Adaptive Virtual PIT (AVPIT) mechanism, Smart Threshold Interest Lifetime (STIL) mechanism and Highest Lifetime Least Request (HLLR) policy. The AVPIT is responsible for obtaining early PIT overflow prediction and reaction. STIL is meant for adjusting lifetime value for incoming Interest packet while HLLR is utilized for managing PIT entries in efficient manner. A specific research methodology is followed to ensure that the work is rigorous in achieving the aim of the study. The network simulation tool is used to design and evaluate PITCM. The results of study show that PITCM outperforms the performance of standard NDN PIT with 45% higher Interest satisfaction rate, 78% less Interest retransmission rate and 65% less Interest drop rate. In addition, Interest satisfaction delay and PIT length is reduced significantly to 33% and 46%, respectively. The contribution of this study is important for Interest packet management in NDN routing and forwarding systems. The AVPIT and STIL mechanisms as well as the HLLR policy can be used in monitoring, controlling and managing the PIT contents for Internet architecture of the future.
format	Thesis
qualification_name	other
qualification_level	Doctorate
author	Alubady, Raaid Nasur Kadham
author_facet	Alubady, Raaid Nasur Kadham
author_sort	Alubady, Raaid Nasur Kadham
title	An efficient pending interest table control management in named data network
title_short	An efficient pending interest table control management in named data network
title_full	An efficient pending interest table control management in named data network
title_fullStr	An efficient pending interest table control management in named data network
title_full_unstemmed	An efficient pending interest table control management in named data network
title_sort	efficient pending interest table control management in named data network
granting_institution	Universiti Utara Malaysia
granting_department	Awang Had Salleh Graduate School of Arts & Sciences
publishDate	2017
url	https://etd.uum.edu.my/7050/1/s94192_01.pdf https://etd.uum.edu.my/7050/2/s94192_02.pdf
_version_	1747828150524444672
spelling	my-uum-etd.70502021-05-02T01:41:10Z An efficient pending interest table control management in named data network 2017 Alubady, Raaid Nasur Kadham Hassan, Suhaidi Habbal, Adib Awang Had Salleh Graduate School of Arts & Sciences Awang Had Salleh Graduate School of Arts and Sciences TK7885-7895 Computer engineering. Computer hardware QA75 Electronic computers. Computer science Named Data Networking (NDN) is an emerging Internet architecture that employs a new network communication model based on the identity of Internet content. Its core component, the Pending Interest Table (PIT) serves a significant role of recording Interest packet information which is ready to be sent but in waiting for matching Data packet. In managing PIT, the issue of flow PIT sizing has been very challenging due to massive use of long Interest lifetime particularly when there is no flexible replacement policy, hence affecting PIT performance. The aim of this study is to propose an efficient PIT Control Management (PITCM) approach to be used in handling incoming Interest packets in order to mitigate PIT overflow thus enhancing PIT utilization and performance. PITCM consists of Adaptive Virtual PIT (AVPIT) mechanism, Smart Threshold Interest Lifetime (STIL) mechanism and Highest Lifetime Least Request (HLLR) policy. The AVPIT is responsible for obtaining early PIT overflow prediction and reaction. STIL is meant for adjusting lifetime value for incoming Interest packet while HLLR is utilized for managing PIT entries in efficient manner. A specific research methodology is followed to ensure that the work is rigorous in achieving the aim of the study. The network simulation tool is used to design and evaluate PITCM. The results of study show that PITCM outperforms the performance of standard NDN PIT with 45% higher Interest satisfaction rate, 78% less Interest retransmission rate and 65% less Interest drop rate. In addition, Interest satisfaction delay and PIT length is reduced significantly to 33% and 46%, respectively. The contribution of this study is important for Interest packet management in NDN routing and forwarding systems. The AVPIT and STIL mechanisms as well as the HLLR policy can be used in monitoring, controlling and managing the PIT contents for Internet architecture of the future. 2017 Thesis https://etd.uum.edu.my/7050/ https://etd.uum.edu.my/7050/1/s94192_01.pdf text eng public https://etd.uum.edu.my/7050/2/s94192_02.pdf text eng public other doctoral Universiti Utara Malaysia [1] G. M. Brito, P. B. Velloso, and I. M. Moraes, Information Centric Networks: A New Paradigm for the Internet. John Wiley and Sons, 2013. [2] W. Li, S. M. Oteafy, and H. S. Hassanein, “Dynamic Adaptive Streaming over Popularity-driven Caching in Information-Centric Networks,” in 2015 IEEE International Conference on Communications (ICC). IEEE, 2015, pp. 5747– 5752. [3] K. Michael, “Growth of the Internet 2014,” Internet Society Organization, Tech. Rep., 2014, accessed: 15-Jun-2014. [Online]. Available: https://www.internetsociety.org/sites/default/ files/Global_Internet_Report_2014.pdf [4] ICNRG-IRTF, “Information-Centric Networking Research Group,” January 2016, accessed: 15-Jul-2013. [Online]. Available: https://irtf.org/icnrg [5] M. Hovaidi Ardestani, “Congestion Control in Information Centric Networking using Neural Networks,” Ph.D. dissertation, Aalto University, 2014. [6] J. Scott, Social Network Analysis. Sage, 2012. [7] K. Hampton, L. S. Goulet, L. Rainie, and K. Purcell, “Social Petworking Sites and Our Lives,” Pew Research Center’s Internet and American Life Project, pp. 1–85, 2011, accessed: 17-May-2013. [Online]. Available: http://cn.cnstudiodev.com/uploads/document_ attachment/attachment/46/pew_-_social_networking _sites_and_our_lives.pdf [8] K. Yuta, N. Ono, and Y. Fujiwara, “A Gap in the Community-Size Distribution of a Large-Scale Social Networking Site,” arXiv preprint physics, pp. 1–9, 2007, accessed: 10-Jul-2013. [Online]. Available: https://arxiv.org/pdf/physics/0701168.pdf [9] P. Juluri, V. Tamarapalli, and D. Medhi, “Measurement of Quality of Experience of Video-on-Demand Services: A Survey,” IEEE Communications Surveys & Tutorials, vol. 18, no. 1, pp. 401–418, 2016. [10] D. Ciullo, V. Martina, M. Garetto, and E. Leonardi, “How Much can Largescale Video-on-Demand Benefit from Users’ Cooperation?” IEEE/ACM Transactions on Networking, vol. 23, no. 6, pp. 1846–1861, 2015. [11] M. Amadeo, C. Campolo, A. Molinaro, and N. Mitton, “Named Data Networking: a Natural Design for Data Collection in Wireless Sensor Networks,” in Proceedings of Wireless Days (WD) - 2013 IFIP. IEEE, 2013, pp. 1–6. [12] S. Devaraj, D. Ortiz, S. Chinnasamy, and R. MELENDRES, “System and Method for On-line Multi-player Interactive Wagering,” accessed: 9-Apr-2014. [Online]. Available: https://www.google.com/patents/US20160300432 [13] M.W. Yacenda, “Interactive Computer Gaming System with Audio Response,” accessed: 18-Apr-2014. [Online]. Available: https://www.google.com/patents/US20010003100 [14] M. Amadeo, C. Campolo, and A. Molinaro, “Internet of Things via Named Data Networking: the Support of Push Traffic,” in Proceedings of 2014 International Conference and Workshop on the Network of the Future (NOF). IEEE, 2014, pp. 1–5. [15] M. Loffler and A. Tschiesner, “The Internet of Things and the Future of Manufacturing,” McKinsey on Business Technology, vol. 30, pp. 8–13, 2013. [16] L. Atzori, A. Iera, and G. Morabito, “The Internet of Things: A Survey,” Computer networks, vol. 54, no. 15, pp. 2787–2805, 2010. [17] M. Gallo, “Traffic and Resource Management in Content-Centric Networks: Design and Evaluation,” Ph.D. dissertation, TELECOM ParisTech, 2012. [18] D. Papadimitriou, H. Tschofenig, A. Rosas, S. Zahariadis et al., “Fundamental Limitations of current Internet and the path to Future Internet,” European Commission FIArch Group, vol. 1, pp. 1–15, 2011. [19] GENI, “The Global Environment for Network Innovations,” accessed: 24-Aug-2014. [Online]. Available: http://www.geni.net [20] FIA, “European Future Internet Assembly,” accessed: 5-Jun-201. [Online]. Available: http://www.future-internet.eu [21] AsiaFI, “Asia Future Internet Forum,” accessed: 12-Feb-2013. [Online]. Available: http://www.asiafi.net/ [22] D. P. Arjunwadkar, “Introduction of NDN with Comparison to Current Internet Architecture based on TCP/IP,” International Journal of Computer Applications, vol. 105, no. 5, pp. 31–35, 2014. [23] T. Zahariadis, D. Papadimitriou, H. Tschofenig, S. Haller, P. Daras, G. D. Stamoulis, and M. Hauswirth, “Towards a Future Internet Architecture Theodore,” in The Future Internet Assembly. Springer, 2011, pp. 7–18. [24] Cisco, “Cisco Visual Networking Index: Global Mobile Data Traf- fic Forecast Update, 2014-2019,” Cisco, Technical Report, Tech. Rep., 2015. [25] A. V. Vasilakos, Z. Li, G. Simon, and W. You, “Information Centric Network: Research Challenges and Opportunities,” Journal of Network and Computer Applications, vol. 52, pp. 1–10, 2015. [26] F. L. F. Almeida and J. M. Lourenco, “Information Centric Networks-Design Issues, Principles and Approaches,” International Journal of Latest Trends in Computing, vol. 3, no. 3, pp. 58–66, 2012. [27] B. Mathieu, P. Truong, J.-F. Peltier, Y. Wei, and G. Simon, Media Networks-Architectures, Applications, and Standards. CRC Press, 2012, ch. Information-Centric Networking: Current Research Activities and Challenges, pp. 141–184. [28] A. Ghodsi, S. Shenker, T. Koponen, A. Singla, B. Raghavan, and J. Wilcox, “Information-Centric Networking: Seeing the Forest for the Trees,” in Proceedings of the 10th ACM Workshop on Hot Topics in Networks. ACM, 2011, pp. 1–6. [29] N. Fotiou, P. Nikander, D. Trossen, and G. C. Polyzos, “Developing Information Networking Further: From PSIRP to PURSUIT,” in Proceedings of International Conference on Broadband Communications, Networks and Systems. Springer, 2010, pp. 1–13. [30] D. Kutscher, H. Flinck, and H. Karl, “Information-Centric Networking: A position paper,” in Proceedings of 6th GI/ITG KuVS Workshop on Future Internet, 2010, pp. 1–2. [31] Z. Jaffri, Z. Ahmad, and M. Tahir, “Named Data Networking (NDN), New Approach to Future Internet Architecture Design: A Survey,” International Journal of Informatics and Communication Technology (IJ-ICT), vol. 2, no. 3, pp. 155–165, 2013. [32] T. Koponen, M. Chawla, B.-G. Chun, A. Ermolinskiy, K. H. Kim, S. Shenker, and I. Stoica, “A Data-Oriented (and Beyond) Network Architecture,” ACM SIGCOMM Computer Communication Review, vol. 37, no. 4, pp. 181–192, 2007. [33] C. Dannewitz, “NetInf: An Information-Centric Design for the Future Internet,” in Proceedings of 3rd GI/ITG KuVSWorkshop on The Future Internet, 2009, pp. 1–3. [34] V. Jacobson, D. K. Smetters, J. D. Thornton, M. F. Plass, N. H. Briggs, and R. L. Braynard, “Networking Named Content,” in Proceedings of the 5th International Conference on Emerging Networking Experiments and Technologies. ACM, 2009, pp. 1–12. [35] L. Zhang, D. Estrin, J. Burke, V. Jacobson, J. D. Thornton, D. K. Smetters, B. Zhang, G. Tsudik, D. Massey, C. Papadopoulos et al., “Named Data Networking (NDN) Project,” PARC Technical Report 2010-003, Tech. Rep., 2010. [Online]. Available: http://citeseerx.ist.psu.edu/viewdoc/download? doi=10.1.1.366.6736&rep=rep1&type=pdf [36] M. Tortelli, G. Piro, L. A. Grieco, and G. Boggia, “On Simulating Bloom Filters in the ndnSIM Open Source Simulator,” Simulation Modelling Practice and Theory, vol. 52, pp. 149–163, 2015. [37] V. Jacobson, J. Burke, D. Estrin, L. Zhang, B. Zhang, G. Tsudik, K. Claffy, D. Krioukov, D. Massey, C. Papadopoulos et al., “Named Data Networking (NDN) Project 2012-2013 Annual Report,” Tech. Rep., 2014. [38] D. Saxena, V. Raychoudhury, N. Suri, C. Becker, and J. Cao, “Named Data Networking: A Survey,” Computer Science Review, vol. 19, pp. 15–55, 2016. [39] M. Amadeo, C. Campolo, and A. Molinaro, “Forwarding Strategies in Named Data Wireless Ad hoc Networks: Design and Evaluation,” Journal of Network and Computer Applications, vol. 50, pp. 148–158, 2015. [40] C.-Y. Ho, C.-Y. Ho, and C.-C. Tseng, “A Case Study of Cache Performance in ICN - Various Combinations of Transmission Behavior and Cache Replacement Mechanism,” in Proceedings of 2015 17th International Conference on Advanced Communication Technology (ICACT). IEEE, 2015, pp. 323–328. [41] H. Moustafa and S. Zeadally, Media Networks: Architectures, Applications, and Standards. CRC Press, 2012. [42] M. M. S. Soniya and K. Kumar, “A Survey on Named Data Networking,” in Proceedings of 2015 2nd International Conference on Electronics and Communication Systems (ICECS). IEEE, 2015, pp. 1515–1519. [43] F. Oehlmann, “Content-Centric Networking,” Network, vol. 43, pp. 11–18, 2013. [44] Z. Zhu, A. Afanasyev, and L. Zhang, “A New Perspective on Mobility Support,” Named-Data Networking Project,Techncal Report, Tech. Rep., 2013, accessed: 23-Jan-2015. [Online]. Available: https://named-data.net/wp-content/ uploads/TRmobility.pdf [45] S. DiBenedetto, C. Papadopoulos, and D. Massey, “Routing Policies in Named Data Networking,” in Proceedings of the ACM SIGCOMM Workshop on Information-Centric Networking. ACM, 2011, pp. 38–43. [46] H. Dai, B. Liu, Y. Chen, and Y. Wang, “On Pending Interest Table in Named Data Networking,” in Proceedings of the Eighth ACM/IEEE Symposium on Architectures for Networking and Communications Systems. ACM, 2012, pp. 211–222. [47] A. Afanasyev, I. Moiseenko, L. Zhang et al., “ndnSIM: NDN Simulator for NS-3,” University of California, Los Angeles, Technical Report NDN-0005, Tech. Rep., 2012, accessed: 29-June-2013. [Online]. Available: https://named-data.net/wp-content/uploads/ TRndnsim.pdf [48] C. Tsilopoulos, G. Xylomenos, and Y. Thomas, “Reducing Forwarding State in Content-Centric Networks with Semi-Stateless Forwarding,” in Proceedings of IEEE INFOCOM 2014-IEEE Conference on Computer Communications. IEEE, 2014, pp. 2067–2075. [49] A. Azgin, R. Ravindran, and G. Wang, “Mobility Study for Named Data Networking in Wireless Access Networks,” in Proceedings of 2014 IEEE International Conference on Communications (ICC). IEEE, 2014, pp. 3252–3257. [50] G. Carofiglio, M. Gallo, L. Muscariello, and D. Perino, “Pending Interest Table Sizing in Named Data Networking,” in Proceedings of the 2nd International Conference on Information-Centric Networking. ACM, 2015, pp. 49–58. [51] C. Park, T. Kwon, and Y. Choi, “Scalability Problem for Interest Diffusion in Content-Centric Network,” in Proceedings of 14th Conference on Next Generation Communication Software (NCS), 2010, pp. 58–66. [52] H. Yuan and P. Crowley, “Scalable Pending Interest Table Design: From Principles to Practice,” in Proceedings of IEEE INFOCOM 2014-IEEE Conference on Computer Communications. IEEE, 2014, pp. 2049–2057. [53] Z. Zhou, X. Tan, H. Li, Z. Zhao, and D. Ma, “MobiNDN: A Mobility Support Architecture for NDN,” in Proceedings of 2014 33rd Chinese Control Conference (CCC). IEEE, 2014, pp. 5515–5520. [54] Z. Li, J. Bi, S. Wang, and X. Jiang, “Compression of Pending Interest Table with Bloom Filter in Content Centric Network,” in CFI ’12: Proceedings of the 7th International Conference on Future Internet Technologies. ACM, 2012, pp. 1–4. [55] M. Varvello, D. Perino, and L. Linguaglossa, “On the Design and Implementation of a Wire-speed Pending Interest Table,” in Proceedings of 2013 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS). IEEE, 2013, pp. 369–374. [56] W. So, A. Narayanan, and D. Oran, “Named Data Networking on a Router: Fast and DoS-resistant Forwarding with Hash Tables,” in Proceedings of the Ninth ACM/IEEE Symposium on Architectures for Networking and Communications Systems. IEEE Press, 2013, pp. 215–226. [57] P. Gasti, G. Tsudik, E. Uzun, and L. Zhang, “DoS and DDoS in Named Data Networking,” in Proceedings of 2013 22nd International Conference on Computer Communication and Networks (ICCCN). IEEE, 2013, pp. 1–7. [58] M. Virgilio, G. Marchetto, and R. Sisto, “PIT Overload Analysis in Content Centric Networks,” in Proceedings of the 3rd ACM SIGCOMM Workshop on Information-Centric Networking. ACM, 2013, pp. 67–72. [59] A. J. Abu, B. Bensaou, and A. M. Abdelmoniem, “Inferring and Controlling Congestion in CCN via the Pending Interest Table Occupancy,” in Local Computer Networks (LCN), 2016 IEEE 41st Conference on. IEEE, 2016, pp. 433–441. [60] M. Vahlenkamp, “Threats on Information-Centric Networking,” Master’s thesis, Faculty of Engineering and Computer Science, 2013, accessed: 23-Feb.-2014. [Online]. Available: https://www.inet.haw-hamburg.de/teaching/ws- 2012-13/master-projekt/markus-vahlenkamp_ seminar.pdf [61] S. H. Bouk, S. H. Ahmed, M. A. Yaqub, D. Kim, and M. Gerla, “DPEL: Dynamic PIT Entry Lifetime in Vehicular Named Data Networks,” IEEE Communications Letters, vol. 20, no. 2, pp. 336–339, 2016. [62] L. Wang, R. Wakikawa, R. Kuntz, R. Vuyyuru, and L. Zhang, “Data Naming in Vehicle-to-Vehicle Communications,” in Proceedings of 2012 IEEE Conference on Computer CommunicationsWorkshops (INFOCOM WKSHPS). IEEE, 2012, pp. 328–333. [63] K. Shilton, J. A. Burke, and L. Zhang, “Anticipating Policy and Social Implications of Named Data Networking,” Communication of the ACM, vol. 59, no. 12, pp. 92–101, 2016. [64] X. Jiang and J. Bi, “Interest Set Mechanism to Improve the Transport of Named Data Networking,” in Proceedings of the ACM SIGCOMM 2013 Conference on SIGCOMM - SIGCOMM ’13, no. 4. ACM, 2013, pp. 515–516. 2[65] D. Perino, M. Varvello, L. Linguaglossa, R. Laufer, and R. Boislaigue, “Caesar: A Content Router for High-Speed Forwarding on Content Names,” in Proceedings of the tenth ACM/IEEE Symposium on Architectures for Networking and Communications Systems. ACM, 2014, pp. 137–148. [66] M. Dehghan, B. Jiang, A. Dabirmoghaddam, and D. Towsley, “On the Analysis of Caches with Pending Interest Tables,” in Proceedings of the 2nd International Conference on Information-Centric Networking. ACM, 2015, pp. 69–78. [67] Z. Li, K. Liu, Y. Zhao, and Y. Ma, “MaPIT : An Enhanced Pending Interest Table for NDN With Mapping Bloom Filter,” IEEE Communications Letters, vol. 18, no. 11, pp. 1915–1918, 2014. [68] W. You, B. Mathieu, P. Truong, J.-F. Peltier, and G. Simon, “DiPIT: A Distributed Bloom-Filter Based PIT Table for CCN Nodes,” in Proceedings of 2012 21st International Conference on Computer Communications and Networks (ICCCN). IEEE, 2012, pp. 1–7. [69] C. Anastasiades, L. von Rotz, and T. Braun, “Adaptive Interest Lifetimes for Information-Centric Wireless Multi-hop Communication,” in Proceedings of 2015 8th IFIP Wireless and Mobile Networking Conference (WMNC). IEEE, 2015, pp. 40–47. [70] G. Carofiglio, M. Gallo, and L. Muscariello, “ICP: Design and Evaluation of an Interest Control Protocol for Content-Centric Networking,” in Proceedings of 2012 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS). IEEE, 2012, pp. 304–309. [71] C. Yao, L. Fan, Z. Yan, and Y. Xiang, “Long-Term Interest for Realtime Applications in the Named Data Network,” in Proceedings of ACM AsiaFI12. ACM, 2012, pp. 1–8. [72] D. Grund and J. Reineke, “Estimating the Performance of Cache Replacement Policies,” in Proceedings of 6th ACM/IEEE International Conference on Formal Methods and Models for Co-Design, 2008 (MEMOCODE 2008). IEEE, 2008, pp. 101–112. [73] Y. Smaragdakis, “General Adaptive Replacement Policies,” in Proceedings of the 4th International Symposium on Memory Management. ACM, 2004, pp. 108–119. [74] B. Azimdoost, C. Westphal, and H. R. Sadjadpour, “Fundamental Limits on Throughput Capacity in Information-Centric Networks,” IEEE Transactions on Communications, vol. 64, no. 12, pp. 5037–5049, 2016. [75] A. Zahemszky, B. Gajic, C. E. Rothenberg, C. Reason, D. Trossen, D. Lagutin, J. Tuononen, and K. Katsaros, “Experimentally-Driven Research in Publish/-Subscribe Information-Centric Inter-Networking,” in Proceedings of International Conference on Testbeds and Research Infrastructures. Springer, 2010, pp. 469–485. [76] H. Al-Zoubi, A. Milenkovic, and M. Milenkovic, “Performance Evaluation of Cache Replacement Policies for the SPEC CPU2000 Benchmark Suite,” in Proceedings of 42nd Annual Southeast Regional Conference. ACM, 2004, pp. 267–272. [77] K. Shimazu, N. Kawashima, and M. Ito, “Position paper: Design Concept of Ad-hoc Information Network System for disaster mitigation,” in Communications (APCC), 2013 19th Asia-Pacific Conference on. IEEE, 2013, pp. 138– 141. [78] C. Yi, “Adaptive Forwarding in Named Data Networking,” Ph.D. dissertation, University of Arizona - Graduate College, 2014. [79] P. Rodriguez, S.-M. Tan, and C. Gkantsidis, “On the Feasibility of Commercial, Legal P2P Content Distribution,” ACM SIGCOMM Computer Communication Review, vol. 36, no. 1, pp. 75–78, 2006. [80] F. Almeida, M. T. Andrade, N. B. Melazzi, H. Walker, Richard nad Hussmann, and I. S. Venieris, Enhancing the Internet with CONVERGENCE System. Springer Science and Business Media, 2014, vol. Furth. [81] P. Daras, D. Williams, C. Guerrero, I. Kegel, I. Laso, J. Bouwen, J. Meunier, N. Niebert, and T. Zahariadis, “Why do We Need a Content-Centric Future Internet,” Information Society and Media Journal, pp. 1–23, 2009. [82] M. Tortelli, D. Rossi, G. Boggia, and L. Grieco, “ICN Software Tools: Survey and Cross-Comparison,” Simulation Modelling Practice and Theory, vol. 63, pp. 23–46, 2016. [83] D. Saxena, V. Raychoudhury, and N. SriMahathi, “SmartHealth-NDNoT: Named Data Network of Things for Healthcare Services,” in MobileHealth 2015 Proceedings of the 2015 Workshop on Pervasive Wireless Healthcare. ACM, 2015, pp. 1–6. [84] G. Xylomenos, C. N. Ververidis, V. A. Siris, N. Fotiou, C. Tsilopoulos, X. Vasilakos, K. V. Katsaros, and G. C. Polyzos, “A Survey of Information-Centric Networking Research,” IEEE Communications Surveys and Tutorials, vol. 16, no. 2, pp. 1024–1049, 2014. [85] M. F. Bari, S. R. Chowdhury, R. Ahmed, R. Boutaba, and B. Mathieu, “A Survey of Naming and Routing in Information-Centric Networks,” IEEE Communications Magazine, vol. 50, no. 12, pp. 44–53, 2012. [86] B. Ahlgren, C. Dannewitz, C. Imbrenda, D. Kutscher, and B. Ohlman, “A Survey of Information-Centric Networking,” IEEE Communications Magazine, vol. 50, no. 7, pp. 26–36, 2012. [87] R. Tourani, T. Mick, S. Misra, and G. Panwar, “Security, Privacy, and Access Control in Information-Centric Networking: A Survey,” IEEE Communications Surveys and Tutorials, pp. 1–35, 2016. [88] D. Goergen, T. Cholez, J. Francois, and T. Engel, “Security Monitoring for Content-Centric Networking,” in Data Privacy Management and Autonomous Spontaneous Security. Springer, 2013, pp. 274–286. [89] G. Tyson, N. Sastry, I. Rimac, R. Cuevas, and A. Mauthe, “A Survey of Mobility in Information-Centric Networks : Challenges and Research Directions,” in Proceedings of the 1st ACM workshop on Emerging Name-Oriented Mobile Networking Design-Architecture, Algorithms, and Applications. ACM, 2012, pp. 1–6. [90] Y. Rekhter, T. Li, and S. Hares, “A Border Gateway Protocol 4 (BGP-4),” Network Working Group, Technical report, Tech. Rep., 2006. [91] H. Wang, Z. Chen, F. Xie, and F. Han, “A Data Structure for Content Cache Management in Content-Centric Networking,” in Proceedings of 2012 Third International Conference on Networking and Distributed Computing. IEEE, 2012, pp. 11–15. [92] G. Carofiglio, V. Gehlen, and D. Perino, “Experimental Evaluation of Memory Management in Content-Centric Networking,” in Proceedings of 2011 IEEE International Conference on Communications (ICC). IEEE, 2011, pp. 1–6. [93] C. Tsilopoulos and G. Xylomenos, “Supporting Diverse Traffic Types in Information Centric Networks,” in Proceedings of the ACM SIGCOMM Workshop on Information-Centric Networking. ACM, 2011, pp. 13–18. [94] A. Carzaniga, D. S. Rosenblum, and A. L. Wolf, “Content-Based Addressing and Routing: A General Model and its Application,” University of Colorado, Technical Report CU-CS-902-00, Tech. Rep., 2000. [95] A. Carzaniga, M. J. Rutherford, and A. L. Wolf, “A Routing Scheme for Content-based Networking,” in Proceedings of Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies (INFOCOM). IEEE, 2004, pp. 918–928. [96] B. Ahlgren, M. D Ambrosio, M. Marchisio, I. Marsh, C. Dannewitz, B. Ohlman, K. Pentikousis, O. Strandberg, R. Rembarz, and V. Vercellone, “Design Considerations for a Network of Information,” in Proceedings of the 2008 ACM CoNEXT Conference. ACM, 2008, pp. 66–72. [97] P. Jokela, A. Zahemszky, C. Esteve Rothenberg, S. Arianfar, and P. Nikander, “LIPSIN: Line Speed Publish/Subscribe Inter-Networking,” ACM SIGCOMM Computer Communication Review, vol. 39, no. 4, pp. 195–206, 2009. [98] V. Dimitrov and V. Koptchev, “PSIRP: Publish-Subscribe Internet Routing Paradigm: New Ideas for Future Internet,” in Proceedings of the 11th International Conference on Computer Systems and Technologies (CompSysTech10). ACM, 2010, pp. 167–171. [99] G. Garcia, A. Beben, F. J. Ramon, A. Maeso, I. Psaras, G. Pavlou, N. Wang, J. Sliwinski, S. Spirou, S. Soursos et al., “COMET: Content Mediator Architecture for Content-aware Networks,” in Proceedings of Future Network and MobileSummit 2011 Conference Proceedings Paul Cunningham and Miriam Cunningham (Eds) IIMC International Information Management Corporation. IEEE, 2011, pp. 1–8. [100] K. Katsaros, G. Xylomenos, and G. C. Polyzos, “MultiCache: An Overlay Architecture for Information-Centric Networking,” Computer Networks, vol. 55, no. 4, pp. 936–947, 2011. [101] A. Detti, N. Blefari Melazzi, S. Salsano, and M. Pomposini, “CONET: A Content Centric Inter-Networking Architecture,” in Proceedings of the ACM SIGCOMM Workshop on Information-Centric Networking. ACM, 2011, pp. 50–55. [102] D. Raychaudhuri, K. Nagaraja, and A. Venkataramani, “MobilityFirst: A Robust and Trustworthy Mobility-Centric Architecture for the Future Internet,” ACM SIGMOBILE Mobile Computing and Communications Review, vol. 16, no. 3, pp. 2–13, 2012. [103] M. Amadeo, A. Molinaro, and G. Ruggeri, “E-CHANET: Routing, Forwarding and Transport in Information-Centric Multihop Wireless Networks,” Computer communications, vol. 36, no. 7, pp. 792–803, 2013. [104] Y. Wang, K. He, H. Dai, W. Meng, J. Jiang, B. Liu, and Y. Chen, “Scalable Name Lookup in NDN Using Effective Name Component Encoding,” in Proceedings of 2012 IEEE 32nd International Conference on Distributed Computing Systems (ICDCS). IEEE, 2012, pp. 688–697. [105] C. Yi, J. Abraham, A. Afanasyev, L. Wang, B. Zhang, and L. Zhang, “On The Role of Routing in Named Data Networking,” in Proceedings of the 1st International Conference on Information-Centric Networking. ACM, 2014, pp. 27–36. [106] A. Hoque, S. O. Amin, A. Alyyan, B. Zhang, L. Zhang, and L. Wang, “NLSR: Named-data Link State Routing Protocol,” in Proceedings of the 3rd ACM SIGCOMM Workshop on Information-Centric Networking. ACM, 2013, pp. 15–20. [107] H. Dai, J. Lu, Y.Wang, and B. Liu, “A Two-layer Intra-domain Routing Scheme for Named Data Networking,” in Proceedings of 2012 IEEE Global Communications Conference (GLOBECOM). IEEE, 2012, pp. 2815–2820. [108] L.Wang, A. Hoque, C. Yi, A. Alyyan, and B. Zhang, “OSPFN: An OSPF based Routing Protocol for Named Data Networking,” University of Memphis and University of Arizona, Technical Report NDN-0003, Tech. Rep., 2012. [109] H. Choi, J. Yoo, T. Chung, N. Choi, T. Kwon, and Y. Choi, “CoRC: Coordinated Routing and Caching for Named Data Networking,” in Proceedings of the tenth ACM/IEEE Symposium on Architectures for Networking and Communications Systems. ACM, 2014, pp. 161–172. [110] X. Hu, C. Papadopoulos, J. Gong, and D. Massey, “Not So Cooperative Caching in Named Data Networking,” in Proceedings of 2013 IEEE Global Communications Conference (GLOBECOM). IEEE, 2013, pp. 2263–2268. [111] M. Rezazad and Y. Tay, “A Cache Miss Equation for Partitioning an NDN Content Store,” in Proceedings of the 9th Asian Internet Engineering Conference. ACM, 2013, pp. 1–8. [112] H. Dai, Y. Wang, H. Wu, J. Lu, and B. Liu, “Towards Line-Speed and Accurate On-line Popularity Monitoring on NDN Routers,” in Proceedings of 2014 IEEE 22nd International Symposium of Quality of Service (IWQoS). IEEE, 2014, pp. 178–187. [113] J. Ran, N. Lv, D. Zhang, Y. Ma, and Z. Xie, “On Performance of Cache Policies in Named Data Networking,” in Proceedings of International Conference on Advanced Computer Science and Electronics Information, 2013, pp. 668–671. [114] W. Dron, A. Leung, M. Uddin, S. Wang, T. Abdelzaher, R. Govindan, and J. Hancock, “Information-maximizing Caching in Ad Hoc Networks with Named Data Networking,” in Proceedings of 2013 IEEE 2nd Network Science Workshop (NSW). IEEE, 2013, pp. 90–93. [115] S. H. Ahmed, S. H. Bouk, M. A. Yaqub, D. Kim, H. Song, and J. Lloret, “CODIE: COntrolled Data and Interest Evaluation in Vehicular Named Data Networks,” IEEE Transactions on Vehicular Technology, vol. 65, no. 6, pp. 3954–3963, 2016. [116] S. H. Bouk, M. Yaqub, S. H. Ahmed, and D. Kim, “Evaluating Interest/Data Propagation in Vehicular Named Data Networks,” in Proceedings of the 2015 Conference on research in adaptive and convergent systems. ACM, 2015, pp. 256–259. [117] Y. Rao, D. Gao, H. Zhang, and C. H. Foh, “Mobility Support for the User in NDN-Based Cloud Storage Service,” in Proceedings of 2015 IEEE Globecom Workshops. IEEE, 2015, pp. 1–6. [118] X. Jiang, J. Bi, and Y. Wang, “What Benefits Does NDN Have in Supporting Mobility,” in Proceedings of 2014 IEEE Symposium on Computers and Communications (ISCC). IEEE, 2014, pp. 1–6. [119] L. Wang, O. Waltari, and J. Kangasharju, “MobiCCN: Mobility Support with Greedy Routing in Content-Centric Networks,” in Proceedings of 2013 IEEE Global Communications Conference (GLOBECOM). IEEE, 2013, pp. 2069–2075. [120] A. A. Barakabitze, T. Xiaoheng, and G. Tan, “A Survey on Naming, Name Resolution and Data Routing in Information Centric Networking (ICN),” International Journal of Advanced Research in Computer and Communication Engineering, vol. 3, no. 10, pp. 8322–8330, 2014. [121] A. Afanasyev, “Addressing Operational Challenges in Named Data Networking Through NDNs Distributed Database,” Ph.D. dissertation, University of California, 2013. [122] R. L. Rivest, A. Shamir, and L. Adleman, “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems,” Communications of the ACM, vol. 21, no. 2, pp. 120–126, 1978. [123] M. Gao, X. Zhu, and Y. Su, “Protecting Router Cache Privacy in Named Data Networking,” in Proceedings of 2015 IEEE/CIC International Conference on Communications in China (ICCC). IEEE, 2015, pp. 1–5. [124] T. Nguyen, R. Cogranne, and G. Doyen, “An Optimal Statistical Test for Robust Detection against Interest Flooding Attacks in CCN,” in Proceedings of 2015 IFIP/IEEE International Symposium on Integrated Network Management (IM). IEEE, 2015, pp. 252–260. [125] C. Ghali, G. Tsudik, and E. Uzun, “Network-Layer Trust in Named-Data Networking,” ACM SIGCOMM Computer Communication Review, vol. 44, no. 5, pp. 12–19, 2014. [126] D. Kim, S. Nam, J. Bi, and I. Yeom, “Efficient Content Verification in Named Data Networking,” in Proceedings of the 2nd International Conference on Information-Centric Networking. ACM, 2015, pp. 109–116. [127] A. Compagno, M. Conti, C. Ghali, and G. Tsudik, “To NACK or not to NACK? Negative Acknowledgments in Information-Centric Networking,” in Proceedings of 2015 24th International Conference on Computer Communication and Networks (ICCCN). IEEE, 2015, pp. 1–10. [128] T. Asami, B. Namsraijav, Y. Kawahara, K. Sugiyama, A. Tagami, T. Yagyu, K. Nakamura, and T. Hasegawa, “Moderator-Controlled Information Sharing by Identity-Based Aggregate Signatures for Information Centric Networking,” in Proceedings of the 2nd International Conference on Information-Centric Networking. ACM, 2015, pp. 157–166. [129] T. Song, H. Yuan, P. Crowley, and B. Zhang, “Scalable Name-Based Packet Forwarding: From Millions to Billions,” in Proceedings of the 2nd International Conference on Information-Centric Networking. ACM, 2015, pp. 19–28. [130] Y. Li, D. Zhang, X. Yu,W. Liang, J. Long, and H. Qiao, “Accelerate NDN Name Lookup using FPGA: Challenges and A Scalable Approach,” in Proceedings of 24th International Conference on Field Programmable Logic and Applications (FPL). IEEE, 2014, pp. 1–4. [131] D. O Coileain and D. O Mahony, “SAVANT: Aggregated Feedback and Accountability Framework for Named Data Networking,” in Proceedings of the 1st international conference on Information-Centric Networking. ACM, 2014, pp. 187–188.

An efficient pending interest table control management in named data network

Similar Items