Redes de Comunicaciones de Datos

Routing
Ing. Marco A. Ortiz N.
An autonomous system (AS) is a network under a single
administrative control.

Figure1. Autonomous systems. Source: Implementing Cisco IP Routing, 2015

2
 An autonomous system (AS)

Figure2. Autonomous systems. Source:Guide to Reliable Internet Services and Applications,

3
2010
Enterprise Network Infrastructure

4
Figure3. Network infrastructure. Source: Implementing Cisco IP Routing, 2015
Routing protocols

Table 1. Unicast and Multicast routing. Source:

5
https://technet.microsoft.com/en-us/library/cc759719(v=ws.10).aspx
“In unicast routing, a packet is routed, hop by hop, from
its source to its destination by the help of forwarding
tables. The source host needs no forwarding table
because it delivers its packet to the default router in its
local network. The destination host needs no forwarding
table either because it receives the packet from its
default router in its local network. This means that only
the routers that glue together the networks in the
internet need forwarding tables” (Forouzan, 2013, p.
596)

6
 Routing protocols

7
Figure4. Routing protocols. Source: Implementing Cisco IP Routing, 2015
 Routing protocols

8
Figure5. Routing protocols detailed. Source: Implementing Cisco IP Routing, 2015
 Principles of Static Routing
A static route can be used in the following circumstances

• When it is undesirable to have dynamic routing updates forwarded

across slow bandwidth links
• When the administrator needs total control over the routes used by
the router.
• When a backup to a dynamically recognized route is necessary.
• When it is necessary to reach a network accessible by only one path
(a stub network).
• When a router connects to its ISP and needs to have only a default
route pointing toward the ISP router, rather than learning many
routes from the ISP.
• When a router is underpowered and does not have the CPU or
memory resources necessary to handle a dynamic routing protocol.

(Teare et.al, 2015)

9
 References

Teare, D. (2015). Implementing Cisco IP Routing

(ROUTE) Foundation Learning Guide: (ccnp Route
300-101).
Kalmanek, C. (2010). Guide to reliable internet services
and applications. London: Springer.

10
“To find the best route, an internet can be modeled as a graph. A
graph in computer science is a set of nodes and edges (lines) that
connect the nodes. To model an internet as a graph, we can think
of each router as a node and each network between a pair of
routers as an edge. An internet is, in fact, modeled as a weighted
graph, in which each edge is associated with a cost.” (Forouzan,
2013, p. 596)

11
 Graphs

Null graph (No vertices, no edges. For mathematical porpoises)

One node graph (Trivial)
All others (Non trivial)

Simple graph: With no loops or parallel edges.

 Graphs

Undirected G(N,E)
Directed
Weighted
“The ends of an edge are said to be incident
with the edge, and vice versa” (Bondy et. al,
2008, p. 3 )
Adjacent nodes: Incident with a
common edge.

Adjacent edges: Incident with a

common node. H(N,E)

Two distinct adjacent

nodes are neighbors
(Bondy et. al, 2008) 13
 Graphs

Undirected
Directed
Weighted

G(N, E, W)
 Graphs - Weighted
The sequence of nodes is a path if

The weight through a path is

Shortest path algorithm:

Find a path ( ) with a minimum Weight
 Shortest path algorithm
A single node path, that is, from to has a
weight of zero.
“The algorithm doesn’t depend on the range of the
dynamic range of the weights” (Devadas, 2011,13.00)

The weight of the shortest path between and is

represented as

Where is the minimum weight over all

paths.
 Shortest path algorithm
1. Initially every weight is
2. Then, reduce these for all the nodes that are
reachable from the source node
18
 Shortest Path Algorithms

Bellman-Ford Dijkstra

19
 Bellman-Ford algorithm

“The Bellman–Ford shortest path algorithm for

computing the shortest path in a centralized manner
was proposed by Ford in 1956. Bellman described a
version independently in 1958, by using a system of
equations that has become known as Bellman’s
equations. Moore also independently presented an
algorithm in 1957 that was published in 1959 [499].
Thus, what is often known as the Belllman–Ford
algorithm, especially in communications networking, is
also known as the Bellman–Ford–Moore algorithm in
man circles.”

20
 Distance-Vector Routing

distance vector: gives only the least costs to the

destinations.

21
 Distance-Vector Routing
First: when the corresponding node has been booted, these
vectors are made (asynchronously)

22
 Distance-Vector Routing
Second: Improve vectors by exchanging information.
Each node sends a copy of the vector to all its immediate
neighbors.
After a node receives a distance vector from a neighbor, it
updates its distance vector using the Bellman-Ford equation

23
 Routing Information Protocol
(RIP)
Distance Vector
The cost is defined as the number of hops, which means
the number of subnets a packet needs to travel
through from the source router to the final destination
host.
RIP, the maximum cost of a path can be 15, which
means 16 is considered as infinity (no connection).
RIP can be used only in autonomous systems in which
the diameter of the AS is not more than 15 hops
Periodic updates.
24
Routing Information Protocol
(RIP)

25
26
RIP

27
 RIP

Destino Métrica interfaz Destino Métrica interfaz

(hops) (hops)
10.4.4.0 1 f0/0 14.33.3.0 1 f0/0
14.33.3.0 1 f0/1 11.3.1.0 1 f0/1
11.3.1.0 2 f0/1 10.4.4.0 2 f0/0
192.168.1.0 3 f0/1 192.168.1.0 2 f0/1

28
 RIP

Uses the service of UDP on the well-known port

number 520.

RIP format

Each entry carries the information related to one line in the forwarding table of the
router that sends the message

29
A request message is sent by a router that has just come
up.
A request message is sent by a router that has some
time-out entries.
A request message can ask about specific entries or all
entries.

A response (or update) message can be either:

• Solicited: Sent only in answer to a request message. It contains information
about the destination specified in the corresponding request message.
• Unsolicited: sent periodically, every 30 seconds or when there is a change in
the forwarding table.

30
 RIP

A router needs to send the whole contents of its

forwarding table in a response message.

The receiver adds one hop to each cost and changes the
next router field to the address of the sending router.

• If the received route does not exist in the old forwarding table, it should
be added to the route.
• If the cost of the received route is lower than the cost of the old one, the
received route should be selected as the new one.
• If the cost of the received route is higher than the cost of the old one, but
the value of the next router is the same in both routes, the received
route should be selected as the new one.

31
 RIP timers
periodic timer: controls the advertising of regular update
messages. (between 25 and 35 seconds)

Expiration timer: governs the validity of a route. When a

router receives update information for a route, the
expiration timer is set to 180 seconds for that particular
route.

• If expired the route is considered expired and the hop count of

the route is set to 16

Garbage collection timer: used to purge a route from the

forwarding table.

32
Marco A Ortiz N

33
Marco A Ortiz N

34