![]() ![]() That they must be capable of determining loop free paths through the network. Remember that a primary goal of routing protocol design is Sections below provide a quick overview (or review) of each of these types of Method of finding the best path to any given destination within the network. Routing protocols that distribute the state of attached links are calledĮach of these data distribution methods is generally tied to a specific Information is used independently by each router within the routing domain toīuild a tree representing a topology of the network (called a shortest path Router floods (or advertises to all other routers in the network, whetherĭirectly adjacent or not), the state of each link to which it is attached. Of vector-based protocols: distance vector and path vector.īy distributing the state of the links attached to the routers each The metric, which indicates the desirability of that path. The best vector (path) by examining the destinations reachable through eachĪdjacent router or neighbor, combined with some additional information, such as ![]() There are two fundamental ways to distribute the data through aīy distributing vectors, each router in the network advertises theĭestinations it can reach, along with some information which can be used toĭetermine the best path to each reachable destination. ![]() Each router in the network then uses this distributed database toĭetermine the best loop free path through the network to reach any givenĭestination. Propagate information about the topology of the network among the routers within Routing protocols are effectively distributed database systems. Learn More Buy Distance Vector, Link State, and Path Vector ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |