Measuring QoS of Nearest Replica Routing Forwarding Strategy on Named Data Networking for Triple Play Services

The Internet has become a major need of the world community leading to a new era of sophisticated communication strategies. This is to provide services to develop the architecture and improve the content widely. The main obstacle to the TCP / IP protocol for retrieving data or using a service is the consumer who wants to know the endpoint (IP address) that provides the desired object or service. Another problem is the efficient use of network power available. The last problem that motivates the paradigm shift in the network is the inherent problem in IP. Neither the integrity of the IP packet nor its authenticity can be accessed by the recipient or by the network forwarding entity.Named Data Networking (NDN) offers an alternative solution as the next generation internet architecture. Named Data Networking (NDN) is a theory that has been used based on progress in data-driven processes. In this thesis, we have studied the strategy of Forwarding Replica Routing (NRR) to some forwarding strategies in NDN by analyzing their performance against triple-play services (data, voice and video). Ideal Nearest Replica Routing (NRR) is a strategy implemented on the CCnSIM simulator where this forwarding strategy looks for the nearest cache and selects the shortest path accordingly. Experiments were performed using NS3 and ndnSIM 2.0 on Ubuntu 14.04.5 with different forwarding strategies and increasing the number of consumers.The experimental results show that the Nearest Replica Routing (NRR) strategy provides the total data sent / total overhead cost more efficiently by 20% to 58% compared to other forwarding strategies in terms of data transfer. And the total cost per kilobyte is better by 18% to 45% compared to other forwarding strategies.