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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Engineering & Technology
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.