Performance Enhancement of Routing Algorithm Based on PSO

Abstract

Telecommunication networks have become a special focus of research in both academia and industry due to the unprecedented growth of the Internet popularization. This paper focuses on the enhancement of routing algorithm by using an intelligent algorithm approach to the Q-routing problem. The Q-routing algorithm developed by adding intelligent represents determined state for each link to serve as constraint and contributes in choosing the appropriate path. The computer networks considered are packet switching networks, modeled as directed graphs where nodes represent servers, hosts or switches, while bi-directional and symmetric arcs represent full duplex communication links. By adding PSO into its proposed algorithm, which is based on shortest delivery time, focuses on improving quality of service by depending on defined state of shortest delivery time to filter out any inappropriate path.