By Topic

Methodology to Solve the Count-To-Infinity Problem by Accepting and Forwarding Correct and Updated Information Only Using "Test" Packet

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kothari, A.D. ; Charotar Inst. of Comput. Applic., Changa ; Patel, D.T.

In distance vector routing [4,7, 9, 10] each router collects and forwards the information from and to the neighbors. It was the original ARPANET routing algorithm and use in the Internet under the RIP [2]. The methodology of collecting and broadcasting the routing related information initiates the problems i.e. (1) two-node loop instability, (2) three-node loop instability and (3) count-to-infinity, are well known all over. We try to give the details of distance vector routing algorithm and the problems in the introduction section and discuss the related works in direction of this problem. New algorithms are introduce to give the solution of the discuss problem along with the corrective actions for arising the problem due to implementation of new discuss methodology. We try to reduce the loopholes in the distance vector routing algorithm by applying the new concept of test packet, which is helpful in receiving and forwarding the correct and updated information regarding the available and non available routers to the other routers.

Published in:

Advance Computing Conference, 2009. IACC 2009. IEEE International

Date of Conference:

6-7 March 2009