ROUTING TABLE – ROUTER E
128.1.0.0/16 Reach 9.0.0.1
10.0.0.0/8
E
9.0.0.2
9.0.0.1
A 128.2.0.1/16
128.1.0.0/16
ROUTING TABLE – ROUTER A
128.1.0.0/16 Directly connected
128.2.0.0/16 Directly connected
9.0.0.0/8 Directly connected
128.3.0.0/16 Reach 128.2.0.2
128.4.0.0/16 Reach 128.2.0.2
128.5.0.0/16 Reach 128.2.0.2
128.6.0.0/16 Reach 128.2.0.2
128.7.0.0/16 Reach 128.2.0.2
10.0.0.0/8 Reach 9.0.0.2
128.2.0.0/16 Reach 9.0.0.1
9.0.0.0/8 Directly connected
128.3.0.0/16 Reach 9.0.0.1
128.4.0.0/16 Reach 9.0.0.1
128.5.0.0/16 Reach 9.0.0.1
128.6.0.0/16 Reach 9.0.0.1
128.7.0.0/16 Reach 9.0.0.1
10.0.0.0/8 Directly connected
128.4.0.1/16
128.2.0.2/16
B
128.3.0.0/16
ROUTING TABLE – ROUTER B
128.1.0.0/16 Reach 128.2.0.1
128.2.0.0/16 Directly connected
9.0.0.0/8 Reach 128.2.0.1
128.3.0.0/16 Directly connected
128.4.0.0/16 Directly connected
128.5.0.0/16 Reach 128.4.0.2
128.6.0.0/16 Reach 128.4.0.2
128.7.0.0/16 Reach 128.4.0.2
10.0.0.0/8 Reach 128.2.0.2
128.6.0.1/16
128.4.0.2/16 C 128.6.0.2/16
128.5.0.0/16
ROUTING TABLE – ROUTER C
128.1.0.0/16 Reach 128.4.0.1
128.2.0.0/16 Reach 128.4.0.1
9.0.0.0/8 Reach 128.4.0.1
128.3.0.0/16 Reach 128.4.0.1
128.4.0.0/16 Directly connected
128.5.0.0/16 Directly connected
128.6.0.0/16 Directly connected
128.7.0.0/16 Reach 128.6.0.2
10.0.0.0/8 Reach 128.4.0.1
D
128.7.0.0/16
ROUTING TABLE – ROUTER D
128.1.0.0/16 Reach 128.6.0.1
128.2.0.0/16 Reach 128.6.0.1
9.0.0.0/8 Reach 128.6.0.1
128.3.0.0/16 Reach 128.6.0.1
128.4.0.0/16 Reach 128.6.0.1
128.5.0.0/16 Reach 128.6.0.1
128.6.0.0/16 Directly connected
128.7.0.0/16 Directly connected
10.0.0.0/8 Reach 128.6.0.1
1
 DATA 10.0.0.11 (S)
ROUTING TABLE – ROUTER E
128.1.7.1 (D)
128.1.0.0/16 Reach 9.0.0.1
9.0.0.0/8 Directly connected DATA 10.0.0.11 (S)
10.0.0.0/8
10.0.0.0/8 Directly connected 128.1.255.1 (D)
128.1 = 10000000.00000001
16 = 11111111.11111111
E
9.0.0.2

9.0.0.1

128.1.0.17/30 128.1.0.21/30
A 128.1.0.13/30 128.1.0.13/30 128.1.0.18/30 C 128.1.0.22/30 D
B

128.1.5.0/24 128.1.6.0/24 128.1.7.0/24

128.1.4.0/24
128.1.2.0/24
128.1.3.0/24

128.1.0.0/30
128.1.0.12/30
128.1.0.4/30
Point – to – Point Links 128.1.0.16/30
128.1.0.8/30
128.1.0.20/30

2
 ROUTING TABLE – ROUTER E
128.1.0.0/16 Reach 9.0.0.1
9.0.0.0/8 Directly connected
10.0.0.0/8
10.0.0.0/8 Directly connected

E
9.0.0.2

9.0.0.5

9.0.0.6

9.0.0.1

128.1.0.17/30 128.1.0.21/30
A 128.1.0.13/30 128.1.0.13/30 128.1.0.18/30 C 128.1.0.22/30 D
B

128.1.5.0/24 128.1.6.0/24 128.1.7.0/24

128.1.4.0/24
128.1.2.0/24
128.1.3.0/24

128.1.0.0/30
128.1.0.12/30
128.1.0.4/30
Point – to – Point Links 128.1.0.16/30
128.1.0.8/30
128.1.0.20/30

3
 DATA 10.0.0.11 (S)
ROUTING TABLE – ROUTER E
128.1.2.1 (D)
128.1.0.0/16 Reach 9.0.0.1
128.1.2.0/24 Reach 9.0.0.6 DATA 10.0.0.11 (S)
10.0.0.0/8
9.0.0.0/8 Directly connected 128.1.4.1 (D)
128.1 = 10000000.00000001
10.0.0.0/8 Directly connected 16 = 11111111.11111111
E
9.0.0.2 128.1.2 = 10000000.00000001.00000010
24 = 11111111.11111111.11111111

9.0.0.5

9.0.0.6

9.0.0.1

128.1.0.17/30 128.1.0.21/30
A 128.1.0.13/30 128.1.0.13/30 128.1.0.18/30 C 128.1.0.22/30 D
B

128.1.5.0/24 128.1.6.0/24 128.1.7.0/24

128.1.4.0/24
128.1.2.0/24
128.1.3.0/24

128.1.0.0/30
128.1.0.12/30
128.1.0.4/30
Point – to – Point Links 128.1.0.16/30
128.1.0.8/30
128.1.0.20/30

4
 DATA 10.0.0.11 (S)
ROUTING TABLE – ROUTER E
128.1.2.1 (D)
128.0.0.0/8 reach 9.0.0.9
128.1.0.0/16 Reach 9.0.0.1 DATA 10.0.0.11 (S)
10.0.0.0/8
128.1.2.0/24 Reach 9.0.0.6 128.1.4.1 (D)
128.1 = 10000000.00000001
9.0.0.0/8 Directly connected 16 = 11111111.11111111
E
10.0.0.0/8 Directly connected DATA 10.0.0.11 (S)
9.0.0.2 128.1.2 = 10000000.00000001.00000010
128.2.4.1 (D)
24 = 11111111.11111111.11111111

9.0.0.5
9.0.0.9
9.0.0.6

9.0.0.1

128.1.0.17/30 128.1.0.21/30
A 128.1.0.13/30 128.1.0.13/30 128.1.0.18/30 C 128.1.0.22/30 D
B

128.1.5.0/24 128.1.6.0/24 128.1.7.0/24

128.6.0.0/16 128.255.0.0/1
128.2.0.0/16 128.4.0.0/16 128.5.0.0/16 6
128.3.0.0/16
128.1.4.0/24
128.1.2.0/24
128.1.3.0/24

5
 DATA 10.0.0.11 (S)
ROUTING TABLE – ROUTER E
128.1.2.1 (D)
128.0.0.0/8 reach 9.0.0.9
128.1.0.0/16 Reach 9.0.0.1 DATA 10.0.0.11 (S)
10.0.0.0/8
128.1.2.0/24 Reach 9.0.0.6 128.1.4.1 (D)
128.1 = 10000000.00000001
129.0.0.0/16 Reach 9.0.0.9 16 = 11111111.11111111
E
9.0.0.0/8 Directly connected DATA 10.0.0.11 (S)
9.0.0.2 128.1.2 = 10000000.00000001.00000010
10.0.0.0/8 Directly connected 128.2.4.1 (D)
24 = 11111111.11111111.11111111

9.0.0.5
9.0.0.9
9.0.0.6

9.0.0.1

128.1.0.17/30 128.1.0.21/30
A 128.1.0.13/30 128.1.0.13/30 128.1.0.18/30 C 128.1.0.22/30 D
B

128.1.5.0/24 128.1.6.0/24 128.1.7.0/24

128.6.0.0/16 128.255.0.0/1
128.2.0.0/16 128.4.0.0/16 128.5.0.0/16 6
128.3.0.0/16
128.1.4.0/24
128.1.2.0/24
128.1.3.0/24

129.0.0.0/16

6
 ROUTING TABLE – ROUTER E
128.0.0.0/7 reach 9.0.0.9
128.1.0.0/16 Reach 9.0.0.1 DATA 10.0.0.11 (S)
10.0.0.0/8
128.1.2.0/24 Reach 9.0.0.6 129.1.4.1 (D)
128 = 10000000
129.0.0.0/16 Reach 9.0.0.9 7 = 11111110.
E
9.0.0.0/8 Directly connected
9.0.0.2 129.1.2.2 = 10000001.00000001.00000010. 00000010
10.0.0.0/8 Directly connected 7 = 11111110.00000000.00000000.00000000

9.0.0.5
9.0.0.9
9.0.0.6

9.0.0.1

128.1.0.17/30 128.1.0.21/30
A 128.1.0.13/30 128.1.0.13/30 128.1.0.18/30 C 128.1.0.22/30 D
B

128.1.5.0/24 128.1.6.0/24 128.1.7.0/24

128.6.0.0/16 128.255.0.0/1
128.2.0.0/16 128.4.0.0/16 128.5.0.0/16 6
128.3.0.0/16
128.1.4.0/24
128.1.2.0/24
128.1.3.0/24

129.0.0.0/16

7
 ROUTING TABLE – ROUTER E
128.0.0.0/6 reach 9.0.0.9
128.1.0.0/16 Reach 9.0.0.1 DATA 10.0.0.11 (S)
10.0.0.0/8
128.1.2.0/24 Reach 9.0.0.6 131.1.2.2 (D)
128 = 10000000
129.0.0.0/16 Reach 9.0.0.9 6 = 11111100.
E
9.0.0.0/8 Directly connected
9.0.0.2 131.1.2.2 = 10000011.00000001.00000010. 00000010
10.0.0.0/8 Directly connected 6 = 11111100.00000000.00000000.00000000

9.0.0.5
9.0.0.9
9.0.0.6

9.0.0.1

128.1.0.17/30 128.1.0.21/30
A 128.1.0.13/30 128.1.0.13/30 128.1.0.18/30 C 128.1.0.22/30 D
B

128.1.5.0/24 128.1.6.0/24 128.1.7.0/24

128.6.0.0/16 128.255.0.0/1
128.2.0.0/16 128.4.0.0/16 128.5.0.0/16 6
128.3.0.0/16
128.1.4.0/24
128.1.2.0/24
128.1.3.0/24

129.0.0.0/16 130.0.0.0/16 131.0.0.0/16

8
 ROUTING TABLE – ROUTER E
128.0.0.0/5 reach 9.0.0.9
128.1.0.0/16 Reach 9.0.0.1 DATA 10.0.0.11 (S)
10.0.0.0/8
128.1.2.0/24 Reach 9.0.0.6 135.1.2.2 (D)
128 = 10000000
129.0.0.0/16 Reach 9.0.0.9 5 = 11111000.
E
9.0.0.0/8 Directly connected
9.0.0.2 135.1.2.2 = 10000111.00000001.00000010. 00000010
10.0.0.0/8 Directly connected 5 = 11111000.00000000.00000000.00000000

9.0.0.5
9.0.0.9
9.0.0.6

9.0.0.1

128.1.0.17/30 128.1.0.21/30
A 128.1.0.13/30 128.1.0.13/30 128.1.0.18/30 C 128.1.0.22/30 D
B

128.1.5.0/24 128.1.6.0/24 128.1.7.0/24

128.6.0.0/16 128.255.0.0/1
128.2.0.0/16 128.4.0.0/16 128.5.0.0/16 6
128.3.0.0/16
128.1.4.0/24
128.1.2.0/24
128.1.3.0/24

129.0.0.0/16 130.0.0.0/16 131.0.0.0/16 132.0.0.0/16 133.0.0.0/16 135.0.0.0/16

9
 ROUTING TABLE – ROUTER E
128.0.0.0/4 reach 9.0.0.9
128.1.0.0/16 Reach 9.0.0.1 DATA 10.0.0.11 (S)
10.0.0.0/8
128.1.2.0/24 Reach 9.0.0.6 143.1.2.2 (D)
128 = 10000000
129.0.0.0/16 Reach 9.0.0.9 5 = 11110000.
E
9.0.0.0/8 Directly connected
9.0.0.2 143.1.2.2 = 10001111.00000001.00000010. 00000010
10.0.0.0/8 Directly connected 4 = 11110000.00000000.00000000.00000000

9.0.0.5
9.0.0.9
9.0.0.6

9.0.0.1

128.1.0.17/30 128.1.0.21/30
A 128.1.0.13/30 128.1.0.13/30 128.1.0.18/30 C 128.1.0.22/30 D
B

128.1.5.0/24 128.1.6.0/24 128.1.7.0/24

128.6.0.0/16 128.255.0.0/1
128.2.0.0/16 128.4.0.0/16 128.5.0.0/16 6
128.3.0.0/16
128.1.4.0/24
128.1.2.0/24
128.1.3.0/24

129.0.0.0/16 130.0.0.0/16 131.0.0.0/16 132.0.0.0/16 133.0.0.0/16 135.0.0.0/16

136.0.0.0/16 137.0.0.0/16 138.0.0.0/16 139.0.0.0/16 140.0.0.0/16 143.0.0.0/16

10
 ROUTING TABLE – ROUTER E
0.0.0.0/0 reach 9.0.0.9
128.1.0.0/16 Reach 9.0.0.1 DATA 10.0.0.11 (S)
10.0.0.0/8
128.1.2.0/24 Reach 9.0.0.6 143.1.2.2 (D)
0 = 10000000
129.0.0.0/16 Reach 9.0.0.9 0 = 0000000.
E
9.0.0.0/8 Directly connected
9.0.0.2 223.1.2.2 = 11101111.00000001.00000010. 00000010
10.0.0.0/8 Directly connected 0 = 00000000.00000000.00000000.00000000

9.0.0.5
9.0.0.9
9.0.0.6

9.0.0.1

128.1.0.17/30 128.1.0.21/30
A 128.1.0.13/30 128.1.0.13/30 128.1.0.18/30 C 128.1.0.22/30 D
B

128.1.5.0/24 128.1.6.0/24 128.1.7.0/24

128.6.0.0/16 128.255.0.0/1
128.2.0.0/16 128.4.0.0/16 128.5.0.0/16 6
128.3.0.0/16
128.1.4.0/24
128.1.2.0/24
128.1.3.0/24

129.0.0.0/16 130.0.0.0/16 131.0.0.0/16 132.0.0.0/16 133.0.0.0/16 135.0.0.0/16

136.0.0.0/16 137.0.0.0/16 138.0.0.0/16 139.0.0.0/16 140.0.0.0/16 143.0.0.0/16

11
 ROUTING TABLE – ROUTER E
0.0.0.0/0 reach 9.0.0.9
128.1.0.0/16 Reach 9.0.0.1 DATA 10.0.0.11 (S)
10.0.0.0/8
128.1.2.0/24 Reach 9.0.0.6 143.1.2.2 (D)
0 = 10000000
129.0.0.0/16 Reach 9.0.0.9 0 = 0000000.
E
9.0.0.0/8 Directly connected
9.0.0.2 223.1.2.2 = 11101111.00000001.00000010. 00000010
10.0.0.0/8 Directly connected 0 = 00000000.00000000.00000000.00000000

9.0.0.5
9.0.0.9
9.0.0.6

9.0.0.1

128.1.0.17/30 128.1.0.21/30
A 128.1.0.13/30 128.1.0.13/30 128.1.0.18/30 C 128.1.0.22/30 D
B

128.1.5.0/24 128.1.6.0/24 128.1.7.0/24

128.6.0.0/16 128.255.0.0/1
128.2.0.0/16 128.4.0.0/16 128.5.0.0/16 6
128.3.0.0/16
128.1.4.0/24
128.1.2.0/24
128.1.3.0/24

129.0.0.0/16 130.0.0.0/16 131.0.0.0/16 132.0.0.0/16 133.0.0.0/16 135.0.0.0/16

136.0.0.0/16 137.0.0.0/16 138.0.0.0/16 139.0.0.0/16 140.0.0.0/16 143.0.0.0/16

12
Scaling Large
Enterprise
Networks

13
Problem Analysis
• Interior Gateway Protocols (IGPs)
• Distance vector protocols
Periodic
Simple

• Link state protocols

Uses levels/areas for scaling
Can be complex

14
Problem Analysis (Cont.)

• Application of policies difficult

• Merging organizations is painful
• Divesting is even more painful

15
IGP’s—RIP

• Distance vector
• Split horizon
• Decisions based on hop count

16
 IGP’s—RIP (Cont.)
- +
• 16 hop maximum • But it is a ‘standard’
• 30 second • Simple
periodic update
• CPU efficient
• Bandwidth inefficient
• Handles silent hosts
• No VLSM (routed)
• Slow convergence • Supports default
injection
• No security
• No multicast
17
IGP’s—RIPv2

• Distance vector
• Split horizon
• Decisions based on hop count
• Adds VLSM support

18
IGP’s—RIPv2 (Cont.)
- +
• 16 hop maximum • Standards based
• 30 second • Simple
periodic update
• CPU efficient
• Bandwidth inefficient
• Handles silent
• Slow convergence hosts (routed)
• Supports default
injection
• Authentication
• Multicast
19
 Variable Length Subnetting (IP)
A
172.16.50.1
.5 255.255.255.0
172.16.1.4
255.255.255.252 .13

B
.6
172.16.40.1 172.16.1.12
255.255.255.0 255.255.255.252
.9

172.16.1.8 .14
255.255.255.252 .10
172.16.60.1
255.255.255.0
C

• Conserve IP addresses
20
 Discontiguous IP Subnet
A
172.16.50.1
.5 255.255.255.0
192.168.1.4
255.255.255.252 .13

B
.6
172.16.40.1 192.168.1.12
255.255.255.0 255.255.255.252
.9

192.168.1.8 .14
255.255.255.252 .10
172.16.60.1
255.255.255.0
C

21
 Route Summarization
172.16.0/17 172.16.128/17

192.111.107/24

Route Summaries
172.16.0.0 255.255.0.0
192.111.107.0 255.255.255.0

• By default summaries occur on

classful boundaries—no auto-summary
prevents this
22
Broadcast Routing Updates

RIP V1

23
Multicast Routing Updates

RIP V2

24
IGP’s—IGRP

• Distance vector
• Split horizon
• Decisions based on bandwidth
and delay

25
 IGP’s—IGRP (Cont.)
- +
• 90 second • Simple
periodic update
• CPU efficient
• Bandwidth
• Supports default
inefficient
injection
• Slow convergence
• Use of metrics to
• Proprietary select best path

26
 IGRP Compound Metric

T1
R2
• Delay
• Bandwidth T1

• Reliability 56k

• Load R1 R3

• Administrative weight

27
IGP’s—OSPF
• Link state
• Decisions based on cost
• Cost based on bandwidth
(Default cisco cost =100,000/bandwidth k)

• Adds VLSM support

• Supports non-contiguous networks
• Classless
28
 IGP’s—OSPF (Cont.)
- +
• CPU intensive • Standards based
• 30 minute periodic update • Fast convergence
• Limited to a 2 • Bandwidth efficient
layer hierarchy
• Supports default injection
• LSA flooding
• Authentication
• Databases must
• Router ID
be in synch
• Hello’s
• Requires detailed
planning • Stub areas
• No auto summarization
29
IGP’s—EIGRP

• Modified distance vector

• Decisions based on bandwidth
and delay
• Adds VLSM support
• Supports non-contiguous networks
• Classless

30
IGP’s—EIGRP (Cont.)
- +
• Bandwidth intensive • Fast convergence
• Not efficient in highly • No periodic update
redundant topologies
• Supports default injection
• Proprietary
• Authentication
• Queries used to find
• Hello’s
new routes
• Auto summarization
• Topology tables can
be large • Simple to implement
• Advertizes its
routing table

31
 What Is Route Summarization?
172.16.25.0/24
I Can
Route to the
172.16.0.0/16
Network
172.16.26.0/24 A

Routing Table Routing Table

172.16.25.0/24 172.16.0.0/16
172.16.27.0/24
172.16.26.0/24
172.16.27.0/24

• Routing protocols can summarize

addresses of several networks into
one address
32
Route Summarization
• Control growth of routing tables

128.1.1.0 128.2.1.0 128.3.1.0 10.1.1.0

128.1.5.0 128.2.5.0 128.3.5.0 10.1.5.0
128.1.8.0 128.2.8.0 128.3.8.0 10.1.8.0
128.2.0.0 128.1.0.0 128.1.0.0 128.1.0.0
128.3.0.0 128.3.0.0 128.2.0.0 128.2.0.0
10.0.0.0 10.0.0.0 10.0.0.0 128.3.0.0

128.1.0.0 128.2.0.0 128.3.0.0 10.0.0.0

33
Summarizing Addresses in a
VLSM-Designed Network

172.16.128.0/20
B
B

172.16.32.64/26
172.16.32.0/24
Internet
C C A
A
172.16.32.128/26 172.16.0.0/16

D
172.16.64.0/20
D

34
 Route Summarization
Operation in Cisco Routers
172.168.5.33 /32 Host
172.168.5.32 /27 Subnet
172.168.5.0 /20 Network
172.168.0.0 /16 Block of Networks
0.0.0.0 /0 Default

• Supports host-specific routes, blocks of

networks, default routes
• Routers look for longest match

35
Summarizing Routes in a
Discontiguous Network
172.16.5.0 192.168.14.16 172.16.6.0
255.255.255.0 255.255.255.240 255.255.255.0

A B

Advertise Subnet
172.16.0.0

• RIP1 and IGRP do not advertise subnets,

therefore cannot have discontiguous subnets
• OSPF, EIGRP, and RIP2 can advertise subnets,
therefore can have discontiguous subnets

36
 IGP Conclusions

• Use EIGRP or OSPF as an IGP

• New designs with strict hierarchy
could use either protocol
• Meshed designs and legacy networks
work better with EIGRP
• Highly redundant topologies with
heirarchy work well with OSPF

37
 IGP Conclusions
700 4000

600 3500

3000
500 Update Update
Dead Interval 2500 Dead Interval
400 Overhead
2000
300
1500
200
1000
100 500

0 0
RIP/ IGRP EIGRP OSPF EIGRP OSPF RIP/ IGRP EIGRP OSPF EIGRP OSPF
RIPv2 Broad- Broad- NBMA NBMA RIPv2 Broad- Broad- NBMA NBMA
cast cast cast cast

Worst Case Bandwidth

Convergence Overhead

38
 IGP Conclusions
400 400
350 350
300 300
Update Update
250 Dead Interval 250 Dead Interval
Overhead
200 200
150 150
100 100
50 50
0 0
EIGRP OSPF EIGRP OSPF EIGRP OSPF EIGRP OSPF
Broad- Broad- NBMA NBMA Broad- Broad- NBMA NBMA
cast cast cast cast

Worst Case Bandwidth

Convergence Overhead

39
Default Administrative Distances
Route Source Default Distance
Connected Interface 0
Static Route 1
Enhanced IGRP Summary Route 5
External BGP 20
Internal Enhanced IGRP 90
IGRP 100
OSPF 110
IS-IS 115
RIP 120
EGP 140
External Enhanced IGRP 170
Internal BGP 200
Unknown 255

40
 Building the Routing Table
• Hardware state
• Static
Routes are manually defined
• Dynamic
Routes are learned from a protocol

41
 Routing Table

One Forwarding Table

Network # Interface Next Hop Metric Age Source
198.113.181.0 Ethernet0 192.150.42.177 [170/304793] 02:03:50 D

198.113.178.0 Ethernet0 192.150.42.177 [110/9936] 02:03:50 O

192.168.96.0 Ethernet0 192.150.42.177 [120/3] 00:00:20 R

192.168.97.0 Ethernet0 C

42
Comparison of Routing Protocols
Link Traditional Advance
State Distance Distance
Vector Vector
Scalability Good Low Excellent
Bandwidth Low High Low

Memory High Low Moderate

CPU High Low Low

Convergence Fast Slow Fast

Configuration Moderate Easy Easy

43
 Internet Routing Protocols
• IP routing protocols are characterized as

Name Type Proprietary Function Updates Metric VLSM Summ

RIP DV No Interior 30 Sec Hops No Auto

RIPV2 DV No Interior 30 Sec Hops Yes Auto
IGRP DV Yes Interior 90 Sec Comp No Auto
EIGRP Adv DV Yes Interior Trig Comp Yes Both
OSPF LS No Interior Trig Cost Yes Man
IS-IS LS No Int/Ext Trig Cost Yes Auto
BGP DV No Exterior Trig N/A N/A Man

44
 Routing Protocol Goals
• Adapts to changes
easily and quickly
• Optimal path selection • Does not create a lot
• Loop-free routing of traffic
• Fast convergence • Scales to a large size
• Limited design • Compatible with existing
administration hosts and routers
• Minimize update traffic • Supports variable length
subnet masks and
• Handle address discontiguous subnets
limitations
• Supports policy routing
• Easy to configure

45
 Interior Vs. Exterior
Routing Protocols

• Interior • Exterior
Automatic discovery Specifically
configured peers
Generally trust your
IGP routers Connecting with
outside networks
Routes go to all
IGP routers Set administrative
boundaries

46
 IGP Vs. EGP
• What Is an IGP? • What Is an EGP?
Interior Gateway Exterior Gateway
Protocol Protocol
Within an Used to convey
Autonomous System routing information
between ASs
Carries information
decoupled from the IGP
about internal prefixes
Current EGP is BGP
Examples—OSPF,
ISIS, EIGRP…

47
Intra-Domain Routing—OSPF

• RFC 2178 (OSPF version 2)

• Mesh Group support (NBMA scaling)
• Packet pacing
• RFC1850 (SNMP support)
• Selective LSA flooding

48
Inter-Domain Routing—BGP4

NAP
NAP Europe

NAP Japan

Backbone 2

Australia

Network NAP

• Enterprise multihoming
• Qos—policy propagation
• mBGP
49
 BGP4 Multihoming
• Current options ISP A ISP B
Single upstream ISP—
BGP multipath support
(Cisco IOS 11.2)
Default routing/IGP selection
eBGP Peers eBGP Peers
Partial routing
iBGP Peers

Take full BGP routing

(C3640 and up)

• Enterprise requirements
Provider flexibility Enterprise X
Independence from
addressing constraints
Optimized topology

50
BGP

51
BGP Nomenclature

• IBGP—Internal BGP
Internal BGP peers are within the same AS

• EBGP—External BGP
External BGP peers are in different AS’s

• Autonomous System (AS)

A collection of networks/routers
with the same policies

52
BGP
Internal BGP

53
Corporate Intranet—IBGP

IGP 1 A B IGP 2

IGP 3 C AS D IGP 4
64530

54
IBGP with Internet Connection
E

IGP 1 A B IGP 2

IGP 3 C AS D IGP 4
64530

55
IBGP Full Mesh
• Full mesh does not scale
• Solution should not change
the current behavior
• Avoids routing information loop
• Two solutions
Route reflectors
Confederations

56
Route Reflectors

57
Normal IBGP

AS 64530

B C

58
Route Reflector: Principle
Route Reflector

AS 64530

B C

59
Route Reflector: Benefits
• Solves IBGP mesh problem
• Packet forwarding is not affected
• Normal BGP speakers co-exist
• Multiple reflectors for redundancy
• Easy migration
• Multiple levels of route reflectors

60
Confederation

61
Confederation

• Collection of AS—Sub-AS
• Visible to outside world as single AS
• Uses reserved AS numbers
for internal sub-AS
• Sub-AS are fully meshed
• EBGP between sub-AS

62
BGP
External BGP

63
Corporate Intranet with Policy

AS AS
65501 65502
A B
IGP 1 IGP 2

AS AS
65503 65504
C D
IGP 3 IGP 4

64
Corporate Intranet with Policy

• Each region should be

in its own AS
• Could use private AS numbers
• Regions interlinked by EBGP
• AS path filters are applied
to accept/reject routes

65
Corporate Intranet—OSPF

Area 40

Area 1

Area 2

Area 0
Area 3
Area 20

66
Corporate Intranet—IBGP

IGP 5 IGP 5

IGP 6 IGP 6
AS 64530

IGP 7 IGP 7

IGP 8 IGP 8

67
Fundamentals of BGP

Autonomous System

68
Internal BGP

• When BGP neighbors belong to

the same AS

A B AS 200

69
External BGP
• When BGP neighbors AS 109
belong to different AS
• Neighbors should be
directly connected 131.108.0.0 A
.1
131.108.10.0
• Configuration
B
Router B .2
150.10.0.0
router bgp 110
network 150.10.0.0
neighbor 131.108.10.1 remote-as 109

AS 110
Router A
router bgp 109
network 131.108.0.0
neighbor 131.108.10.2 remote-as 110
70
IBGP, EBGP Example

AS 1 AS 3

EBGP EBGP
AS 2

IBGP

71
 BGP

• RFC 1771 introduced in 1995

Each physical link actually represents two logical links:
Outgoing traffic
Incomming traffic
The routes you advertise in each direction influence the
traffic seperately
Advertising a route is a promise to diliver traffic
The routes you advertise directly influence the packets
you receive and the routes you receive directly
influence the packets you transmit.
72
Advertising Networks

73
 Advertising Networks
Using Network Command
AS1
Router A A
11.0.0.0
router bgp 1 12.0.0.0
neighbor 1.1.1.2 remote-as 2
network 11.0.0.0 EBGP
network 12.0.0.0

Router B 92.0.0.0
router bgp 2 93.0.0.0 B

neighbor 1.1.1.1 remote-as 1 AS2

network 92.0.0.0
network 93.0.0.0

74
Advertising Networks
By redistributing Static Routes
AS1
A
11.0.0.0
Router A 12.0.0.0
router bgp 1
neighbor 1.1.1.2 remote-as 2 EBGP
redistribute static

ip route 11.0.0.0 255.0.0.0 null 0 92.0.0.0

ip route 12.0.0.0 255.0.0.0 null 0 B
93.0.0.0
AS2

75
Advertising Networks
By Redistributing Dynamic Routes
AS1
A
11.0.0.0
12.0.0.0

Router A EBGP
router bgp 1
neighbor 1.1.1.2 remote-as 2
redistribute ospf 1 92.0.0.0
93.0.0.0 B

router ospf 1 AS2

network 11.0.0.0 0.255.255.255 area 0

76
he
Synchronization
Rule:
Do not use/advertise a prefix until a
matching route has been learnt from
an IGP

77
 Synchronization AS 10
C A
Routers A, B, D run I-BGP
Router C does not D B

AS 1
If synchronization is off then
• Router A sends traffic to C to reach
128.10.0.0
• C drops the packets since it has no
route to 128.10.0.0 AS 2

If synchronization is on then 128.10.0.0

• Routers A, B and D would not use the
route until they receive the matching
route via an IGP

78
Autonomous Systems
IGPs: RIP, IGRP, EGPs: BGP
OSPF, EIGRP

Autonomous System 65000 Autonomous System 65500

An autonomous system (AS) is a collection of
networks under a a single technical
administration
IGPs operate within an autonomous system
EGPs connect different autonomous systems
79
BGP Is Used Between
Autonomous Systems
AS
B 65000 C
BGP B

AS BGP AS
64500 A F 65500

BGP AS
D 65250 E

BGP is used between autonomous systems

Guarantees exchange of loop-free
routing information
80
Scalable Routing Protocol
Comparison

Interior or Hierarchy
Protocol DV or LS Metric
Exterior Required

OSPF Interior LS Yes Cost

EIGRP Advanced
Interior No Composite
DV
BGP
Advanced Path vectors
Exterior No
DV or attributes

81
Local Preference Attribute
AS 65350
172.16.0.0 AS 65250 AS 65000

Local Pref = 200

A
Needs to go to AS 65350
AS 65500 AS 64500
B
Local Pref = 150

• Paths with highest preference value are

most desirable
Preference configured on routers
Preference sent to internal BGP neighbors only
82
MED Attribute
AS 65500
172.20.0.0

B C
MED = 150
MED = 200

A 172.16.0.0

AS 65000

• Paths with lowest MED (also called the metric)

value are most desirable
MED configured on routers
MED sent to external BGP neighbors only
83
 Weight Attribute (Cisco Only)

AS 65000 AS 65250
172.20.0.0
AS 65500

B
D C

Weight = 200 A Weight = 150

AS 64500

• Paths with highest weight value are most

desirable
Weight configured on routers, on a per-neighbor basis
Weight not sent to any BGP neighbors
84
 BGP Synchronization
Example
AS 65500 AS 64500
EBGP • All routers in AS
C A E 65500 are running
IBGP BGP; no IGP is
AS 65000 running
D B F
EBGP 172.16.0.0

• If synchronization is on (the default) then:

– Routers A, C, and D would not use or advertise the route to
172.16.0.0 until they receive the matching route via an IGP
– Router E would not hear about 172.16.0.0
• If synchronization is off then:
– Routers A, C, and D would use and advertise the route they receive
via IBGP; Router E would hear about 172.16.0.0
– If Router E sends traffic for 172.16.0.0, Routers A, C, and D would
route the packets correctly to Router B
85
 Route Selection Decision
Process
• Consider only (synchronized) routes with no AS
loops and a valid next-hop, and then:
Prefer highest weight (local to router)
Prefer highest local preference (global within AS)
Prefer route originated by the local router
Prefer shortest AS-path
Prefer lowest origin code (IGP < EGP < incomplete)
Prefer lowest MED (from other AS)
Prefer EBGP path over IBGP path
Prefer the path through the closest IGP neighbor
Prefer oldest route for EBGP paths
Prefer the path with the lowest neighbor BGP router ID 86
 When to Use BGP
• BGP is most appropriate when at
least one of the following conditions
exist:
An AS allows packets to transit through it to
reach other autonomous systems (for
example, a service provider)
An AS has multiple connections to other
autonomous systems
The flow of traffic entering and leaving your
AS must be manipulated
• And the effects of BGP are well understood
87
 When Not to Use BGP
• BGP is not always appropriate. Don’t use BGP
if you have one of the following conditions:
A single connection to the Internet or other AS
Routing policy and route selection are not a
concern for your AS
Lack of memory or processor power on BGP
routers to handle constant updates
Limited understanding of route filtering and BGP
path selection process
Low bandwidth between autonomous systems

• Use static routes instead

88
Policy-Based Routing
• BGP allows administrators to define policies,
or rules, for how data will flow through the
autonomous systems
• BGP and associated tools cannot express all
routing policies
BGP does not enable one AS to send traffic to a
neighbor AS, intending that the traffic take a
different route from that taken by traffic
originating in the neighbor AS

• However, BGP can support any policy

conforming to (implementable by) the
hop-by-hop routing paradigm
89
 BGP Attributes

Well-known attributes Optional attributes

Must be recognized by all compliant Need not be supported by all BGP
BGP implementations implementations, if supported it may
be propagated to BGP Neighbors
Are propagated to other neighbors

Mandatory
Included in every update
AS Path (code 2)
Next Hop (code 3)
Origin (code 1)
Discreptionary
Not necessary to be Transitive Non-transitive
included in every update Marked as partial &
Discarded if not
Local preference (code 5) propagated to other recognized
neighbors – if recognized
Atomic Aggregate (code 6) MED (code 4)
Aggregator (code 7)
Origenator ID (code 9)
Community (code 8) (Cisco)

Cluster list (code 10)

90
 Incoming traffic matches the most-specific route

INTERNET

207.36.64.0/19
205.113.48.0/20 E
205.113.50.0/23

ISP1 ISP2

205.113.48.0/20 B C
207.36.64.0/19

205.113.50.0/23
205.113.50.0/23

A
SUBSCRIBER
205.113.50.0/23
91
 ISPs require Globally Routable address

INTERNET

205.113.48.0/20 207.36.64.0/19
E

205.113.50.0/23 205.113.50.0/23

ISP1 ISP2

205.113.48.0/20 B C
207.36.64.0/19

205.113.50.0/23
205.113.50.0/23

A
SUBSCRIBER
205.113.50.0/23
92
 ISPs require Globally Routable address

INTERNET

Customer 1
E

Customer 2

Full Routes B ISP2 routes

Plus default Customer 3
205.113.50.0/23

Customer 4
205.113.48.0/20
205.113.50.0/23
93
 ISPs require Globally Routable address

INTERNET

Customer 1
E

Customer 2

ISP2 routes
Full Routes B ISP2 routes
Plus default Customer 3
205.113.50.0/23

Customer 4
205.113.48.0/20
205.113.50.0/23
94
 Shortest loop free Inter AS Path

207.126.0.0/16 (4,2,1)

AS 7
AS 4

207.126.0.0/16 (6,5,3,1)
AS 2
AS 6

AS 3

AS 5 AS 1

207.126.0.0/16

95
 Shortest loop free Inter AS Path

207.126.0.0/16 AS 8
(8,7,4,2,1) 207.126.0.0/16 (7,4,2,1)

AS 7
AS 4
AS 9
AS 2
207.126.0.0/16
(9,8,7,4,2,1)
AS 6

AS 3

AS 5 AS 1

207.126.0.0/16

96
 AS Numbers are Prepended

NAP
207.126.0.0/16 207.126.0.0/16
(500,200,100) (300,100)

AS 500 AS 300

207.126.0.0/16 207.126.0.0/16
(200,100) (100)

AS 200

AS 100
207.126.0.0/16 (100) 207.126.0.0/16

97
 AS Numbers are Prepended

NAP
207.126.0.0/16 207.126.0.0/16
(500,200,100) (300,100,100,100)

AS 500 AS 300

207.126.0.0/16 207.126.0.0/16
(200,100) (100,100,100)

AS 200

AS 100
207.126.0.0/16 (100) 207.126.0.0/16

98
• Lan Technologies • WAN Technologies
• Star, Bus, Ring, FDDI • PPP/SLIP
• MAC(CSMA/CD, Token Passing) • Asynchronous circuits
• 10base5, 10 base 2, 1 base 5, 10base T, • ISDN, DDR
100baseT, 10 broad36, 10 base FL, 10base • Frame Relay, X.25, ATM, SMDS
FOIRL, 100base4, 100baseFx, 100baseTx,
1000baseSx, 1000baseFx, 1000baseCx, • OC-1 51.84, OC-3 155.52, OC-9 466.56
1000baseT, LANE • OC-12 622.08, OC-18 933.12, OC-24
1244.16
• OC-36 1866.24, OC-48 2488.32, OC-192
9953.28, OC-768 39813.12
• OTHER TECHNOLOGIES
• STM1 etc
• CIDR/VLSM/SubnetSupernet, 172.25.0.0
• T1/E1, T3/E3 etc
zero subnet etc, NAT • SECURITY
• NBMA • ACL, Firewall, VPN, IPSEC,
• E
Unicast/Mcast/Broadcast
network
AS 65500 GRE.

• Routing Control
• ACL, Polocy routing
ISP 172.20.0.0 172.30.0.0 ISP • Distribution lists
• Route redistribution
AS 65000 AS 65250
B C
10.10.10.2 10.10.20.1

• SWITCHING
• ROUTING • Vlans/VTP
• Static Routing • Spanning Tree
• RIP • Vlan Routing
• IGRP 10.10.10.1 10.10.20.2 • MLS
• EIGRP • HSRP
• OSPF A • Multicast
• IS-IS AS 64500 • Queing
• IBGP • Compression
BGP

99
 ASTRA CCNP/CCIE LAB
Astra
Infonets

Astra NOC
7206 7507
INTERNET

{Catalayst2924 With ATM uplink }x 1 nos.

{ Catalyst 3524 with GE uplink }x 2 nos.
ATM

GE For RAS &

WAN Testing
{Cisco 3640 + IOS enterprise
Catalyst 5500 Cisco PIX + memory +Cables + 30 Port Digital RAS+ 16 port
analog modem card +
4 WAN(A/S)} x 1 nos.

For Voice
Testing
VoIP
{Cisco 1750-4V,
{Cisco 2610 + IOS enterprise Plus 2FXS+2E&M+2WAN} x 1 nos.
+ memory +Cables} x 3 nos.
For WAN Testing
{Cisco 2610 + IOS IP Plus
{Cisco 2522 + IOS enterprise
+ memory + 2E&M +
+ memory +Cables} x 2 nos.
2 FXS ports + 2 WAN + Cables} x 1 nos.
For Frame Relay
and ISDN Testing For Voice and
WAN Testing 100
Network Competency Center
Astra
1. CCNA Infonets

2. CCNP (Routing, Switching, Remote Access, Support)

3. IP NETWORK RESOURCE SPECIALIST (DNS, NAT, Sendmail,

Vlans, FTP server, HSRP, Web server, Caching, Routing-static/rip,
Routing – bgp, ISDN, Framerelay, Asynchronous links, Bigbrother,
MRTG, Traffic shaping, Radius

4. INTERNET ROUTING ARCHITECTURE (Static routing, RIP

(V1, V2), IGRP, Routing Principles, Extending IP Addresses,
Configuring OSPF in a Single Area, Interconnecting Multiple
OSPF Areas, Configuring Enhanced IGRP (EIGRP), Configuring Basic
Border Gateway Protocol, Implementing BGP in Scalable Networks,
Optimizing Routing, Update, Operation, Implementing Scalability
Features in Your Network

5. VOICE OVER IP

6. SECURITY AND FIREWALL (Pix, Check-point, IDS)

101
Thank You!
Questions?

161
102