Scribd
Upload
2 views

Chapter 07 Routing Basics and Static Routing

This chapter covers the basics of routing, including static and dynamic routing methods, and the structure of routing tables. It explains how routers determine the best path to a destination and provides details on configuring static routes and default routes. Additionally, it discusses dynamic routing protocols, their functions, and the classification of routing protocols based on their characteristics.

Uploaded by

Senopy Petreck
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
2 views

Chapter 07 Routing Basics and Static Routing

This chapter covers the basics of routing, including static and dynamic routing methods, and the structure of routing tables. It explains how routers determine the best path to a destination and provides details on configuring static routes and default routes. Additionally, it discusses dynamic routing protocols, their functions, and the classification of routing protocols based on their characteristics.

Uploaded by

Senopy Petreck
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 25

Chapter 07

Routing Basics and Static Routing


What is Routing?

 Routing Means: finding all possible paths to destination


networks and selecting the best path

 Routing methods:
- Static Routing
- Dynamic Routing
Routing Table Structure
 Routing Table is stored in RAM and contains
information about:
Directly connected networks - this occurs when a device is
connected to another router interface
Remotely connected networks - this is a network that is not
directly connected to a particular router
Detailed information about the networks include source of
information, network address & subnet mask, and IP address of
next-hop router

 show ip route command is used to view a routing table


Router interfaces
 Each router interface is a member of a different network

 Activated using the no shutdown command


Dymanic Routing
 Maintaining routing tables
-Dynamic routing protocols are used to share routing information with
other router & to maintain and up date their own routing table.
 IP routing protocols. Example of routing protocols include:
-RIP
-IGRP
-EIGRP
-OSPF
-IS-IS
-BGP
Routing Table Structure
 Routing Table Principles
- 3 principles regarding routing tables:
 Every router makes its decisions alone, based on the
information it has in its routing table.
 Different routing table may contain different information.
 A routing table can tell how to get to a destination but not
how to get back.
Static Routing
Static Routes with Exit Interfaces
 Purpose of a static route
A manually configured route used when routing from a network
to a stub network
Static Routes with Exit Interfaces
 IP route command
To configure a static route use the following command: ip route
Example:
-Router(config)# ip route network-address subnet-mask {ip-
address | exit-interface }
Static Routes with Exit Interfaces
 Configuring routes to 2 or more remote networks
Use the following commands for R1
-R1(config)#ip route 192.168.1.0 255.255.255.0 172.16.2.2
-R1(config)#ip route 192.168.2.0 255.255.255.0 172.16.2.2
Static Routes with Exit Interfaces
 Verifying the Static Route Configuration
-Use the following commands
Step 1 show running-config
Step 2 verify static route has been entered correctly
Step 3 show ip route
Step 4 verify route was configured in routing table
Step 5 issue ping command to verify packets can reach
destination and that Return path is working
Summary and Default Route
 Default Static Route
This is a route that will match all packets. Stub routers that
have a number of static routes all exiting the same interface are
good candidates for a default route.
-Like route summarization this will help reduce the size of the
routing table

 Configuring a default static route


Similar to configuring a static route. Except that destination IP
address and subnet mask are all zeros
Example:
-Router(config)# ip route 0.0.0.0 0.0.0.0 [exit-interface | ip-
address ]
Introduction to Dynamic
Routing Protocol
Dynamic Routing Protocols
Dynamic Routing Protocols
 Function(s) of Dynamic Routing Protocols:
-Dynamically share information between routers.
-Automatically update routing table when topology changes.
-Determine best path to a destination.
Dynamic Routing Protocols
 The purpose of a dynamic routing protocol is to:
-Discover remote networks
-Maintaining up-to-date routing information
-Choosing the best path to destination networks
-Ability to find a new best path if the current path is no longer
available
Classifying Routing Protocols
 Dynamic routing protocols are grouped according to
characteristics. Examples include:

 Autonomous System is a group of routers under the control of


a single authority.
Classifying Routing Protocols
- Interior Gateway Protocols (IGP)
Used for routing inside an autonomous system & used to route
within the individual networks themselves.
- Exterior Gateway Protocols (EGP)
Used for routing between autonomous systems
Classifying Routing Protocols

 IGP: Comparison of Distance Vector & Link State Routing


Protocols
Distance vector
– Routing updates from / to neighbors only.
– incomplete view of network topology.
– Generally, periodic updates.
Link state
– complete view of network topology is created.
– updates are not periodic.
Routing Protocols Metrics
 The Metric Field in the
Routing Table
 Metric used for each
routing protocol
-RIP - hop count
-IGRP & EIGRP - Bandwidth
(used by default), Delay (used
by default), Load,
Reliability,MTU
-IS-IS & OSPF – Cost (
Bandwidth (Cisco’s
implementation))
Administrative Distance of a Route
 Purpose of a metric
It’s a calculated value used to determine the best path to a
destination

 Purpose of Administrative Distance


It’s a numeric value that specifies the preference of a particular
route
Administrative Distance of a Route
 Dynamic Routing Protocols
Link-State Routing
Protocols
Link-State Routing

Dikjstra’s algorithm also known as the shortest path first (SPF)


algorithm
Link-State Routing
 The shortest path to a destination is not necessarily the path
with the least number of hops

You might also like