TSRN: A Tabu Search-Based Routing Protocol for Named Data Networking

Information-centric network (ICN) has become a basic research topic with regard to the future architecture of the Internet. Storage and routing data is an important feature of ICN, as it improves network performance and content distribution. One of the challenges in this type of network is the routing problem. The objective of this paper is to propose a routing algorithm in the named data network. Owing to the impressive results presented by the enhanced heuristic methods, tabu search has been selected to develop the proposed algorithm. This work has been carried out in five major steps, Creating the initial solution, The mechanisms of generating a neighborhood, Evaluating the neighbor solutions and selecting the appropriate responses, Updating the answer and the tabu list, Controlling the algorithm termination conditions. The proposed protocol has been implemented in the simulator NS3. Important measures such as the packet delivery ratio, satisfied the interest packets ratio, the average number of interest packets, end-to-end delay, route creation delay, transmission delay, loss rate, and control message overhead have been studied. These show the quality of the proposed protocol. To evaluate the performance of the proposed algorithm, the results of the algorithm were compared with OSPFN and OSPF, which are the most well-known algorithms. The results of this assessment of throughput, control message overhead, packet delivery ratio, and end-to-end delay show that the proposed algorithm has the ability to provide appropriate solutions comparable to these algorithms. © 2018, Springer Science+Business Media, LLC, part of Springer Nature