Open Science Research Excellence

Open Science Index

Commenced in January 2007 Frequency: Monthly Edition: International Publications Count: 29414


Select areas to restrict search in scientific publication database:
1258
Tabu Search Approach to Solve Routing Issues in Communication Networks
Abstract:
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.
Digital Object Identifier (DOI):

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.
Vol:13 No:03 2019Vol:13 No:02 2019Vol:13 No:01 2019
Vol:12 No:12 2018Vol:12 No:11 2018Vol:12 No:10 2018Vol:12 No:09 2018Vol:12 No:08 2018Vol:12 No:07 2018Vol:12 No:06 2018Vol:12 No:05 2018Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007