CC THUT TAN NH TUYN TRN MPLS Trn Cng Hng (Khoa Cng Ngh Thng Tin 2, Hc Vin Cng

Ngh Bu Chnh Vin Thng c s

TP H Ch Minh) E-mail: conghung@ptithcm.edu.vn

Nguyn Hong Thanh (Khoa Cng Ngh Thng Tin 2, Hc Vin Cng Ngh Bu Chnh Vin Thng
c s TP H Ch Minh) E-mail: thanhnh@ptithcm.edu.vn

Nguyn c Thng (Khoa Cng Ngh Thng Tin 2, Hc Vin Cng Ngh Bu Chnh Vin Thng c
s TP H Ch Minh) E-mail: duc_thang@ptithcm.edu.vn

Tm tt:
Trong bi bo ny, chng ti s khi qut v phn loi cc thut ton nh tuyn nng cao ang c nghin cu, cc thut ton ny s dng cc u im ca mng MPLS m rng cc thut ton nh tuyn, h tr QoS v thit k lu lng.Chng ti cng kho st mt vi d n hin ti ang nghin cu v lm vic vi cc thut ton nh tuyn nng cao.Bi bo ny gm 5 phn. Phn 1 Gii thiu. Phn 2 Thut ton nh tuyn da trn QoS: Phn loi cc thut ton da trn QoS, Phn 3 Thut ton nh tyn da trn lu lng: Da trn cc thng tin ca mng hin ti nh: Thut ton nh tuyn vi im giao ti thiu MIRA (Minimum Interference Routing Algorithm) [7], Thut ton nh tuyn ng trc tuyn DORA(Dynamic On line Routing Algorithm) [9] v da vo thng tin m t nh: Thut ton nh tuyn da vo thng tin m t PBR (Profile Based Routing)[8]. Phn 4 Trin khai cc thut ton nh tuyn nng cao.V phn cui, M phng vi s kt hp ca cc gi cn thit, chng ti xy dng mt mi trng m phng cho MPLS da trn ns2, ci t mt vi thut ton nh tuyn nng cao, v nh gi chng vi cc giao thc nh tuyn c.

1.

Gii thiu

T yu cu ca mng thc, phi c mt giao thc mi, l s kt hp ca giao thc IP v cc giao thc trn cc mng bng rng nh Frame Relay, ATM giao thc ny khng c thay i ton b kin trc IP ca mng v cng khng lm gim tc ca mng bng rng. Giao thc MPLS c nghin cu v pht trin. Giao thc MPLS c hin thc bng vic ng gi cc tiu nh v gi IP trong min MPLS, do chng ta khng phi thay i nhiu. Mi tiu c mt nhn, MPLS c th s dng nhn , dng k thut chuyn mch gim bt thi gian tr ca gi trn mi router v vn gi

c tc ca mng bng rng. Chng ti s gii thiu ngn gn v MPLS. [1][2][3] Trong MPLS, cc gi c ng tiu MPLS ti u vo. Mi tiu c 4 bytes, v phn quan trng l phn nhn dng chuyn mch cc gi vo cc ng Chuyn Mch Nhn LSP (Label Switched Path) ti mi nt. Cc LSP mang cc dng tp trung bao gm dng cc gi c cng c im nh l cng a ch ngun-ch, a ch ch trng vi tin t IP xc nh hoc l c cng cng TCP Tp hp cc gi c gi l FEC, v mt FEC s c lin kt vi mt LSP chuyn i cc gi. Nhn ca LSP t im vo n im ra ca min MPLS c bao bi cc giao thc bo hiu nh l RSVP-TE hoc CR-LDP. Khi mng MPLS pht trin, rt nhiu vn nh tuyn xut hin. Vn v QoS l vic chn ra cc tuyn ng p ng cc yu cu v bng thng, tr, t l mt gi Vn v thit k lu lng l vic ti u v s dng hiu qu ti nguyn mng bng cch iu khin dng lu lng. Yu cu cho vic pht trin cc thut ton nh tuyn cao cp l phi m bo nhiu yu cu LSP cho nh tuyn ng trong MPLS (thut ton nh tuyn ca giao thc IP m bo gii php ti u ti thi im hin ti nhng khng m bo v kh nng tc nghn trong tng lai, do d rt nhiu yu cu LSP trong tng lai khng th c m bo). Nh qun tr mng thng tnh ton gii php ti u cho vn trn v cu hnh tnh trn router MPLS. Nhng gii php ny khng hiu qu vi cc mng ln v gii php ng. Vi nhng l do trn, cc thut ton nh tuyn nng cao c nghin cu, pht trin v trin khai trn mng MPLS. Hn na, MPLS c cc c im cn thit h tr cho cc thut ton nh tuyn nng cao. Cc LSPs c th c ci t mt cch c lp vi cc thut ton nh tuyn c (thut ton IP) do LSPs c nh tuyn bi cc nhn. Do , chng ta c th thit k

LSPs vi cc thut ton nh tuyn nng cao m rng cc chc nng nh tuyn. Giao thc nh tuyn nng cao yu cu phi c giao thc qung b mi. qung b khng ch thng tin v metric, s hop, tr (s dng bi cc giao thc nh tuyn c nh l OSPF, IS-IS) nhng cng bao gm cc thng tin v ti nguyn cn li ca mng. Thit k lu lng l im mnh ca MPLS v MPLS hon ton h tr cc thng tin trn vi giao thc nh tuyn m rng nh l OSPF-TE, IS-IS-TE bi v MPLS cn chng cho vic xy dng C S D Liu K Thut Lu Lng TED (Traffic Engineering Database). C rt nhiu thut ton nh tuyn cao cp trn MPLS ang c nghin cu. Chng ta phn loi cc thut ton nh tuyn ra 2 loi. Mt loi h tr cc thut ton nh tuyn rng buc v dch v QoS, chng ta gi l thut ton nh tuyn da trn QoS. Loi khc h tr tm gii php p ng cho nhiu yu cu LSP v lm gim kh nng tc nghn trong tng lai, c gi l nh tuyn da trn lu lng. Trong phn 2, chng ta nghin cu v Thut ton nh tuyn da trn QoS, phn 3 da trn K thut lu lng, phn 4 v cc m hnh v d n hin ti v phn 5 v m phng .

Phn loi cc thut ton QoS: Vi mt vi metric, metric ca tuyn ng b nh hng bi cc lin kt vi metric ti thiu (bng thng, khng gian b m). Chng ta gi l cc lin kt nghn c chai. Chng ta c thut ton nh tuyn ti u lin kt (link optimize )(tm mt tuyn ng ti u ti lin kt b nghn c chai) v nh tuyn rng buc lin kt (link constrained ) (tm tuyn ng tt nht m lin kt b nghn c chai tha mn mt vi rng buc metric) Vi mt vi metric, metric ca truyn ng l s kt hp ca metric ca tt c lin kt dc theo tuyn ng . Chng ta c nh tuyn ti u tuyn ng (path optimize routing) (tm tuyn ng vi metric tuyn ng ti u) v nh tuyn rng buc tuyn ng (path constrained routing) (tm tuyn ng tha mn mt vi rng buc metric) Thut ton nh tuyn c th gii c vi thi gian a thc nh tuyn rng buc lin kt, ti u tuyn ng (Link-constrained, path-optimization routing) nh tuyn ti u lin kt, rng buc lin kt (Link-constrained, link-optimization routing) nh tuyn rng buc nhiu lin kt (Multilink-constrained routing) nh tuyn rng buc lin kt, rng buc tuyn ng (Link-constrained, path-constrained routing) nh tuyn rng buc tuyn ng, ti u lin kt (Path-constrained, link-optimization routing) Vi cc bi ton trn, u tin chng ta phi gii bi ton rng buc lin kt hoc ti u lin kt, chng ta s c mt tp gii hn cc kt qu ph thuc vo s lin kt, v sau chng ta gii bi ton rng buc tuyn ng hoc ti u tuyn ng. Thut ton nh tuyn khng th gii c vi thi gian a thc (Vn NP_No Polynomial) nh tuyn rng buc tuyn ng, ti u tuyn ng (PCPO_ Path Constrained, Path Optimize) nh tuyn rng buc nhiu tuyn ng (MPC_ Multi-Path-Constrained): Nu tt c cc metric u ph thuc vo mt metric chung, chng ta c th chuyn bi ton MPC v bi ton tuyn ng ngn nht vi thi gian a thc. tm c gii php cho nhng vn trn, chng ta phi duyt tt c cc tuyn ng t ngun ti ch, nhng thi gian duyt ht tt c cc tuyn ng l mt hm m ca s nh, do n l bi ton NP kh. Chng ta ch c th tm ra gii php gn vi gii php ti u bng cch s dng cc thut ton tm kim tr tu nhn to vi heuristic lm gin khng gian tm kim. V d: vi bi ton nh tuyn rng buc nhiu tuyn ng, chng ta c th chn heuristic l metric l mt hm kt hp ca mi

2.

nh tuyn da trn QoS

Ngy nay, Internet h tr ch dch v kt qutt nht, nhng khng c c ch m bo cho vic mt gi, bng thng, tr, jitter trong khi cc dch v c nh l FTP, mail lm vic tt vi nn tng Internet c, th cc dch v hin ti nh l in thoi Internet, Video trc tuyn yu cu bng thng cao, tr thp v jitter nh. [4] QoS l mt tp cc yu cu v dch v cho mng khi truyn ti d liu. Ni cch khc, QoS l mc yu cu v dch v ca ngi dng, c c trng bi t l mt gi, bng thng, tr u cui. QoS l tha thun gia ngi dng v nh cung cp mng bi Tha Thun V Mc Dch V SLA(Service Level Agreement). nh tuyn da trn QoS: nh tuyn sao cho tuyn ng m bo dch v QoS (l tha thun gia ngi dng v nh cung cp dch v mng v bng thng, tr, t l mt gi) Bn cnh l cc rng buc, cc rng buc phi m bo l ti u ti nguyn mng. QoS metric: SLA c th hin bi QoS metric. QoS metric bao gm bng thng, jitter, gi thnh, t l mt gi. Mt tp m(n1,n2) l metric ca lin kt (n1,n2). Vi bt c tuyn ng P (path) no, P=(n1,n2,n3,ni,nj), metric m l: tnh cng (additive), nu m(P) = m(n1,n2) + m(n2,n3) + ... + m(ni,nj) tnh nhn (multiplicative), nu m(P) = m(n1,n2) * m(n2,n3) * ... * m(ni,nj) tnh lm (concave), nu m(P) = min{ m(n1,n2), m(n2,n3), ... , m(ni,nj) }

metric, v gi tr ti thiu ca n l s kt hp ca cc metric bao gm gii php ti u gn ng[6] C nhiu thut ton nh tuyn da trn QoS c phn loi mt cch h thng trong [5].

3.

nh tuyn da trn lu lng

thc ton hc: t sd l maxflow ca cp ngunch (s,d) c tnh ton sau khi tha mn yu cu thit lp LSP, bi ton t ra l cc i tng sd ca mi cp ngun-ch. Mc tiu ti u l: Maximize sd
( s , d )P ( a ,b )

Vi thut ton tm ng ngn nht, nhc im ca cc thut ton ny l khi mt cung l tt vi nhiu cp ngun-ch, th cc cp ngun-ch s chn cung cho tuyn ng ca chng v dn n tc nghn trn cung . Thut ton nh tuyn da trn lu lng khng ch ti u ti nguyn mng ti thi im hin ti, nhng cng cho yu cu ca tng lai. Thut ton nh tuyn da trn lu lng s tin on lin kt no s b tc nghn khi chng ta nh tuyn qu nhiu lu lng qua chng v s gim nh tuyn lu lng qua cc lin kt . Phn loi - Da trn thng tin ca mng hin ti, tnh ton v chn ra nhng lin kt lm ti thiu kh nng tc nghn ca mng trong tng lai. - Da trn thng tin thng k bi server hoc router, chng ta s c thng tin gn ng v yu cu trong tng lai. Chng ta s gi cc thng tin thng k l thng tin m t (profile). Sau khi c cc thng tin m t, chng ta s s dng quy hoch tuyn tnh tm ra gii php ti u trong tng lai. Tip theo, chng ti s ch ra mt vi thut ton nh tuyn da trn lu lng, cc thut ton ny gi ra cc l thuyt c bn v cc tng tng qut cho cc thut ton nh tuyn da trn lu lng. 3.1. Da trn thng tin hin ti ca mng Thut ton nh tuyn vi im giao ti thiu MIRA (Minimum Interference Routing Algorithm) [7] Chng ta bit rng m bo yu cu ci t LSP, gi tr maxflow cng nh sau khi mi cp ngun-ch chn c tuyn ng th kh nng ca mng p ng cho yu cu ca tng lai cng ln. Vn ny c th c m t bi cng

Bn cnh , chng ta phi tm ra lu lng ca mi cp ngun-ch, thit lp tuyn ng vi bng thng D v m bo rng buc: tng bng thng ca mi lu lng i qua mi lin kt phi nh hn bng thng d tr ca lin kt , v tng lu lng i vo bng vi tng lu lng i ra mi nt ca mng. gii quyt hon ton vn l mt bi ton NP kh. Tc gi tm ra gii php gn ng cho vic gii quyt vn trn v c m t bi thut ton MIRA: t thng tin v dung lng d tr ca mi cung, chng ta c th tnh ton ra maxflow ca mi cp ngun-ch. Vi mi cp ngun-ch, chng ta tm ra tp mincut, v nhng lin kt thuc v cc tp c gi l cc lin kt ti hn (critical links). Cc lin kt ti hn ny c tnh cht l nu chng ta nh tuyn lu lng ca cp ngun-ch i qua chng, maxfow ca cp ngun-ch s b gim. Do , mc tiu ca thut ton MIRA l trnh n ti a vic i qua cc lin kt ti hn. tng tng ca thut ton l cc ng i s khng nh hng qu nhiu tha mn yu cu tng lai. Thut ton pht trin da trn heuristic critical link [7]. critical link c ch nh bi thut ton, v l cc kt ni vi cc thuc tnh m mt LSP c nh tuyn qua cc kt ni ny gi tr lung ln nht (maxflow) ca mt hoc nhiu i ng vo-ng ra (ingress-egress) gim i. Nu critical link c ti nng th mng khng c kh nng tha mn cho tng lai. Cc tng chnh :

Hnh 1: cc tng chnh

V d: Nu thut ton t trm nht (min-hop) c s dng , tuyn t S3 ti D3 l 1-7-8-5 v n s kha cc tuyn gia (S1, D1) v (S2, D2). Trong v d ny, s la chn tt hn l 1-2-3-4-5. Chng ta thit lp lung cc i (maxflow) v1 gia mt cp ng vo ng ra (S1, D1). Gi tr ny l gii hn trn ca tng bng thng c th i t ng vo n ng ra. Gi tr lung cc i s gim D n v khi bng thng yu cu ca D n v c nh tuyn gia (S1, D1).

Chn ng i bng tnh ton ng i ngn nht: sau khi xc nh cc critical link chng ta s trnh nh tuyn LSP trn cc critical link. Chng ta s s dng Dijkstra hay Bellman-Ford tnh ng i. Thc hin iu bng cch xy dng ma trn trng s (matrix weight) lm tng chi ph khi cc tuyn LSP i qua critical link. Sau ta chn ng i theo thut ton ng i ngn nht.
MIRA (Minimum Algorithm)

Interference

Routing

Cc ng giao ti thiu (Minimum Interference Paths): chng ta c th ngh ng giao ti thiu l ng i ti a ca ti thiu lung cc i (minimum maxflow) ca mi cp ng vo-ng ra.

Sau y l kt qu m phng ca MIRA. Vi m hnh v bng thng ging nh trong tp tin on m th lu lng t ngun 0 s i thng qua con ng 0-6-7-4 nhng vi MIRA, sau khi tnh ton cho cc critical links, lu lng t ngun 0 s i qua con ng 0-1-2-3-4, v th 5, 9 v 8, 10 c nhiu c hi thit lp mt LSP thng qua kt ni 6-7

Hnh 2: MIRA 1 Vi thut ton MIRA, ng i t nt 1 n 5 l 1-3-5, t nt 1 n 4 l 1-2-4 v con ng t nt 2 n 3 l 2-4-3. Sau ta s dng nh tuyn tng minh thit lp ER-LSP dc theo cc nt ny. Vi MIRA, mng ca chng ta c th ti u ti nguyn cho cc yu cu tng lai.

Hnh 3: MIRA 2 Thut ton nh tuyn ng trc tuyn DORA (Dynamic On line Routing Algorithm) [9] thut ton DORA cng da trn thng tin hin ti ca mng tin on ra cc lin kt c kh nng b tc nghn trnh i qua chng. DORA khc bit vi MIRA ch MIRA th da trn maxflow, trong khi DORA xem xt v s tuyn ng i qua mt lin kt (Xem xt n mi cp ngun-ch). t n l s tuyn ng (ca mi cp ngun-ch) i qua mt lin kt, gi tr ca n cng ln, kh nng tc nghn trn lin kt trong tng lai cng ln, do DORA chn n lm trng s cho mi lin kt v s dng thut ton tm ng ngn nht tm ra tuyn ng c trng s ti thiu. Ngai ra, kt hp n vi cc iu kin ti u metric khc (v d m), thut ton DORA xy dng gi tr trng s bng cng thc: o c lu lng i qua mng, v c c thng tin m t ca dng lu lng . Mi thng tin m t thuc v mt lp, bao gm Bi th hin bng thng yu cu ca LSP gia ngun si v ch di v c nh x ti classID. Chng ta k hiu mi bng m t bng (classID, si, di, Bi) v chng ta gi l commodity th i. m bo mt cch gn ng cho mi yu cu trong tng lai, chng ta phi gii h phng trnh tm ra lu lng ca mi cp ngunch phn phi trn mi lin kt (bc u tin). Nu vn ny gii quyt c, chng ta p dng kt qu cho mng ca chng ta. Cho mi yu cu LSP, chng ta xc nh lp ca n v s dng kt qu ( bc u tin) cho mi lp khi to tp mng, sau chng ta s dng thut ton tm ng ngn nht tm ra gii php ti u (bc th hai). Trong trng hp tng qut, khng phi mi bng m t u c th c hon ton tha mn. PBR thm vo cc cnh ph vo th. Cc cnh ph ei ny l cc cung ni gia cp ngun ch (si,di) ca lp i v c bng thng v cng ln (mt gi tr rt ln). Vi cnh ph c thm vo, h phng trnh lun lun gii c v c nhiu nghim. iu m PBR cn l ti a vic p ng yu cu ca PBR, do chng ta phi lm sao ti thiu nh tuyn lu lng i qua cc cnh ph.

w = n'+ (1 ) m'

n' , m' l cc gi tr c chun ha ca n,m trong phm vi [0,100]. 0 1 , chn gi tr da trn thc nghim (thng thng = 0,5).
3.2. Da trn thng tin m t nh tuyn da trn thng tin m t PBR (Profile Based Routing) [8] Chng ta gi s rng bng vic s dng router hoc server, chng ta c th

Hnh 4: Cc cnh ph (excess edges) c thm vo th Gi s chng ta c hai gi thuyt sau: Gi s rng chng ta c k bng m t, t xi(e) - class id 0, source 0, destination 2, aggregated l gi tr lu lng ca i i qua cnh e. Mc tiu ti bandwidth 28M u l: - class id 1, source 1, destination 3, aggregated k bandwidth 25M Minimize cos t (e) xi (e) Bng thng cn cho nt 0 n nt 2 l 8M v bng i =1 thng cn cho nt 1 n nt 3 l 9M. Sau khi tnh cos t (e) = nu e l cnh ph v ton lng commodity ca mi class id trn mi kt cos t (e) = 1 nu e l cnh bnh thng. ni, th bng thng cn li ban u v sau p dng V by gi, h phng trnh c a v bi thut ton u tin tm min-hop-path. V th lu ton quy hoch tuyn tnh v c th gii c vi lng t nt 0 n nt 2 (class id 0) l 0-5-2 v t nt thi gian a thc. Kt qu ny s c s dng cho 1 n nt 3 (class id 1) l 1-0-3 bc th hai ca thut ton PBR. PBR (Profile Based Routing)

Hnh 5: PBR trn server vi m hnh tp trung. Cc server ly cc 4. Trin khai cc thut ton nh tuyn thng tin ca mng t cc giao thc qung b nh l nng cao OSPF-TE, IS-IS-TE, sau , server tnh ton tuyn ng ti u, s dng COPS,SNMP, telnet, Cc thut ton nh tuyn nng cao rt kh iu khin cc cp ngun-ch thit lp LSP mi. khn hin thc trn router bi v gii hn ca b nh, tc CPU v chc nng ca h thng. Do , cc thut ton nh tuyn nng cao c hin thc

Hnh 6: M hnh server tp trung h tr thut ton nh tuyn nng cao trn MPLS MATE gi thng ip yu cu ti router thng qua Mt vi d n ang thc hin vi cc thut ton nh SNMP/Telnet cu hnh router, yu cu router ly tuyn nng cao trn MPLS vi server thng tin bng TFTP, sau router cp nht thng tin Server k thut lu lng RATES (Traffic cu hnh cho chnh n. engineering server)[10] c xy dng bi phng th nghim Bell, RATES s dng TE-server tnh 5. M phng ton cc tuyn ng ti u da trn thut ton Vic xy dng mt mi trng m phng rt MIRA, sau COPS server thit lp tuyn ng bi quan trng trong vic nh gi hiu qu ca thut giao thc COPS [15].RATES s dng CORBA cho ton nh tuyn v chn ra gii php tt nht cho cc vic lp trnh phn tn. thut ton trn. ns2 [19] l phn mm m phng m K thut lu lng m bo QoS cho ngun m trn h iu hnh linuz, v thng c s mng Internet din rng TEQUILA (Traffic dng hin thc cc gi mi trong nghin cu. Engineering for Quality of Service in the Khi u ns2 khng c mun MPLS, chng ta s Internet at Large Scale)[17] l d n cng tc ca dng mun MNS [20] cho MPLS. c th qung Chu u. N a ra kin trc cung cp QoS cho b cc thng tin ca mng, chng ti s dng gi Internet. TEQUILA c cc thnh phn chnh nh l QOSPF [13][14][18] bi v IS-IS-TE, OSPF-TE mt phng iu khin, mt phng d liu, mt phng cha c xy dng trn ns2. Mt vi thut ton cn qun l TEQUILA s dng SLS cho vic ly cc gii bi ton quy hoch tuyn tnh, chng ti s dng yu cu ca ngi s dng mng, v cc thnh phn gi PPRN [16]. V cui cng, chng ti chnh sa ca n lin lc vi nhau thng qua CORBA. Mi cc phin bn khc nhau ca cc gi trn, kt hp router c cu hnh bi giao thc COPS. chng vi mun ca chng ti v chng ti c mt T ng qun l k thut lu lng MATE mi trng m phng MPLS hon chnh cho vic kim tra v m phng cc thut ton nh tuyn nng (Traffic Engineering Automated cao. Manager)[11] s dng thut ton SPeCRA [12] cho nh tuyn. Thut ton ny n gin hn MIRA. M hnh ny c hin thc trn router vi Linux.

Hnh 7: M hnh l thuyt ban u ca MNS trn ns2

Hnh 8: M hnh l thuyt ca chng ti trin khai thut ton nh tuyn nng cao da trn ns2 vi MNS LSP. Nu khng, yu cu s b t chi. Kt qu so C rt nhiu thut ton nh tuyn da trn snh c th hin trn th vi cc yu cu c QoS. l kt qu ca s kt hp ca rt nhiu bi p ng (trc Y) v tng s yu cu (trc X), v c ton ti u v rng buc, s kt hp ca rt nhiu th hin bi xgraph (trn ns2). loi metric nh l bng thng, tr, jitter v cc Tp n gin l tp c s dng trong [7]. heuristic c a ra gii quyt bi ton NP kh. Trn tp ny, cc cnh mng c dung lng 1200 Chng ti s khng i su vo cc thut ton da trn n v, v cc cnh dy c dung lng 4800 n v. QoS, v thy c kt qu r rng trong vic so Chng ta c 4 cp ngun-ch (S0,D0) (S1,D1) snh gia thut ton nh tuyn nng cao v cc thut (S2,D2) (S3,D3).Tng ng, PBR s dng 4 ton nh tuyn c, chng ti ci t mt s thut commodity, mi commodity c 2700 n v. Chng ton nh tuyn da trn lu lng. Thut ton c ti s dng hm ngu nhin ng nht h tr bi ns2 c em ra so snh l MHA (Min-Hop Algorithm), pht sinh ngu nhin bng thng v cp ngunthut ton vi s hop ti thiu. MHA s chn tuyn ch. Thut ton DORA s dng = 0.5 . ng vi s hop-ti thiu. Nu tuyn ng tha mn iu kin bng thng, n s chn vic ci t
S1 S3 D2
1 10 5 2 12 4 11

S0

D0

0 6 3 9

13

S2
8 7 14

D1

D3

Hnh 9: Tp c s dng trong th nghim

Trong th nghim 1, chng ti c 500 yu cu LSP, mi yu cu chn la ngu nhiu mt cp ngun-ch v bng thng yu cu t 100 ti 400 n v. Trong th nghim 2, chng ti c 1000 yu cu LSP, mi yu cu chn la mt cch ngu nhin bng thng t 10 ti 40 n v. Chng ta c th thy rng trn th, thut ton MIRA v DORA m bo s yu cu c p ng ln hn thut ton PBR v MHA trong hai trng hp ny, v c bit vi s lng ln cc yu cu, s khc bit tr nn r rng. Trong hai th nghim ny, PBR khng c ng bng m t bi v bng m t tin on rng mi commodity (cp ngun-ch) c tng 2700 n v bng thng, nhng iu khng ng. Do , thut ton PBR khng hiu qu.

Hnh 10: Tng s yu cu LSP c p ng trong th nghim 1 v 2 yu cu LSP, mi yu cu chn la mt cch ngu Trong th nghim 3, chng ta to iu kin nhin mt cp ngun-ch v bng thng t 10 ti 40. cho PBR c ng bng m t. Chng ta nh ngha Vi bng m t thch hp, PBR chng minh c mt bng m t v p buc lung lu lng ca hiu qu hn hai th nghim trn. Bi v bng thng mng i theo bng m t . Bng m t l mi yu yu cu ca mi cp ngun-ch khng vt qu cu chn la mt cch ngu nhin cp ngun-ch, 2700 n v, nn thc ra chng ta c gn ng 420 nhng tng s bng thng yu cu ca mi cp yu cu LSP cho mi cp ngun-ch (<1000) nh ngun-ch khng c vt qu 2700 n v, v chng ta thy trong hnh 11. bng m t ny c p vo mng. Chng ta c 1000

Hnh 11: S yu cu LSP c p ng trong th nghim 3 Trong 3 th nghim ny, chng ti chng minh c hiu qa cc thut ton nh tuyn nng cao (thut ton nh tuyn da trn lu lng) vi thut ton nh tuyn c (MHA) trn MPLS cho vic m bo yu cu LSP ( do th hin kh nng gim tc nghn) trn mng ng v cng th hin s khc bit gia thut ton nh tuyn c bng m t v thut ton khng c bng m t (trn mi trng m phng).

6.

Kt lun

Ngy nay, vi s xut hin ca nhiu dch v v rng buc mi cho mng MPLS ca ngi dng, nh cung cp v ngi qun tr, cn thit phi c nhng thut ton nh tuyn nng cao mi trn MPLS. MPLS h tr kin trc h tng v mi trng y tim nng cho vic pht trin cc thut ton ny. Trong bi bo ny, chng ti th hin cc c im chnh v phn loi cc thut ton nh tuyn nng cao trn MPLS. Chng ti cng m phng mt vi thut

ton thy c hiu qu ca chng v cp n mt vi d n vi thut ton nh tuyn nng cao. Trong tng lai, rt nhiu d n s c xy dng c h tr cc thut ton nh tuyn nng cao khng ch cho server m cn cho router, thit b hin nay ch h tr giao thc nh tuyn IP v CSPF (tuyn ng tha rng buc ngn nht) (cho thit k lu lng). Nu chng ta mun pht trin cc thut ton ny trn MPLS router, thut ton ny phi n gin v hiu qu thch hp vi cc thit b router. V l hng nghin cu trong tng lai ca chng ti v thut ton nh tuyn nng cao trn MPLS.

[15]

Jim boyle, et. al., "The COPS(Common Open Policy Service) Protocol", draft-ietf-rapcops-08.txt, Nov. 1999. [16] http://www-eio.upc.es/~jcastro/pprn.html [17] http://www.ist-tequila.org [18] http://www.ironet/qosr.html [19] http://www.isi.edu/nsnam/ns/ [20] http://flower.ce.cnu.ac.kr/~fog1/mns/mns2.0/sourc e/mns_v2.0.tar

7. Tham kho [1] Uyless

TRN CNG HNG sinh nm 1961 ti Vit Nam

Nhn bng K s v in t-Vin thng ti i hc Bch Khoa thnh ph H Ch Minh, Vit Nam, nm 1987. Nhn bng K s v Cng Ngh Thng Tin ti i hc Bch Khoa thnh ph H Ch Minh, Vit Nam, nm 1995. Nhn bng Thc s k thut ti i hc Bch Khoa H Ni, Vit Nam, 1998 Nhn bng Tin s k thut ti i hc Bch Khoa H Ni, Vit Nam,2004. Hng nghin cu chnh l phng php o lng tham s hiu sut B-ISDN, QoS trong mng tc cao, MPLS. Hin ti, ang l ging vin, Ph khoa Cng ngh thng tin II v Trng b mn Mng v Truyn d liu ti Hc Vin Cng Ngh Bu Chnh Vin Thng (PTIT), Thnh ph H Ch Minh, Vit Nam.

Black, MPLS Label Switching Network, PRENTICE HALL, 2002. [2] Vivek Alwayn, Advanced MPLS Design and Implementation, Cisco Press, 2002. [3] Sean Harnedy, MPLS Primer, PRENTICE HALL, 2002. [4] Wei Sun, QoS/Policy/Constraint Based Routing, January 1999. [5] Shigang Chen, Klara Nahrstedt, An Overview of Quality-of-Service Routing for the Next Generation High-Speed Networks: Problems and Solutions,1999. [6] L. Guo and I. Matta. Search Space Reduction in QoS Routing, In Proceedings of the 19th International Conference on Distributed Computing Systems, Austin, Texas, June 1999. [7] M. Kodialam, and T. Lakshman, Minimum Interference Routing with Applications to MPLS Traffic Engineering, in Proceedings of IEEE INFOCOM, March 2000. [8] Subhash Suri, Marcel Waldvogel, Daniel Bauer, and Priyank Ramesh Warkhede, Profile-Based Routing and Traffic Engineering, Computer Communication 2002. [9] R. Boutaba, W. Szeto, and Y. Iraqi, DORA: Efficient Routing for MPLS Traffic Engineering Journal of Network and Systems Management, Vol. 10, No. 3, September 2002. [10] P. Aukia et al., RATES: A Server for MPLS Traffic Engineering, IEEE Network, vol. 14, Mar./Apr. 2000. [11] A. Elwalid et al., MATE: MPLS Adaptive Traffic Engineering, Proc. IEEE INFOCOM 01, Anchorage, AK, Apr. 2001. [12] J. C. de Oliveira, F. Martinelli, and C. Scoglio, SPeCRA: A Stochastic Performance Comparison Routing Algorithm for LSP Setup in MPLS Networks, Proc. IEEE GLOBECOM 02, Taipei, Taiwan, Nov. 2002. [13] Z. Zhang, C. Sanchez, B. Salkewicz and E. Crawley, Quality of Service Extensions to OSPF or Quality of Service Path First Routing, Internet Draft, September 1997. [14] G. Aposto,opoulos, et. al., "QoS Routing Mechanism and OSPF Extensions", RFC 2676, August 1999.

NGUYN HONG THANH sinh nm 1982 ti Vit Nam

Nhn bng k s v Cng ngh thng tin ti PTIT, 2003 vi tn n tt nghip nh tuyn cao cp trong mng Chuyn Mch Nhn a Giao Thc. t gii nht nghin cu khoa hc nm 2002. Cc ti khoa hc: Qun l mng t xa da trn k thut Java Agent, voice Portal s dng VXML (hoc truy cp Internet bi in thoi) 2003, Hin thc tng i ni b 4 thu bao 2001. Hin ti ang l ging vin ca khoa CNTT2, Hc Vin Cng Ngh Bu Chnh Vin Thng (PTIT), H Ch Minh, Vit Nam

NGUYN C THNG sinh nm 1982 ti Vit Nam

Nhn bng k s v Cng ngh thng tin ti PTIT, 2004 vi tn n tt nghip Nghin cu GIS trn thit b di ng v x l phn tn . t gii nht nghin cu khoa hc 2003 vi tn ti Nghin cu v p dng cc thut ton x l nh trong vic nhn dng bn giy. Cc ti nghin cu khoa hc: Tm gii php ti u cho qun l h thng mng phng LAB, hin thc h iu hnh x l theo l gi l MECURY OS. Hin ti, ang l ging vin khoa CNTT2, Hc Vin Cng Ngh Bu Chnh Vin Thng (PTIT), H Ch Minh, Vit Nam.

10