Distance vector versus link-state
来源:互联网 发布:以下哪些淘宝禁售商品 编辑:程序博客网 时间:2024/06/06 17:58
There are two major classes of routing protocol: distance vector and link-state. It's easy to remember which protocols belong to either class, but comprehending their differences between the two classes takes a bit more effort.
Distance vector routing is so named because it involves two factors: the distance, or metric, of a destination, and the vector, or direction to take to get there. Routing information is only exchanged between directly connected neighbors. This means a router knows from which neighbor a route was learned, but it does not know where that neighbor learned the route; a router can't see beyond its own neighbors. This aspect of distance vector routing is sometimes referred to as "routing by rumor." Measures like split horizon and poison reverse are employed to avoid routing loops.
Link-state routing, in contrast, requires that all routers know about the paths reachable by all other routers in the network. Link-state information is flooded throughout the link-state domain (an area in OSPF or IS-IS) to ensure all routers posess a synchronized copy of the area's link-state database. From this common database, each router constructs its own relative shortest-path tree, with itself as the root, for all known routes.
Consider the following topology.
Both distance vector and link-state routing protocols are suitable for deployment on this network, but each will go about propagating routes in a different manner.
Distance Vector
If we were to run a distance vector routing protocol like RIP or EIGRP on this topology, here's how R1 would see the network, assuming each link has a metric of 1 (locally connected routes have been omitted):
Notice that although R1 has connectivity to all subnets, it has no knowledge of the network's structure beyond its own links. R4 has even less insight:
Because they do not require routers to maintain the state of all links in the network, distance vector protocols typically consume less overhead at the expense of limited visibility. Because routers have only a limited view of the network, tools like split horizon and poision reverse are needed to prevent routing loops.
Link-State
Now, let's look at the same topology running a link-state routing protocol (in a single area). Because each router records the state of all links in the area, each router can construct a shortest-path tree from itself to all known destinations. Here's what R1's tree would look like:
R4 has constructed its own shortest-path tree, different from that of R1:
Although maintaining link-state information for the entire area typically requires more overhead than does processing advertisements only from direct neighbors, but provide more robust operation and scalability.
- Distance vector versus link-state
- 距离矢量路由协议(distance vector) VS 链路状态路由协议(link-state)
- Hard Link versus Symbolic Link
- Link State Routing
- Link-state routing algorithm simulation
- Link-State协议的PRC计算详解
- Optimized Link State Routing Protocol(OLSRP)
- LINK - Azure - Session/Cache State Management
- 1986 Distance Queries //LCA+VECTOR 贼慢
- (Andrew NG)The Importance of Encoding Versus Training with Sparse Coding and Vector Quantization
- cannot enable both sham-link state-change interface traps
- Distance
- distance
- distance
- Distance
- State
- state
- State
- webkit编译
- 快放假喽!
- JTAG学习笔记 (3)
- android学习小结4
- android学习小结3
- Distance vector versus link-state
- hibernate inverse cascade详解
- 【原创】关于wince os开发面试的总结系列之驱动
- [转]2010年Gartner企业绩效管理四分区
- vim小技巧:不用切换到输入模式交换前后字符
- 2010-02-09
- JLink-Utils
- 综合布线常用公式
- 互联网将现完美风暴式灾难?