Routing Concept

Chapter 4
Router Operations

A router needs to do the following:

 Know the destination address.
 Identify the sources from which the router can learn.
 Discover possible routes to the intended destination.
 Select the best route.
 Maintain and verify routing information.
Router Operations (Cont.)

Routers must learn destinations that are not directly connected.

Static vs. Dynamic Routes

Static Route Dynamic Route

Uses a route that a network Uses a route that a network
administrator enters into the routing protocol adjusts
router manually automatically for topology or
traffic changes
Static Routes

Configure unidirectional static routes to and from a stub network to

allow communications to occur.
Static Route Configuration

RouterX(config)# ip route network [mask]

{address | interface}[distance] [permanent]

Defines a path to an IP destination network or subnet or host

Address = IP address of the next hop router
Interface = outbound interface of the local router
Static Route Example

RouterX(config)# ip route 172.16.1.0 255.255.255.0 172.16.2.1

or
Router(config)#ip route 172.16.1.0 255.255.255.0 s0/0/0

 This is a unidirectional route. You must have a route configured in the

opposite direction.
Static Route Example

 This route allows the stub network to reach all known networks
beyond Router A.
 Verifying the Static Route Configuration

RouterX# show ip route

Codes: C - connected, S - static, I - IGRP, R - RIP, M - mobile, B - BGP
D - EIGRP, EX - EIGRP external, O - OSPF, IA - OSPF inter area
E1 - OSPF external type 1, E2 - OSPF external type 2, E - EGP
i - IS-IS, L1 - IS-IS level-1, L2 - IS-IS level-2, * - candidate default
U - per-user static route

Gateway of last resort is 0.0.0.0 to network 0.0.0.0

10.0.0.0/8 is subnetted, 1 subnets

C 10.1.1.0 is directly connected, Serial0/0/0
S* 0.0.0.0/0 is directly connected, Serial0
Route Summarization
 LAB 3

1. Gunakan Packet Tracert – assign topologi

2. Static Route
3. Verify static route
Virtual LAN
Chapter 5
VLAN Overview

 Segmentation
 Flexibility
 Security

VLAN = Broadcast Domain = Logical Network (Subnet)

VLAN Operation
VLAN Operation

• Each logical VLAN is like a separate physical bridge.

• VLANs can span across multiple switches.
• Trunks carry traffic for multiple VLANs.
• Trunks use special encapsulation to distinguish between
different VLANs.
VLAN Membership Modes
802.1Q Trunking
802.1Q Trunking
VTP Features
 VTP Modes
 Create VLANs
 Modify VLANs
 Delete VLANs
 Sends and forwards
advertisements
 Synchronizes

 Cannot create,  Create local VLANs only

change, or delete  Modify local VLANs only
VLANs  Delete local VLANs only
 Sends and  Forwards advertisements
forwards
advertisements  Does not
synchronize
 Synchronizes
VTP Operation

 VTP advertisements are sent as multicast frames.

 VTP servers and clients are synchronized to the
latest revision number.
 VTP advertisements are sent every 5 minutes or
when there is a change.
VTP Pruning
Configuring VLANs and Trunks

1. Configure and verify VTP.

2. Configure and verify 802.1Q trunks.
3. Create or modify a VLAN on the VTP server switch.
4. Assign switch ports to a VLAN and verify.
5. Execute adds, moves, and changes.
6. Save the VLAN configuration.
 LAB 4

1. Gunakan Packet Tracert – assign topologi

VLAN
2. VLAN
3. Inter VLAN
4. Verify VLAN
Routing Protocol
Chapter 6
What Is a Dynamic Routing Protocol?
 Routing protocols are used between routers to determine paths to
remote networks and maintain those networks in the routing tables.
 After the path is determined, a router can route a routed protocol to
the learned networks.
What Is a Dynamic Routing Protocol?
Autonomous Systems: Interior and Exterior
Routing Protocols

 An autonomous system is a collection of networks within

a common administrative domain.
 Interior gateway protocols operate within an autonomous system.
 Exterior gateway protocols connect different autonomous systems.
Distance Vector Routing Protocols

Routers pass periodic copies of their routing table to

neighboring routers and accumulate distance vectors.
Link-State Routing Protocols

After an initial flood of LSAs, link-state routers pass small,

event-triggered link-state updates to all other routers.
Benefits and Drawbacks of Link-State Routing
• Benefits of link-state routing:
 Fast convergence:
• Changes are reported immediately by the affected source
 Robustness against routing loops:
• Routers know the topology
• Link-state packets are sequenced and acknowledged
 Hierarchical network design enables optimization of resources.

• Drawbacks of link-state routing:

 Significant demands for resources:
• Memory (three tables: adjacency, topology, forwarding)
• CPU (Dijkstra’s algorithm can be intensive, especially when there are
many instabilities)
 Requires very strict network design
 Configuration can be complex when tuning various parameters and
when design is complex
Classful Routing Protocol

 Classful routing protocols do not include the subnet mask with the
route advertisement.
 Within the same network, consistency of the subnet masks is assumed.
 Summary routes are exchanged between foreign networks.
 These are examples of classful routing protocols:
 RIPv1
 IGRP
Classless Routing Protocol

 Classless routing protocols include the subnet mask with the route
advertisement.
 Classless routing protocols support a variable-length subnet mask
(VLSM).
 Summary routes can be manually controlled within the network.
 These are examples of classless routing protocols:
 RIPv2
 EIGRP
 OSPF
 IS-IS
Selecting the Best Route Using Metrics
Administrative Distance: Ranking Routing Sources

Routers choose the routing source with the

best administrative distance:
 OSPF has an administrative distance of 110.
 EIGRP has an administrative distance of 90.
Administrative Distance: Ranking Routing Sources
RIP Overview

 Maximum is 16 equal-cost paths (default = 4)

 Hop-count metric selects the path
 Routes update every 30 seconds
RIP Configuration Example
Verifying the RIP Configuration

Routing Protocol is "rip"

Sending updates every 30 seconds, next due in 6 seconds
Invalid after 180 seconds, hold down 180, flushed after 240
Outgoing update filter list for all interfaces is not set
Incoming update filter list for all interfaces is not set
Redistributing: rip
Default version control: send version 2, receive version 2
Interface Send Recv Triggered RIP Key-chain
FastEthernet0/0 2 2
Serial0/0/2 2 2
Automatic network summarization is in effect
Maximum path: 4
Routing for Networks:
10.0.0.0
172.16.0.0
Routing Information Sources:
Gateway Distance Last Update
10.1.1.2 120 00:00:25
Distance: (default is 120)

RouterA#
Verifying the RIP Configuration

RouterA# show ip route

Codes: C - connected, S - static, I - IGRP, R - RIP, M - mobile, B - BGP
D - EIGRP, EX - EIGRP external, O - OSPF, IA - OSPF inter area
N1 - OSPF NSSA external type 1, N2 - OSPF NSSA external type 2
E1 - OSPF external type 1, E2 - OSPF external type 2, E - EGP
i - IS-IS, L1 - IS-IS level-1, L2 - IS-IS level-2, * - candidate default
U - per-user static route, o - ODR
T - traffic engineered route

Gateway of last resort is not set

172.16.0.0/24 is subnetted, 1 subnets

C 172.16.1.0 is directly connected, fastethernet0/0
10.0.0.0/24 is subnetted, 2 subnets
R 10.2.2.0 [120/1] via 10.1.1.2, 00:00:07, Serial0/0/2
C 10.1.1.0 is directly connected, Serial0/0/2
R 192.168.1.0/24 [120/2] via 10.1.1.2, 00:00:07, Serial0/0/2
OSPF Overview

 Creates a neighbor relationship by exchanging hello packets

 Propagates LSAs rather than routing table updates
Link: Router interface
State: Description of an interface and its relationship to neighboring routers
 Floods LSAs to all OSPF routers in the area, not just directly connected
routers
 Pieces together all the LSAs generated by the OSPF routers to create
the OSPF link-state database
 Uses the SPF algorithm to calculate the shortest path to each
destination and places it in the routing table
OSPF Hierarchy Example

 Minimizes routing table entries

 Localizes the impact of a topology change within an area
OSPF Packet Types
Neighbor Adjacencies: The Hello Packet
SPF Algorithm

10

10
1
1

 Places each router at the root of a tree and calculates the

shortest path to each destination based on the cumulative cost
 Cost = Reference Bandwidth / Interface Bandwidth (b/s)
Configuring Single-Area OSPF
RouterX(config)#
router ospf process-id
 Defines OSPF as the IP routing protocol

RouterX(config-router)#
network address wildcard-mask area area-id
 Assigns networks to a specific OSPF area
Configuring Loopback Interfaces

Router ID:
 Number by which the router is known to OSPF
 Default: The highest IP address on an active interface at the moment of
OSPF process startup
 Can be overridden by a loopback interface: Highest IP address of any active
loopback interface
 Can be set manually using the router-id command
Verifying the OSPF Configuration
RouterX# show ip protocols
 Verifies that OSPF is configured

RouterX# show ip route

 Displays all the routes learned by the router

RouterX# show ip route

Codes: I - IGRP derived, R - RIP derived, O - OSPF derived,

C - connected, S - static, E - EGP derived, B - BGP derived,
E2 - OSPF external type 2 route, N1 - OSPF NSSA external type 1 route,
N2 - OSPF NSSA external type 2 route

Gateway of last resort is 10.119.254.240 to network 10.140.0.0

O 10.110.0.0 [110/5] via 10.119.254.6, 0:01:00, Ethernet2

O IA 10.67.10.0 [110/10] via 10.119.254.244, 0:02:22, Ethernet2
O 10.68.132.0 [110/5] via 10.119.254.6, 0:00:59, Ethernet2
O 10.130.0.0 [110/5] via 10.119.254.6, 0:00:59, Ethernet2
O E2 10.128.0.0 [170/10] via 10.119.254.244, 0:02:22, Ethernet2
...
Verifying the OSPF Configuration (Cont.)

RouterX# show ip ospf

 Displays the OSPF router ID, timers, and statistics

RouterX# show ip ospf

Routing Process "ospf 50" with ID 10.64.0.2
<output omitted>

Number of areas in this router is 1. 1 normal 0 stub 0 nssa

Number of areas transit capable is 0
External flood list length 0
Area BACKBONE(0)
Area BACKBONE(0)
Area has no authentication
SPF algorithm last executed 00:01:25.028 ago
SPF algorithm executed 7 times
<output omitted>
Verifying the OSPF Configuration (Cont.)

RouterX# show ip ospf interface

 Displays the area ID and adjacency information

RouterX# show ip ospf interface ethernet 0

Ethernet 0 is up, line protocol is up

Internet Address 192.168.254.202, Mask 255.255.255.0, Area 0.0.0.0
AS 201, Router ID 192.168.99.1, Network Type BROADCAST, Cost: 10
Transmit Delay is 1 sec, State OTHER, Priority 1
Designated Router id 192.168.254.10, Interface address 192.168.254.10
Backup Designated router id 192.168.254.28, Interface addr 192.168.254.28
Timer intervals configured, Hello 10, Dead 60, Wait 40, Retransmit 5
Hello due in 0:00:05
Neighbor Count is 8, Adjacent neighbor count is 2
Adjacent with neighbor 192.168.254.28 (Backup Designated Router)
Adjacent with neighbor 192.168.254.10 (Designated Router)
 Verifying the OSPF Configuration (Cont.)

RouterX# show ip ospf neighbor

 Displays the OSPF neighbor information on a per-interface basis

RouterX# show ip ospf neighbor

ID Pri State Dead Time Address Interface

10.199.199.137 1 FULL/DR 0:00:31 192.168.80.37 FastEthernet0/0
172.16.48.1 1 FULL/DROTHER 0:00:33 172.16.48.1 FastEthernet0/1
172.16.48.200 1 FULL/DROTHER 0:00:33 172.16.48.200 FastEthernet0/1
10.199.199.137 5 FULL/DR 0:00:33 172.16.48.189 FastEthernet0/1
 LAB 5

1. Gunakan Packet Tracert – assign topologi

OSPF
2. OSPF
3. Verify OSPF