Control of Traffic Congestion in a Packet-Switching Network Using Routing Algorithms

This research discussed the application of routing algorithms to the control of the congestion of the traffic of packets in a packet-switching network, it is required to find the path with the least total cost of transmitting the packets, with the shortest possible distance between a packet source and a destination host and also to reduce the amount of time that takes the packet to get through to its destination. The routing algorithms considered are Dijkstra algorithm and the Floyd s algorithm, they are reviewed, implemented and compared with respect to there performances. The Floyd s algorithm implementation tends to find the path between all pairs of nodes in the network according to the changes in the costs of each path due to the packet passing through them. This makes Floyd s algorithm implementation one of the best ways of find paths through a network compared to the Dijkstra algorithm implementation which is good particularly for path finding between two specific nodes in the network.