An Efficient Innovative Method to Decrease Routing Table Size in Packet Switched Networks

Main Article Content

Maassoumeh Javadi Baygi
Abdul Rahman B Ramli, Bahram Zaeri, Borhanuddin Mohd Ali


Appropriate routing for supporting the requirements of various high quality applications emerged in current communication networks is a challenging problem that can lead to improved routing algorithms. Taking into considerationthe highly distributed character of networks, numerousmulti-agent based algorithms, and particularly ant colony based algorithms, have been proposed in recent years. However, consideringthe need for decreasing overhead and increasing the scalability of these algorithms remains an elusive challenge. Our goal here is to reduce the overhead and the process complexity in nodes by decreasing the size of routing tables of network nodes in an innovative manner. More specifically, data routing tables which are established in theAntNet algorithm and keep the information of all destination nodes in network convert to tables that only keep the information of popular destinations of network. The resulting algorithm, the ‘‘D-T-SAntNet,’’ is then simulated via Omnet++ onUUNET network topology. The network performance is evaluated under various node-failure and nodeaddedconditions. Statistical analysis of results confirms that the new method can significantly reducethe average packet delivery time and rate of convergence to the optimal route when compared withstandard AntNet.


Download data is not yet available.

Article Details