Skip to main content

Advertisement

Springer Nature Link
Log in

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

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15

Similar content being viewed by others

Notes

  1. Operation.

References

  1. Named data networking. (2016). http://www.named-data.net/.

  2. Project CCNx. (2016). http://www.ccnx.org.

  3. Drira, W., & Filali, F. (2014). A Pub/Sub extension to NDN for efficient data collection and dissemination in V2X networks. A world of wireless, mobile and multimedia networks (WoWMoM). In IEEE 15th International Symposium, pp. 1–7.

  4. Amadeo, M., Campolo, C., & Molinaro, A. (2015). Forwarding strategies in named data wireless ad hoc networks: Design and evaluation. Journal of Network and Computer Applications, 50, 148–158.

    Article  Google Scholar 

  5. Bari, M., Chowdhury, S., Ahmed, R., Boutaba, R., & Mathieu, B. (2012). A survey of naming and routing in information-centric networks. IEEE Communications Magazine, 50, 44–53.

    Article  Google Scholar 

  6. Ren, Y., Li, J., Shi, S., Li, L., Wang, G., & Zhang, B. (2016). Congestion control in named data networking—A survey. Computer Communications, 86, 1–11.

    Article  Google Scholar 

  7. Jin, Y., Gormus, S., Kulkarni, P., & Sooriyabandara, M. (2016). Content centric routing in IoT networks and its integration in RPL. Computer Communications, 89–90, 87–104.

    Article  Google Scholar 

  8. Yan, Z. H. A. N. G., Tao, H. U. A. N. G., Jiang, L. I. U., Jian-ya, C. H. E. N., & Yun-jie, L. I. U. (2013). Reverse-trace routing scheme in content centric networking. The Journal of China Universities of Posts and Telecommunications, 20(5), 22–29.

    Article  Google Scholar 

  9. Ren, Y., Li, J., Shi, S., Li, L., & Wang, G. (2016). An explicit congestion control algorithm for named data networking. In The 35th IEEE INFOCOM Workshop on Multimedia Streaming in Information Content-Centric Networks (INFOCOM MuSIC).

  10. Nguyen, A. D., Sénac, P., Ramiro, V., & Diaz, M. (2011). Pervasive intelligent routing in content centric delay tolerant networks. In IEEE ninth international conference on dependable, autonomic and secure computing (DASC), pp. 178–185.

  11. Kim, J.-J., Ryu, M.-W., Cha, S.-H., & Cho, K.-H. (2013). A cluster based multi-path routing protocol for support load-balancing in content-centric network. International Conference on Information Science and Applications (ICISA), 2013, 1–2.

    Google Scholar 

  12. Eymann, J., & Timm-Giel, A. (2013). Multipath transmission in content centric networking using a probabilistic ant-routing mechanism. In Mobile networks and management (pp. 45–56). Springer.

  13. Magnani, D. B., Carvalho, I. A., & Noronha, T. F. (2016). Robust optimization for OSPF routing. IFAC-PapersOnLine, 49(12), 461–466.

    Article  Google Scholar 

  14. Wang, L., Hoque, A., Yi, C., Alyyan, A., & Zhang, B. (2012). OSPFN: An OSPF based routing protocol for named data networking. University of Memphis and University of Arizona, Technical Report.

  15. Shariat, Z., Movaghar, A., & Hoseinzadeh, M. (2017). A learning automata and clustering-based routing protocol for named data networking. Telecommunication Systems, 65(1), 9–29.

    Article  Google Scholar 

  16. Li, Q., Zhao, Z., Xu, M., Jiang, Y., & Yang, Y. (2017). A smart routing scheme for named data networks. Computer Communications, 103, 83–93.

    Article  Google Scholar 

  17. Banerjee, B., Seetharam, A., Mukherjee, A., & Naskar, M. K. (2017). Characteristic time routing in information centric networks. Computer Networks, 113, 148–158.

    Article  Google Scholar 

  18. Saino, L., Psaras, I., & Pavlou, G. (2013). Hash-routing schemes for information centric networking. In ACM ICN, pp. 27–32.

  19. Pedro, O., & Saldanha, R. (2013). A tabu search approach for the prize collecting traveling salesman problem. Electronic Notes in Discrete Mathematics, 41, 261–268.

    Article  Google Scholar 

  20. Jang, K.-W. (2012). A tabu search algorithm for routing optimization in mobile ad-hoc networks. Telecommun Systems, 51, 177–191.

    Article  Google Scholar 

  21. Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2013). Heuristics for multi-attribute vehicle routing problems: A survey and synthesis. European Journal of Operational Research, 231, 1–21.

    Article  MathSciNet  MATH  Google Scholar 

  22. Jagiello, S., & Zelazny, D. (2013). Solving multi-criteria vehicle routing problem by parallel tabu search on GPU. Procedia Computer Science, 18, 2519–2532.

    Google Scholar 

  23. Lai, David S. W., Demirag, O. C., & Leung, Janny M. Y. (2016). A tabu search heuristic for the heterogeneous vehicle routing problem on a multi-graph. Transportation Research Part E: Logistics and Transportation Review, 86, 32–52.

    Article  Google Scholar 

  24. Wang, Z., Li, Y., & Xiangpei, H. (2015). A heuristic approach and a tabu search for the heterogeneous multi-type fleet vehicle routing problem with time windows and an incompatible loading constraint. Computers & Industrial Engineering, 89, 162–176.

    Article  Google Scholar 

  25. Kaur, J., & Gangwar, R. C. (2015). Improved tabu search based energy efficient routing protocols for wireless sensor networks. In International conference on green computing and internet of things (ICGCIoT), pp. 637–642.

  26. Nguyen, P. K., Crainic, T. G., & Toulouse, M. (2013). A tabu search for time-dependent multi-zone multi-trip vehicle routing problem with time windows. European Journal of Operational Research, 231(1), 43–56.

    Article  MathSciNet  MATH  Google Scholar 

  27. Yu, M., & Qi, X. (2014). A vehicle routing problem with multiple overlapped batches. Transportation Research Part E, 61, 40–55.

    Article  Google Scholar 

  28. Mauri, G., & Verticale, G. (2013). Distributing key revocation status in named data networking. In Advances in communication networking (pp. 310–313). Springer.

  29. Zachariadis, E. E., & Kiranoudis, C. T. (2010). A strategy for reducing the computational complexity of local search-based methods for the vehicle routing problem. Computers & Operations Research, 37(12), 2089–2105.

    Article  Google Scholar 

  30. Wang, Y., Cheng, T. H., & Lim, M. H. (2005). A tabu search algorithm for static routing and wavelength assignment problem. IEEE Communications Letters, 9(9), 841–843.

    Article  Google Scholar 

  31. Charbonneau, N., & Vokkarane, V. M. (2010). Tabu search meta-heuristic for static manycast routing and wavelength assignment over wavelength-routed optical WDM networks. In Proceedings of IEEE international conference on communications (ICC 2010), Cape Town, South Africa, pp. 23–27.

  32. Phupattanasin, P., & Tong, S.-R. (2014). Applying information-centric networking in today’s agriculture. APCBEE Procedia, 8, 184–188.

    Article  Google Scholar 

  33. Anastasiades, C., Weber, J., & Braun, T. (2016). Dynamic unicast: Information-centric multi-hop routing for mobile ad-hoc networks. Computer Networks, 107(Part 2), 208–219.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Science and Research Branch, Islamic Azad University, Tehran, Iran

    Zeinab Shariat

  2. Department of Computer Engineering, Sharif University of Technology, Tehran, Iran

    Ali Movaghar

  3. Iran University of Medical Sciences, Tehran, Iran

    Mehdi Hosseinzadeh

  4. Computer Science, University of Human Development, Sulaimaniyah, Iraq

    Mehdi Hosseinzadeh

Authors
  1. Zeinab Shariat
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Ali Movaghar
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Mehdi Hosseinzadeh
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Ali Movaghar.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shariat, Z., Movaghar, A. & Hosseinzadeh, M. TSRN: A Tabu Search-Based Routing Protocol for Named Data Networking. Wireless Pers Commun 101, 1411–1428 (2018). https://doi.org/10.1007/s11277-018-5769-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-018-5769-3

Keywords