TY  - JOUR
T1  - Minimum Proximity Algorithm to Minimize Delay in Networks
AU - , D.S. Mahendran AU - , S. Sakthivel 
JO  - Asian Journal of Information Technology
VL  - 6
IS  - 2
SP  - 132
EP  - 135
PY  - 2007
DA  - 2001/08/19
SN  - 1682-3915
DO  - ajit.2007.132.135
UR  - https://makhillpublications.co/view-article.php?doi=ajit.2007.132.135
KW  - Congestion
KW  -routing
KW  -proximity
KW  -offered load
KW  -routing priority
AB  - This study shows a new approach to minimize delay in 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 research 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 study is to propose a new metrics to minimize delay in networks. In minimum proximity algorithm the time taken to set routing priority is less when compared to local greedy algorithm. The objective is to minimize the average packet delay. The performance is studied computationally for various networks topologies  under  static  traffic  model.  In  all  the  experiments  the  Minimum  Proximity  algorithm shows better results.
ER  -