April 2011
Intermediate to advanced
512 pages
16h 3m
English
book
Local Networks and the Internet: From Protocols to Interconnection
by Laurent Toutain, Ana Minaburo
Content preview from Local Networks and the Internet: From Protocols to Interconnection
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.
Chapter 11
Internal Routing Protocols
11.1. The Distant Vector algorithm
11.1.1. Description
The Distant Vector algorithm is based on information exchange between adjacent routers. Two routers are adjacent if there is a direct link between them, i.e. if they have an attachment on the same local network. This algorithm is very simple to implement, but its performance is limited and its scaling factor resistance is small. An analogy can be made with hotel doormen who share gossip with doormen in other hotels. The protocol can be very chatty and false rumors can persist for a very long time.
RIP mainly enables the automatization of learning of prefixes present on a site. It prevents errors that could occur during the manual configuration of routers.
Each router initially only knows the cost of its own links. Routers broadcast their rudimentary routing table consisting of their accessible neighbors and the link cost towards adjacent nodes. When a router receives a new table, it carries out the Bellman-Ford algorithm for each input of the received table:
— If the input is not in the table, it adds it;
— If the cost of the proposed route by the table plus the cost of the traveled route is smaller than the stored route, the table is modified to take this new route into account;
— Otherwise there is no change.
Figure 11.1. Sequence example of the Distant Vector algorithm
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access
More than 5,000 organizations count on O’Reilly
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.Julian F.
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.Addison B.
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.Amir M.
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.