Enhancing Replacement Policy of Content-Centric Networking to Support Reaction toward Natural Disaster

  • Abstract
  • Keywords
  • References
  • PDF
  • Abstract

    Replacement policy in Content-Centric Networking (CCN) is a necessary and current, function as an important part in Interest packet caching. Pending Interest Table (PIT) is the main and core cache tables in CCN and plays a significant role for recording the information of Interest packets that are forwarded but are still waiting for matching with incoming Data packets. However, PIT management is more fundamental with regard to CCN operations for better memory efficiency. The PIT size determination of the forwarding system is a difficult problem in PIT management. Due to the limited PIT sizing, PIT replacement is utilized to remove the current entry from PIT and constructing a new space for the incoming entry to it. In a disaster area, this problem is due to the massive Interest packet that generating by survivors from the disaster and rescuers. The PIT overflow could be subjected due to use of long Interest lifetimes that would simultaneously increase the number of entries in the PIT. Thus particularly when there is no flexible replacement policy, hence affecting PIT performance.  Therefore, the ultimate aim of this paper is to develop the replacement policy that can deal with this problem. The proposed policy is a PIT management based on CCN PIT replacement policy for  managing the PIT during a natural disaster, which can lead to mitigating PIT overflowing. The results showed the overall scenarios, the proposed policy better PIT memory usage as well as decreasing the Interest drop, delay time, Interest lifetime and Interest retransmission. A positive significance influence in this work would be to presents a formulate a rule as a function which can decrease the delay and thus be leading to increasing PIT utilization, which will be very much useful for survivors, emergency rescue teams as well as emergency operation centers.



  • Keywords

    Content-Centric Networking, Future Internet Architecture, Pending Interest Table, Natural Disaster, Network Simulation.

  • References

      [1] A. Morelli, M. Tortonesi, C. Stefanelli, and N. Suri, “Information-Centric Networking in Next-generation Communications Scenarios,” J. Netw. Comput. Appl., vol. 80, pp. 232--250, 2016.

      [2] F. Oehlmann, “Content-Centric Networking,” Netw. Archit. Serv., vol. 43, pp. 11–18, 2013.

      [3] D. Saxena, V. Raychoudhury, S. Neeraj, C. Becker, and J. Cao, “Named Data Networking: A Survey,” Comput. Sci. Rev. - Elsevier, vol. 19, pp. 15--55, 2016.

      [4] A. J. Abu, B. Bensaou, and J. M. Wang, “Interest Packets Retransmission in Lossy CCN Networks and its Impact on Network Performance,” in Proceedings of the 1st international conference on Information-centric networking - INC ’14, 2014, pp. 167–176.

      [5] M. Virgilio, M. Guido, and S. Riccardo, “PIT Overload Analysis in Content Centric Networks,” in Proceedings of the 3rd ACM SIGCOMM workshop on Information-centric networking, 2013, pp. 67–72.

      [6] V. Matteo, P. Diego, and L. Linguaglossa, “On the Design and Implementation of a wire-speed Pending Interest Table,” in Computer Communications Workshops (INFOCOM WKSHPS), 2013 IEEE Conference on, 2013, vol. 13, pp. 369--374.

      [7] 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 Commun. Lett., vol. 20, no. 2, pp. 336--339, 2016.

      [8] G. Carofiglio, M. Gallo, D. Perino, and L. Muscariello, “Pending Interest Table Sizing in Named Data Networking,” in Proceedings of the 2nd International Conference on Information-Centric Networking, 2015, pp. 49–58.

      [9] R. Alubady, “An Efficient Pending Interest Table Control Management in Named Data Network,” Universiti Utara Malaysia (UUM), 2017.

      [10] D. Grund and J. Reineke, “Estimating the Performance of Cache Replacement Policies,” in Proceedings - 6th ACM and IEEE International Conference on Formal Methods and Models for Co-Design, MEMOCODE’08, 2008, pp. 101–111.

      [11] R. Nijenhuis, “The International Environmental Emergencies Response System: A Case Study of Supertyphoon Haiyan (Yolanda), The Philippines,” Asian J. Environ. Disaster Manag., vol. 6, no. 2, pp. 175–190, 2014.

      [12] A. M. Al-Bakry and A. K. Hadi, “Collaborative Computer Aid Diagnosis Framework in Cloud Environment based on Multi Agents Systems,” Int. J. Adv. Eng. Technol., vol. 7, no. 1, p. 21, 2014.

      [13] V. G. Menon, J. P. Pathrose, and J. Priya, “Ensuring Reliable Communication in Disaster Recovery Operations with Reliable Routing Technique,” Mob. Inf. Syst., vol. 2016, pp. 1–11, 2016.

      [14] A. K. Idrees, “Neural Network for QoS Multicast Routing in Computer Networks,” J. Babylon Univ., vol. 18, no. 3, 2010.

      [15] L. Bhimarao and S. Uma, “Disaster Area Communication Using Neighbor coverage in MANET,” Int. J. Sci. Eng. Technol. Res., vol. 3, no. 5, pp. 1310–1314, 2014.

      [16] Z. Li, K. Liu, Y. Zhao, and Y. Ma, “MaPIT : An Enhanced Pending Interest Table for NDN With Mapping Bloom Filter,” IEEE Commun. Lett., vol. 18, no. 11, pp. 1915–1918, 2014.

      [17] S. Hassan, A. Habbal, R. Alubady, and M. Salman, “A Taxonomy of Information-Centric Networking Architectures based on Data Routing and Name Resolution Approaches,” J. Telecommun. Electron. Comput. Eng., vol. 8, no. 10, 2016.

      [18] W. Yang and Y. Qin, “An Interest Shaping Mechanism in NDN : Joint Congestion Control and Traffic Management,” in 2018 IEEE International Conference on Communications (ICC), 2018, pp. 1–6.

      [19] M. Tortelli, D. Rossi, G. Boggia, and L. A. Grieco, “ICN Software Tools: Survey and Cross-Comparison,” Simul. Model. Pract. Theory - Elsevier, vol. 63, pp. 23–46, 2016.

      [20] G. M. Brito, P. B. Velloso, and I. M. Moraes, Information-Centric Networks A New Paradigm for the Internet, 1st ed. Croydon, Surrey CR0 4YY: John Wiley & Sons, 2013.

      [21] X. Wang, J. Lv, M. Huang, K. Li, J. Li, and K. Ren, “Energy-efficient ICN Routing Mechanism with QoS Support,” Comput. Networks, vol. 131, no. December 2017, pp. 38–51, 2018.

      [22] X. Q. Xdqj et al., “Scalable High-Speed NDN Name Lookup,” in Proceedings of the 2018 Symposium on Architectures for Networking and Communications Systems, 2018, pp. 55–65.

      [23] D. Saxena and V. Raychoudhury, “Radient: Scalable, Memory Efficient Name Lookup Algorithm for Named Data Networking,” J. Netw. Comput. Appl., vol. 63, pp. 1–13, 2016.

      [24] A. Afanasyev, I. Moiseenko, and L. Zhang, “ndnSIM: NDN Simulator for NS-3,” University of California, Los Angeles, Technical Report NDN-0005, California, Los Angeles, pp. 1–7, 2012.

      [25] D. Perino, B. Labs, B. D. Styles, and C. Network, “A Reality Check for Content Centric Networking,” in ACM ICN 2011, 2011, pp. 44–49.

      [26] W. You, B. Mathieu, P. Truong, J.-F. Peltier, and G. Simon, “DiPIT: A Distributed Bloom-Filter Based PIT Table for CCN Nodes,” in 2012 21st International Conference on Computer Communications and Networks (ICCCN), 2012, pp. 1–7.

      [27] 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 - ANCS ’12, 2012, pp. 211–222.

      [28] S. J. Taher, O. Ghazali, and S. Hassan, “A Review on Cache Replacement Strategies in Named Data Network,” J. Telecommun. Electron. Comput. Eng., vol. 10, no. 2–4, pp. 53–57, 2018.

      [29] R. Alubady, S. Hassan, and A. Habbal, “HLLR : Highest Lifetime Least Request Policy for High Performance Pending Interest Table,” in 2016 IEEE Conference on Open Systems (ICOS), October 10-12, 2016, Langkawi, Malaysia HLLR:, 2016, pp. 42–47.

      [30] S. Hassan, R. Alubady, and A. Habbal, “Performance Evaluation of the Replacement Policies for Pending Interest Table,” J. Telecommun. Electron. Comput. Eng., vol. 8, no. 10, pp. 125–131, 2016.

      [31] T. Gomes et al., “A Survey of Strategies for Communication Networks to Protect against Large-scale Natural Disasters,” in Proceedings of 2016 8th International Workshop on Resilient Networks Design and Modeling, RNDM 2016, 2016, pp. 11–22.

      [32] A. Hannan et al., “Disaster Management System Aided by Named Data Network of Things: Architecture, Design, and Analysis,” Sensors, vol. 18, no. 8, pp. 1–20, 2018.

      [33] R. Alubady, S. Hassan, and A. Habbal, “Adaptive Interest Lifetime in Named Data Networking to Support Disaster Area,” J. Telecommun. Electron. Comput. Eng., vol. 10, no. 2–4, 2018.

      [34] J. Seedorf, D. Kutscher, and B. S. Gill, “Decentralised Interest Counter Aggregation for ICN in Disaster Scenarios,” in Globecom Workshops (GC Wkshps), 2016 IEEE, 2016, pp. 1–6.

      [35] G. Baldini, S. Karanasios, D. Allen, and F. Vergari, “Survey of Wireless Communication Technologies for Public Safety,” IEEE Commun. Surv. Tutorials, vol. 16, no. 2, pp. 619–641, 2014.

      [36] A. G. Fragkiadakis, I. G. Askoxylakis, E. Z. Tragos, and C. V Verikoukis, “Ubiquitous Robust Communications for Emergency Response Using Multi-Operator Heterogeneous Networks,” EURASIP J. Wirel. Commun. Netw., vol. 2011, no. 1, p. 13, 2011.

      [37] R. Alubady, S. Hassan, and A. Habbal, “Pending Interest Table Control Management in Named Data Network,” J. Netw. Comput. Appl., vol. 111, pp. 99–116, 2018.

      [38] A. Ud Din, Ikram and Hassan, Suhaidi and Habbal, “A Content Placement Scheme for Information-Centric Networking,” Adv. Sci. Lett., vol. 21, no. 11, pp. 3482--3484, 2015.

      [39] S. Mastorakis, A. Afanasyev, I. Moiseenko, and L. Zhang, “ndnSIM 2 . 0 : A New Version of the NDN Simulator for NS-3,” University of California, Los Angeles, Tech. Rep. NDN-0028, California, Los Angeles, pp. 1–8, 2015.

      [40] 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 Trans. Veh. Technol., vol. 65, no. 6, pp. 3954–3963, 2016.

      [41] G. Carofiglio, M. Gallo, L. Muscariello, and M. Papalini, “Multipath Congestion Control in Content-Centric Networks,” in Computer Communications Workshops (INFOCOM WKSHPS), 2013 IEEE Conference on, 2013, pp. 363–368.

      [42] 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 - ANCS ’14, 2014, pp. 161–172.

      [43] Y. Sun et al., “Trace-Driven Analysis of ICN Caching Algorithms on Video-on-Demand Workloads,” in Proceedings of the 10th ACM International on Conference on emerging Networking Experiments and Technologies - CoNEXT ’14, 2014, pp. 363–376.




Article ID: 28002
DOI: 10.14419/ijet.v7i4.19.28002

Copyright © 2012-2015 Science Publishing Corporation Inc. All rights reserved.