Abstract
This chapter analyzes the performance of the routing information protocol (RIP) model. A router in the network needs to look at the packet's destination address and determines which output port serves as the best choice to get the packet to the address. It is observed that the router makes this decision by consulting a forwarding table. Routing algorithms are required to build the routing tables and hence, forwarding tables. The basic problem of routing is to find the lowest-cost path between any two nodes. Routing is achieved in most practical networks by running routing protocols among the nodes. The protocols provide a distributed, dynamic way to solve the problem of finding the lowest-cost path in the presence of link and node failures and changing edge costs. One of the main classes of routing algorithms is the distance-vector algorithm. Each node constructs a vector containing the distances to all other nodes and distributes that vector to its immediate neighbors. A router also sends an update message whenever a triggered update from another router causes it to change its routing table.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
