Tabu Search Approach to Solve Routing Issues in Communication Networks

Optimal routing in communication networks is a major issue to be solved. In this paper, the application of Tabu Search (TS) in the optimum routing problem where the aim is to minimize the computational time and improvement of quality of the solution in the communication have been addressed. The goal is to minimize the average delays in the communication. The effectiveness of Tabu Search method is shown by the results of simulation to solve the shortest path problem. Through this approach computational cost can be reduced.

Authors:

• Anant Oonsivilai
• Wichai Srisuruk
• Boonruang Marungsri
• Thanatchai Kulworawanichpong

Keywords:

• Communication networks
• optimum routing network
• tabu search algorithm
• shortest path.

References:

[1] Baransel, C., Dobosiewicz, W., and Gburzynski, P. "Routing in Multi
Packet Switching Networks: Gbps Challenge." IEEE Network, May-
June 1995, pp. 123-138.
[2] Bertsekas , D., and Gallager, R. " Data Networks", Second Eddition,
Prentice-Hall, 1992.
[3] Saniee, I. "Optimal Routing Designs in Self-healing Communications
Networks." International Transactions in Operational Research, Vol. 3,
Issue 2, pp. 187 - 195, Aug 2006.
[4] Ramakrishnan, K. G. and Rodrigues M. A. "Optimal Routing In
Shortest-Path Data Networks." Bell Labs Technical Journal, Vol. 6 Issue
1, pp. 117 - 138, Aug 2002.
[5] Liu Rong , L. Ze-Rin , L. and Zheng, Z. "Neural Network Approach for
Communication Network Routing Problem." IEEE TENCON '93/
Beijing, pp. 649 -662. 1993.
[6] Hamdan M. and El-Hawary, M.E. "Hopfield-Genetic Approach for
Solving the Routing Problem In computer Networks." Proceedings of
the 2002 IEEE Canadian Conference on Electrical and Computer
Engineering, pp. 823-827.
[7] Ikonomovska, E., Gjorgjevik, D., and Loskovska, S. "Using Data
Mining Technique for Coefficient Tuning of an Adaptive Tabu Search."
Proceedings of International Conference on Computer as a Tool
EUROCON 2007, pp. 706-713, Warsaw, September 9-12, 2007.
[8] Anant Oonsivilai, A. and Pao-La-Or, P. "Application of Adaptive Tabu
Search For Optimum PID Controller Tuning AVR System" WSEAS
Transactions on Power Systems Vol. 3, Issue 6, Pp. 495-506, June 2008.
[9] Puangdownreong, D., Sujitjorn, S., and Kulworawanichpong, T.
"Convergence Analysis of Adaptive Tabu Search", International Journal
of ScienceAsia, Vol. 38, No.2, 2004, pp. 183-190.
[10] C. Chaiyaratana, C., and Zalzala, A.M.S. "Recent Developments in
Evolutionary and Genetic Algorithms: Theory and Applications",
Second International Conference on Genetic Algorithms in Engineering
System: Innovations and Applications, 2-4 September 1997, pp. 270 -
277.
[11] Puangdownreong, D., Areerak, K., Srikaew, A., Sujitjorn, S., and
Totarong, P. "System Identification via Adaptive Tabu Search", IEEE
International Conference on Industrial Technology, Vol. 2, 11-14
December 2002, pp. 915 - 920.
[12] B. Marungsri, B., Meeboon, N., and Oonsivilai, A. "Dynamic Model
Identification of Induction Motors using Intelligent Search Techniques
with taking Core Loss into Account" , WSEAS Trans. on Power
Systems, Vol. 1, No. 8, August 2006, pp. 1438 - 1445.
[13] Ali, M.K., and Kamoun, F. "Neural Network for Shortest Path
Computation and Routing in Computer Networks." IEEE Transaction
Neural Networks, Vol. 4, pp. 941-953, Nov. 1993.
[14] Araujo. F. and Ribeiro, B. "Neural Networks for Shortest Path
Computation and Routing in Computer Networks." IEEE Transactions
on Neural Networks, Vol. 4, Issue 5, pp. 941-953, November 1993.
[15] Glover, F. "Future Paths for Integer Programming and Links to Artificial
Intelligence", Comp. Oper. Res., Vol. 13, pp. 533-549, 1986.
[16] Hansen, P. "The Steepest Ascent Mildest Descent Heuristic for
Combinatorial Programming", Congress on Numerical Methods in
Combinatorial Optimization, Capri, Italy, 1986.