Routing

Routing Protocol

Routing is a function that router collects, keeps and

presents the information of plural path address on the
network.
To exchange packet, Routing plays a very important role in
IP network to control QoS demands of several medias
such as moving image and music.

Iwao Sasase
Department of Information and
Computer Science, Keio University
http://www.sasase.ics.keio.ac.jp
Email:sasase@ics.keio.ac.jp

Iwao Sasase, Keio University

Iwao Sasase, Keio University

Dynamic Routing

Routing Protocol

Router learns the routing information

automatically.

Routing protocols ate classified into twp types:

Static routing
A method to configure routing information in each router
manually.
AdvantageAble to provide stable arrival of the network
Disadvantage Management cost
Dynamic routing
A method that router learns routing information automatically.
Advantage No management cost, and able to change route in
response to the condition of network.
DisadvantageNetwork may be down by route loop
Iwao Sasase, Keio University

Routing of inter-domain policy

RIP (Routing Information Protocol)
OSPF (Open Shortest Path First)

Routing of intra-domain policy

BGP (Border Gateway Protocol)

Iwao Sasase, Keio University

Unicast Routing Protocol

Example of Routing Table

Basic principle

The addresses whose next hop from router 1 is router 2

Router has routing table

Table includes the information of addressNext hoprouter

When packet arrives

1. Read target IP address in IP header.

2. Search routing table, and redirect a packet to the router near
target IP address

8
1

Typical protocol

RIPRouting Information Protocol

OSPFOpen Shortest Path First

Iwao Sasase, Keio University

12

10

11

The addresses whose next hop from router 1 is router 3

Iwao Sasase, Keio University

Address

Next hop

10

11

12

RIPRouting Information Protocol

Behavior of RIP

Distance vector system

The whole routing information is built by exchanging routing information mutually
one after another between Contiguity router.
Routing table is broadcast by UDP every 30 seconds, and routing information is
exchanged.
Even if 3 minute passes, when routing information does not arrive, it deletes from
routing table.
The evaluation measure used as a distance to an address metric
The number of hop (the intermediate number of nodes)

Connection
speed

T1
T3

Path A
Path B

T1

Advantage
The processing load of router is small and pre-installed by almost all routers.
suitable for the small-scale network.

Path C

Disadvantage
Not suitable for large size network because of size of communication overhead.
Since it is routing selection only by the number of hop, optimal routing selection
cannot be performed.

Iwao Sasase, Keio University

When Routing protocol is RIP ; Path A ( least number of HOPs) is

selected.
Iwao Sasase, Keio University

OSPFOpen Shortest Path First

Behavior of OSPF

Algorithm
1. All router exchange link state information with each other
Metric includes cost of link, network, neighbor routers.
2. From the obtained link state, all routers grasp a network topology and hold this
as a topology database commonly.
3. Each router calculates the tree of the path from itself and creates routing table.
In this tree generation, the SPF (Shortest Path First) algorithm by Dijkstra is
used.
Although the periodical recheck is done every30 minutes, the link states are
sent when network composition is changed. Mitigation of overhead

Advantage

Disadvantage

Since creation of link state information in SPF algorithm is complicated, the

processing load of router is large.

Iwao Sasase, Keio University

Comparison of RIP and OSPF

The grasp range of
routing information

Overhead

Speed

RIP

OSPF

Up to contiguity
router

Network whole

10
A

10

Path B
5

cost
50
25
60

10

10
10

T1
T3
T1

10
Path A

Path C
10

When routing protocol is OSPF; path B (least cost) is selected.

Iwao Sasase, Keio University

10

BGP (Border Gateway Protocol)

Inter-router : large
Intra-router small

Inter-router : small
Intra-router large

(It takes large time to

exchange the whole
routing table in the
whole network.)

(The processing load of link State

information acquisition and SPF algorithm
is large, and a mass memory and highspeed CPU are required for router)

The evaluation
measure of a route
(metric)

Number of HOPs

Use of various metric is possible

Suitable network

Small size

Medium or Large size

Iwao Sasase, Keio University

20

10

10

Since metrics can be used, the optimal routing selection is possible.

11

Path vector type routing protocol to exchange the route

information between AS.
AS (Autonomous System) --- which summarizes route
information in a fixed group such as ISP.
BGP route information includes AS numbers is exchanged,
and optimal route selection is based on this information.
BGP router establishes the session between the adjacent
router, and exchanges all route information immediately
after session establishment.
Advantage Suitable for the large-scale network. A route
loop is detectable.
Disadvantage When a course changes frequently, it is
difficult to deal with the diversification
Iwao Sasase, Keio University

12

Behavior of BGP

Behavior of BGP (loop avoidance)

Send the
information of AS1

AS2

AS1
AS3

Send the information of AS1

AS1

AS2
Send the
information of
AS1,AS2,AS3

Send the information of AS2,AS3,AS4

AS4

AS1 gets the information of

13

Broadcast and a simultaneous notice of an E-mail

Distribution of the stream data to plural terminals.
Push type information distribution of news, What's New,
etc.
The multimedia meeting among remote many persons.
Simultaneous distribution of the program of a new
version, maintenance information, etc.
The information service share in mobile computing
using radio
15

Multicasting by Using Unicast

router
Receiving terminal
Receiving terminal

router
Transmitting
agency

Receiving terminal
router

Iwao Sasase, Keio University

14

Unicast : Communication with a single partner

Broadcast : Communications with many and unspecified
persons (broadcast etc.)
Multicast : Communication with two or more specific partners
Standard

Version of IP

Contents

RFC922

IPv4IPv6

Delivery to one specific terminal

IPv4

Multicast

RFC1112

IPv4IPv6

Delivery to all the terminals in a

network.
Delivery to all the terminals in a
group.

Unicast

RFC1546
RFC2526

IPv6

Delivery to the nearest terminal

in being related.

Delivery system
Unicast
Broadcast

Iwao Sasase, Keio University

16

Unicast and Multicast

Repetition of unicast communication (serial broadcast)

router

Iwao Sasase, Keio University

The communication form in the

Internet

Multicasting Communication

Iwao Sasase, Keio University

AS3

If AS1 gets the information of (AS1AS2,AS3) from

AS3, AS1 discards the route because it contains AS1.

AS2, AS3 and AS4 from AS2.

Iwao Sasase, Keio University

Send the
information of
AS1,AS2

In Multicast, although many receiving terminals receive same

packets, the communication between router-router is done by
only one packet.
Same information is transmitted to plural terminals
When repetition of unicast communications is used, it has a
problem that the amount of communications is increased.
This problem is remarkable when many terminals of
receiving multicast packets are connected to specific
router.
Needs multicast communication

17

Iwao Sasase, Keio University

18

Multicast communication

Multicast Techniques in Internet

Between router-router, it communicates only once.

router

1. IP Multicast

router
Receiving terminal
Receiving terminal

router
Transmitting
agency

Receiving terminal

Realized in the third layer, IP layer.

The elements for routing determination
The transmission performance such as link delay for a
receiving terminal
The amount of the load of a network
The amount of processing in router depending on routing
algorithm

2. Multicasting realized in the 4th layer

router

Compared with repetition of unicast, the amount of

communications is reduced.
Iwao Sasase, Keio University

Realized in the 4th layer, i.e., TCP, or its higher layer.

High reliability can be achieved.
Iwao Sasase, Keio University

19

Tree Generation for Routing Control

RPTReverse Path Tree

Tree

The route for which a packet flows

It branches by each intermediate router and the tree which uses a transmitting
agency as a root is formed.
>> Important : how this tree is formed

>> Shortest path of an opposite direction (reverse path) to a transmitted path is

used.
Problem of scalability

SPTShared Path Tree

>> Regardless of a transmitted path, same path is shared .
Excellent in the scalability

Iwao Sasase, Keio University

21

RPB(Reverse Path Broadcasting)

router

A packet is transmitted on the basis of the shortest route to

the opposite direction from the router named RPF (Reverse
Path Forwarding).
1.
2.

Routing in IP multicast communication

Two tree formation methods
RPTReverse Path Tree

20

RPB (Reverse Path Broadcasting)

RPM (Reverse Path Multicasting)

The basic system of transmission

Flooding
Each router transmits the packet to all interfaces other
than the interface which received the packet.
The basic system of relay
A packet is sent in the direction which always keeps
away from a transmit terminal.
Iwao Sasase, Keio University

22

RPM(Reverse Path Multicasting)

router

router

router
Receiving terminal

Receiving terminal
router

router

Transmitting
terminal

router

Receiving terminal
router

Router
Reception of a packet

>
>

router
Transmitting terminal

router

router

If it receives, it searches for the route to Transmitting terminal.

A packet is sent out in the direction opposite to the route of Transmitting terminal.

Maintenance of routing information

The group unit of the multicasting group address of an address,
and Transmitting terminal

Iwao Sasase, Keio University

Receiving terminal
router

23

A multicasting packet is not transmitted when a subordinate does

not have Receiving terminal.
Increase of transmitting terminal, distribution of receiving terminal
> The increase in the traffic by flooding
> Problem in the scalability
Iwao Sasase, Keio University

24

SPTShared Path Tree

SPTShared Path Tree
Transmitting
terminals 2

CR Core Router
Sets up for every multicasting group address.
A tree is formed in the shortest route from this router to
each Receiving terminal.

Receiving terminal

router

router

router

router
Receiving terminal

Transmitting
terminals 1

Shared Path Tree

Core router

When a multicasting group address is the same, even if a

packet is sent from different terminals, it transmits along
with the same tree.
One distribution tree which all the participating terminals
of a multicasting group share is formed.
Iwao Sasase, Keio University

A tree is formed of the shortest route from core

router to each receiving terminal, and multicasting
is performed according to the tree according to it.

Iwao Sasase, Keio University

RPT
It transmits in the
opposite direction of
transmitting terminal.

A path becomes
the shortest route

Course management is
required for every Transmitting
terminal and group address.
inferior in respect of a
scalability.

SPT
Regardless of
transmitting terminal,
it transmits in the
same course.

Paths are shared.

route
management of a
group address unit.
scalability

A path does not necessarily

become the shortest course.
The determination of the
suitable core router is difficult.

Iwao Sasase, Keio University

26

The protocol of the 4th layer

Comparison of RPT and SPT

Disadvantage

Receiving terminal

Packet once brought together in core router before performing multicasting

The group of the multicasting packet from S1 and S2

25

Advantage

router

IP multicast

UDP (instead of TCP) is used in the 4th layer protocol

Reason
1. The flow control of TCP is not suitable for multicast communication.
The dynamic flow control with window is used. However, in the
case of multicast with two or more addresses, window size for
performing communication efficiently as a whole cannot be set
up.
2. Response (ACK) is flooded with TCP on a network.
Moreover, when a negative response (NACK) is returned, it will
multicast the data again, and communication is inefficient.

27

Iwao Sasase, Keio University

28

The feature of an IP multicast

"Host group" model is used.
A host group is expressed in a group address.
It is delivered by the member of a group if a packet is transmitted
to a group address.
A host can belong to plural groups simultaneously, and it can join
a group or escape from a group freely.
The host who does not belong to a group can also transmit a data
packet to the group.

A packet is delivered by the delivery tree constituted by

the group member.
Important : forming an efficient delivery tree.
Iwao Sasase, Keio University

29