Tuyn tp Bo co Hi ngh Sinh vin Nghin cu Khoa hc ln th 7 i hc Nng nm 2010

GII PHP IU KHIN NGHN TRONG MNG CHUYN MCH BURST QUANG BNG PHNG PHP LCH HNG I
CONTENTION BASED LIMITED DEFLECTION ROUTING PROTOCOL IN OPTICAL BURST SWITCHED NETWORK SVTH: Mai Th Kim Lin, Nguyn ng Phc Lm
Lp 05DT1, Khoa in t Vin thng, Trng i hc Bch khoa

GVHD: TS Tng Tn Chin

Khoa in t Vin thng, Trng i hc Bch Khoa
TM TT nh tuyn lch hng l mt phng php c dng gii quyt nghn trong mng chuyn mch burst quang. Mc ch ca bi bo ny l a ra mt gii php hn ch nghn bng phng php nh tuyn lm lch hng i. Ti node trung gian nu nghn xy ra th gi tin iu khin s c nh tuyn truyn i trn mt ng khc, nh vy trnh c hin tng mt d liu v xc sut suy hao ca chm c gim i ng k. Kt qu m phng di y s cho ta mt gii php gim s mt burst n mc thp v ci thin cht lng ng truyn. ABSTRACT Deflection routing is one of main solutions which are used for resolving the burst contentions. The purpose of this paper proposed a contention limited solution based on deflection routing protocol. At the intermediate node if contention occurs, the packet can get routed to transmit to the another destination. Therefore it can avoid the loss of the data burst and reduce the consume probability of burst. The simulation results showed that the propsed method can decrease the burst loss probability in the low and medium traffic loads and also improve the link utilization.

1. t vn Cc gi IP khi n nt bin ca mng OBS s c kt hp li thnh chm d liu (DP). Sau mt khong thi gian hoc khi t n di nht nh, chm s c to ra ti nt bin cng vi gi iu khin chm (BCP). BCP s c gi i trc DB v c x l in t ti cc nt trung gian t trc ti nguyn cho DB. Sau khi BCP t trc bc sng trn ton tuyn t ngun n ch th DB s c pht i. Mng chuyn mch burst quang cung cp s truyn dn phi kt ni nn c kh nng burst s tranh chp vi mt burst khc ti cc node trung gian. C 4 phng php c bn gii quyt nghn l: m bng ng dy tr quang, chuyn i bc sng, phn on chm v nh tuyn lch hng. i vi phng php nh tuyn lch hng, cc chm b xung t s c gi ti lin kt ra khc ca nt v sau c nh tuyn qua mt tuyn khc n ch. 2. Thut ton nh tuyn lch hng 2.1. C s l thuyt Lm lch hng i l mt phng php gii quyt nghn bng vic nh tuyn mt chm tranh chp n mt ng ra khc so vi ng ra theo d kin. Tuy nhin chm lch hng c th n ch theo mt tuyn di hn. V vy c th xy ra tr u cui u cui

211

Tuyn tp Bo co Hi ngh Sinh vin Nghin cu Khoa hc ln th 7 i hc Nng nm 2010

ca mt chm. Lm lch hng i khng c kh thi trong mng chuyn mch in v kh nng lp v phn tn chm.

Hnh 1. Cu trc ca mng OBS vi k thut lm lch hng i

Trong khi x l gi iu khin truyn i chm trn tuyn chnh, nu chm cm thy nghn th mt gi iu khin khc c bt u t nt nghn trung gian v chm c truyn qua mt tuyn la chn t nt trung gian .C nhiu yu t quyt nh nh tuyn, trc ht n xc nh c la chn tuyn cho mt chm c hay kh ng hay loi b v thc hin gi li t nt ngun. 2.2. Phng php nh lch hng i Phng php nh tuyn lch hng i trong OBS bao gm cc bc c miu t nh trong hnh 2 Bc 1: Nt ngun truyn i mt gi iu khin. Bc 2: Nt trung gian x l gi iu khin v c gng dnh trc mt knh hot ng cho chm. Bc 3: Nt ngun truyn i chm sau mt khong offset. Bc 4: Nu ti mt nt khng c knh ng ra no hiu lc cho chm, trc ht n kim tra c phi nt hin ti l ngun hay khng. Nu nt hin ti l nt ngun th nh lch hng khng thc hin. Thay v , sau khi i mt khong thi gian, ngun truyn li gi iu khin ri sau chm c truyn i. Nu nt hin ti l nt trung gian th chuyn sang bc 5.
Retry C Nt Ngun Qun l DB ca router ra Nt trung gian Gi iu khin OAM

Gi iu khin t trc chm

Tranh chp

Ngun kim tra Khng

Qun l DB ca router ra

Gi iu khin OAM

Sender truyn li

Khng

Thc hin kim tra nh lch hng ? C Gi gi iu khin trn tuyn chn la ca chm t trc

Bc 5: Nt hin ti c xem nh l mt nt Hnh 2. Phng php nh lch hng trung gian. V vy nt hin ti tnh ton thng s th hin v thc hin kim tra da trn nhng thng s . Do vy n quyt nh c lm lch hng hay l loi b v thng bo cho ngun thc hin truyn li. Nu quyt nh l lm lch hng i, th tuyn chn la
212

Tuyn tp Bo co Hi ngh Sinh vin Nghin cu Khoa hc ln th 7 i hc Nng nm 2010

c chn trong DRT. Tuy nhin, nu khng c tuyn no c hiu lc trong DRT th n t hin ti loi b chm v gi bn tin NACK n ngun truyn li t ngun. 2.3. Cu trc kim tra a ra cu trc kim tra quyt nh c nn loi b hay thc hin lm lch hng hay khng. Ch (count hop)=
x i ,i
1

i ,i 1 i ,i 1 N c

x j, j
j , j 1 Nd

(1)

l mt gi tr nh phn ph hp lin kt (i, i+1) gia nt i v nt k tip i+1.

0 , lm lch hng i chm.

a ra quyt nh: Nu Ch Nu khc th loi b chm. Nu s lng nt trn tuyn chnh t ngun s n nt nghn c ln hn t nt nghn c n nt ch d, iu th Ch 0 , thc hin lm lch hng gii quyt tranh chp. Ngc li chm s b loi b. Cng thc (1) c s dng nhm t c mc ch: Ti nguyn mng c tit kim v ci tin chm bng vic nh lch hng i nu nt nghn gn nt ch v truyn li nu nt nghn gn nt ngun. Gim bt vic x l ti v mo u (thi gian v ti nguyn t trc bi nhng gi iu khin). Cu trc kim tra tha b :
d 1

Cb

lg b

lg 1
i 1

1 bi ,i

i, i 1 N d

(2)

Vi b l tc chn c th chu c t u cui u cui trn mt tuyn. a ra quyt nh: Nu Cb y bi ,i

0 , lm lch hng i chm.

Nu khc th loi b.
1

th hin kh nng (xc sut) tranh chp gia nt i v i+1. Mong mun

la chn tuyn vi xc sut tranh chp nh gim mc suy hao chm v mc b chn trong mng. a ra hai quyt nh:

Qh

1, nu gi tri C h 0, khc
1,
* nu b1

(3)
* b2

Cb b1*
* b2

Qb

M, M,

nu C b nu C b

(4)

Hay

Qt=whQh+Qb
213

(5)

Tuyn tp Bo co Hi ngh Sinh vin Nghin cu Khoa hc ln th 7 i hc Nng nm 2010

y wh<<M l trng lng s nt lin quan n tc suy hao chm. Kt hp cu trc kim tra ta c c:

Ct

1, 0,

nu Q t khc

wh 1

(6)

nh lch hng c thc hin nu Ct=1 Cng thc tnh lu lng ngun v xc sut ca chm suy hao

n0
Ns

10 3 C L
L
i

(7) (8) m h thng

10 3 C

Ta c th iu chnh i n0 1 mu s cng thc 3.20 khong cn thit trng thi i cho chm lm tr vt qu B ms.

BC L , i n0 i n0 1
pi n i
i

n0 1
n i

(9)

(10)

Xc sut chm suy hao:

n

PL

pi e
i n0 1

(11)

2.4. Kt qu m phng v nh gi Theo hnh 3, xc sut chm suy hao trong phng php lm lch hng i c gim nu tng gi tr FDL. Vi FDL=50ms th xc sut chm suy hao nh hn FDL=10ms v khng FDL. Vic khc phc nghn trong mng t hiu qu cao nu s dng phng php lm lch hng i kt hp vi FDL ln. Nguyn nhn l do khi s dng FDL, lu lng burst ca nhiu ngun khc nhau s tc ng qua li, lm cho s tng quan v thi gian biu hin r rng hn.

Hnh 3. Kt qu thu c 214

Tuyn tp Bo co Hi ngh Sinh vin Nghin cu Khoa hc ln th 7 i hc Nng nm 2010

3. Kt lun Trong mng OBS, vic gii quyt s c trong mng khi lu lng a vo mng qu ln rt cn thit khi mng hot ng, ni dung bi bo ny nu ln mt cch gii quyt kh thi bng thut ton lm lch hng i ca chm khi nghn xy ra ti mt nt trung gian trong mng. Thut ton a ra gii php iu khin nghn khc phc nhng s c xy ra i vi mng, t hiu qu cao v chi ph mng tng i thp. Chng ta cng a ra c mt s kt qu quan trng biu th bn cht ca node bin cng nh node trung gian. Cc kt qu ny rt c ch trong vic nghin cu s bin thin ca xc sut chm suy hao khi cc thng s h thng v lu lng thay i. TI LIU THAM KHO [1] C.Qiao and M.Yoo (1999), Optical burst switching (OBS) a new paradigm for an optical internet, Journal of High Speed Networks, vol.8, pp.6984, March. [2] S.Lee, K.Sriram, H.Kim, J.Song (2003), Contention-based Limited Deflection Routing in OBS Networks, Proceedings of IEEE Globecom, vol.5, pp.2633-2637, San Francisco, USA, December. [3] Jason P.Jue, Vinod M.Vokkarane, Optical burst switched network, optical networks series, Springer; 2005. [4] Klaus Dolzer, Christoph Gauger, Jan Spath and Stefan Bodamer; Evaluation of Reservation Mechanisms in Optical Burst Switching, AEU International Journal of Electronics and Communications; 2001. [5] [Trn Quang Vinh, V M Hng, Kin trc mng chuyn mch burst quang. [6] ThS Nguyn La Giang,Chuyn mch chm quang OBS: mt gii php cho mng ng trc internet th h sau tp ch Bu chnh Vin thng v Cng ngh Thng tin.

215