Ni dung hc phn Mng vin thng (Lp chnh quy 4,5 nm)

Mng vin thng

L thuyt: 36 tit

Gii thiu chung Cc nguyn l xy dng mng Cc mng chuyn mch knh Cc mng chuyn gi Mng IP v Internet Xu hng pht trin mng v dch v vin thng

Tho lun: 8 tit*2 chia nhm (mi nhm t 3-4 sv) Thc hnh 12 tit*2 =4 bui/nhm, chia 4 nhm (di 15sv/nhm) Kim tra trc nghim gia k Thi cui k: Thi vit Gi t hc: ~126 gi

Mng vin thng

Ni dung chng 5

5.1 5.2 5.3 5.4 5.5

Kin trc giao thc TCP/IP nh tuyn trong mng IP Cht lng dch v trong mng IP Bo mt trong mng IP IPv6

Kin trc ca Internet

Phn loi cc giao thc nh tuyn

nh tuyn

Tnh

ng

Gii php cui

DV v LS

Classless v classful

IGB v EGP

V tr giao thc nh tuyn

Application layer
Ping SMTP FTP Telnet NNTP etc...
NFS

RPC

DNS

TFTP BOOTP etc...

Transport layer
OSPF ICMP IGMP BGP

TCP

UDP
RIP

I nternet layer ARP Network Access layer

IP RARP
Data link

Media (physical)

Metric trong giao thc nh tuyn

Internetwork Delay Reliability Bandwidth Load Cost

Hopcount

Routing Metric

nh tuyn theo vc t khong cch v nh tuyn theo trng thi lin kt

K thut nh tuyn vct khong cch (Distance Vector)

Xc nh hng v khong cch ti bt k mt lin kt no trn lin mng Da trn gii thut Bellman-Ford

Gii thut Bellman-Ford

Dng trong k thut nh tuyn vct khong cch (DV)

b

Bng nh tuy n

Bng nh tuy n

Bng nh tuy n

Bng nh tuy n

Gii thut Bellman-Ford

Dng trong k thut nh tuyn vct khong cch (DV)

Lp: Tip dn ti khi khng c thng tin no thay i D b: Nt khng cn phi trao i trong bc kha Phn b: Mi nt truyn thng ch vi hng xm trc tip Mi router duy tr:

Hng cho mi ch kh thi Ct cho mi hng xm trc tip ti nt

Mc trong hng Y v ct Z ca nt X khong cch tt nht t X ti Y qua hop tip theo l Z

Ch : n gin, v d ny ch cho thy khong cch ngn nht ti ch.

Gii thut Bellman-Ford

Dng trong k thut nh tuyn vct khong cch (DV)

Thc hin lp khi:

Gi lin kt ni ht thay i Thng ip t hng xm: thay i ng c gi thnh thp nht t hng xm ti ch

Mi nt thng bo cc hng xm ch khi c ng i gi thnh thp nht ti bt k ch no c thay i Khi hng xm li thng bo ti hng xm ca n nu cn.

Gii thut Bellman-Ford

1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17.

Khi u for all nodes V do if V ni vi A D(A, V)=c(A,V); else D(A,V)= loop: wait (cho ti khi A thy gi thnh lin kt ti hng xm V thay i hoc ti khi A nhn c thng tin cp nht t hng xm V) if (D(A, V) i bng d) for all ch Y qua V do D(A, Y)=D(V,Y)+d else if (cp nht D(V,Y) nhn c t V) /* ng ngn nht t V ti Y thay i */ if (c mt gi tr nh nht ti ch Y) send D(A,Y) ti cc hng xm forever

V d v gii thut Bellman-Ford

V d v gii thut Bellman-Ford

V d v gii thut Bellman-Ford

V d v gii thut Bellman-Ford

V d v gii thut Bellman-Ford

nh tuyn theo trng thi lin kt

K thut nh tuyn trng thi lin kt (Link State)

To li chnh xc tp ca ton b lin mng (hoc t nht mt phn ca lin mng m router ni ti) Da trn gii thut Dijkstra

Gii thut Dijkstra

1. 2. 3. 4. 5. 6. 7.

Khi u S={A}; for all node V if v ni vi A then D(v)=c(A,v); else D(A,v)= ;

8.
9. 10. 11. 12.

Loop

tm w khng trong S sao cho D(w) l nh nht thm w vo S Cp nht D(v) cho tt c cc nt v gn w v khng c trong S: D(v)=min (D(v), D(w)+ c(w,v)); ti khi ton b nt c trong S;

nu gi thnh mi vi v l gi c vi v hoc bit nu gi ng i ngn nht ti w cng vi gi t w ti v

13.

V d: Gii thut Dijkstra

Gii thut Dijkstra

Gii thut Dijkstra

Gii thut Dijkstra

Gii thut Dijkstra

Gii thut Dijkstra

nh tuyn n v a min qun tr

Lin mng c chia thnh nhiu h thng t tr (AS - Autonomous System) trnh c vic mt lin mng ln n mc mt giao thc nh tuyn khng th x l cng vic cp nht cc bng nh tuyn ca tt c cc router H thng t tr l mt nhm cc mng v router chu mt quyn lc qun tr chung. N i khi cn c gi l vng nh tuyn (routing domain).

nh tuyn bn trong mt h thng t tr c gi l nh tuyn trong. nh tuyn gia cc h thng t tr c gi l nh tuyn ngoi.

nh tuyn n v a min qun tr

Mi h thng t tr c th chn mt giao thc nh tuyn trong thc hin nh tuyn bn trong h thng. Tuy nhin, thng ch c mt giao thc nh tuyn ngoi c la chn thc hin gia cc h thng t tr. Hin nay c nhiu giao thc trong v ngoi ang c s dng. Tuy nhin, tiu biu nht v ph bin nht l giao thc nh tuyn trong OSPF v giao thc nh tuyn ngoi BGP

OSPF c th c s dng cp nht cc bng nh tuyn bn trong mt h thng t tr. BGP c th c s dng cp nht cc bng nh tuyn cho cc router ni cc h thng t tr vi nhau.

nh tuyn n v a min qun tr

Giao thc nh tuyn RIP

L mt trong cc giao thc nh tuyn c pht trin u tin (ngay khi TCP/IP ra i). RIP l mt giao thc nh tuyn vect khong cch c s dng bn trong h t tr. Giao thc ny kh n gin, n s dng gii thut Bellman-Ford tnh ton bng nh tuyn.

Giao thc nh tuyn RIP

RIP hot ng da trn 3 nguyn tc

Chia s hiu bit v ton b h t tr Ch chia s vi hng xm Chia s ti cc khong thi gian u n
08 14 23 55 66 78 92 2 1 1 2 3 1 2 E B E F

B
Mng 14
08 14 23 55 66 78 92

14 1 55 1 -

08 14 23 55 66 78 92 3 A 2 A 2 A 3 A 4 A 1 1 -

3 1 2 1 2 2 3

A A C A A

B
14 1 23 1 78 1 -

Mng 55

08 14 23 66 55 78 92

2 2 3 1 1 3 4

D B D B B

Mng 14 Mng 55
78 1 92 1 66 1 55 1 -

Mng 78

C
Mng 92 Mng 66
08 14 23 55 66 78 92 1 3 2 2 1 3 4 E E C E E

Mng 78

F
Mng 92

C
Mng 23
Mng 66
08 14 23 55 66 78 92 1 2 1 3 2 2 3 A A D A A

Mng 23
08 1 23 1 08 1 66 1 -

Mng 08

Mng 08

Giao thc nh tuyn OSPF Hot ng da trn nguyn tc trng thi lin kt Chiu di qung ng tnh theo bng thng Cc b nh tuyn trong mt min nh tuyn trao i thng tin gm trng thi v trng s ca tt c cc lin kt trong min .

Giao thc nh tuyn OSPF

Thng tin nh tuyn ny c mi b nh tuyn tng hp li v xy dng trn c s d liu lin kt. Khi , c th coi mi b nh tuyn nhn bit v topo ton cc. Da vo topo ton cc, kt hp vi thut ton Dijkstra, mi b nh tuyn s xy dng cc thc th trong bng nh tuyn.

Giao thc nh tuyn OSPF

Cn bng ti gia cc tuyn cng cost: Vic s dng nhiu tuyn cho php tn dng c hiu qu ti nguyn mng. Phn chia mng mt cc logic: iu ny lm gim bt cc thng tin pht ra trong nhng iu kin bt li. N cng gip kt hp cc thng bo v nh tuyn, hn ch vic pht i nhng thng tin khng cn thit v mng. H tr nhn thc Thi gian hi t nhanh hn

Giao thc nh tuyn BGP

Border Gateway Protocol: Giao thc nh tuyn bin h tr vic chia s thng tin nh tuyn gia cc h t tr Chc nng ca BGP l trao i thng tin nh tuyn gia cc h t tr v m bo vic la chn mt ng i khng vng lp Ch s dng BGP khi chnh sch nh tuyn khc vi ISP

Hng m nghin cu v nh tuyn trn mng IP

Sensor Network Routing Multicast Routing Routing in Adhoc Networks Detail in RIP and OSPF MPLS routing IPv6 routing BGP: Border Gateway Protocol