Routing Algorithm for Fastest Path – a Queuing Approach

Abstract

Finding a fastest route for data packets is a complex process as far as large scale network is considered. Fastest path helps to minimize the delay, data loss and in turn minimizes the total cost of the network. Dijkstra’s algorithm is one of the most commonly used algorithms for finding the shortest path from one source node to another destination node, which pertains to positive weights only. In this paper, Dijkstra’s Algorithm combined with the features of single server queuing model is presented to find the fastest route between any two given nodes. In this improvised algorithm, every edge along with its end vertices is considered as M/M/1 queuing model. The Waiting time of a packet, number of packets in the system and the probability that the queue length exceeds packets are considered along with the weight of the particular link, for the calculation of the fastest route.