Module 7:
Understanding
Routing
CSE-Network Management—Introduction [Link] © 1999, Cisco Systems, Inc. 1-1
Agenda
• What Is Routing?
• Network Addressing
• Routing Protocols
CSE: Networking Fundamentals—Routing [Link] © 1999, Cisco Systems, Inc. 7-2
What is Routing?
CSE-Network Management—Introduction
© 1999, Cisco Systems, Inc. [Link] © 1999, Cisco Systems, Inc. 1-3
What Is Routing?
• Routing is:
– Finding a path between a source and
destination (path determination)
– Moving information across an internetwork
from a source to a destination (switching*)
– Very complex in large networks because
of the many potential intermediate nodes
• A router is:
– A network layer device that forwards packets
from one network to another and determines
the optimal path for forwarding network traffic
* The term “switching”, when used to describe a router’s
function, is different from a switch (the network device).
CSE: Networking Fundamentals—Routing [Link] © 1999, Cisco Systems, Inc. 7-4
Routers—Layer 3
Remote
Routing Table Location
[Link] Frame Relay
[Link] Ethernet
[Link] FDDI
Network [Link]
Frame Relay
Main Site
Network [Link]
FDDI
Network [Link]
Ethernet
CSE: Networking Fundamentals—Routing [Link] © 1999, Cisco Systems, Inc. 7-5
Where are Routers Used?
• LAN-to-LAN connectivity
• LAN-to-WAN connectivity
• Remote access
CSE: Networking Fundamentals—Routing [Link] © 1999, Cisco Systems, Inc. 7-6
LAN-to-LAN Connectivity
X Y
C
C
A
A
Application B
B Application
Presentation Presentation
Session A B C Session
Transport Transport
Network Network Network Network Network
Data Link Data Link Data Link Data Link Data Link
Physical Physical Physical Physical Physical
• Routers encapsulate and de-encapsulate data packets
as they are transferred from system X to system Y
CSE: Networking Fundamentals—Routing [Link] © 1999, Cisco Systems, Inc. 7-7
Path Determination
5
2 8 9
4 Which Path?
6 10 11
1 3
7
• Routers find the best path through the network
– Routing tables contain route information
– Network addresses represent the path
of media connections to a destination
CSE: Networking Fundamentals—Routing [Link] © 1999, Cisco Systems, Inc. 7-8
Multiprotocol Routing
Routing Tables
IPX 3a.0800.5678.12ab
Novell Apple
IPX 4b.0800.0121.ab13 DEC IP Token IP [Link]
Ring
AppleTalk 100.110
VAX
DECnet 5.8 Token
Ring
VAX
IP [Link] DECnet 10.1
AppleTalk 200.167 IP [Link]
CSE: Networking Fundamentals—Routing [Link] © 1999, Cisco Systems, Inc. 7-9
Routing Tables
• Routing algorithms
– Initialize and maintain
To Reach Send
routing tables to help
Network: To:
with path determination
• Route information types 27 Node A
– Destination/next-hop associations 57 Node B
– Path desirability 17 Node C
– Vary depending on routing algorithm 24 Node B
11 Node B
• Message = Routing table
maintenance communications 72 Node A
– Routing update messages
– Link-state advertisement
CSE: Networking Fundamentals—Routing [Link] © 1999, Cisco Systems, Inc. 7-10
Routing Algorithm Goals
• Optimality
– Selecting the best route based on metrics and
metric weightings used in the calculation
• Simplicity and low overhead
– Efficient routing algorithm functionality with a
minimum of software and utilization overhead
• Robustness and stability
– Correct performance in the face of unusual
or unforeseen circumstances (e.g., high load)
• Rapid convergence
– Fast agreement, by all routers, on optimal routes
• Flexibility
– Quick and accurate adaptation to changes in
router availability, bandwidth, queue size, etc.
CSE: Networking Fundamentals—Routing [Link] © 1999, Cisco Systems, Inc. 7-11
Routing Metrics
• Path length
– Total hop count or sum of cost per network link
• Reliability
– Dependability (bit error rate) of each network link
• Delay
– Useful because it depends on bandwidth, queues, network congestion, and physical
distance
• Communication cost
– Operating expenses of links (private versus public)
• Bandwidth and load
CSE: Networking Fundamentals—Routing [Link] © 1999, Cisco Systems, Inc. 7-12
Network Addressing
CSE-Network Management—Introduction
© 1999, Cisco Systems, Inc. [Link] © 1999, Cisco Systems, Inc. 1-13
Network and Node Addresses
Network Node
2
1 1
2.1
2 1.2
3 1.1
2 1 1 3.1
1.3
3
3 1
• Network address—Path part used by the router
• Node address—Specific port or device on the network
CSE: Networking Fundamentals—Routing [Link] © 1999, Cisco Systems, Inc. 7-14
Addressing Examples
Network Node/Host
Protocol Address Address
General 1. 4
TCP/IP 10. 8.2.48
Novell IPX 1aceb0b 0000.0c00.6e25
AppleTalk 10. 1.
X.25 DNIC NTN
NTN: National Terminal Number
CSE: Networking Fundamentals—Routing [Link] © 1999, Cisco Systems, Inc. 7-15
Subnetwork Addressing
INTERNET
[Link]
[Link] Subdividing address
space into smaller blocks
[Link]
[Link] – Helps organize network
[Link]
– Security (keeps HR
HR [Link] separately addressable)
[Link]
131.108. 8.0 – Scalability—Keeps traffic to
appropriate segments
– Allows single, summarized
Manufacturing [Link] routing entry ([Link]) to
[Link] be advertised to external
networks
R&D
– Specific route entries
[Link] ([Link]) required only
for routers in the subnetted
block
CSE: Networking Fundamentals—Routing [Link] © 1999, Cisco Systems, Inc. 7-16
Routing Algorithm Types
• Single-path versus multi-path
• Flat versus hierarchical
• Host-intelligent versus router-intelligent
• Intradomain versus interdomain
• Static versus dynamic routing
• Link state versus distance vector
CSE: Networking Fundamentals—Routing [Link] © 1999, Cisco Systems, Inc. 7-17
Static Routing
• Manual table updates by
a network administrator
• Benefits
– Reflects administrator’s special
A topology knowledge
– Private—Not conveyed to other
routers in updates
– Avoids the overhead of dynamic
routing
• Stub network
B – When a node is accessible by
only one path, a static route is
sufficient
“Stub” Network
– Point-to-point or circuit-switched
connection
CSE: Networking Fundamentals—Routing [Link] © 1999, Cisco Systems, Inc. 7-18
Dynamic Routing
• Most internetworks use dynamic routing
A B A B
X D
X D
C C
A network change blocks …and an alternate route is
the established path... found dynamically.
CSE: Networking Fundamentals—Routing [Link] © 1999, Cisco Systems, Inc. 7-19
Distance Vector versus Link State
• Distance vector
– Sends routing table info only to neighbors, so change communication
may need one min/router
– Also called “routing by rumor”
– Easy to configure, but slow
• Link state
– Floods routing information about itself to all nodes, so changes are
known immediately
– Efficient, but complex to configure
• Cisco’s EIGRP hybrid
– Efficient and easy to configure
CSE: Networking Fundamentals—Routing [Link] © 1999, Cisco Systems, Inc. 7-20
Routing Protocols
CSE-Network Management—Introduction
© 1999, Cisco Systems, Inc. [Link] © 1999, Cisco Systems, Inc. 1-21
Routed versus Routing Protocols
• Routed protocols
used between
routers to direct user
traffic; also called
network protocols
– Examples: IP, IPX,
DECnet, AppleTalk,
NetWare, OSI, VINES
• Routing protocols
Network Destination Exit Port
used between Protocol Network to Use
routers to maintain
Protocol name 1.0 1.1
routing tables 2.0 2.1
– Examples: RIP, IGRP, 3.0 3.1
OSPF, BGP, EIGRP
CSE: Networking Fundamentals—Routing [Link] © 1999, Cisco Systems, Inc. 7-22
Routing Protocol Evolutions
EIGRP
EIGRP
•• Hybrid
Hybridprotocol
protocol
IGRP
IGRP •• Developed
Developedby byCisco
Cisco
••Distance
Distancevector
vector •• Superior
Superiorconvergence
convergence
••Developed
Developedby byCisco
Cisco and
andoperating
operatingefficiency
efficiency
••Addresses
Addressesproblems
problemsin
in •• Merges
Mergesbenefits
benefitsof
oflink
link
large,
large,heterogeneous
heterogeneous state & distance vector
state & distance vector
RIP
RIP networks
networks
••Distance
Distancevector
vector
••Most
Mostcommon
commonIGP
IGP
••Uses OSPF
OSPF
Useshop
hopcount
count
•• Link
Linkstate,
state,hierarchical
hierarchical
•• Successor
Successorto toRIP
RIP
•• Uses
Usesleast-cost
least-costrouting,
routing,
Distance Vector multipath
multipath routing,and
routing, and
load
loadbalancing
balancing
Hybrid •• Derived
Derivedfrom
fromIS-IS
IS-IS
Link State
CSE: Networking Fundamentals—Routing [Link] © 1999, Cisco Systems, Inc. 7-23
RIP and IGRP
19.2 k 19.2 k
64k 64k 64k 64k
64k 64k
RIP IGRP
Industry standard that Cisco protocol that selects
selects the path with the the fastest path (using
fewest hops load, distance, etc.)
CSE: Networking Fundamentals—Routing [Link] © 1999, Cisco Systems, Inc. 7-24
OSPF and EIGRP
Aspect OSPF EIGRP
Topology Hierarchical Not restricted
Memory & CPU
High Moderate
requirements
Routing table size Large Moderate
Controlling body Industry standard Cisco proprietary
Convergence Fast Fast
Configuration Difficult Easy
IP
Supported
IP IPX
protocols
AppleTalk
CSE: Networking Fundamentals—Routing [Link] © 1999, Cisco Systems, Inc. 7-25
Summary
• Routers move data across networks
from a source to a destination
• Routers determine the optimal path for
forwarding network traffic
• Routing protocols communicate
reachability information between routers
CSE: Networking Fundamentals—Routing [Link] © 1999, Cisco Systems, Inc. 7-26
Presentation_ID © 1999, Cisco Systems, Inc. [Link] 27
