Transcript Computer Networks

Computer Networks
Routing
Adrian Sergiu DARABANT
Lecture 9
Routing
Routing protocol
5
Goal: determine “good” path
(sequence of routers) thru
network from source to dest.
Graph abstraction for
routing algorithms:
graph nodes are routers
graph edges are
physical links

link cost: delay, $ cost,
or congestion level
2
A
B
2
1
D
3
C
3
1
5
F
1
E
2
“good” path:


typically means
minimum cost path
other def’s possible
Routing Algorithm classification
Global or decentralized
information?
Static or dynamic?
Global:
all routers have complete
topology, link cost info
“link state” algorithms
Decentralized:
router knows physicallyconnected neighbors, link
costs to neighbors
iterative process of
computation, exchange of
info with neighbors
“distance vector” algorithms
Static:
routes change
slowly over time
Dynamic:
routes change more
quickly
 periodic update
 in response to link
cost changes
Routing tables - Campus
Destination
Gateway
Genmask
Flags
Metric
Iface
193.226.40.128 *
255.255.255.224
U
0 eth1
192.168.1.0
172.30.5.19
255.255.255.0
UG
0 eth1
192.168.0.0
172.30.1.4
255.255.255.0
UG
0 eth1
193.231.20.0
*
255.255.255.0
U
0 eth0
172.30.0.0
*
255.255.0.0
U
0 eth1
169.254.0.0
*
255.255.0.0
U
0 eth1
127.0.0.0
*
255.0.0.0
U
0 lo
default
193.231.20.9 0.0.0.0
UG
0 eth0
Routing tables (static)
Destination
Gateway
Genmask
Flags
Metric
Ref
Us
e
Iface
172.16.25.1
172.30.0.4
255.255.255.255
UGH
0
0
0
Eth1
193.226.40.128
0.0.0.0
255.255.255.224
U
0
0
Eth0
193.0.225.0
0.0.0.0
255.255.255.0
U
0
0
Eth0
193.231.20.0
0.0.0.0
255.255.255.0
U
0
0
Eth0
172.30.0.0
0.0.0.0
255.255.0.0
U
0
0
Eth1
169.254.0.0
0.0.0.0
255.255.0.0
U
0
0
Eth1
0.0.0.0
193.0.225.9
0.0.0.0
UG
0
0
Eth0
The route command – (Windows/Linux/other OS)
A Link-State Routing Algorithm
Dijkstra’s algorithm
net topology, link costs
known to all nodes
 accomplished via “link
state broadcast”
 all nodes have same info
computes least cost paths
from one node (‘source”) to
all other nodes
 gives routing table for
that node
iterative: after k iterations,
know least cost path to k
dest.’s
Notation:
c(i,j): link cost from
node i to j. cost infinite
if not direct neighbors
D(v): current value of
cost of path from
source to dest. V
p(v): predecessor node
along path from source
to v, that is next v
N: set of nodes whose
least cost path
definitively known
Dijsktra’s Algorithm
1 Initialization:
2 N = {A}
3 for all nodes v
4
if v adjacent to A
5
then D(v) = c(A,v)
6
else D(v) = infinity
7
8 Loop
9 find w not in N such that D(w) is a minimum
10 add w to N
11 update D(v) for all v adjacent to w and not in N:
12
D(v) = min( D(v), D(w) + c(w,v) )
13 /* new cost to v is either old cost to v or known
14 shortest path cost to w plus cost from w to v */
15 until all nodes in N
Dijkstra’s algorithm: example
Step
0
1
2
3
4
5
start N
A
AD
ADE
ADEB
ADEBC
ADEBCF
D(B),p(B) D(C),p(C) D(D),p(D) D(E),p(E) D(F),p(F)
2,A
1,A
5,A
infinity
infinity
2,A
4,D
2,D
infinity
2,A
3,E
4,E
3,E
4,E
4,E
5
2
A
B
2
1
D
3
C
3
1
5
F
1
E
2
Dijkstra’s algorithm, discussion
Algorithm complexity: n nodes
each iteration: need to check all nodes, w, not in N
n*(n+1)/2 comparisons: O(n**2)
more efficient implementations possible: O(nlogn)
Oscillations possible:
e.g., link cost = amount of carried traffic
D
1
1
0
A
0 0
C
e
1+e
e
initially
B
1
2+e
A
0
D 1+e 1 B
0
0
C
… recompute
routing
0
D
1
A
0 0
C
2+e
B
1+e
… recompute
2+e
A
0
D 1+e 1 B
e
0
C
… recompute
Distance Vector Routing Algorithm
iterative:
continues until no nodes
exchange info.
self-terminating: no
“signal” to stop
Distance Table data
structure
each node has its own
row for each possible
destination
column for each directlyattached neighbor to node
example: in node X, for dest.
Y via neighbor Z:
asynchronous:
nodes need not
exchange info/iterate in
lock step!
distributed:
each node
communicates only with
directly-attached
neighbors
X
D (Y,Z)
distance from X to
= Y, via Z as next hop
Z
= c(X,Z) + minw{D (Y,w)}
Distance Table: example
7
A
B
1
E
cost to destination via
D ()
A
B
D
A
1
14
5
B
7
8
5
C
6
9
4
D
4
11
2
2
8
1
C
E
2
D
E
D
D (C,D) = c(E,D) + minw {D (C,w)}
= 2+2 = 4
E
D
c(E,D)
+
min
{D
(A,w)}
D (A,D) =
w
= 2+3 = 5 loop!
E
B
D (A,B) = c(E,B) + minw{D (A,w)}
= 8+6 = 14
loop!
Distance table gives routing table
A
Next
Hop
Dist
B
Next
Hop
Dist
C
Next
Hop
Dist
D
Next
Hop
Dist
E
Next
Hop
Dist
B
-
7
A
-
7
A
-
∞
A
-
∞
A
-
1
C
-
∞
C
-
1
B
-
1
B
-
∞
B
-
8
D
-
∞
D
-
∞
D
-
2
C
-
2
C
-
∞
E
-
1
E
-
8
E
-
∞
E
-
2
D
-
2
A
Next
Hop
Dist
B
Next
Hop
Dist
C
Next
Hop
Dist
D
Next
Hop
Dist
E
Next
Hop
Dist
B
-
7
A
-
7
A
B
8
A
E
3
A
-
1
C
B
8
C
-
1
B
-
1
B
C
3
B
-
8
D
E
3
D
C
3
D
-
2
C
-
2
C
D
4
E
-
1
E
-
8
E
D
4
E
-
2
D
-
2
Distance table
Routing table
A
Distance Vector routing
Next
Hop
Dist
B
Next
Hop
Dist
C
Next
Hop
Dist
D
Next
Hop
Dist
E
Next
Hop
Dist
B
-
7
A
-
7
A
D
5
A
E
3
A
-
1
C
E
5
C
-
1
B
-
1
B
C
3
B
D
5
D
E
3
D
C
3
D
-
2
C
-
2
C
D
4
E
-
1
E
C
5
E
D
4
E
-
2
D
-
2
A
Next
Hop
Dist
B
Next
Hop
Dist
C
Next
Hop
Dist
D
Next
Hop
Dist
E
Next
Hop
Dist
B
E
6
A
C
6
A
D
5
A
E
3
A
-
1
C
E
5
C
-
1
B
-
1
B
C
3
B
D
5
D
E
3
D
C
3
D
-
2
C
-
2
C
D
4
E
-
1
E
C
5
E
D
4
E
-
2
D
-
2
A
7
1
B
1
2
8
E
C
2
D
Distance Vector
7
A
1
1
B
2
8
E
C
2
D
A
Next
Hop
Dist
B
Next
Hop
Dist
C
Next
Hop
Dist
D
Next
Hop
Dist
E
Next
Hop
Dist
B
E
6
A
C
6
A
D
5
A
E
3
A
-
1
C
E
5
C
-
1
B
-
1
B
C
3
B
D
5
D
E
3
D
C
3
D
-
2
C
-
2
C
D
4
E
-
1
E
C
5
E
D
4
E
-
2
D
-
2
Distance Vector Routing: overview
Iterative, asynchronous:
each local iteration caused
by:
local link cost change
message from neighbor: its
least cost path change from
neighbor
Distributed:
each node notifies neighbors
only when its least cost path
to any destination changes

neighbors then notify their
neighbors if necessary
Each node:
wait for (change in local link
cost of msg from neighbor)
recompute distance table
if least cost path to any dest
has changed, notify
neighbors
Distance Vector Algorithm:
At all nodes, X:
1 Initialization:
2 for all adjacent nodes v:
3
D X(*,v) = infinity
/* the * operator means "for all rows" */
X
4
D (v,v) = c(X,v)
5 for all destinations, y
X
6
send min D (y,w) to each neighbor /* w over all X's neighbors */
w
Distance Vector Algorithm (cont.):
8 loop
9 wait (until I see a link cost change to neighbor V
10
or until I receive update from neighbor V)
11
12 if (c(X,V) changes by d)
13 /* change cost to all dest's via neighbor v by d */
14 /* note: d could be positive or negative */
15 for all destinations y: D X(y,V) = D X(y,V) + d
16
17 else if (update received from V wrt destination Y)
18 /* shortest path from V to some Y has changed */
19 /* V has sent a new value for its min w DV(Y,w) */
20 /* call this received new value is "newval" */
21 for the single destination y: D X(Y,V) = c(X,V) + newval
22
23 if we have a new minw DX(Y,w)for any destination Y
24
send new value of min w D X(Y,w) to all neighbors
25
26 forever
Distance Vector Algorithm: example
X
2
Y
7
1
Z
Distance Vector Algorithm: example
X
2
Y
7
1
Z
Z
X
D (Y,Z) = c(X,Z) + minw{D (Y,w)}
= 7+1 = 8
Y
X
D (Z,Y) = c(X,Y) + minw {D (Z,w)}
= 2+1 = 3
Distance Vector: link cost changes
Link cost changes:
node detects local link cost change
updates distance table (line 15)
if cost change in least cost path, notify
neighbors (lines 23,24)
“good
news
travels
fast”
1
X
4
Y
50
1
Z
algorithm
terminates
Distance Vector: link cost changes
Link cost changes:
good news travels fast
bad news travels slow “count to infinity”
problem!
60
X
4
Y
50
1
Z
algorithm
continues
on!
Distance Vector: poisoned reverse
If Z routes through Y to get to
X:
Z tells Y its (Z’s) distance to X is
infinite (so Y won’t route to X via
Z)
will this completely solve count to
infinity problem?
60
X
4
Y
50
1
Z
algorithm
terminates
Comparison of LS and DV algorithms
Message complexity
LS: with n nodes, E links,
O(nE) msgs sent each
DV: exchange between
neighbors only
 convergence time varies
Speed of Convergence
LS: O(n2) algorithm requires
O(nE) msgs
 may have oscillations
DV: convergence time varies
 may be routing loops
 count-to-infinity problem
Robustness: what happens
if router malfunctions?
LS:


node can advertise
incorrect link cost
each node computes only
its own table
DV:


DV node can advertise
incorrect path cost
each node’s table used by
others
 error propagate thru
network
What is mobility?
spectrum of mobility, from the network
perspective:
no mobility
mobile user, using
same access point
high mobility
mobile user,
connecting/
disconnecting
from network
using DHCP.
mobile user, passing
through multiple
access point while
maintaining ongoing
connections (like cell
phone)
Mobility: Vocabulary
home network: permanent
“home” of mobile
(e.g., 128.119.40/24)
Permanent address:
address in home
network, can always be
used to reach mobile
e.g., 128.119.40.186
home agent: entity that will
perform mobility functions on
behalf of mobile, when mobile
is remote
wide area
network
correspondent
Mobility: more vocabulary
Permanent address: remains
constant (e.g., 128.119.40.186)
visited network: network
in which mobile currently
resides (e.g., 79.129.13/24)
Care-of-address: address
in visited network.
(e.g., 79.129.13.2)
wide area
network
correspondent: wants
to communicate with
mobile
home agent: entity in
visited network that
performs mobility
functions on behalf
of mobile.
How do you contact a mobile friend:
Consider friend frequently changing
addresses, how do you find her?
search all phone books?
call her parents?
expect her to let you
know where he/she is?
I wonder where
Alice moved to?
Mobility: approaches
Let routing handle it: routers advertise permanent
address of mobile-nodes-in-residence via usual routing
table exchange.
 routing tables indicate where each mobile located
 no changes to end-systems
Let end-systems handle it:
 indirect routing: communication from correspondent

to mobile goes through home agent, then forwarded
to remote
direct routing: correspondent gets foreign address of
mobile, sends directly to mobile
Mobility: approaches
Let routing handle it: routers advertise permanent
not
address of mobile-nodes-in-residence
via usual routing
scalable
table exchange.
to millions of
 routing tables indicate
where each mobile located
mobiles
 no changes to end-systems
let end-systems handle it:
 indirect routing: communication from correspondent

to mobile goes through home agent, then forwarded
to remote
direct routing: correspondent gets foreign address of
mobile, sends directly to mobile
Mobility: registration
home network
2
visited network
1
wide area
network
foreign agent contacts home
agent home: “this mobile is
resident in my network”
mobile contacts
foreign agent on
entering visited
network
End result:
Foreign agent knows about mobile
Home agent knows location of mobile
Mobility via Indirect Routing
foreign agent
receives packets,
forwards to mobile
home agent intercepts
packets, forwards to
foreign agent
home
network
visited
network
3
wide area
network
correspondent
addresses packets
using home address
of mobile
1
2
4
mobile replies
directly to
correspondent
Indirect Routing: comments
Mobile uses two addresses:
 permanent address: used by correspondent (hence
mobile location is transparent to correspondent)
 care-of-address: used by home agent to forward
datagrams to mobile
foreign agent functions may be done by mobile itself
triangle routing: correspondent-home-network-mobile
 inefficient when
correspondent, mobile
are in same network
Forwarding datagrams to remote
mobile
foreign-agent-to-mobile packet
packet sent by home agent to foreign
agent: a packet within a packet
dest: 79.129.13.2
dest: 128.119.40.186
dest: 128.119.40.186
Permanent address:
128.119.40.186
dest: 128.119.40.186
packet sent by
correspondent
Care-of address:
79.129.13.2
Indirect Routing: moving between
networks
suppose mobile user moves to another network




registers with new foreign agent
new foreign agent registers with home agent
home agent update care-of-address for mobile
packets continue to be forwarded to mobile (but
with new care-of-address)
Mobility, changing foreign networks
transparent: on going connections can be
maintained!
Mobility via Direct Routing
correspondent forwards
to foreign agent
foreign agent
receives packets,
forwards to mobile
home
network
4
wide area
network
2
correspondent
requests, receives
foreign address of
mobile
visited
network
1
3
4
mobile replies
directly to
correspondent
Mobility via Direct Routing: comments
overcome triangle routing problem
non-transparent to correspondent:
correspondent must get care-of-address
from home agent

What happens if mobile changes networks?
Mobile IP
RFC 3220
has many features we’ve seen:

home agents, foreign agents, foreign-agent
registration, care-of-addresses, encapsulation
(packet-within-a-packet)
three components to standard:



agent discovery
registration with home agent
indirect routing of datagrams
Mobile IP: agent discovery
agent advertisement: foreign/home agents
advertise service by broadcasting ICMP
16
0
8= 9)
24
messages (typefield
type = 9
H,F bits: home
and/or foreign agent
R bit: registration
required
checksum
=9
code = 0
=9
standard
ICMP fields
router address
type = 16
length
registration lifetime
sequence #
RBHFMGV
bits
reserved
0 or more care-ofaddresses
mobility agent
advertisement
extension
Mobile IP: registration
example
home agent
HA: 128.119.40.7
foreign agent
COA: 79.129.13.2
visited network: 79.129.13/24
ICMP agent adv.
COA: 79.129.13.2
….
registration req.
COA: 79.129.13.2
HA: 128.119.40.7
MA: 128.119.40.186
Lifetime: 9999
identification: 714
encapsulation format
….
registration req.
COA: 79.129.13.2
HA: 128.119.40.7
MA: 128.119.40.186
Lifetime: 9999
identification:714
….
registration reply
time
HA: 128.119.40.7
MA: 128.119.40.186
Lifetime: 4999
Identification: 714
encapsulation format
….
registration reply
HA: 128.119.40.7
MA: 128.119.40.186
Lifetime: 4999
Identification: 714
….
Mobile agent
MA: 128.119.40.186