11

NH TUYEN (ROUTING)
Cuc not chon much trong mung chon much go co nhm o nhun
cuc go d t ngoon chon dn trum dch
Kh cuc go d o d uo not chon much, chong doc km tru bo
Cl| cou not tdu ch dch o mung cou go). Du uo do go s du dn
hung do cou ngo ru thch ho. Chc nung nu doc go u dnh ton
trootng)
Vc dnh ton tu mo not s gu
ru tho gun tr
q 1r do x hung trong Cl| u
hung do n kt ru
q 1r do tho gun x cou Cl|
q 1r do tho gun tron go
Hnh: Not chon much
Lo s khuc nhuo gu chon
much go u chon much much
21
User Plane
Control Plane
Output
Packets
Input
Packets
Header payload
Forwarding
Table
Packet
Classification
Next Hop + Port
Queuing and
Schedule rules
Output
Queue
Routing
Packets
(ROUTI NG)
31
n nh t uy n
n Nh n gi d li u t ngu n v phn ph i n ch
n Nt chuy n m ch
n Th c hi n vi c chuy n m ch
n nh t uy n
n nh t uy n khng b ng:
n Ng u nhin
n Ngu n
n Tnh t on
n nh t uy n t heo b ng
41
nh t uy n t heo b ng
n Xc nh con ng n ch t i
n Khi t nh t on t i , c t h xem xt n:
n T ng t h i gian t ruy n
n Th i gian x l v x p hng t i m i nt
n M c t in c a m i gi
n Ho ch nh c a admin
n Th t c nh t uy n
n Tnh ch t :
n T nh & ng
n T p t rung & phn b
n Th t c t p t rung: Short est Forward Pat h Tree (SFPT),
Short est Backward Pat h Tree (SBPT)
n Th t c phn b : Th t c t rao i kho ng cch,
51
n Gi i t hi u t hu t t on SPF :
n X n nh t t 1 ngu n
t i t t c cc nt t rn m ng
n V t r t rung t m c n ph i t h c hi n vi c t nh
t on ny m t l n cho m x nh
ng ng n nh t t i m i node cn l i
THU T TON SFPT
(SHORT FORWARD PATH FI RST)
61
n M t t hu t t on SPF:
n Trong cy Short est Pat h First (SPF), D nh ngh a
ra ba lo i nhnh : I , I I v I I I . V t rong rout er, s c ba
i di n cho t p ba lo i nh , g m c :
n Tree dat abase : : i di n cho nhnh lo i I . Nh ng link
(nhnh) n c t hm vo cy SPF s c t hm v .
Khi t hu t t on SPF hon t t , t h dat abase ny chnh l t on
b cy SPF.
n Candidat e dat abase : dat abase n i di n cho nhnh lo i
I I . C c copy t link st at e dat abase sang dat abase
ny t heo m t t r t t nh nh. Cc link t rong dat abase ny
s l c kh o s t hm vo cy SPF.
n Link st at e dat abase : ch a t t c cc link. i di n cho lo i
nhnh I I I .
n Ngoi ra Dij kst ra c nh ngh a ra hai lo i node, A v B.
Lo i A, bao g m t t c cc rout er n i v i cc link t rong cy
SPF. Lo i B, g m t t c cc rout er khc. Khi t hu t t on SPF
k t t hc t h cc rout er lo i B s khng cn.
THU T TON SFPT
(SHORT FORWARD PATH FI RST)
71
Thu t t on SPF c :
n c 1 : Ch n m t rout er lm g c.
n c 2 : t t c cc link n i gi a rout er g c v i neighbor c a n
s o candidat e dat abase.
n c 3 : cost c a m i link t rong candidat e dat abase s c
t nh t on. Link no c cost nh nh t s c t hm vo Tree
dat abase. N hai link c cost nh nh t b ng nhau t h
s ch n m t .
n c 4 : rout er nighbor n i v s c ki m t ra.
T t c c ng link n i v s o
candidat e dat abase, ngoi t r c t rong Tree
dat abase.
n c 5 : N u v n cn gi t r t rong candidat e dat abase t h t hu t
t on s quay l c 3 t h c hi n t i p. N u khng cn, t h d ng
t hu t t on.
THU T TON SFPT
(SHORT FORWARD PATH FI RST)
81
Gi i t hu t :
N= { s} (v i s l nt ngu n )
For all node v# s
Begin
esv: = Csv
I f esv< t hen Lsv: = (s,v)
End
Do while (N khng ch a t t c cc node)
Find w# N for which esw= minesv
N= N{ w} (N h p v i w, t c b sung t hm w vo N)
For all vN
Begin
Temp: = esv
esv: = min(esv,esw + ewv)
if esv< t emp t hen
L: = Lsw{ v}
End
End
THU T TON SFPT
(SHORT FORWARD PATH FI RST)
91
n V d t hu t t on : T n nh t t A h n t t c cc
nt v t cc n n A
THU T TON SFPT
(SHORT FORWARD PATH FI RST)
101
A B
C D
E
3 2
2
11
7
5
6 1
6
7
4
10
111
K t qu n nh t t A d n cc nt cn l i
THU T TON SFPT
(SHORT FORWARD PATH FI RST)
121
SFPT (SHORT FORWARD PATH FIRST)
Hnh: So do mung
Hnh: 1nh toun Sll1 but duo t not ngoon A
l
XY
dong d t X dn Y
C
XY
ch h t X dn Y
131
SFPT (SHORT FORWARD PATH FIRST)
Hnh: 1nh toun Sll1 but duo t not ngoon A
Hnh: Cuc dong
ngun nhut t not A