An Intelligent Heuristic Algorithm Based on Tabu Search to Enhance Open Shortest Path Protocol
Keywords:
Dynamic Routing, OSPF, Tabu Search,Abstract
Nowadays, a number of artificial intelligence search algorithms have been engaged with the problem of computer networks, especially in the area of network routing problems. Nodes in a network with many connections can be called hubs and some other nodes with fewer connections can create problems in routing messages around the network. In general, the protocol Open Shortest Path First OSPF is a link state protocol and it provides a good connection performance. However, this protocol has some drawbacks such as the determination of like weights and the increase of routing load. In this paper, an intelligent heuristic method based on the Tabu Search algorithm is proposed to find the optimal link cost/weight set and to determine the best path for the OSPF in a dynamic network. The simulation results show that other paths can be checked and selected to avoid congestion problem with the optimal path.References
P. R. Tadimety, “OSPF: A network routing protocol”, Berkeley: Apress, 1st ed., 2015.
M. Pióro, A. Szentesi, J. Harmatos, A. Jüttner, P. Gajowniczek, and S.Kozdrowski, “On open shortest path first related network optimisation problems. Performance evaluation,”vol.48(1-4), pp. 201- 223, 2002.
M. Caserta, A. Márquez Uribe, “Tabu search-based metaheuristic algorithm for software system reliability problems,” Computers & Operations Research, vol. 36, Issue 3, pp. 811-822, 2009.
K. Zhou, W. Wan, X. Chen, Z. Shao, and L.T. Biegler,“A parallel method with hybrid algorithms for mixed integer nonlinear programming,” Computer Aided Chemical Engineering, Elsevier, vol. 32, pp. 271-276, 2013.
M.A. Mohiuddin, S.A. Khan, and A.P. Engelbrecht, “Fuzzy particle swarm optimization algorithms for the open shortest path first weight setting problem,” Applied Intelligence,vol. 45, no. 3, pp. 598-621, 2016.
A. L. Kok, E. W. Hans, and J. M. J. Schutten, “Vehicle routing under time-dependent travel times: the impact of congestion avoidance,” Computers & Operations Research, vol. 39, Issue 5, pp. 910–918, 2012.
R. Jaballah, M. Veenstra, L.C. Coelho, J. Renaud, “The TimeDependent Shortest Path and Vehicle Routing Problem,” CIRRELT, Centre interuniversitaire de recherche sur les réseauxd'entreprise, la logistiqueet le transport= Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation, 2019.
Y. Huang, L. Zhao, T. V. Woensel, and J.P. Gross, “Time-dependent vehicle routing problem with path flexibility,” Transportation Research Part B: Methodological, vol. 95, pp. 169-195,2017.
A.E. Khandani, J. Abounadi, E. Modiano and L. Zheng, “Cooperative routing in static wireless networks,” IEEE Transactions on communications, vol. 55, Issue11, pp. 2185-2192, 2007.
D. Li, X. Jia, and H. Liu, “Energy efficient broadcast routing in static ad hoc wireless networks,” IEEE Transactions on Mobile Computing, vol. 3, Issue2, pp. 144-151, 2004.
S. Basu, M. Sharma, and P. S. Ghosh., “Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem,” Information Systems and Operational Research, Taylor & Francis, vol. 55, Issue2, pp. 134-158, 2017.
B. Cao, F. Glover, and C. Rego, “A tabu search algorithm for cohesive clustering problems,” Journal of Heuristics, vol. 21, pp. 457–477, 2015.
W. Sangiamvibool, S. Pothiya, I. Ngamroo, “Multiple tabu search algorithm for economic dispatch problem considering valve-point effects,” International Journal of Electrical Power & Energy Systems, vol. 33, Issue 4, pp. 846-854, 2011.
H.P. Chiang, Y.H. Chou, C.H. Chiu, S.Y. Kuo, Y.M. Huang, “A quantum-inspired Tabu search algorithm for solving combinatorial optimization problems,” Soft Computing, vol. 18, Issue 9, pp. 1771– 1781, 2014.
A. L. Barabási, “Network science." Philosophical Transactions of the Royal Society A: Mathematical,” Physical and Engineering Sciences 371, no. 1987, 2013.
A.S. Tanenbaum, and D.J. Wetherall, “Computer networks”, Pearson, 5th edition, 2012.
P. R.Tadimety, “OSPF: a network routing protocol”, Apress, 1st ed.edition, 2015.
Downloads
Published
How to Cite
Issue
Section
License
TRANSFER OF COPYRIGHT AGREEMENT
The manuscript is herewith submitted for publication in the Journal of Telecommunication, Electronic and Computer Engineering (JTEC). It has not been published before, and it is not under consideration for publication in any other journals. It contains no material that is scandalous, obscene, libelous or otherwise contrary to law. When the manuscript is accepted for publication, I, as the author, hereby agree to transfer to JTEC, all rights including those pertaining to electronic forms and transmissions, under existing copyright laws, except for the following, which the author(s) specifically retain(s):
- All proprietary right other than copyright, such as patent rights
- The right to make further copies of all or part of the published article for my use in classroom teaching
- The right to reuse all or part of this manuscript in a compilation of my own works or in a textbook of which I am the author; and
- The right to make copies of the published work for internal distribution within the institution that employs me
I agree that copies made under these circumstances will continue to carry the copyright notice that appears in the original published work. I agree to inform my co-authors, if any, of the above terms. I certify that I have obtained written permission for the use of text, tables, and/or illustrations from any copyrighted source(s), and I agree to supply such written permission(s) to JTEC upon request.
