Unicast Routing
20-2
20
Configuring the Routing Information Protocol
The RIP protocol is the most widely used routing protocol. The RIP protocol uses a
distance-vector-based approach to routing. Routes are determined on the basis of
minimizing the distance vector, or hop count, which serves as a rough estimate of
transmission cost. Each router broadcasts its advertisement every 30 seconds,
together with any updates to its routing table. This allows all routers on the network
to learn consistent tables of next hop links which lead to relevant subnets.
Command Usage
• Just as Layer 2 switches use the Spanning Tree Algorithm to prevent loops, routers
also use methods for preventing loops that would cause endless retransmission of
data traffic. RIP utilizes the following three methods to prevent loops from occurring:
- Split horizon – Never propagate routes back to an interface port from which they
have been acquired.
- Poison reverse – Propagate routes back to an interface port from which they
have been acquired, but set the distance-vector metrics to infinity. (This provides
faster convergence.)
- Triggered updates – Whenever a route gets changed, broadcast an update
message after waiting for a short random delay, but without waiting for the
periodic cycle.
• RIP-2 is a compatible upgrade to RIP. RIP-2 adds useful capabilities for plain text
authentication, multiple independent RIP domains, variable length subnet masks,
and multicast transmissions for route advertising (RFC 1723).
• There are several serious problems with RIP that you should consider. First of all,
RIP (version 1) has no knowledge of subnets, both RIP versions can take a long
time to converge on a new route after the failure of a link or router during which time
routing loops may occur, and its small hop count limitation of 15 restricts its use to
smaller networks. Moreover, RIP (version 1) wastes valuable network bandwidth
by propagating routing information via broadcasts; it also considers too few
network variables to make the best routing decision.
A
1
3
6
4
2
5
B
C
D
E
A
A
B
C
D
Link
Cost
0
E
1
1
3
1
0
1
2
1
2
Cost = 1 for all links
Routing table for node A
Содержание 8926EM
Страница 6: ...ii ...
Страница 34: ...Getting Started ...
Страница 44: ...Introduction 1 10 1 ...
Страница 62: ...Initial Configuration 2 18 2 ...
Страница 64: ...Switch Management ...
Страница 76: ...Configuring the Switch 3 12 3 ...
Страница 118: ...Basic Management Tasks 4 42 4 ...
Страница 164: ...User Authentication 6 28 6 ...
Страница 176: ...Access Control Lists 7 12 7 ...
Страница 284: ...Quality of Service 14 8 14 ...
Страница 294: ...Multicast Filtering 15 10 15 ...
Страница 300: ...Domain Name Service 16 6 16 ...
Страница 310: ...Dynamic Host Configuration Protocol 17 10 17 ...
Страница 320: ...Configuring Router Redundancy 18 10 18 ...
Страница 344: ...IP Routing 19 24 19 ...
Страница 356: ...Unicast Routing 20 12 20 Web Click Routing Protocol RIP Statistics Figure 20 5 RIP Statistics ...
Страница 386: ...Unicast Routing 20 42 20 ...
Страница 388: ...Command Line Interface ...
Страница 400: ...Overview of the Command Line Interface 21 12 21 ...
Страница 466: ...SNMP Commands 24 16 24 ...
Страница 520: ...Access Control List Commands 26 18 26 ...
Страница 546: ...Rate Limit Commands 30 2 30 ...
Страница 612: ...VLAN Commands 34 24 34 ...
Страница 626: ...Class of Service Commands 35 14 35 ...
Страница 670: ...DHCP Commands 39 16 39 ...
Страница 716: ...IP Interface Commands 41 36 41 ...
Страница 768: ...IP Routing Commands 42 52 42 ...
Страница 770: ...Appendices ...
Страница 791: ......
Страница 792: ...20 Mason Irvine CA 92618 Phn 949 679 8000 www smc com 150200062800A R02 149100000035A R01 SMC8926EM SMC8950EM ...