<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://lms.onnocenter.or.id/wiki/index.php?action=history&amp;feed=atom&amp;title=IPv6%3A_Route_Control_-_Route_Redistribution</id>
	<title>IPv6: Route Control - Route Redistribution - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://lms.onnocenter.or.id/wiki/index.php?action=history&amp;feed=atom&amp;title=IPv6%3A_Route_Control_-_Route_Redistribution"/>
	<link rel="alternate" type="text/html" href="https://lms.onnocenter.or.id/wiki/index.php?title=IPv6:_Route_Control_-_Route_Redistribution&amp;action=history"/>
	<updated>2026-04-22T16:00:12Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.45.1</generator>
	<entry>
		<id>https://lms.onnocenter.or.id/wiki/index.php?title=IPv6:_Route_Control_-_Route_Redistribution&amp;diff=55843&amp;oldid=prev</id>
		<title>Onnowpurbo: Created page with &quot;Principles of Redistribution The capabilities of the IP routing protocols vary widely. The protocol characteristics that have the most bearing on redistribution are the differ...&quot;</title>
		<link rel="alternate" type="text/html" href="https://lms.onnocenter.or.id/wiki/index.php?title=IPv6:_Route_Control_-_Route_Redistribution&amp;diff=55843&amp;oldid=prev"/>
		<updated>2019-03-18T02:08:38Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;Principles of Redistribution The capabilities of the IP routing protocols vary widely. The protocol characteristics that have the most bearing on redistribution are the differ...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;Principles of Redistribution&lt;br /&gt;
The capabilities of the IP routing protocols vary widely. The protocol&lt;br /&gt;
characteristics that have the most bearing on redistribution are the&lt;br /&gt;
differences in metrics and administrative distances, and each protocol&amp;#039;s&lt;br /&gt;
classful or classless capabilities. Failure to give careful consideration to&lt;br /&gt;
these differences when redistributing can lead to, at best, a failure to&lt;br /&gt;
exchange some or all routes or, at worst, routing loops and black holes.&lt;br /&gt;
Metrics&lt;br /&gt;
The routers of Figure 11-1 are redistributing static routes into OSPF,&lt;br /&gt;
which then advertises the routes to other OSPF-speaking routers. Static&lt;br /&gt;
routes have no metric associated with them, but every OSPF route must&lt;br /&gt;
have a cost. Another example of conflicting metrics is the redistribution of&lt;br /&gt;
RIP routes into EIGRP. RIP&amp;#039;s metric is hop count, whereas EIGRP uses&lt;br /&gt;
bandwidth and delay. In both cases, the protocol into which routes are&lt;br /&gt;
redistributed must be able to associate its own metrics with those routes.&lt;br /&gt;
So the router performing the redistribution must assign a metric to the&lt;br /&gt;
redistributed routes. Figure 11-2 shows an example. Here EIGRP is&lt;br /&gt;
being redistributed into OSPF, and OSPF is being redistributed into&lt;br /&gt;
EIGRP. OSPF does not understand the composite metric of EIGRP, and&lt;br /&gt;
EIGRP does not understand OSPF cost. As a result, part of the&lt;br /&gt;
redistribution process is that the router must assign a cost to each EIGRP&lt;br /&gt;
route before passing it to OSPF. Likewise, the router must assign a&lt;br /&gt;
bandwidth, delay, reliability, load, and MTU to each OSPF route before&lt;br /&gt;
passing it to EIGRP. If incorrect metrics are assigned, redistribution will&lt;br /&gt;
fail.&lt;br /&gt;
Figure 11-2. When routes are redistributed, a metric that is&lt;br /&gt;
understandable to the receiving protocol must be assigned&lt;br /&gt;
to the routes.Case studies later in this chapter show how to configure routers to assign&lt;br /&gt;
metrics for purposes of redistribution.&lt;br /&gt;
Administrative Distances&lt;br /&gt;
The diversity of metrics presents another problem: If a router is running&lt;br /&gt;
more than one routing protocol and learns a route to the same&lt;br /&gt;
destination from each of the protocols, which route should be selected?&lt;br /&gt;
Each protocol uses its own metric scheme to define the best route.&lt;br /&gt;
Comparing routes with different metrics, such as cost and hop count, is&lt;br /&gt;
like comparing apples and oranges.&lt;br /&gt;
The answer to the problem is administrative distances. Just as metrics&lt;br /&gt;
are assigned to routes so that the most preferred route may be&lt;br /&gt;
determined, administrative distances are assigned to route sources so&lt;br /&gt;
that the most preferred source may be determined. Think of an&lt;br /&gt;
administrative distance as a measure of believability. The lower the&lt;br /&gt;
administrative distance, the more believable the protocol.&lt;br /&gt;
For example, suppose a router running RIP and EIGRP learns of a route&lt;br /&gt;
to network 192.168.5.0 from a RIP-speaking neighbor and another route&lt;br /&gt;
to the same destination from an EIGRP-speaking neighbor. Because ofto the same destination from an EIGRP-speaking neighbor. Because of&lt;br /&gt;
EIGRP&amp;#039;s composite metric, that protocol is more likely to have&lt;br /&gt;
determined the optimum route. Therefore, EIGRP should be believed&lt;br /&gt;
over RIP.&lt;br /&gt;
Table 11-1 shows the default Cisco administrative distances. EIGRP has&lt;br /&gt;
an administrative distance of 90, whereas RIP has an administrative&lt;br /&gt;
distance of 120. Therefore, EIGRP is deemed more trustworthy than RIP.&lt;br /&gt;
Table 11-1. Cisco default administrative distances.&lt;br /&gt;
Route Source Administrative Distance&lt;br /&gt;
Connected interface [*] 0&lt;br /&gt;
Static route 1&lt;br /&gt;
EIGRP summary route 5&lt;br /&gt;
External BGP 20&lt;br /&gt;
EIGRP 90&lt;br /&gt;
IGRP 100&lt;br /&gt;
OSPF 110&lt;br /&gt;
IS-IS 115&lt;br /&gt;
RIP 120&lt;br /&gt;
EGP 140&lt;br /&gt;
External EIGRP 170&lt;br /&gt;
Internal BGP 200&lt;br /&gt;
Unknown 255Unknown&lt;br /&gt;
255&lt;br /&gt;
[*]&lt;br /&gt;
Recall from Chapter 3, &amp;quot;Static Routing,&amp;quot; that when a static route refers to an interface&lt;br /&gt;
instead of a next-hop address, the destination is considered to be a directly connected&lt;br /&gt;
network.&lt;br /&gt;
Although administrative distances help resolve the confusion of diverse&lt;br /&gt;
metrics, they can cause problems for redistribution. For example, in&lt;br /&gt;
Figure 11-3, both Gehrig and Ruth are redistributing RIP-learned routes&lt;br /&gt;
into IGRP. Gehrig learns about network 192.168.1.0 via RIP and&lt;br /&gt;
advertises the network into the IGRP domain. As a result, Ruth learns&lt;br /&gt;
about network 192.168.1.0 not only from Combs via RIP, but also from&lt;br /&gt;
Meusel via IGRP.&lt;br /&gt;
Figure 11-3. Network 192.168.1.0 is being advertised to&lt;br /&gt;
Ruth via both RIP and IGRP.Example 11-1 shows Ruth&amp;#039;s route table. Notice that the route to&lt;br /&gt;
192.168.1.0 is an IGRP route. Ruth has chosen the IGRP route because,&lt;br /&gt;
compared to RIP, IGRP has a lower administrative distance. Ruth will&lt;br /&gt;
send all packets to 192.168.1.0 over the &amp;quot;scenic route&amp;quot; through Meusel,&lt;br /&gt;
instead of sending them directly to Combs.&lt;br /&gt;
Example 11-1. Although the optimal route to network&lt;br /&gt;
192.168.1.0 from Ruth is through Combs, out S0, Ruth is&lt;br /&gt;
instead routing to that network through Meusel, out S1.&lt;br /&gt;
Ruth#show ip route&lt;br /&gt;
Codes: C - connected, S - static, I - IGRP, R - RIP, M - mobile&lt;br /&gt;
D - EIGRP, EX - EIGRP external, O - OSPF, IA - OSPF inte&lt;br /&gt;
E1 - OSPF external type 1, E2 - OSPF external type 2, E&lt;br /&gt;
i - IS-IS, L1 - IS-IS level-1, L2 - IS-IS level-2, * - c&lt;br /&gt;
U - per-user static route&lt;br /&gt;
Gateway of last resort is not set&lt;br /&gt;
I&lt;br /&gt;
192.168.1.0/24 [100/16100] via 192.168.5.1, 00:00:00, Seri&lt;br /&gt;
I&lt;br /&gt;
192.168.2.0/24 [100/12576] via 192.168.5.1, 00:00:00, Seri&lt;br /&gt;
I&lt;br /&gt;
192.168.3.0/24 [100/12476] via 192.168.5.1, 00:00:01, Seri&lt;br /&gt;
I&lt;br /&gt;
192.168.4.0/24 [100/10476] via 192.168.5.1, 00:00:01, Seri&lt;br /&gt;
C&lt;br /&gt;
192.168.5.0/24 is directly connected, Serial1&lt;br /&gt;
C&lt;br /&gt;
192.168.6.0/24 is directly connected, Serial0&lt;br /&gt;
Ruth#&lt;br /&gt;
Split horizon prevents a routing loop in the network of Figure 11-3. Both&lt;br /&gt;
Gehrig and Ruth initially advertise subnet 192.168.1.0 into the IGRP&lt;br /&gt;
domain, and the four IGRP routers eventually converge on a single path&lt;br /&gt;
to that subnet. However, the convergence is unpredictable. This condition&lt;br /&gt;
can be seen by rebooting routers Lazzeri and Meusel. After the reboot,&lt;br /&gt;
Ruth&amp;#039;s route table shows that it is using Combs as the next-hop router toreach 192.168.1.0 (Example 11-2).&lt;br /&gt;
Example 11-2. The convergence of the network in Figure&lt;br /&gt;
11-3 is unpredictable. After a reboot of the routers, Ruth is&lt;br /&gt;
now routing to 192.168.1.0 through Combs.&lt;br /&gt;
Ruth#show ip route&lt;br /&gt;
Codes: C - connected, S - static, I - IGRP, R - RIP, M - mobile&lt;br /&gt;
D - EIGRP, EX - EIGRP external, O - OSPF, IA - OSPF inte&lt;br /&gt;
E1 - OSPF external type 1, E2 - OSPF external type 2, E&lt;br /&gt;
i - IS-IS, L1 - IS-IS level-1, L2 - IS-IS level-2, * - c&lt;br /&gt;
U - per-user static route&lt;br /&gt;
Gateway of last resort is not set&lt;br /&gt;
R&lt;br /&gt;
192.168.1.0/24 [120/1] via 192.168.6.2, 00:00:23, Serial0&lt;br /&gt;
I&lt;br /&gt;
192.168.2.0/24 [100/12576] via 192.168.5.1, 00:00:22, Seri&lt;br /&gt;
I&lt;br /&gt;
192.168.3.0/24 [100/12476] via 192.168.5.1, 00:00:22, Seri&lt;br /&gt;
I&lt;br /&gt;
192.168.4.0/24 [100/10476] via 192.168.5.1, 00:00:22, Seri&lt;br /&gt;
C&lt;br /&gt;
192.168.5.0/24 is directly connected, Serial1&lt;br /&gt;
C&lt;br /&gt;
192.168.6.0/24 is directly connected, Serial0&lt;br /&gt;
Ruth#&lt;br /&gt;
Convergence after the reboot is not only unpredictable but also slow.&lt;br /&gt;
Example 11-3 shows Gehrig&amp;#039;s route table approximately three minutes&lt;br /&gt;
after the reboot. It is using Lazzeri as a next-hop router to subnet&lt;br /&gt;
192.168.1.0, but pings to a working address on that link fail. Lazzeri&amp;#039;s&lt;br /&gt;
route table (Example 11-4) shows the problem: Lazzeri is using Gehrig&lt;br /&gt;
as a next-hop router. A routing loop exists.&lt;br /&gt;
Example 11-3. Soon after the reboot, Gehrig is routing&lt;br /&gt;
packets to 192.168.1.0 via Lazzeri.&lt;br /&gt;
Gehrig#show ip routeCodes: C - connected, S - static, I - IGRP, R - RIP, M - mobile&lt;br /&gt;
D - EIGRP, EX - EIGRP external, O - OSPF, IA - OSPF inte&lt;br /&gt;
N1 - OSPF NSSA external type 1, N2 - OSPF NSSA external&lt;br /&gt;
E1 - OSPF external type 1, E2 - OSPF external type 2, E&lt;br /&gt;
i - IS-IS, L1 - IS-IS level-1, L2 - IS-IS level-2, * - c&lt;br /&gt;
U - per-user static route, o - ODR&lt;br /&gt;
Gateway of last resort is not set&lt;br /&gt;
I&lt;br /&gt;
192.168.1.0/24 [100/16100] via 192.168.3.2, 00:02:38, Seri&lt;br /&gt;
C&lt;br /&gt;
192.168.2.0/24 is directly connected, Ethernet0&lt;br /&gt;
C&lt;br /&gt;
192.168.3.0/24 is directly connected, Serial0&lt;br /&gt;
I&lt;br /&gt;
192.168.4.0/24 [100/10476] via 192.168.3.2, 00:00:29, Seri&lt;br /&gt;
I&lt;br /&gt;
192.168.5.0/24 [100/12476] via 192.168.3.2, 00:00:29, Seri&lt;br /&gt;
I&lt;br /&gt;
192.168.6.0/24 [100/14476] via 192.168.3.2, 00:00:39, Seri&lt;br /&gt;
Gehrig#ping 192.168.1.1&lt;br /&gt;
Type escape sequence to abort.&lt;br /&gt;
Sending 5, 100-byte ICMP Echos to 192.168.1.1, timeout is 2 sec&lt;br /&gt;
.....&lt;br /&gt;
Success rate is 0 percent (0/5)&lt;br /&gt;
Gehrig#&lt;br /&gt;
Example 11-4. Lazzeri is routing packets to 192.168.1.0 via&lt;br /&gt;
Gehrig, creating a routing loop. Notice the age of the route.&lt;br /&gt;
Lazzeri#show ip route&lt;br /&gt;
Codes: C - connected, S - static, I - IGRP, R - RIP, M - mobile&lt;br /&gt;
D - EIGRP, EX - EIGRP external, O - OSPF, IA - OSPF inte&lt;br /&gt;
E1 - OSPF external type 1, E2 - OSPF external type 2, E&lt;br /&gt;
i - IS-IS, L1 - IS-IS level-1, L2 - IS-IS level-2, * - c&lt;br /&gt;
U - per-user static route&lt;br /&gt;
Gateway of last resort is not set&lt;br /&gt;
I&lt;br /&gt;
192.168.1.0/24 [100/12100] via 192.168.3.1, 00:04:21, Seri&lt;br /&gt;
I&lt;br /&gt;
192.168.2.0/24 [100/8576] via 192.168.3.1, 00:00:33, SeriaC&lt;br /&gt;
192.168.4.0/24 is directly connected, Serial1&lt;br /&gt;
I&lt;br /&gt;
192.168.5.0/24 [100/10476] via 192.168.4.2, 00:00:53, Seri&lt;br /&gt;
I&lt;br /&gt;
192.168.6.0/24 [100/12100] via 192.168.3.1, 00:02:32, Seri&lt;br /&gt;
Lazzeri#&lt;br /&gt;
Here&amp;#039;s the sequence of events leading to the loop:&lt;br /&gt;
1. While Lazzeri and Meusel are rebooting, both Gehrig and Ruth have&lt;br /&gt;
route table entries showing network 192.168.1.0 as reachable via&lt;br /&gt;
Combs.&lt;br /&gt;
2. As Lazzeri and Meusel become active, both Gehrig and Ruth send&lt;br /&gt;
IGRP updates that include subnet 192.168.1.0. Simply by the &amp;quot;luck&lt;br /&gt;
of the draw,&amp;quot; Ruth sends its update slightly earlier than Gehrig does.&lt;br /&gt;
3. Meusel, receiving Ruth&amp;#039;s update, makes Ruth the next-hop router&lt;br /&gt;
and sends an update to Lazzeri.&lt;br /&gt;
4. Lazzeri, receiving Meusel&amp;#039;s update, makes Meusel the next-hop&lt;br /&gt;
router.&lt;br /&gt;
5. Lazzeri and Gehrig send updates to each other at about the same&lt;br /&gt;
time. Lazzeri makes Gehrig the next-hop router to 192.168.1.0&lt;br /&gt;
because its route is metrically closer than Meusel&amp;#039;s route. Gehrig&lt;br /&gt;
makes Lazzeri the next-hop router to 192.168.1.0 because its IGRP&lt;br /&gt;
advertisement has a lower administrative distance than Combs RIP&lt;br /&gt;
advertisement. The loop is now in effect.&lt;br /&gt;
Split horizon and the invalid timers will eventually sort things out. Lazzeri&lt;br /&gt;
is advertising 192.168.1.0 to Meusel, but Meusel continues to use the&lt;br /&gt;
metrically closer route via Ruth. And since Ruth is the next-hop router,&lt;br /&gt;
split horizon is in effect for 192.168.1.0 at Meusel&amp;#039;s S1 interface. Meusel&lt;br /&gt;
is also advertising 192.168.1.0 to Lazzeri, but Lazzeri sees Gehrig as&lt;br /&gt;
metrically closer.&lt;br /&gt;
Lazzeri and Gehrig see each other as the next-hop router to 192.168.1.0,so they will not advertise the route to each other. The route will age in&lt;br /&gt;
both of their route tables until the invalid timer expires (Example 11-5).&lt;br /&gt;
Example 11-5. When the invalid timer for the route to&lt;br /&gt;
192.168.1.0 expires, the route is declared unreachable and&lt;br /&gt;
the holddown timer is started.&lt;br /&gt;
Lazzeri#show ip route&lt;br /&gt;
Codes: C - connected, S - static, I - IGRP, R - RIP, M - mobile&lt;br /&gt;
D - EIGRP, EX - EIGRP external, O - OSPF, IA - OSPF inte&lt;br /&gt;
E1 - OSPF external type 1, E2 - OSPF external type 2, E&lt;br /&gt;
i - IS-IS, L1 - IS-IS level-1, L2 - IS-IS level-2, * - c&lt;br /&gt;
U - per-user static route&lt;br /&gt;
Gateway of last resort is not set&lt;br /&gt;
I&lt;br /&gt;
192.168.1.0/24 is possibly down, routing via 192.168.3.1,&lt;br /&gt;
I&lt;br /&gt;
192.168.2.0/24 [100/8576] via 192.168.3.1, 00:00:57, Seria&lt;br /&gt;
C&lt;br /&gt;
192.168.3.0/24 is directly connected, Serial0&lt;br /&gt;
C&lt;br /&gt;
192.168.4.0/24 is directly connected, Serial1&lt;br /&gt;
I&lt;br /&gt;
192.168.5.0/24 [100/10476] via 192.168.4.2, 00:01:25, Seri&lt;br /&gt;
I&lt;br /&gt;
192.168.6.0/24 is possibly down, routing via 192.168.3.1,&lt;br /&gt;
Lazzeri#&lt;br /&gt;
When Lazzeri&amp;#039;s invalid timer expires, the route to 192.168.1.0 will be put&lt;br /&gt;
into holddown. Although Meusel is advertising a route to that network,&lt;br /&gt;
Lazzeri cannot accept it until the holddown timer expires. Example 11-6&lt;br /&gt;
shows that Lazzeri has finally accepted the route from Meusel, and&lt;br /&gt;
Example 11-7 shows that Gehrig is successfully reaching 192.168.1.0&lt;br /&gt;
through Lazzeri. It took more than nine minutes for these two routers to&lt;br /&gt;
converge, and the route they are using is still not the optimal route.&lt;br /&gt;
Example 11-6. After the holddown timer for 192.168.1.0&lt;br /&gt;
expires, Lazzeri accepts the route advertised by Meusel.Lazzeri#show ip route&lt;br /&gt;
Codes: C - connected, S - static, I - IGRP, R - RIP, M - mobile&lt;br /&gt;
D - EIGRP, EX - EIGRP external, O - OSPF, IA - OSPF inte&lt;br /&gt;
E1 - OSPF external type 1, E2 - OSPF external type 2, E&lt;br /&gt;
i - IS-IS, L1 - IS-IS level-1, L2 - IS-IS level-2, * - c&lt;br /&gt;
U - per-user static route&lt;br /&gt;
Gateway of last resort is not set&lt;br /&gt;
I&lt;br /&gt;
192.168.1.0/24 [100/14100] via 192.168.4.2, 00:00:27, Seri&lt;br /&gt;
I&lt;br /&gt;
192.168.2.0/24 [100/8576] via 192.168.3.1, 00:00:02, Seria&lt;br /&gt;
C&lt;br /&gt;
192.168.3.0/24 is directly connected, Serial0&lt;br /&gt;
C&lt;br /&gt;
192.168.4.0/24 is directly connected, Serial1&lt;br /&gt;
I&lt;br /&gt;
192.168.5.0/24 [100/10476] via 192.168.4.2, 00:00:28, Seri&lt;br /&gt;
I&lt;br /&gt;
192.168.6.0/24 [100/12476] via 192.168.4.2, 00:00:28, Seria&lt;br /&gt;
Lazzeri#&lt;br /&gt;
Example 11-7. Gehrig can now reach subnet 192.168.1.0 via&lt;br /&gt;
Lazzeri.&lt;br /&gt;
Gehrig#show ip route&lt;br /&gt;
Codes: C - connected, S - static, I - IGRP, R - RIP, M - mobile&lt;br /&gt;
D - EIGRP, EX - EIGRP external, O - OSPF, IA - OSPF inte&lt;br /&gt;
N1 - OSPF NSSA external type 1, N2 - OSPF NSSA external&lt;br /&gt;
E1 - OSPF external type 1, E2 - OSPF external type 2, E&lt;br /&gt;
i - IS-IS, L1 - IS-IS level-1, L2 - IS-IS level-2, * - c&lt;br /&gt;
U - per-user static route, o - ODR&lt;br /&gt;
Gateway of last resort is not set&lt;br /&gt;
I&lt;br /&gt;
192.168.1.0/24 [100/16100] via 192.168.3.2, 00:00:32, Seri&lt;br /&gt;
C&lt;br /&gt;
192.168.2.0/24 is directly connected, Ethernet0&lt;br /&gt;
C&lt;br /&gt;
192.168.3.0/24 is directly connected, Serial0&lt;br /&gt;
I&lt;br /&gt;
192.168.4.0/24 [100/10476] via 192.168.3.2, 00:00:33, Seri&lt;br /&gt;
I&lt;br /&gt;
192.168.5.0/24 [100/12476] via 192.168.3.2, 00:00:33, Seri&lt;br /&gt;
I&lt;br /&gt;
192.168.6.0/24 [100/14476] via 192.168.3.2, 00:00:33, SeriType escape sequence to abort.&lt;br /&gt;
Sending 5, 100-byte ICMP Echos to 192.168.1.1, timeout is 2 sec&lt;br /&gt;
!!!!!&lt;br /&gt;
Success rate is 100 percent (5/5), round-trip min/avg/max = 52/&lt;br /&gt;
Gehrig#&lt;br /&gt;
Administrative distances can cause even worse problems than the sub-&lt;br /&gt;
optimal routes, unpredictable behavior, and slow convergence of the&lt;br /&gt;
previous example. For example, Figure 11-4 shows essentially the same&lt;br /&gt;
network as in Figure 11-3, except that the links between the IGRP routers&lt;br /&gt;
are Frame Relay PVCs. By default, IP split horizon is turned off on Frame&lt;br /&gt;
Relay interfaces. As a result, permanent routing loops will form between&lt;br /&gt;
Lazzeri and Gehrig and between Meusel and Ruth. Subnet 192.168.1.0&lt;br /&gt;
is unreachable from the IGRP domain.&lt;br /&gt;
Figure 11-4. Because IP split horizon is turned off by&lt;br /&gt;
default on Frame Relay interfaces, permanent routing&lt;br /&gt;
loops will form in this network.Several tools and strategies exist to prevent routing loops when&lt;br /&gt;
redistributing. The administrative distances can be manipulated, and&lt;br /&gt;
route filters or route maps can be used. Chapter 13 covers route filters,&lt;br /&gt;
and Chapter 14 covers route maps. These chapters also demonstrate&lt;br /&gt;
techniques for changing administrative distances.&lt;br /&gt;
Redistributing from Classless to Classful&lt;br /&gt;
Protocols&lt;br /&gt;
Careful consideration must be given to the effects of redistributing routes&lt;br /&gt;
from a classless routing process domain into a classful domain. To&lt;br /&gt;
understand why, it is necessary to first understand how a classful routing&lt;br /&gt;
protocol reacts to variable subnetting. Recall from Chapter 5, &amp;quot;Routing&lt;br /&gt;
Information Protocol (RIP),&amp;quot; that classful routing protocols do not&lt;br /&gt;
advertise a mask with each route. For every route a classful router&lt;br /&gt;
receives, one of two situations will apply:&lt;br /&gt;
The router will have one or more interfaces attached to the major&lt;br /&gt;
network.&lt;br /&gt;
The router will have no interfaces attached to the major network.&lt;br /&gt;
In the first case, the router must use its own configured mask for that&lt;br /&gt;
major network to correctly determine the subnet of a packet&amp;#039;s destination&lt;br /&gt;
address. In the second case, only the major network address itself can&lt;br /&gt;
be included in the advertisement because the router has no way of&lt;br /&gt;
knowing which subnet mask to use.&lt;br /&gt;
Figure 11-5 shows a router with four interfaces connected to subnets of&lt;br /&gt;
192.168.100.0. The network is variably subnettedtwo interfaces have 27-&lt;br /&gt;
bit masks, and two interfaces have 30-bit masks. If the router is running a&lt;br /&gt;
classful protocol such as IGRP, it cannot use the 27-bit mask to derive30-bit subnets, and it cannot use the 30-bit mask to derive 27-bit subnets.&lt;br /&gt;
So, how does the protocol cope with the conflicting masks?&lt;br /&gt;
Figure 11-5. If this router is running a classful routing&lt;br /&gt;
protocol, what mask should it choose?&lt;br /&gt;
In Example 11-8, debugging is used to observe the IGRP advertisements&lt;br /&gt;
sent by the router in Figure 11-5. Notice that subnet 192.168.100.128/27&lt;br /&gt;
is advertised out interface E0, which has a 27-bit mask, but neither&lt;br /&gt;
192.168.100.4/30 nor 192.168.100.8/30 is advertised out that interface.&lt;br /&gt;
Similarly, 192.168.100.8/30 is advertised out interface S1, which has a&lt;br /&gt;
30-bit mask, but neither 192.168.100.96/27 nor 192.168.100.128/27 is&lt;br /&gt;
advertised out that interface. The same situation applies to all four&lt;br /&gt;
interfaces. Only subnets of 192.168.100.0 whose masks match the&lt;br /&gt;
interface mask are advertised. As a result, IGRP-speaking neighbors on&lt;br /&gt;
interfaces E0 and E1 will have no knowledge of the 30-bit subnets, and&lt;br /&gt;
IGRP-speaking neighbors on interfaces S0 and S1 will have no&lt;br /&gt;
knowledge of the 27-bit subnets.&lt;br /&gt;
Example 11-8. A classful routing protocol will not advertise&lt;br /&gt;
routes between interfaces whose masks do not match.&lt;br /&gt;
O&amp;#039;Neil#debug ip igrp transactions&lt;br /&gt;
IGRP protocol debugging is onO&amp;#039;Neil#&lt;br /&gt;
IGRP: sending update to 255.255.255.255 via&lt;br /&gt;
subnet 192.168.100.128, metric=1100&lt;br /&gt;
IGRP: sending update to 255.255.255.255 via&lt;br /&gt;
subnet 192.168.100.96, metric=1100&lt;br /&gt;
IGRP: sending update to 255.255.255.255 via&lt;br /&gt;
subnet 192.168.100.4, metric=8476&lt;br /&gt;
IGRP: sending update to 255.255.255.255 via&lt;br /&gt;
subnet 192.168.100.8, metric=8476&lt;br /&gt;
O&amp;#039;Neil#&lt;br /&gt;
Ethernet0 (192.168.&lt;br /&gt;
Ethernet1 (192.168.&lt;br /&gt;
Serial0 (192.168.10&lt;br /&gt;
Serial1 (192.168.10&lt;br /&gt;
This behavior of only advertising routes between interfaces with matching&lt;br /&gt;
masks also applies when redistributing from a classless routing protocol&lt;br /&gt;
into a classful routing protocol. In Figure 11-6, the subnets of the OSPF&lt;br /&gt;
domain are variably subnetted, and Paige is redistributing OSPF-learned&lt;br /&gt;
routes into IGRP.&lt;br /&gt;
Figure 11-6. Paige is redistributing its OSPF-learned routes&lt;br /&gt;
into IGRP.&lt;br /&gt;
As Example 11-9 shows, Paige knows about all of the subnets in both the&lt;br /&gt;
OSPF and the IGRP domain. And because OSPF is classless, the router&lt;br /&gt;
knows which masks are associated with each subnet connected to&lt;br /&gt;
Gibson. Paige&amp;#039;s IGRP process is using a 24-bit mask; therefore,&lt;br /&gt;
172.20.113.192/26 and 172.20.114.48/28 are not compatible and are not&lt;br /&gt;
advertised (Example 11-10). Notice that IGRP does advertise172.20.112.0/24 and 172.20.115.0/24. The result is that the only subnets&lt;br /&gt;
within the OSPF domain that Leonard knows of are the ones with a 24-bit&lt;br /&gt;
mask (Example 11-11).&lt;br /&gt;
Example 11-9. Paige knows about all six subnets of Figure&lt;br /&gt;
11-6, either from OSPF, IGRP, or a direct connection.&lt;br /&gt;
Paige#show ip route&lt;br /&gt;
Codes: C - connected, S - static, I - IGRP, R - RIP, M - mobile&lt;br /&gt;
D - EIGRP, EX - EIGRP external, O - OSPF, IA - OSPF inte&lt;br /&gt;
N1 - OSPF NSSA external type 1, N2 - OSPF NSSA external&lt;br /&gt;
E1 - OSPF external type 1, E2 - OSPF external type 2, E&lt;br /&gt;
i - IS-IS, L1 - IS-IS level-1, L2 - IS-IS level-2, * - c&lt;br /&gt;
U - per-user static route, o - ODR&lt;br /&gt;
Gateway of last resort is not set&lt;br /&gt;
172.20.0.0/16 is variably subnetted, 6 subnets, 3 masks&lt;br /&gt;
O&lt;br /&gt;
172.20.113.192/26 [110/74] via 172.20.112.1, 00:01:35,&lt;br /&gt;
C&lt;br /&gt;
172.20.112.0/24 is directly connected, Ethernet1&lt;br /&gt;
O&lt;br /&gt;
172.20.115.0/24 [110/80] via 172.20.112.1, 00:01:35, Et&lt;br /&gt;
I&lt;br /&gt;
172.20.110.0/24 [100/1600] via 172.20.111.1, 00:00:33,&lt;br /&gt;
C&lt;br /&gt;
172.20.111.0/24 is directly connected, Ethernet0&lt;br /&gt;
O&lt;br /&gt;
172.20.114.48/28 [110/74] via 172.20.112.1, 00:01:35, E&lt;br /&gt;
Paige#&lt;br /&gt;
Example 11-10. Only the OSPF-learned routes with a 24-bit&lt;br /&gt;
mask are successfully redistributed into the IGRP domain,&lt;br /&gt;
which is also using a 24-bit mask.&lt;br /&gt;
Paige#debug ip igrp transactions&lt;br /&gt;
IGRP protocol debugging is on&lt;br /&gt;
Paige#&lt;br /&gt;
IGRP: received update from 172.20.111.1 on Ethernet0subnet 172.20.110.0, metric 1600 (neighbor 501)&lt;br /&gt;
IGRP: sending update to 255.255.255.255 via Ethernet0 (172.20.1&lt;br /&gt;
subnet 172.20.112.0, metric=1100&lt;br /&gt;
subnet 172.20.115.0, metric=1100&lt;br /&gt;
Paige#&lt;br /&gt;
Example 11-11. The only subnets within the OSPF domain&lt;br /&gt;
known at Leonard are the ones with a 24-bit mask.&lt;br /&gt;
172.20.113.192/26 and 172.20.114.48/28 are unreachable&lt;br /&gt;
from here.&lt;br /&gt;
Leonard#show ip route&lt;br /&gt;
Codes: C - connected, S - static, I - IGRP, R - RIP, M - mobile&lt;br /&gt;
D - EIGRP, EX - EIGRP external, O - OSPF, IA - OSPF inte&lt;br /&gt;
N1 - OSPF NSSA external type 1, N2 - OSPF NSSA external&lt;br /&gt;
E1 - OSPF external type 1, E2 - OSPF external type 2, E&lt;br /&gt;
i - IS-IS, L1 - IS-IS level-1, L2 - IS-IS level-2, * - c&lt;br /&gt;
U - per-user static route, o - ODR&lt;br /&gt;
Gateway of last resort is not set&lt;br /&gt;
172.20.0.0/24 is subnetted, 4 subnets&lt;br /&gt;
I&lt;br /&gt;
172.20.112.0 [100/1200] via 172.20.111.2, 00:00:48, Eth&lt;br /&gt;
I&lt;br /&gt;
172.20.115.0 [100/1200] via 172.20.111.2, 00:00:48, Eth&lt;br /&gt;
C&lt;br /&gt;
172.20.110.0 is directly connected, Ethernet0&lt;br /&gt;
C&lt;br /&gt;
172.20.111.0 is directly connected, Ethernet1&lt;br /&gt;
Leonard#&lt;br /&gt;
The configuration section includes case studies that demonstrate&lt;br /&gt;
methods for reliably redistributing from a classless routing protocol to a&lt;br /&gt;
classful routing protocol.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Pranala Menarik==&lt;br /&gt;
&lt;br /&gt;
* [[IPv6: Advanced Routing]]&lt;/div&gt;</summary>
		<author><name>Onnowpurbo</name></author>
	</entry>
</feed>