Академический Документы
Профессиональный Документы
Культура Документы
Autonomous Systems
Routing Protocols
The goal of a routing protocol is to build and maintain the routing table. This table contains the learned networks and associated ports for those
networks.
Routing by rumor Each router receives a routing table from its directly
connected neighbor routers.
Routing Update
RTA Network W Network X RTB Network Y RTC Network Z
Routing Update
Net.HopsNext-hop-add W 1 RTA X 1 RTA
Routing Update
Net.HopsNext-hop-add X 1 RTB Y 1 RTB
Routing Update
Net.HopsNext-hop-add Y 1 RTC Z 1 RTC
Routing Table
(Distance) (Vector) Net. Hops Exit-int. W 0 <-X 0 --> Y 1 RTB
Routing Table
(Distance) (Vector) Net. Hops Exit-int. X 0 <-Y 0 --> W 1 RTA Z 1 RTC
Routing Table
(Distance) (Vector) Net. Hops Exit-int. Y 0 <-Z 0 --> X 1 RTB
Network W
RTA
Network X
RTB
Network Y
RTC
Network Z
Routing Table (Distance) (Vector) Net. Hops Exit-int. W 0 <-X 0 --> Y 1 RTB Z 2 RTB
Routing Table (Distance) (Vector) Net. Hops Exit-int. X 0 <-Y 0 --> W 1 RTA Z 1 RTC
Routing Table (Distance) (Vector) Net. Hops Exit-int. Y 0 <-Z 0 --> X 1 RTB W 2 RTB
Convergence!
(also known as Bellman-Ford algorithms) call for each router to send all or some portion of its routing table only to its neighbors. Distance vector algorithms perform routing decisions based upon information provided by neighboring routers. Distance vector protocols use fewer system resources but can suffer from slow convergence and may use metrics that do not scale well to larger systems.
RIP Hop Count IGRP and EIGRP Bandwidth, Delay, Reliability, Load Ciscos OSPF Cost (Based on Bandwidth) IS-IS Cost BGP Number of AS or policy
[ administrative distance / routing metric (or cost) ] The cost for all static routes is 0 The default administrative distance for static routes is 1
Examples
Examples
Example
Summary
Routed and routing protocol Configure static route, default route Protocol administrative distance Distance vector and link state routing protocol Routing protocols metrics