Tabu Search Approach to Solve Routing Issues in Communication Networks

Autor: Anant Oonsivilai, Wichai Srisuruk, Boonruang Marungsri, Thanatchai Kulworawanichpong
Jazyk: angličtina
Rok vydání: 2009
Předmět:
DOI: 10.5281/zenodo.1054861
Popis: 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.
{"references":["Baransel, C., Dobosiewicz, W., and Gburzynski, P. \"Routing in Multi\nPacket Switching Networks: Gbps Challenge.\" IEEE Network, May-\nJune 1995, pp. 123-138.","Bertsekas , D., and Gallager, R. \" Data Networks\", Second Eddition,\nPrentice-Hall, 1992.","Saniee, I. \"Optimal Routing Designs in Self-healing Communications\nNetworks.\" International Transactions in Operational Research, Vol. 3,\nIssue 2, pp. 187 - 195, Aug 2006.","Ramakrishnan, K. G. and Rodrigues M. A. \"Optimal Routing In\nShortest-Path Data Networks.\" Bell Labs Technical Journal, Vol. 6 Issue\n1, pp. 117 - 138, Aug 2002.","Liu Rong , L. Ze-Rin , L. and Zheng, Z. \"Neural Network Approach for\nCommunication Network Routing Problem.\" IEEE TENCON '93/\nBeijing, pp. 649 -662. 1993.","Hamdan M. and El-Hawary, M.E. \"Hopfield-Genetic Approach for\nSolving the Routing Problem In computer Networks.\" Proceedings of\nthe 2002 IEEE Canadian Conference on Electrical and Computer\nEngineering, pp. 823-827.","Ikonomovska, E., Gjorgjevik, D., and Loskovska, S. \"Using Data\nMining Technique for Coefficient Tuning of an Adaptive Tabu Search.\"\nProceedings of International Conference on Computer as a Tool\nEUROCON 2007, pp. 706-713, Warsaw, September 9-12, 2007.","Anant Oonsivilai, A. and Pao-La-Or, P. \"Application of Adaptive Tabu\nSearch For Optimum PID Controller Tuning AVR System\" WSEAS\nTransactions on Power Systems Vol. 3, Issue 6, Pp. 495-506, June 2008.","Puangdownreong, D., Sujitjorn, S., and Kulworawanichpong, T.\n\"Convergence Analysis of Adaptive Tabu Search\", International Journal\nof ScienceAsia, Vol. 38, No.2, 2004, pp. 183-190.\n[10] C. Chaiyaratana, C., and Zalzala, A.M.S. \"Recent Developments in\nEvolutionary and Genetic Algorithms: Theory and Applications\",\nSecond International Conference on Genetic Algorithms in Engineering\nSystem: Innovations and Applications, 2-4 September 1997, pp. 270 -\n277.\n[11] Puangdownreong, D., Areerak, K., Srikaew, A., Sujitjorn, S., and\nTotarong, P. \"System Identification via Adaptive Tabu Search\", IEEE\nInternational Conference on Industrial Technology, Vol. 2, 11-14\nDecember 2002, pp. 915 - 920.\n[12] B. Marungsri, B., Meeboon, N., and Oonsivilai, A. \"Dynamic Model\nIdentification of Induction Motors using Intelligent Search Techniques\nwith taking Core Loss into Account\" , WSEAS Trans. on Power\nSystems, Vol. 1, No. 8, August 2006, pp. 1438 - 1445.\n[13] Ali, M.K., and Kamoun, F. \"Neural Network for Shortest Path\nComputation and Routing in Computer Networks.\" IEEE Transaction\nNeural Networks, Vol. 4, pp. 941-953, Nov. 1993.\n[14] Araujo. F. and Ribeiro, B. \"Neural Networks for Shortest Path\nComputation and Routing in Computer Networks.\" IEEE Transactions\non Neural Networks, Vol. 4, Issue 5, pp. 941-953, November 1993.\n[15] Glover, F. \"Future Paths for Integer Programming and Links to Artificial\nIntelligence\", Comp. Oper. Res., Vol. 13, pp. 533-549, 1986.\n[16] Hansen, P. \"The Steepest Ascent Mildest Descent Heuristic for\nCombinatorial Programming\", Congress on Numerical Methods in\nCombinatorial Optimization, Capri, Italy, 1986."]}
Databáze: OpenAIRE
Externí odkaz: