WEBVTT 0:00:04.940000 --> 0:00:10.000000 So now as we're continuing on our journey of comparing and contrasting 0:00:10.000000 --> 0:00:14.100000 types of routing protocols, we're going to look at the third type here, 0:00:14.100000 --> 0:00:17.020000 which is advanced distance vector. 0:00:17.020000 --> 0:00:20.880000 Some people at Cisco Systems, they said, you know what? 0:00:20.880000 --> 0:00:26.980000 On the one hand, link state routing protocol is good because if the routing 0:00:26.980000 --> 0:00:32.280000 table never changes, why re-send it over and over and over and over again 0:00:32.280000 --> 0:00:34.040000 like distance vector does? 0:00:34.040000 --> 0:00:35.860000 That's overkill. 0:00:35.860000 --> 0:00:38.880000 And link state is good because it's good to actually build a neighbor 0:00:38.880000 --> 0:00:43.840000 relationship. Check the ground rules first, make sure certain things match 0:00:43.840000 --> 0:00:46.340000 before you send your routes. 0:00:46.340000 --> 0:00:48.440000 Distance vector doesn't do that. 0:00:48.440000 --> 0:00:53.700000 But at the same time, what distance vector does have going for it is that 0:00:53.700000 --> 0:00:58.860000 in order to know everything about everything. 0:00:58.860000 --> 0:01:02.520000 All you need to know is about your next top neighbors and what routes 0:01:02.520000 --> 0:01:03.740000 they're telling you about. 0:01:03.740000 --> 0:01:07.980000 You don't really need all the visibility into the entire topology, which 0:01:07.980000 --> 0:01:09.440000 link state does. 0:01:09.440000 --> 0:01:13.880000 So in that regard, distance vector is actually a little bit better. 0:01:13.880000 --> 0:01:19.120000 We should create a routing protocol that has characteristics of both of 0:01:19.120000 --> 0:01:25.240000 them. And that is where we get advanced distance vector. 0:01:25.240000 --> 0:01:30.680000 So in advanced distance vector, like link state does require that neighborships 0:01:30.680000 --> 0:01:37.000000 be built. Like link state, it will exchange all of its routes right the 0:01:37.000000 --> 0:01:40.800000 very beginning when the neighbor is very first formed. 0:01:40.800000 --> 0:01:45.360000 And then it will rely on periodic hellos or keep alive to keep those routes 0:01:45.360000 --> 0:01:53.280000 believable. Like distance vector, all it knows about is itself as directly 0:01:53.280000 --> 0:01:54.480000 connected neighbor. 0:01:54.480000 --> 0:01:59.980000 It does not have visibility into the full topology of your company. 0:01:59.980000 --> 0:02:05.360000 It will keep a topology table of learned routes. 0:02:05.360000 --> 0:02:10.040000 This is actually probably more of a distance vector characteristic than 0:02:10.040000 --> 0:02:12.160000 a link state characteristic. 0:02:12.160000 --> 0:02:20.040000 So actually, let me make that change here because that's not really correct. 0:02:20.040000 --> 0:02:27.400000 Let's say distance vector characteristic. 0:02:27.400000 --> 0:02:31.160000 That makes more sense. 0:02:31.160000 --> 0:02:35.080000 Topology table of learned routes, that's more like a distance vector characteristic. 0:02:35.080000 --> 0:02:39.480000 However, advanced distance vector will also keep track of a neighbor table. 0:02:39.480000 --> 0:02:45.460000 And that is definitely a link state characteristic. 0:02:45.460000 --> 0:02:50.340000 And EIGRP, the Enhanced Interior Gateway Routing Protocol, is an example 0:02:50.340000 --> 0:02:53.900000 of an advanced distance vector routing protocol. 0:02:53.900000 --> 0:02:57.240000 We also sometimes call it a hybrid routing protocol because it has characteristics 0:02:57.240000 --> 0:03:02.240000 of both distance vector and link state. 0:03:02.240000 --> 0:03:07.160000 In the next video, we're going to look at path vector routing protocols.