Network Route Minimization Using Time Based Interface Control
Main Article Content
The demand for networking is increasing day by day with the progressive need of communication. As a result the communication channel and state database are increased with correspondingly. A rise in the amount of state database maintenance is one of the important cost effective issues for communication devices. The most challenging think is router state database reducing. As of now, many different types of state table accomplishments method are proposed for router state database reducing. In this purpose, we apply and modify the SPF algorithm by time based interface control. Dijkstra’s SPF algorithms searching the shortest specific link among from the all link then build a router state database table. If the state table size is little amount, then router OS using little amount of clock cycle. Some of Network interface are down for a fixed amount of time in a router. Therefore, we proposed a time based interface control method on SPF algorithm for re-build a new state database table. The modified SPF time based interfaces control algorithm suggests a new approach on dynamic routing protocol for reducing routing table size and saving router state-database size, resulting in a better convergence time.
How to Cite
, M. N. H. M. A. H. P. T. A. M. E. H. “Network Route Minimization Using Time Based Interface Control”. International Journal on Recent and Innovation Trends in Computing and Communication, vol. 6, no. 2, Feb. 2018, pp. 166-, doi:10.17762/ijritcc.v6i2.1442.