Swarm intelligence for network routing optimization

• Autorzy: Dempsey P. , Schuster A.
• Języki publikacji: EN

Abstrakty

EN

This paper presents the results of a comparative study of network routing approaches. Recent advances in the field suggest that swarm intelligence may offer a robust, high quality solution. The overall aim of the study was to develop a framework to facilitate the empirical evaluation of a swarm intelligence routing approach compared to a conventional static and dynamic routing approach. This paper presents a framework for the simulation of computer networks, collection of performance statistics, generation and reuse of network topologies and traffic patterns.

Słowa kluczowe

EN

network routing; swarm intelligence; ant algorithms

• Wydawca: Instytut Łączności - Państwowy Instytut Badawczy
• Czasopismo: Journal of Telecommunications and Information Technology
• Rocznik: 2005
• Tom: nr 3
• Strony: 24--28
• Opis fizyczny: Bibliogr. 14 poz., rys.

Twórcy

autor

Dempsey P.

• University of Ulster, Shore Road, Newtownabbey, Co. Antrim, BT370QB, Northern Ireland

autor

Schuster A.

• Faculty of Engineering School of Computing and Mathematics University of Ulster Shore Road, Newtownabbey, Co. Antrim, BT370QB Northern Ireland

Bibliografia

• [1] “ANON – the swarm development group”, 2004, http://wiki.swarm.org/
• [2] B. Baccala, “Connected: an Internet encyclopedia”, 2004, http://www.freesoft.org/CIE/Topics/90.htm
• [3] A. Barab´asi and E. Bonabeau, “Scale-free networks,” Sci. Amer., vol. 288, no. 5, pp. 50–59, 2003.
• [4] R. Bellman, Dynamic Programming. New Jersey: Princeton University Press, 1957.
• [5] E. Bonabeau, M. Dorigo, and Z. Theraulaz, Sarm Intelligence: From Natural to Artificial Systems. New York: Oxford University Press, 1999.
• [6] G. Di Caro and M. Dorigo, “AntNet: distributed stigmergetic control for communications networks”, J. Artif. Intel. Res., vol. 9, pp. 317–365, 1998.
• [7] M. Faloutsos, P. Faloutsos, and C. Faloutsos, “On power-law relationships of Internet topology”, in Conf. Appl., Technol., Architect. Protoc. Comput. Commun. SIGCOMM’99, Cambridge, USA, 1999, pp. 251–262.
• [8] L. Ford jr. and D. Fulkerson, Flows in Networks. Princeton, New Jersey: Princeton University Press, 1962.
• [9] M. Heissenbuettel and T. Braun, “Ants-based routing in large scale mobile ad hoc networks”. Kommunikation in verteilten Systemen KiVS’03, Leipzig, Germany, 2003.
• [10] S. Park, A. Khrabrov, D. Pennock, S. Lawrence, C. Giles, and L. Ungar, “Static and dynamic analysis of the Internet’s susceptibility to faults and attacks”, in 22nd Ann. Joint Conf. IEEE Comput. Commun. Soc. Infocom’03, San Francisco, USA, 2003.
• [11] Ch.-Chu. Shen and C. Srisathapornphat, “Ant-based energy conservation for ad hoc networks”, Tech. Rep. no. 2004-09, DEGAS Group, Dept. of CIS, University of Delaware, 2004.
• [12] J. Spencer and L. Sacks, “Modelling IP network topologies by emulating network development processes”, in Int. Conf. Softw., Telecommun. Comput. Netw. Softcom’02, Split, Croatia, 2002.
• [13] A. S. Tannenbaum, Computer Networks. 4th ed. New Jersey: Prentice Hall, 2003.
• [14] M. Ward, “There’s an ant in my phone ...”, New Sci., vol. 157, pp. 32–36, 1998.