Improved version of HALO: Hop-by-Hop Adaptive Link State Optimal Routing with 2Ack System

Use of HALO scheme to achieve finest routing is newly developed better approach. By using the technique every node, for every other node, the algorithm independently and iteratively updates the fraction of traffic destined to that leaves on every of its outgoing links. At every iteration, the updates are calculated by using on the shortest path calculations to each destination which in turns determined by the marginal costs of the network’s links. That means the marginal link costs are used to find the shortest paths are in turn obtained from link-state updates that are flooded through the network after every iteration. This technique is also adaptive which means it automatically detects the static network changes and takes decisions considering the other available means. Though this has achieved to eliminate the trade-off between optimality and ease of implementation and routing still it can work elegantly if we tried to reduce the acknowledgement overhead traffic. This paper project that there is a congestion issue due to acknowledgements which is to be reduced by using 2ACK system with triplet model and this has helped to reduce traffic and improve link utilization. This paper also gives experimental results to support these theoretical facts.