Look-Ahead Approach To Minimize Congestion In Data Networks

This paper presents a new approach to minimize congestion in data networks. The routing algorithm guarantees a loss-free delivery of data packets from congested sources, and a deterministic bound on the route length in arbitrary topology networks. This work shows that routing decisions using Local Greedy method are not optimal, and the performance of the algorithm can be improved substantially by using new look-ahead measures. The contribution of this paper is to propose a new metrics to find an optimal path to minimize congestion in networks .In the proposed method, time taken to find an optimal path is less when compared to Local Greedy algorithm. The objective is to minimize the congestion. The performance is studied computationally for various networks with different number of nodes under static traffic model. In all the experiments the proposed method shows better results.