uepL of LLL CS63-CompuLer neLworks

repared by ur.S.Muralldharan 1
1
Routing & forwarding Routing & forwarding Routing & forwarding Routing & forwarding
Not the same thing!
Routing- routing refers to deciding the route of the packet from one
system (a computer) to another system (a computer). It involves
many intermediate routers and routing table knowledge.
Forwarding forwarding is a rather simple process of passing a
packet from one port/interface to another port /interface. It
generally involves one of the routers and routers forwarding table
information
2
How to find the best path from A to F?
How does R1 chooses the best route to R4?
What is routing?
A part of the network software responsible for deciding which output line an
incoming packet should be transmitted on. Tanenbaum
In Internetworking multiple paths exist between two networks. Routing helps
to identifying the path.
3
A
B
C
D
E
F
R1
R2
R3
R4
1. Next-hop routing
To reduce the contents of a routing table
Routing table holds only the information that leads to the next hop instead of
holding information about the complete route
4
uepL of LLL CS63-CompuLer neLworks
repared by ur.S.Muralldharan 2
2. Network-specific routing
To reduce the routing table and simplify the searching process
5
3. Host-specific routing
Inverse of network-specific routing
Destination host address is given in the routing table
Not efficient, but administrator has greater control over routing
6
4. Default routing
Another technique to simplify routing
7
Route method Vs Next Route method Vs Next Route method Vs Next Route method Vs Next- -- -hop method hop method hop method hop method
uepL of LLL CS63-CompuLer neLworks
repared by ur.S.Muralldharan 3
Routing Routing Routing Routing - -- - properties properties properties properties
1. correctness
2. simplicity
3. Robustness
should cope with changes in the topology and traffic that happen
over days
updating possibility to meet the above requirement
4. Stability
must converge to equilibrium
5. fairness
6. optimality
min mean packet delay
max total network throughput
Note: 5 & 6 often contradictory
9
Routing Algorithm Analogy
A person traveling from Madurai to Sivakasi.
If they were using a non-adaptive algorithm, they would make the decision to pass
through Thirumangalam and Virudhunagar before they left Madurai.
If they were using an adaptive algorithm, they would possibly travel to
Thirumangalam first and depending on how busy the routes are, they may travel
to Srivilliputtur instead of Virudhunagar and then onto Sivakasi.
In non-adaptive, the hops or jumps taken is decided before hand.
In adaptive, the next hop is decided at each stage.
10
Critaria used for selection of route
Minimum hop
Least cost
11
Routing algorithms Routing algorithms Routing algorithms Routing algorithms
Grouped into
Non-adaptive algorithm or Static routing
Non-adaptive routing algorithms make routing decisions based
on the network topology.
The routes are chosen in advance, off line and downloaded to
the routers when the network is booted.
Adaptive algorithm
Adaptive algorithms change their routing decisions in line with
changes in network traffic or network topology.
This is sometimes known as dynamic routing.
12
uepL of LLL CS63-CompuLer neLworks
repared by ur.S.Muralldharan 4
Static Routing
A graph of the layout of all routers in the subnet is composed.
Each node on the graph represents a router and each line represents
a communication line or link (cable or radio link etc.).
A distance is associated with each communication link connecting
two routers.
To choose a route between a pair of routers, the routing algorithm
just selects the shortest path between them on the graph.
All shortest paths are calculated in advance.
13
Adaptive Routing
Adaptive algorithms require up to date information about network traffic and network topology at well
defined times so that they can optimize throughput of packets.
These algorithms may differ in:
Where the routers get their information.
This could be locally from all adjacent routers or from all routers in the subnet.
Routing decisions usually based on knowledge of network (not always)
Distributed routing
o Nodes use local knowledge
o May collect info from adjacent nodes
o May collect info from all nodes on a potential route
Central routing
o Collect info from all nodes
Update timing
o When is network info held by nodes updated
o Fixed - never updated
o Adaptive - regular updates
When the routers change the routes.
This may be after a well known number of seconds or if the network traffic increases or if new
LANs are added to the network (change in network topology).
What measure is used for optimizing throughput of packets.
Will it depend on shortest distance between routers, the fastest transmission time or the
number of routers it has to pass through.
14