![]() For example,"Destination A is a distance of 5 hops away, in the direction of next-hoprouter X." As that statement implies, each router learns routes from itsneighboring routers' perspectives and then advertises the routes from itsown perspective. The name distance vector is derived from the fact that routes are advertisedas vectors of (distance, direction), where distance is defined in terms of ametric and direction is defined in terms of the next-hop router. R.Fulkerson 2 and for this reason occasionally arereferred to as Bellman-Ford or Ford-Fulkerson algorithms. Distancevector algorithms are based on the work done of R. The basics of distance vector routing protocols areexamined here the next section covers link state routing protocols. Most routing protocols fall into one of two classes: distance vectoror link state. Learn More Buy Distance Vector Routing Protocols Routing TCP/IP Volume I (CCIE Professional Development) ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |