Weitere Artikel dieser Ausgabe durch Wischen aufrufen
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
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.
Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten
Sie möchten Zugang zu diesem Inhalt erhalten? Dann informieren Sie sich jetzt über unsere Produkte:
Named data networking. (2016). http://www.named-data.net/.
Project CCNx. (2016). http://www.ccnx.org.
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.
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. CrossRef
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. CrossRef
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. CrossRef
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. CrossRef
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. CrossRef
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).
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.
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.
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.
Magnani, D. B., Carvalho, I. A., & Noronha, T. F. (2016). Robust optimization for OSPF routing. IFAC-PapersOnLine, 49(12), 461–466. CrossRef
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.
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. CrossRef
Li, Q., Zhao, Z., Xu, M., Jiang, Y., & Yang, Y. (2017). A smart routing scheme for named data networks. Computer Communications, 103, 83–93. CrossRef
Banerjee, B., Seetharam, A., Mukherjee, A., & Naskar, M. K. (2017). Characteristic time routing in information centric networks. Computer Networks, 113, 148–158. CrossRef
Saino, L., Psaras, I., & Pavlou, G. (2013). Hash-routing schemes for information centric networking. In ACM ICN, pp. 27–32.
Pedro, O., & Saldanha, R. (2013). A tabu search approach for the prize collecting traveling salesman problem. Electronic Notes in Discrete Mathematics, 41, 261–268. CrossRef
Jang, K.-W. (2012). A tabu search algorithm for routing optimization in mobile ad-hoc networks. Telecommun Systems, 51, 177–191. CrossRef
Jagiello, S., & Zelazny, D. (2013). Solving multi-criteria vehicle routing problem by parallel tabu search on GPU. Procedia Computer Science, 18, 2519–2532.
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. CrossRef
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. CrossRef
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.
Yu, M., & Qi, X. (2014). A vehicle routing problem with multiple overlapped batches. Transportation Research Part E, 61, 40–55. CrossRef
Mauri, G., & Verticale, G. (2013). Distributing key revocation status in named data networking. In Advances in communication networking (pp. 310–313). Springer.
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. CrossRef
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. CrossRef
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.
Phupattanasin, P., & Tong, S.-R. (2014). Applying information-centric networking in today’s agriculture. APCBEE Procedia, 8, 184–188. CrossRef
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. CrossRef
- TSRN: A Tabu Search-Based Routing Protocol for Named Data Networking
- Springer US