Chapter 4
Chapter 4
73
With a hop-based routing strategy, R1 will choose the path
through the router R4 since it will result in two hops until the
packet reaches the destination.
On the other hand, if router R1 selected router R2, it would
result in three hops until the packet reaches its destination,
which is not the best option in such a scenario.
A problem related to distance vector-based routing is that
updating routing tables is a slow process.
So, bad news typically takes a long time to reach some routers,
and the convergence time (time to a router producing an
updated routing table) is long. Furthermore, there are loop-
sensitive protocols.
74
The most popular distance vector-based routing protocol is
the Routing Information Protocol (RIP).
In summary, it defines a periodic update time for a router
to update its table, broadcasting (V1) or multicasting (V2)
the updated to its neighbors.
The RIP protocol defines a series of timers to control a
router’s lifecycle: update, invalidation, hold down, and
flush.
These timer helps the routers to keep their tables valid and
with recent information.
75
Link state routing protocols have a broad perspective of the network instead of
working with the state of the neighbors’ routers, like distance vector routing
protocols. To keep track of the state of the entire network, the routers using link
state-based protocols have three tables:
Route Table: sometimes called Forwarding Database, the routing table defines the
network traffic forwarding rules of a given router
Topology Map: also called Link State Database, this table holds topological
information about the working network
Neighbors Table: sometimes referred to as Adjacency Database, it keeps data and
routing details about directly connected neighbors of a given router.
76
For building these tables, we can summarize the operation
of link state-based routers in four simple steps:
Discover the neighbor routers by sending and receiving hello
messages. It will enable a particular router to build its neighbor
table
Measure the costs to communicate with an adjacent router, thus
flooding the information to the network domain; routers repeat
such a process (fully or partially) every time the network changes,
flooding update messages
Receive route updates from other routers. So, the routers can build
and maintain the topology map of the network
Build a logical tree with the current router as the root. Thus, the
router can execute shortest-path first algorithms (typically
Dijkstra) to allocate the paths with the lowest cost for all the
possible destinations in its routing table
77
Link state-based routers can employ different metrics to
determine the shortest path to a destination.
For example, they can adopt bandwidth, delay, or jitter as the
optimization criteria.
Let’s consider the same example of the previous section, where
there is a packet in router R1 that must reach server S.
However, now we have the information about the transmission
delay between the connected entities:
78
With a minimum delay-based routing strategy and knowing the state of the
entire network, R1 will choose to send the network traffic to R2, which in turn
will send it to R3, then to R5, and finally reach the destination.
The described path results in a total delay of 150ms. The alternative path,
from R1 to R4 and then R5, results in a total delay of 240ms, making it a worse
option.
The major problem with link state-based routing protocols is that it generates
heavy control traffic due to the routers flooding updates in the network.
Furthermore, these flooding events can create transmission loopings, which
make the overloading problem even worse. However, we can mitigate these 79
looping problems by properly configuring the packets’ Time To Live (TTL)
The most known link state-based protocols are called Open Shortest Path First
(OSPF) and Intermediate System to Intermediate System (IS-IS).
Both protocols implement the basics of link state-based routing, as previously
described in this section.
Moreover, they have other relevant similarities, such as being interior gateway
protocols (exchange data between gateways of a single autonomous system, such
as between local networks of a corporation), providing authentication methods,
and supporting an unlimited number of hops count to route a packet.
However, these protocols also present some differences. Examples are that OSPF
runs on the network layer and IS-IS runs on the data link layer; OSPF supports
working with virtual links and IS-IS does not; and OSPF identifies routers
through the Router ID while IS-IS uses a System ID.
80
Unicasting, Multicasting and Broadcasting
IPv6 supports three address types:
Unicast: Provides one-to-one transmission service to
individual interfaces, including server farms sharing a single
address. IPv6 supports several types of unicast addresses,
including global, link-local, and unique local.
Multicast: Provides one-to-many transmission service to
groups of interfaces identified by a single multicast address.
Anycast: Provides one-to-one-of-many transmission service to
groups of interfaces, only the nearest of which (measured by
the number of intermediate routers) receives the
transmission.
IPv6 ADDRESSES
Despite all short-term solutions, address
depletion is still a long-term problem for the
Internet. This and other problems in the IP
protocol itself have been the motivation for IPv6.
An IPv6 address is 128 bits or 32 hexadecimal
digits long
Abbreviated IPv6 addresses
THANKS
!!!