High Impact Factor : 4.396 icon | Submit Manuscript Online icon | UGC Approved icon

HALO - A PERFORMANCE APPROACH

Author(s):

LAKSHMANA KUMAR.S , ADHIYAMAAN COLLEGE OF ENGINEERING; Dr. D. RAMYA DORAI, ADHIYAMAAN COLLEGE OF ENGINEERING

Keywords:

Link State, Hop by Hop, Optimal, Adaptive

Abstract

Attempts are actually made for as much as decades to boost the efficiency of routing especially link state routing. The objective of the paper is to make the routing optimal through decreasing the cost of carrying traffic over packet switched networks. The Link state routing protocols including Open shortest path first and Intermediate System - Intermediate System gather higher than the distance vector routing protocols like RIPv1, RIPv2, EIGRP. Aforementioned statement is achieved using the techniques called flooding and triggered update techniques. In link state hop by hop routing protocols the updates are flooded at once and estimated parallel. The convergence time will get improved by using the triggered updating techniques through routers send update messages instantly upon learning of a route change. These revised updates are triggered through events for as much as new link flattering available whereas the failure of existing link. The main disadvantages are CPU overhead and memory requirements. Our method iteratively and individually updates the fraction of traffic fated in near future to the node that leaves the beginning node on each of its outgoing links. For each and every iteration ever updates are calculated based on the shortest path on each destination as determined by the marginal cost of the networks links. These costs are obtained by link state updates which are flooded through the network after each iteration. The HALO and PEFT technique is adaptive which automatically converges the new optimal routing assignment for apparently static network changes. The main objective is to eliminate the tradeoff between optimality and ease of implementation in routing.

Other Details

Paper ID: SPCN023
Published in: Volume : 1, Issue : 3
Publication Date: 01/04/2016
Page(s): 47-50

Article Preview




Download Article

Share