NDN Simulator

NDN dapat dikatakan sebagai arsitektur internet masa depan dalam hal routing scalability, fast forwarding, trust model, network security, content protection and privacy.  NDN mengamankan suatu konten dan menyediakan konteks penting dalam hal keamanan, pendekatan ini memungkinkannya decoupling of trust dalam data dari trust terdap host dan server, memungkinkannya trust serta beberapa mekanisme komunikasi skalabilitas secara radikal, misalnya caching otomatis untuk mengoptimalkan bandwidth dan berpotensi dapat memindahkan konten secara bersamaan ke beberapa jalur tujuan (multiple path).
Keamanan NDN dapat diperluas untuk Kontrol akses konten (Content Access  Control) dan keamanan Infrastruktur (Infrastructure Security). Aplikasi dapat mengontrol akses ke data dengan menggunakan enkripsi dan mendistribusikan enkripsi data (data encryption) kunci sebagai data NDN yang dienkripsi.
Keamanan adalah salah satu topik utama dari pengembangan Named Data Networking-Next Phase (NDN-NP), secara khusus pengembang NDN termotivasi untuk dapat memenuhi tantangan secara spesifik, pada makalah ini penulis akan mencoba memberikan gambaran tentang persyaratan dan  prinsip-prinsip keamanan dalam NDN serta beberapa contoh terkait dengan Security attack seperti interest flooding attack dan Denial  of Service, Distribute Denial of Service dan penanggulangan (Countermeasures attack).skalabilitas secara radikal, misalnya caching otomatis untuk mengoptimalkan bandwidth dan berpotensi dapat memindahkan konten secara bersamaan ke beberapa jalur tujuan (multiple path). Keamanan NDN dapat diperluas untuk Kontrol akses konten (Content Access Control) dan keamanan Infrastruktur (Infrastructure Security). Aplikasi dapat mengontrol akses ke data dengan menggunakan enkripsi dan mendistribusikan enkripsi data (data encryption) kunci sebagai data NDN yang dienkripsi. Keamanan adalah salah satu topik utama dari pengembangan Named Data Networking-Next Phase (NDN-NP), secara khusus pengembang NDN termotivasi untuk dapat memenuhi tantangan secara spesifik, pada makalah ini penulis akan mencoba memberikan gambaran tentang persyaratan dan prinsip-prinsip keamanan dalam NDN serta beberapa contoh terkait dengan Security attack seperti interest flooding attack dan Denial of Service, Distribute Denial of Service dan penanggulangan (Countermeasures attack).

It is well known that Named Data networking ensure data integrity so that every important data has to be signed by its owner in order to send it safely inside the network. Similarly, in NDN we have to assure that none could open the data except authorized users. Since only the endpoints have the right to sign the data or check its validity during the verification process , we have considered that the data could be requested from various types of devices used by different people, these devices could be anything like a smartphone, PC, sensor node etc.b, with a different CPU descriptions, parameters, and memory sizes, however their ability to check the high traffic of a data during the key generation and/or verification period is definitely a hard task and it could exhaust the systems with low computational resources. RSA and ECDSA as digital signature algorithms have proven their efficiency against cyber-attacks, they are characterized by their speed to encrypt and decrypt data, in addition to their competence at checking the data integrity. The main purpose of our research was to find the optimal algorithm that avoids the system’s overhead and offers the best time during the signature scheme

— Pending Interest Table (PIT) in Named Data Networking (NDN) architecture is complex in the forwarding operation in both upload of Interest packets and download of Data packets. PIT is considered useful for so many reasons in the centric-networking. These among other operations include: reducing bandwidth usage, communicating with no prior knowledge of publishers and subscribers, loop and packet loss detection and best security. However, despite the numerous advantages of PIT, hardware challenges, including PIT are still crucial in respect to NDN management for better memory efficiency. Due to the high access frequency to the PIT, it is essential to understand its functionality, and the effect it has on PIT performance, especially since PIT overflows. In our quest for designing a replacement policy as close to optimal as possible, we proposed a new replacement policy in PIT. This paper presents a new replacement policy named Highest Lifetime Least Request (HLLR). HLLR is designed to replace entries in the PIT which has the minimum number of incoming faces with maximum Lifetime. We have tested the policy using ndnSIM simulator and evaluated the results with some existing PIT replacement policies, i.e. Persistent (default), Least Recently Used (LRU) and Random. HLLR policy, design and evaluation are presented in this paper, aimed at obtaining better performance in case delay time, minimum Interest retransmission and Interest drop. The significance of this study is thus, it presents a conceptual model in order to tackle the issue of Interest replaces delay, which will be very much useful for managing the PIT when it is full.

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.