AntNet: a robust routing algorithm for data networks

Successful implementation and operation of a network largely depends on the routing algorithm in use. To date, several routing algorithms are in use but the problem with these algorithms is that they are either not adaptive or not robust enough, thus limiting the proper use of bandwidth. AntNet is a...

Full description

Bibliographic Details
Main Authors:	Haseeb, Shariq, Sidek, Khairul Azami, Ismail, Ahmad Faris, Weng Kin, Lai, Yit Mei, Aw
Format:	Article
Language:	English
Published:	IIUM Press 2004
Subjects:	TK7885 Computer engineering
Online Access:	http://irep.iium.edu.my/32002/ http://irep.iium.edu.my/32002/ http://irep.iium.edu.my/32002/1/373-1577-1-SM.pdf

id	iium-32002
recordtype	eprints
spelling	iium-320022013-09-25T07:31:44Z http://irep.iium.edu.my/32002/ AntNet: a robust routing algorithm for data networks Haseeb, Shariq Sidek, Khairul Azami Ismail, Ahmad Faris Weng Kin, Lai Yit Mei, Aw TK7885 Computer engineering Successful implementation and operation of a network largely depends on the routing algorithm in use. To date, several routing algorithms are in use but the problem with these algorithms is that they are either not adaptive or not robust enough, thus limiting the proper use of bandwidth. AntNet is an innovative algorithm that may be used for data networks. It is a combination of both static and dynamic routing algorithms. In this algorithm, a group of mobile agents (compared to real ants) form paths between source and destination nodes. They explore the network continuously and exchange obtained information indirectly, in order to update the routing tables at different nodes. Our version of AntNet (hereinafter referred to as AntNet2.0) has been improved to overcome the problems with other algorithms. This paper compares the performance of AntNet2.0 against two other commercially popular algorithms, viz. link state routing algorithm and distant vector routing algorithm. The performance matrix used to compare the algorithms is based on average throughput, packet loss, packet drop and end-to-end delay. Convergence time for this algorithm on a nation-wide telecommunications network will also be discussed. Conclusions and areas of further work will also be presented in lucid manner, so that it may be transformed into real practice in the future. IIUM Press 2004 Article PeerReviewed application/pdf en http://irep.iium.edu.my/32002/1/373-1577-1-SM.pdf Haseeb, Shariq and Sidek, Khairul Azami and Ismail, Ahmad Faris and Weng Kin, Lai and Yit Mei, Aw (2004) AntNet: a robust routing algorithm for data networks. International Islamic University Malaysia Engineering Journal, 5 (1). pp. 1-12. ISSN 1511-788X http://www.iium.edu.my/ejournal/index.php/iiumej/article/view/373
repository_type	Digital Repository
institution_category	Local University
institution	International Islamic University Malaysia
building	IIUM Repository
collection	Online Access
language	English
topic	TK7885 Computer engineering
spellingShingle	TK7885 Computer engineering Haseeb, Shariq Sidek, Khairul Azami Ismail, Ahmad Faris Weng Kin, Lai Yit Mei, Aw AntNet: a robust routing algorithm for data networks
description	Successful implementation and operation of a network largely depends on the routing algorithm in use. To date, several routing algorithms are in use but the problem with these algorithms is that they are either not adaptive or not robust enough, thus limiting the proper use of bandwidth. AntNet is an innovative algorithm that may be used for data networks. It is a combination of both static and dynamic routing algorithms. In this algorithm, a group of mobile agents (compared to real ants) form paths between source and destination nodes. They explore the network continuously and exchange obtained information indirectly, in order to update the routing tables at different nodes. Our version of AntNet (hereinafter referred to as AntNet2.0) has been improved to overcome the problems with other algorithms. This paper compares the performance of AntNet2.0 against two other commercially popular algorithms, viz. link state routing algorithm and distant vector routing algorithm. The performance matrix used to compare the algorithms is based on average throughput, packet loss, packet drop and end-to-end delay. Convergence time for this algorithm on a nation-wide telecommunications network will also be discussed. Conclusions and areas of further work will also be presented in lucid manner, so that it may be transformed into real practice in the future.
format	Article
author	Haseeb, Shariq Sidek, Khairul Azami Ismail, Ahmad Faris Weng Kin, Lai Yit Mei, Aw
author_facet	Haseeb, Shariq Sidek, Khairul Azami Ismail, Ahmad Faris Weng Kin, Lai Yit Mei, Aw
author_sort	Haseeb, Shariq
title	AntNet: a robust routing algorithm for data networks
title_short	AntNet: a robust routing algorithm for data networks
title_full	AntNet: a robust routing algorithm for data networks
title_fullStr	AntNet: a robust routing algorithm for data networks
title_full_unstemmed	AntNet: a robust routing algorithm for data networks
title_sort	antnet: a robust routing algorithm for data networks
publisher	IIUM Press
publishDate	2004
url	http://irep.iium.edu.my/32002/ http://irep.iium.edu.my/32002/ http://irep.iium.edu.my/32002/1/373-1577-1-SM.pdf
first_indexed	2023-09-18T20:46:10Z
last_indexed	2023-09-18T20:46:10Z
_version_	1777409689740378112

AntNet: a robust routing algorithm for data networks

Similar Items