Phân Tích Phương Pháp ARQ Trong Lưu Lư NG T Đ NG B

Pht hin suy gim hiu sut TCP s dng thng k Link Utilization
TS. Nguyn Hng Sn
B THNG TIN & TRUYN THNG

HC VIN CNG NGH BU CHNH VIN THNG
BO CO TIU LUN
L THUYT HNG I V NG DNG
TN TI
PHT HIN SUY GIM HIU SUT TCP S

DNG THNG K LINK UTILIZATION
GVHD: TS. Nguyn Hng Sn
HVTH: Tng H Ph Thun
V Tin Trc
Phan Th Huyn Linh
TP. H Ch Minh
06/2016
1
TS. Nguyn Hng Sn
Mc Lc
1.
Cc k thut ARQ.................................................................................................... 3
1.1.
ARQ stop and wait (dng v i).....................................................................3
1.2.
Phng php Go back N...................................................................................4
1.3.
Phng php Selective repeat............................................................................... 5
2.
M hnh v k hiu................................................................................................... 6
3.
Phn tnh hiu sut................................................................................................... 8
4.
Phn tch hiu sut cho cc loi khc nhau ca ARQ.....................................................13

4.1.
Bin php tnh hiu sut....................................................................................13
4.2.
Phn tch hiu sut cho ARQ.............................................................................. 14
4.2.1.
H thng Stop-and-Wait............................................................................. 16
4.2.2.
H thng Go-back-N.................................................................................. 17
4.2.3.
H thng Selective-repeat............................................................................ 18
5.
Kt qu m phng.................................................................................................. 19
6.
Kt lun............................................................................................................... 24
1. Cc k thut ARQ
2
TS. Nguyn Hng Sn
Khi truyn thng tin trong mng, thng tin truyn t pha pht sang pha thu c
th b sai li hoc mt. Vic thng tin b mt th cn phi thc hin truyn li
thng tin. Cn vic thng thin b sai th cn phi tm hiu nguyn nhn sa
sai. C hai cch sa sai.
Sai do bn thu v sa li trc tip bn thu vi iu kin l thng tin trc khi
truyn phi c ci cc m sa li. Nh vy s lng bt thng tin c th sa
sai ph thuc vo s lng m sa sai v s bt thng tin them vo cho mc
ch sa li. S bt thng tin thm vo cng ln th s bt c th sa li cng
nhiu, tuy nhin hiu sut thng tin li thp.
Sa li bng cu bn pht truyn li thng tin. Vi phng php ny th vhir
cn thm cc bit thng tin phc v cho mc ch pht hin li, do hiu sut
truyn thng tin cao hn so vi trng hp trn. Tuy nhin khi c li xy ra vi
khung thng tin th ton b khung thng tin phi c truyn li.
Ta c cc c ch pht li ARQ (Automatic Repeat Request) sau.
1.1.
ARQ stop and wait (dng v i)

Stop and wait l mt dng ca iu khin dng truyn dng v i
m dng cha cc chc nng truyn li d liu trong trng hp d
liu b mt hoc b h hng.
Hot ng
TS. Nguyn Hng Sn
Pha pht s thc hin pht mt khung thng tin sau dng li ch pha thu
bo nhn. Pha thu khi nhn ng khung thng tin v x l xong s gi li bo
nhn li cho pha pht (ACK - Acknowledgement). Pha pht sau khu nhn
c bo nhn s pht khung thng tin tip theo.
Pha thu khu nhn c khung thng tin v pht hin li s gi li bo li cho
pha pht (NACK negative Acknowledgement). Pha pht sau khi nhn c
bo li s thc hin pht li khung thng tin. Pha pht s dng c ch timeout
pht li khi khng nhn c hi m ca pha thu.
phn bit c cc khung thng tin vi nhau. Cn nh s cc khung. Dng
mt bt nh s khung (0 hoc 1). S th t khung thng tin t pha pht
sang pha thu nm trong trng SN (Sepuence number), s th t ca bo nhn
t pha thu sang pha pht nm trong trng RN (Request number)
Hot ng ca c ch stop and wait khi s dng SN v RN:
M hnh hng i :
1.2.
Phng php Go back N

Nguyn tc :
Pha pht s c pht nhiu hn mt khung thng tin trc khi nhn c bo
nhn t pha thu. S khung cc i m pha pht c th pht l W, c gi l
kch thc ca s. Vi c ch hot ng ny Go back N c gi l c ch
ca s trt (sliding window)
Mi khu pht xong mt khung thng tin, pha pht gim kch thc ca s i 1,
khi kch thc ca s bng 0, pha my pht s khng pht thm khung thng
tin no na. iu ny bo m pha thu kp x l.
Mi khi pha my thu nhn c mt khung thng tin ng v x l xong s
gi li mt bo nhn ACK cho my pht. Khi pha pht s tang kch thc
TS. Nguyn Hng Sn
ca s W ln 1. Nh vy tng s khung m pha thu phi x l ti mt thi

im vn khng vt qu W.
phn bit cc khung, cn nh s th t. Nu dung k bit nh s th tng
s khung c nh s s l 2k (t 0 ti 2k-1) v do , kch thc ca s ti
k
a l W Max=2
M hnh hng i:
1.3.
Phng php Selective repeat

Hot ng :
K thut Go back N nng cao hiu sut so vi Stop and wait, tuy nhin
hiu sut knh truyn vn cha c ti a ha do bn pht vn c th pha
pht li gi nhn ng trong trng hp gi trc b li. Cn Selective
repeat cng s dng k thut ca s trt. Nt khng c li xy ram qu trnh
din ra ging vi Go back N. Nu c li ch phi li nhng gi c li. C
ch ny gip tang hiu qu s duongj ng truyn so vi c ch Go Back
N.
TS. Nguyn Hng Sn
Do ch nhng gi li c pht li, trnh t nhn c cc gi khng ng nh

pha pht cn c b m gip sp xp li gi. Pha pht phi thc hin bo nhn
cho tt c cc khung thng tin m n nhn ng. Cc khung thng tin khng
c bo nhn trong khong thi gian timeout tng ng s c coi l mt
gi.
M hnh hng i :
2. M hnh v k hiu
H thng di s phn tch trong chng ny bao gm mt cp node: mt pht
v my thu. Khi 2 nodes ln cn cn giao tip vi nhau, lin kt d liu cn
c thit lp. chng ta gi nh cc trc thi gian c chia lm nhiu khe
(slots) c chiu di bng nhau v hng lot hng n theo quy trnh Bernoulli.
T , c nhiu khung d liu trong mt hng.
T ng b c xem l mt tnh cht m chng ta lin kt vi mt loi ca
mu (fractal), mt thc th m s xut hin ca n khng lm thay i quy m
khi n c xem xt [9]. Mt quy trnh t ng b c th c xy dng bng
cch chng nhiu qu trnhlm mi n gin, trong phn thngc gii
hn trong 2 gi tr 0 v 1, v thi gian t i mi bn trong (interrenewal) th
heavy-tailed. Phn phi haevy-tailed n gin nht l phn phi Pareto (c, )
[9]. Chng ta biu th l s khung d liu trong mt hng, c gi l kch
thc hng (khung/khe frames/slot), l mt gi tr ngu nhin. Kch thc
6
TS. Nguyn Hng Sn
ca mt hng cng theo phn phi Pareto (c, ). Khi truyn tt c cc khung d
liu phn buffer u ra c hon thnh, lin kt d liu s c gii phng.
H thng s lm vic mt cch chi tit nh sau:
(1) khi mt hng n hng lot trong h thng, mt khong thi gian thit lp
c gi l thi gian thit lp U bt u, ni m thi gian thit lp U tng
ng vi thi gian thit lp vi mt lin kt d liu mi s dng phng thc
bo hiu bt tay ba bn
(2) sau khi thi gian thit lp U kt thc, mt khong thi gian bn gi l thi
gian bn bt u. y, chng ta nh ngha khong thi gian bn l
khong thi gian m cc khung d liu c truyn ni tip nhau cho n khi
buffer my pht tr nn rng (data frames c truyn i ht)
(3) khi khng c khung d liu buffer u ra ca my pht c truyn, lin
kt d liu s c gii phng v h thng nhp vo mt khong thi gian im
lng gi l thi gian im lm I. Mt hng i n trong khi khong thi gian
im lm s lm h thng thit lp mt khong thi gian U mi.
Qu trnh ny c lp i lp li.
Chng ta nh ngha khong thi gian truyn B c gi thi gian truyn B l
khong thi gian khi truyn thnh cng mt khung d liu: khong thi gian t
lc truyn khung d liu u tin ti lc khung d liu ti ni.
S truyn khung d liu ch xy ra sau khi tip nhn chnh xc tt c cc khung
d liu, v th chng ta c th cho rng cc khung d liu trong mt hng n
trong b m vi mt dung lng v hn c truyn bng cch s dng lin
kt d liu thng thng, tng ci mt, trong m hnh (n trc phc v
trc) First-Come First-Served.
Khong thi gian thit lp U v thi gian truyn B l c lp vi nhau v l
nhng gi tr ngu nhin thi gian ri rc trong khe, c cho l phn phi vi
phn phi xc sut l uk v bk . Hm sinh xc sut - Probability Generation
Functions (P.G.Fs.) ca U(z) v B(z) c cho nh sau:
TS. Nguyn Hng Sn
Cho E[U] v E[B] l trung bnh ca U v B trong khe, chng ta c:
Cho E[] l trung bnh ca kch thc hng . Chng ta c th tnh xc xut k,
P.G.F. (z), and trung bnh E[] ca nh sau:
Vi k l xc sut m k khung d liu trong mt hng trn mi khe. c bit, 0

= P{ = 0} l xc sut m khng c hng n no trong khe. T (13.1), chng
B
ta cng bit xc sut ca hng n trong thi gian truyn B l B(0) = 0 .
iu kin ergodic l = E[]E[B] < 1, vi c gi l offered load.

Cho AU v AB l nhng gi tr ngu nhin c th hin trong s khung d liu
n trong khong thi gian U v B. Chng ta c th a ra P.G.Fs ca AU(z) v
AB(z) ca AU v AB nh sau:
Vi U((z)) v B((z)) l hm xc nh ca U(z), B(z), v (z).

Chng ta cng nh ngha (B(z)) l P.G.F ca thi gian truyn trong mt hng
trong cc khe. (B(z)) c cho nh sau:
3. Phn tnh hiu sut

Chng ta cho rng cc khung d liu n v ti ni ch xy ra bin ca mt
khe. Cho Qn = Q(n+) l s d liu khung trong mt h thng ngay lp lc sau
khi khung d liu th n c ti ni. Khi cng thc {Q n, n 1} c xem
nh mt chui Markov. Chng ta nh ngha trng thi ca h thng bng s Q
khung d liu trong h thng bng chui Markov nh sau:
8
TS. Nguyn Hng Sn
(n +1)
Vi A B
l s d liu khung ang n trong thi gian truyn d liu khung
th (n+1), v biu th s d liu khung n trong mt khe di iu kin

rng c t nht mt d liu khung ang n trong khe . Chc chn rng,
P.G.F. (z) ca c tnh nh sau:
T (13.6), ta c P.G.F Q(z) ca Q(z) nh sau:
Vi P{Q = 0} l xc sut khng c khung d liu no c truyn trong h

thng c tnh theo chui Markov, v P{Q 1} l xc sut c t nht mt
khung d liu c truyn trong h thng.
Thay (13.7) vo (13.8), ta c:
S dng cc iu kin bnh thng v quy tc LHospital cng th (13.9), ta

c:
Thay (13.10) vo (13.9), th P.G.F. Q(z) ca Q c nh sau:
TS. Nguyn Hng Sn
Phng trnh (13.11) cho thy Q c th chia lm 2 phn (Q = Q 0 + QU), vi Q0

tng ng vi s khung d liu cho hng i c in GeomX/G/1 v QU l s
khung d liu c thm vo bng cc phng thc thit lp c xem xt
trong chng ny.
P.G.F. Q0(z) ca Q0 c cho bi:
V P.G.F. QU(z) ca QU c cho bi:
Chn chn, QU(z) bng P.G.F ca s khung d liu ang n trong thi gian
thit lp U vi xc sut nh sau:
V QU(z) bng P.G.F ca s khung d liu ang n trong thi gian thit lp U
cn li vi xc sut nh sau:
Cho E[X] v X(2) l moment giai tha u tin l th hai ca bin ngu nhin
ri rc thi gian X bng cch vi phn X(z) theo z v tnh ton kt qu vi z =1
nh sau:
Da trn nh ngha trn, ta c th tnh trung bnh E[Q] ca Q t (13.11) nh

sau:
10
TS. Nguyn Hng Sn
Vi U(2), B(2) v (2) l cc moment giai tha th 2 trong khong thi gian thit
lp U, khong thi gian truyn B, v kch thc hng .
By gi, chng ta bt u phn tch thi gian i ca mt khung d liu. chng
ta tp trung vo mt khung d liu ngu nhin trong h thng, c gi l d
liu khung tag M. chng ta ch rng thi gian i W ca khung d liu tag
M c th chia lm 2 phn nh sau. Mt l thi gian ch Wg ca hng, ni m
khung d liu tag M ang ng. Cn li l tng thi gian truyn J ca khung d
liu trc khung d liu tag M trong cng mt hng. W g v J l 2 bin ngu
nhin c lp, v th chng ta c P.G.F. W(z) ca thi gian i W ca d liu
khung tag M nh sau:
Vi Wg(z) v J(z) l P.G.F ca Wg v J

p dng phn tch ca m hnh hng i Geom / G / 1 thit lp trong [8], ta c
Tham kho [3], vi (B (z)) a ra trong (13.5), ta c
Thay th (13.14) v (13.15) vo (13,13), sau cc gi tr P.G.F. W (z) v trung

bnh E [W] ca W c th tnh c nh sau:
11
TS. Nguyn Hng Sn
Tip theo, chng ta xc nh cc chu k bn rn gi l "chu k bn rn R" l

mt khong thi gian tc thi c xc nh t thi gian bn rn c hon
thnh cho n thi gian bn tip theo kt thc. R rng, mt chu k bn rn R
gm ba phn: khong thi gian thit lp U, khong thi gian bn rn , v giai
on nhn ri I. k hiu l E[R], E[], v E[I] l mc trung bnh ca cc chu k
bn rn R, thi gian bn rn , v thi gian nhn ri I, tng ng, chng ta c
trong E[U] c nh ngha trong (13.1), v E[] v E[I] c a ra di

y.
Q l s khung d liu (data frames) c xc nh khi bt u ca mt thi
gian bn rn . Cc P.G.F. Q(z) ca Q c cho bi
Mi khung d liu phn u ca mt thi gian bn rn s gii thiu mt

thi gian subbusy . Mt thi gian subbusy ca mt khung d liu bao gm
cc giai on truyn B ca khung d liu ny v tng cc khong thi gian
subbusy pht sinh bi tt c cc frame d liu n trong khong thi gian
truyn B ca khung d liu ny. Tt c cc thi gian subbusy a ra bi cc
khung d liu phn u ca thi k bn rn kt hp lm mt h thng thi
gian bn rn , v vy chng ta c
Vi AB l s lng cc khung d liu n trong khong thi gian truyn B trnh

by trong phn. 13.2.
Xem qu trnh n ca h thng ny l qu trnh Bernoulli, cc P.G.F. (z) ca
c th th thu c nh sau:
trong hiu sut trung bnh E [] ca nh sau:
12
TS. Nguyn Hng Sn
T (13.18), chng ta c th c c P.G.F. (z) ca nh
Tch phn (13.20) i vi z ti z = 1 v s dng (13.19), gi tr trung bnh E []

ca sau thu c nh sau:
Thi gian nhn ri I l mt interarrival cn li; do c tnh khng nh v mt

hnh hc ca thi gian interarrival, chng ta c th tnh gi tr trung bnh E[I]
ca I nh sau
Thay th (13.21) v (13.22) n (13,17), E[R] trung bnh ca chu k bn rn R

c th c tnh nh sau:
4. Phn tch hiu sut cho cc loi khc nhau ca ARQ

Da trn phn tch trnh by trong Mc. 13.3, chng ti c th c c cc s o
hiu nng sau y ca h thng.
4.1.
Bin php tnh hiu sut
Thi gian p ng T c nh ngha l tng s chm tr ca mt khung d liu.

Trong phn tch ca chng ti, T ny c chia thnh hai phn. Mt l thi gian
13
TS. Nguyn Hng Sn
ch i W ca khung d liu ny, l thi gian dnh cho cc b m trc khi

truyn dn ca n. Ci khc l tng ng thi gian truyn B ca khung d liu ny.
Trung bnh E[T] ca T c a ra nh sau:
E[T] = E[W]+ E[B].
(13.24)
Thay th (13.16) n (13,24), ta c
Cc t l thit lp c nh ngha l s ln m h thng i vo giai on thit

lp U trong mt khe. C mt khong thi gian thit lp U trong chu k bn rn R.
Cc thit lp t l c th c a ra bi
Thay th (13.23) n (13,26), ta c
Chng ta xc nh offered load l con s trung bnh ca khung d liu thc s

truyn i trong mt khong thi gian truyn B, do offered load c cho bi
4.2.
Phn tch hiu sut cho ARQ
Trong tiu mc ny, chng ta trnh by cc phn tch hiu sut cho cc phng
php ARQ. C ba loi chng trnh ARQ c bn: Stop-and-Wait, Go-Back-N, v
Selective-Repeat. Cc nguyn tc v s khc bit gia cc phng php ARQ khc
nhau c th hin trong hnh. 13,1-13,3. cung cp cho cc cng thc cho
nhng bin php hiu qu cho cc loi khc nhau ca cc phng php ARQ, cc
gi nh v nhng quan nim sau y c gii thiu.
14
TS. Nguyn Hng Sn
(1) Cc mng truyn ti ca khung ACK v khung NACK khng c li, v

di ca khung ACK v khung NACK c b qua.
Stop and Wait
Go back N
Selective repeat
(2) T l li truyn dn l e (0 e 1). Mi khung d liu truyn vi xc sut v
= 1- e (0 v 1), v mi khung d liu c truyn ti hoc truyn li cho
n khi tip nhn ng l t c.
(3) Thi gian round-tripgi nh l khe d nh mt tham s h thng.
Hy N l s ln truyn cn thit cho mt khung d liu c nhn c mt
cch chnh xc. Sau , s phn b xc sut v P.G.F. N (z) ca N c th
c quy nh nh sau:
15
TS. Nguyn Hng Sn
4.2.1. H thng Stop-and-Wait

Trong h thng vi mt Stop-and-Wait, chng ta biu th bi B SW(z), E [BSW], v
B(2)SW cc P.G.F. B (z), trung bnh E[B], v thi im th 2 B (2) ca qu trnh truyn
B, tng ng. T (13.25), chng ti c th tnh thi gian trung bnh E[T] k hiu l
E [TSW] cho mt Stop-and-Wait nh sau:
Mi truyn trong mt Stop-and-Wait s mt 1 + d khe, khng quan trng cho vic

truyn ti l chnh xc hay khng. V vy, B SW(z) [3], E [BSW], v BSW(2) c quy
nh nh sau:
Thay th (13.32) n (13.27) v (13.28), chng ta c th thit lp t l SW v

offered load SW nh sau:
16
TS. Nguyn Hng Sn
4.2.2. H thng Go-back-N

Trong h thng vi mt Go-Back-N, chng ta biu th bi B GBN(z), E [BGBN], v
B(2)GBN cc P.G.F. B (z), trung bnh E[B], trung bnh E[B], v thi im th 2 B (2)
ca qu trnh truyn B, tng ng. T (13.25), chng ti c th cung cp thi gian
trung bnh E [T] k hiu l E [TGBN] cho mt Go-Back-N nh sau:
Trong mt Go-Back-N, mi li truyn chim 1+ d khe, v vic truyn ti chnh xc

cui cng c mt khe cm. V vy, G BN(z) [3], E[BGBN], v BGBN(2) c quy nh
nh sau:
17
TS. Nguyn Hng Sn

4.2.3. H thng Selective-repeat

Trong h thng vi mt Selective-Repeat, chng ta biu th bi B SR(z), E[BSR], v
B(2)SR cc P.G.F. B(z), trung bnh E[B], v thi im th hai B (2) ca qu trnh
truyn B, tng ng. T (13.25), chng ta c th cung cp thi gian phn ng
trung bnh E[T] k hiu l E [TSW] cho mt Stop-and-Wait nh sau:
Mi qu trnh truyn trong mt Selective-Repeat, khng c vn cho d l

ng hay khng, c mt khe. V vy, B SR(z), E [BSR], v BSR(2) c quy nh nh
sau:
18
TS. Nguyn Hng Sn

5. Kt qu m phng
Ph hp vi cc ng dng mng khng dy ph bin, chng ta cho tc
truyn l 50 Mbps. m bo rng cc tn hiu xung t mi nht c cm
nhn bi cc my pht trc mt khung d liu c gi hon ton ra ngoi,
chng ti gi nh kch thc ca mt khung d liu l 1250 byte v chu k l 0.1
ms. Khong thi thit lp U tun theo phn phi hnh hc vi gi tr trung bnh l
0.2 ms.
ng thi cng tnh ti cc d liu pht sinh trn ng truyn internet. Chng ta
gi s kch thc
( +1 )
, k =0,1,2, , khi
l Pareto(c , ) phn phi vi k =c k
c l nhn t chun cho
k =1 , v tham s
k=1
lin quan n tham s Hurst (H)
xc nh bi H=(3 )/2,0.5< H < 1 , 1< < 2 . Cc kt qu nh hn th cng

c nhiu pht sinh trn ng truyn Internet. c bit khng c s t tng ng
khi =2 . Mt s nghin cu cho thy rng ch truyn ti ca cc trnh duyt
19
TS. Nguyn Hng Sn
cho thy t tng ng vi =1.161.5 v d liu ca cc ngun tn hiu vi

nhau s t tng ng vi =1.2
Vi cc thng s ny, chng ti cho thy cc thit lp t l
lng nh l hm ca tc ti
g=1 0
v cng lu
(l/khe) cng vi tc ca li
truyn dn e=0.1 di mc pht sinh =1.2,1.6,2 .0 tng ng. i vi s

khc nhau gia ci loai an ARQ trong hnh 13.4-13.9, khi =2.0 iu c
ngha rng thc t y khng c s t tng ng.
Trong hnh 13.4 13.5, chng ta th hin lm sao ci t t l cng vi tc
ti
v tc ca li truyn dn
=1.2,1.6,2 .0
e=0.1
di mc pht sinh
cho an ARQ khc. Cn lu rng i vi tt c cc thng s
pht sinh, thit lp t l tri qua mt chiu hng 2 giai on. Trong giai on
1, cu hnh
s tng ln cng vi tc ti
g . Trong giai on ny, tc
ti g l tng dn, s lng khung d liu ti trong thi gian rnh I l ln

nht, v thi gian cn cho qu trnh thit lp s di hn. Trong giai on 2 cu hnh
s gim cn tc ti
th tng ln. Trong giai on ny th tc ti
l tng dn, s lng khung d liu ti trong thi gian bn l ln nht,

v v cc khung d liu c th c truyn trc tip m khng cn bt k qu trnh
thit lp no.
20
TS. Nguyn Hng Sn
Hnh 13.4 : Thit lp t l cho qu trnh dng v ch ca ARQ
Hnh 13.5 : Thit lp t l cho qu trnh quay li N ca ARQ
21
TS. Nguyn Hng Sn
Hnh 13.6 : Thit lp t l cho qu trnh chn gi li ca ARQ

y c mt gi tr ln nht ca thit ly t l cho tt c cc tham s pht
sinh v n cng c th quan st thy tham s pht sinh l ln nht. V
chng ta c th kt lut rng nu chng ta b qua bt k s t tng quan no ca
lu lng Internet th t l thit lp s b overeanluated
Trong hnh 13.7 13.9 chng ta so snh cng lu lng
li ng truyn
=1.2,1.6,2 .0
e=0.1
so vi tc ti
cng vi tc
di mc pht sinh
cho an ARQ khc. C th tm c vi vic tng tc ti
, cng lu lng
tng cho tt c an ARQ v tt c cc thng s
pht sinh. Cn lu rng cho cng tc ti th thng s pht sinh l nh,

cng lu lng s l ln cho tt c an ARQ. Do chng ta c th kt
lun rng nu t tng quan khng c cn nhc th cng lu lng
b underevaluated
22
TS. Nguyn Hng Sn
Hnh 13.7 Cng lu lng cho qu trnh dng v i ca ARQ
Hnh 13.8 Cng lu lng cho qu trnh quay li N ca ARQ

Do c thi im u tin l s giai tha hu hn v thi im th 2 l s giai tha
v hn ca mt bin ngu nhin phn phi Pareto, mt s bin php thc hin khc
nh thi gian phn ng trung bnh E[T] trong hnh 13.24 n rt kh tnh ton v
phn tch. V vy chng ta ch trnh by xu hng thay i ca thi gian phn ng
trung bnh E[T] bng cch s dng m phng.
23
TS. Nguyn Hng Sn
Khng c s hm Pareto no trong cng c m phng nh Matlab, v vy chng ta

s dng mt phng php hm nghch o to ra cc chui ngu nhin theo
phn b Pareto
Hnh 13.9 Cng lu lng cho qu trnh chn gi li ARQ

Bng 13.1
Phn b ri rc c m t nh sau:
m
pk =P { X =k } , k 0,
F ( m )= p k , m 0.(13.41)
k=0
Bng cc s dng cc hng to s ngu nhin nn chng ta to c s nhn nhiu

ca a 1 x n vector tn l M m cc thnh phn c phn b u trong khong
(0,1). Mt khc theo phng php hm nghch o chng ti a ra mt vector
khc 1 x n tn N cc thnh phn c thit lp bi N (i ) =min {m: F ( m ) > M ( i ) } , vi
24
TS. Nguyn Hng Sn
c a nh trong hnh 13.41 v m 1,i 1 . Vi phng php ny th

d liu trong vector N s l phn b Pareto.
F (m)
Xu hng thay i ca thi gian p ng trung bnh E[T] cho n ARQ khi
=1.2 v e=0.1
vi g c th hin trong bng 13.1. Vic tnh ton hnh ng
ca thi gian p ng trung bnh E[T] cho an ARQ khi =1.2 v g=0.04
vi tc li khc nhau e c th hin trong bng 13.2.
T bng 13.1 v 13.2 chng ta thy c vi vic tng tc ti g hay tng tc
li e th thi gian p ng trung bnh E[T] lun tng v c xu hng ti v cng
cho tt c cc n ARQ. iu ny l do s t tng quan v c th hin trong
kch thc ca hng i khung d liu, ni ln c l do v sao hiu sut mng b
suy gim trong lu lng t tng quan.
Bng 13.2
6. Kt lun
Chng ny, chng ti trnh by mt phng php mi phn tch hiu sut ca
h thng internet c tin cy cao trong ng truyn t tng quan vi n
ARQ. Xt v bn cht t tng quan th n th hin trong ng truyn internet
v cc thit lp th tc ca mt kt ni d liu, chng ta xy dng 1 h thng hng
X
i Geom /G /1 vi mt mc tiu thit lp. Chng ti phn tch phn b n

nh ca h thng, suy ra c hm to ra bin nhu nhin ca hng i v thi
gian ch ca h thng. Tng ng chng ta a ra cng thc cho cc phng php
hiu qu v thi gian phn ng, t l thit lp, v cng lu lng cho cc loi
n ARQ khc nhau. Chng ti trnh by kt qu tnh ton nh gi v so snh
cc bin php thc hin, v cho thy nh hng ca mc burst trong giao thng
t tng t v s chm tr trong trnh thit lp v hiu nng h thng.
25

Phân Tích Phương Pháp ARQ Trong Lưu Lư NG T Đ NG B

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Phân Tích Phương Pháp ARQ Trong Lưu Lư NG T Đ NG B

Uploaded by

Copyright:

Available Formats

Pht hin suy gim hiu sut TCP s dng thng k Link Utilization

TS. Nguyn Hng Sn

B THNG TIN & TRUYN THNG

PHT HIN SUY GIM HIU SUT TCP S

TS. Nguyn Hng Sn

ARQ stop and wait (dng v i).....................................................................3

Phng php Go back N...................................................................................4

Phng php Selective repeat............................................................................... 5

Phn tnh hiu sut................................................................................................... 8

Phn tch hiu sut cho cc loi khc nhau ca ARQ.....................................................13

Bin php tnh hiu sut....................................................................................13

Phn tch hiu sut cho ARQ.............................................................................. 14

TS. Nguyn Hng Sn

ARQ stop and wait (dng v i)

TS. Nguyn Hng Sn

Phng php Go back N

TS. Nguyn Hng Sn

ca s W ln 1. Nh vy tng s khung m pha thu phi x l ti mt thi

Phng php Selective repeat

TS. Nguyn Hng Sn

Do ch nhng gi li c pht li, trnh t nhn c cc gi khng ng nh

TS. Nguyn Hng Sn

TS. Nguyn Hng Sn

Cho E[U] v E[B] l trung bnh ca U v B trong khe, chng ta c:

Vi k l xc sut m k khung d liu trong mt hng trn mi khe. c bit, 0

iu kin ergodic l = E[]E[B] < 1, vi c gi l offered load.

Vi U((z)) v B((z)) l hm xc nh ca U(z), B(z), v (z).

3. Phn tnh hiu sut

TS. Nguyn Hng Sn

th (n+1), v biu th s d liu khung n trong mt khe di iu kin

T (13.6), ta c P.G.F Q(z) ca Q(z) nh sau:

Vi P{Q = 0} l xc sut khng c khung d liu no c truyn trong h

S dng cc iu kin bnh thng v quy tc LHospital cng th (13.9), ta

Thay (13.10) vo (13.9), th P.G.F. Q(z) ca Q c nh sau:

TS. Nguyn Hng Sn

Phng trnh (13.11) cho thy Q c th chia lm 2 phn (Q = Q 0 + QU), vi Q0

V P.G.F. QU(z) ca QU c cho bi:

Da trn nh ngha trn, ta c th tnh trung bnh E[Q] ca Q t (13.11) nh

TS. Nguyn Hng Sn

Vi Wg(z) v J(z) l P.G.F ca Wg v J

Tham kho [3], vi (B (z)) a ra trong (13.5), ta c

Thay th (13.14) v (13.15) vo (13,13), sau cc gi tr P.G.F. W (z) v trung

TS. Nguyn Hng Sn

Tip theo, chng ta xc nh cc chu k bn rn gi l "chu k bn rn R" l

trong E[U] c nh ngha trong (13.1), v E[] v E[I] c a ra di

Mi khung d liu phn u ca mt thi gian bn rn s gii thiu mt

Vi AB l s lng cc khung d liu n trong khong thi gian truyn B trnh

trong hiu sut trung bnh E [] ca nh sau:

TS. Nguyn Hng Sn

T (13.18), chng ta c th c c P.G.F. (z) ca nh

Tch phn (13.20) i vi z ti z = 1 v s dng (13.19), gi tr trung bnh E []

Thi gian nhn ri I l mt interarrival cn li; do c tnh khng nh v mt

Thay th (13.21) v (13.22) n (13,17), E[R] trung bnh ca chu k bn rn R

4. Phn tch hiu sut cho cc loi khc nhau ca ARQ

Bin php tnh hiu sut

Thi gian p ng T c nh ngha l tng s chm tr ca mt khung d liu.

TS. Nguyn Hng Sn

ch i W ca khung d liu ny, l thi gian dnh cho cc b m trc khi

Thay th (13.16) n (13,24), ta c

Cc t l thit lp c nh ngha l s ln m h thng i vo giai on thit

Thay th (13.23) n (13,26), ta c

Chng ta xc nh offered load l con s trung bnh ca khung d liu thc s

Phn tch hiu sut cho ARQ