Agenda

• Que es Routing?
• Network Addressing
• Routing Protocols

7-1
 Que es 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).
7-2
 Routers—Layer 3
Remote
Routing Table Location
192.168.3.0 Frame Relay
192.168.1.0 Ethernet
192.168.2.0 FDDI

Network 192.168.3.0
Frame Relay
Main Site

Network 192.168.2.0
FDDI
Network 192.168.1.0
Ethernet
7-3
Donde se usan los Routers

• LAN-to-LAN connectivity
• LAN-to-WAN connectivity
• Remote access

7-4
 Conectividad LAN-to-LAN

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
7-5
Determinación de caminos

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

7-6
 Multiprotocol Routing

Routing Tables
IPX 3a.0800.5678.12ab
Novell Apple
IPX 4b.0800.0121.ab13 DEC IP Token IP 15.16.50.3
Ring

AppleTalk 100.110

VAX
DECnet 5.8 Token
Ring
VAX
IP 15.16.42.8 DECnet 10.1

AppleTalk 200.167 IP 15.17.132.6

7-7
 Routing Tables

• Routing algorithms
– Initialize and maintain To
To Reach
Reach Send
Send
routing tables to help Network:
Network: To:
To:
with path determination
27
27 Node
Node A
A
• Route information types
57
57 Node
Node B
B
– Destination/next-hop associations
17
17 Node
Node C
C
– Path desirability 24
24 Node
Node B
B
– Vary depending on routing algorithm 11
11 Node
Node B
B
• Message = Routing table 72
72 Node
Node A
A
maintenance communications
– Routing update messages
– Link-state advertisement
7-8
Objetivos de los algoritmos de Routing

• 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.
7-9
 Métricas de Routing

• 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

7-10
Direccionamiento de nodos y redes

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

7-11
 Ejemplos

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
7-12
 Subnetwork
INTERNET
131.108.0.0
131.108.1.0 Subdividing address
space into smaller blocks
131.108.2.0
131.108.3.0 – Helps organize network
131.108.5.0
– Security (keeps HR
HR 131.108.4.0 separately addressable)
131.108.6.0
131.108. 8.0 – Scalability—Keeps traffic to
appropriate segments
– Allows single, summarized
Manufacturing 131.108.9.0 routing entry (131.108.0.0) to
131.108.7.0 be advertised to external
networks
R&D
– Specific route entries
131.108.10.0 (131.108.8.0) required only
for routers in the subnetted
block
7-13
 Algoritmos de Ruteo

• 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

7-14
 Static Routing

• Manual table updates by

a network administrator
• Benefits
– Reflects administrator’s special
topology knowledge
A
– 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
“Stub” Network sufficient
– Point-to-point or circuit-switched
connection
7-15
 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.
7-16
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
7-17
 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

7-18
 Evolución de los Protocolos de
Routeo
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
multipathrouting,
routing,and
and
load
loadbalancing
balancing
Hybrid •• Derived
Derivedfrom
fromIS-IS
IS-IS
Link State
7-19
 RIP y 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.)

7-20
 OSPF y 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

7-21
 Resumen

• Routers mueven datos a través de

redes de un ______ a __________
• Routers determinan el camino
_______ para reenviar tráfico
• _______ _________ comunican
información de _________ entre
routers
7-22
 Resumen

• Routers mueven datos a través de

redes de un origen a un destino
• Routers determinan el camino óptimo
para reenviar tráfico
• Routing protocols comunican
información de accesibilidad entre
routers
7-23