Named Data Object Organization in Distributed Name Resolution System for Information Centric Network Environment

Authors

  • Suhaidi Hassan InterNetWorks Research Lab, School of Computing, Universiti Utara Malaysia, 06010 UUM Sintok, Kedah, Malaysia.
  • Walid Elbreiki InterNetWorks Research Lab, School of Computing, Universiti Utara Malaysia, 06010 UUM Sintok, Kedah, Malaysia.
  • Shivaleela Arlimatti InterNetWorks Research Lab, School of Computing, Universiti Utara Malaysia, 06010 UUM Sintok, Kedah, Malaysia.
  • Adib Habbal InterNetWorks Research Lab, School of Computing, Universiti Utara Malaysia, 06010 UUM Sintok, Kedah, Malaysia.

Keywords:

Information-Centric Networking, Name Resolution System, Named Data Objects, Balanced Binary Tree,

Abstract

The Information-Centric Networking (ICN) is an emerging network communication model that focuses on what is being exchanged rather than who is exchanging information within a network. The named hosts make use of Named Data Objects (NDO) for data registration and name resolution. The Name Resolution System (NRS) is an element of the ICN that translates the object identifiers into network addresses. Distributing the NRS is an important and challenging issue for increased NDO registering, acquiring and storage. This study proposes a new NRS mechanism called the Distributed Name Resolution Mechanism (DNRM) to address the most significant issue of segregating the network and Balanced Binary Tree (BBT) structure to manage storage on the ever-increasing number of NDOs. The study formulates the proposed DNRM through the nearest neighbor algorithm by adding phases, means and methods, and probable outcomes. The stored NDOs are balanced with a balance factor to increase the scalability of NRS. The result shows that the overall NDO searching time is reduced by half for each iteration, and the proposed mechanisms are faster and more stable than the existing solutions in terms of better grouping NDOs. Both the mechanisms are simulated in the OMNeT++ simulation environment, a discrete event based simulator. The experimental results ensure that both the mechanisms have advantages in improving the network performance by minimizing the end-to-end delay and improving the network throughput.

References

G. Xylomenos, C. N. Ververidis, V. Siris, N. Fotiou, C. Tsilopoulos, X. Vasilakos, K. V. Katsaros, G. C. Polyzos and others, "A survey of information-centric networking research," IEEE, Communications Surveys, Tutorials, vol. 16, pp. 1024--1049, 2014.

J. Alpert and N. Hajaj, "Google we knew the web was big," 25 July 2008. [Online]. Available: https://googleblog.blogspot.my/2008/07/we-knew-web-was-big.html.

D. Evans, "The internet of everything: How more relevant and valuable connections will change the world," Cisco IBSG, pp. 1--9, 2012.

C. Dannewitz, M. DAmbrosio and V. Vercellone, "Hierarchical DHT based name resolution for information-centric networks," Vols. 36, no. 7, p. 736749, 2013.

A. Varga and R. Hornig, "An overview of the OMNeT++ simulation environment," 2008.

A. R. Khan, S. M. Bilal and M. Othman, "A performance comparison of open source network simulators for wireless networks," in Control System, Computing and Engineering (ICCSCE), 2012 IEEE International Conference on, 2012.

S. Project, "Scalable and Adaptive Internet Solutions (SAIL)," 2010.

C. Dannewitz, D. Kutscher, B. Ohlman, S. Farrell, B. Ahlgren and H. Karl, "Network of Information (NetInf) - An Information-centric Networking Architecture," Computer Communications, vol. 36, pp. 721-735, 2013.

W. Elbreiki, S. Hassan, A. Habbal, M. Firdhous and M. Elshaikh, "A Comparative Study of Chord and Pastry for the Name Resolution System Implementation in Information Centric Networks," in Conference: 4th International Conference on Internet Applications, Protocols and Services (NETAPPS2015), Cyberjaya, Kuala Lumpur, Malaysia, 2015.

P. Project, "Publish/Subscriber (PURSUIT)," 2010. [Online]. Available: http://www.fp7-pursuit.eu/PursuitWeb/.

A. Rowstron and P. Druschel, "Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems," IFIP/ACM International Conference on Distributed Systems Platforms, pp. 329-350, 2001.

I. Stoica, R. Morris, D. L. Nowell, D. R. Karger, M. F. Kaashoek, F. Dabek and H. Balakrishnan, "Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications," SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 149-160, 2001.

Barrett and Paul, "Euclidean distance: Raw, normalised, and doublescaled coefficients," Unpublished paper retrieved from http://www.pbmetrix.com/techpapers/Euclidean_Distance. pdf, 2006.

Y. Li and L. E. Parker, "Nearest neighbor imputation using spatial--temporal correlations in wireless sensor networks," Information Fusion, vol. 15, pp. 64--79, 2014.

G. S. Manku, "Balanced Binary Trees for ID Management and Load Balance in Distributed Hash Tables," in Proceedings of the Twentythird Annual ACM Symposium on Principles of Distributed Computing, New York, NY, USA, 2004.

Downloads

Published

2017-06-01

How to Cite

Hassan, S., Elbreiki, W., Arlimatti, S., & Habbal, A. (2017). Named Data Object Organization in Distributed Name Resolution System for Information Centric Network Environment. Journal of Telecommunication, Electronic and Computer Engineering (JTEC), 9(2-5), 119–122. Retrieved from https://jtec.utem.edu.my/jtec/article/view/2410

Most read articles by the same author(s)

1 2 > >>