TP CH KHOA HC, i hc Hu, Tp 74A, S 5, (2012), 109-119

NH GI HIU NNG CA MT S C CH QUN L HNG I TCH

CC DA TRN KCH THC HNG I V TI NP
Nguyn Kim Quc1, V Thanh T2
1
2

Trng i hc Nguyn Tt Thnh

Trng i hc Khoa hc, i hc Hu

Tm tt: Internet phi i mt vi s bng n v s lng my tnh kt ni v s a dng

ca cc lp ng dng trin khai trn n. Qun l hng i tch cc l mt trong cc gii
php cho iu khin trnh tc nghn trn Internet. Trong nhng nm gn y, cc nh
nghin cu v mng xut nhiu c ch qun l hng i tch cc. Bi bo ny thc
hin nh gi hiu nng ca cc c ch qun l hng i tch cc da trn kch thc hng
i v ti np, phn lp v ng dng cc c ch thch nghi vi mi trng mng khc
nhau.

1. t vn
C ch kim sot trnh tc nghn l mt trong nhng vn m bo truyn
thng lin tc v hiu qu trn mng Internet. p ng yu cu trn, cc nh khoa
hc khng ngng nghin cu ci tin cc giao thc iu khin t u cui n u
cui (end-to-end) nhm nng cao hiu nng ca giao thc TCP, nh: TCP NewReno,
Vegas, Vegas-A [4] v ci tin cc phng php qun l hng i tch cc, nh: REM,
FRED, BLUE [3,4,6] ti cc nt mng trung tm. Thng qua cc c ch , mi nt
mng kim sot c s lng ln cc gi d liu n ng thi trong hng i ca
b nh tuyn. Bi bo tp trung nghin cu mt s gii php gii quyt vn trnh tc
nghn trong mi trng mng c mt gi tin dy c. Thm vo , chng ti cng
xc nh c cc tham s iu khin ti u p ng thch nghi nhng thay i
tc thi ca mng truyn thng a phng tin. Qua , chng ti nh gi v so snh
cc c ch qun l hng i tch cc cho ph hp vi tng loi mng v tng lp ng
dng da trn cc kt qu m phng trn NS-2 [11].
Phn tch hiu qu mt s c ch qun l hng i tch cc da theo kch thc
hng i
C ch qun l hng i tch cc da theo kch thc hng i c nghin
cu nhiu trong thi gian qua, nh: RED, FRED, ARED [7,14,16 ]. Cc c ch ny da
trn xc sut hy b sm ngu nhin ca cc gi tin theo cng thc:
pb max p

k minth
maxth minth
109

(1)

110

nh gi hiu nng ca mt s c ch qun l hng i tch cc

Khi kch thc hng i trung bnh k nh hn mc ngng nh nht minth th

khng c gi tin no b nh du (hay gn xc sut nh du bng 0). Khi kch thc
hng i trung bnh ln hn mc ngng ln nht maxth th tt c cc gi n u b
nh du v trn thc t cc gi c th b loi b (hay gn xc sut nh du bng 1).
Khi kch thc hng i trung bnh nm trong khong gi tr ngng nh nht minth v
gi tr ngng ln nht maxth th mi gi n u c nh du bng mt xc sut pb.
Kch thc hng i trung bnh c s dng vi mc ch l trnh s dao
ng qu nhanh ca hng i khi c nhng t gi gi tin vi thi gian ngn. RED tnh
ton k vi h s mi khi c gi tin n theo cng thc sau:
k = (1 ) k + k

(2)

Vi (0 1) l trng s hng i v k l kch thc hng i hin thi.

Nu gi tr ca nh, th gi tr trung bnh s c khuynh hng t thay i, v s t b
nh hng i vi nhng t gi gi tin ngn.
Do vy, RED t ra km hiu qu khi c s thay i nhanh chng mt gi tin
vo hng i. C th l cc tham s iu chnh km thch nghi lm tng s gi tin ri,
nn ngi ta ci tin bng ARED da vo vic thay i tham s maxp ph hp trong
trng hp s lung n ng thi ln [14]. Tuy nhin nhng ci tin ny ch c
ngha cho cc loi gi tin c cng dch v [19]. T ra i mt s c ch qun l
hng i da vo ti np nh BLUE, SFB (Stochastic Fair Blue) [19,20].
3. Phn tch hiu qu mt s c ch qun l hng i tch cc da ti np
Ngy nay, mi trng mng c nhiu lung n ng thi kh ph bin. Do vy,
BLUE l c ch qun l hng i theo ti np hiu qu hn phng php da vo kch
thc hng i trung bnh [20]. iu ny tng phn mt cch r rng vi tt c cc
thut ton iu khin hng i tch cc bit, bi cc thut ton ny s dng khng
gian ca hng i nh l mt tiu chun trong vic iu khin trnh tc nghn.
BLUE s dng mt bin xc sut pm gn cho cc gi tin khi chng vo hng i.
Xc sut ny tng/gim mt cch tuyn tnh ty thuc vo t l ri gi tin hay mc s
dng ng truyn. Nu nh hng i lin tc hy b cc gi tin v nguyn nhn trn
hng i, BLUE s tng pm v nh vy tng mc nghim trng ca thng bo tc
nghn m n gi tr v ngun. Ngc li, nu nh hng i tr nn trng hoc ng
truyn ri, BLUE gim xc sut pm. iu ny cho php BLUE t iu chnh tc cn
thit gi thng bo tc nghn tr li ni gi hoc cho ri gi tin bng cch:
da trn mc mt gi: if ((now last_update) > freeze_time) then
pm = pm + 1 v Last_update = now

(3)

hoc da trn kt ni ri: if ((now last_update) > freeze_time) then

pm = pm 2 v Last_update = now

(4)

NGUYN KIM QUC, V THANH T

111

trong :
pm

: Xc sut nh du hoc loi b gi tin

: Lng tng ca pm

: Lng gim ca pm

now

: Thi gian hin hnh

last_update

: Thi gian cui cng pm thay i

freeze_time

: Lng thi gian gia cc thay i thnh cng

Lng tng ca pm th hin bi 1 v lng gim ca pm c th hin bng 2.

i lng ny lun c cp nht khi c s thay i ca pm , khi kch thc hng i
vt qu gi tr ngng hin ti, ti tc 1/freeze_time. Tham s freeze_time th hin
khong thi gian gia cc ln cp nht thnh cng pm.
4. Gii php tch hp c ch qun l hng i da vo kch thc hng i v ti
np
Vic s dng cc c ch qun l hng i da trn kch thc hng i ch c
hiu qu i vi mng t c s thay i lu lng vo, cn c ch qun l hng i da
trn ti np th p ng nhanh trong mng c nhiu lung n ng thi. V vy, vic
kt hp hai c ch ny rt c ngha cho mi trng mng phc tp hin nay, l c
ch: REM (Random Exponential Marking), GREEN (Generalized Random Early
Evasion Network).
4.1. Nguyn l hot ng ca REM
tng ca REM l n nh ti u vo v nng lc lin kt ca hng i, bt
k s lng ngi s dng chia s lin kt [13,17,18]. Mi hng i ra ca b nh
tuyn c ci t c ch REM v duy tr mt bin gi l pire. Price nh l mt yu t
nh gi tc nghn. Price c cp nht, nh k hoc khng ng b, da trn bt i
xng ca ti v bt i xng kch thc hng i. S bt i xng ca ti l s khc bit
gia tc ca cc lung d liu vo v nng lc hin c ca lin kt ti b nh tuyn. S
bt i xng ca kch thc hng i l s khc bit gia yu cu kch thc hng i
mong mun vi kch thc hng i hin c ca b nh tuyn.
Mc Price ny tng ln nu tng trng lng ca cc bt xng ny l dng v
gim i trong trng hp ngc li. Tng trng lng l dng khi mt trong cc u
vo vt qu kh nng lin kt hoc c qu nhiu gi tn ng trong hng i cn c
xa v m trong cc trng hp ngc li. Khi s lng ngi s dng tng, tc l s
khng ng b gia cc ti vi kch thc hng i tng, Price s tng v do xc sut
tc nghn c thit lp tng. iu ny s gi mt tn hiu tc nghn mnh m hn n
cc ngun pht, yu cu cc ngun pht gim tc pht. Khi ti ngun qu nh, s
khng ng b s m, Price gim, xc sut c thit lp gim v ti ngun c yu

112

nh gi hiu nng ca mt s c ch qun l hng i tch cc

cu tng ln cho n khi s bt xng v khng. Gi s kch thc hng i pl(t) trong
giai on t c cp nht theo cng thc sau:
*

pl (t 1) [ pl (t ) ( l (bl (t ) bl ) xl (t ) cl (t ))]

(5)

Trong , >0 v l>0 l cc hng s nh v [z]+=max{z,0}. y, bl(t) l kch

thc hng i trung bnh ca hng i l thi im t v bt* 0 l chiu di hng i
mc tiu, x(t) l tc ti trung bnh ca hng i l thi im t, v cl(t) bng thng
cho php ca hng i l ti thi im t. S khc bit v tc ti l xl(t) - cl(t) v ca
kch thc hng i bl(t) - bt* . Cc hng s l c th c thit lp bi mi hng i
mi ring l v c cp nht theo hiu sut v tr mi hng i. Cc hng kim
sot p ng ca REM thay i ty theo iu kin mng.
Mc d REM qun l hng i tch cc theo kch thc hng i v ti np,
nhng REM cn t ra thiu tnh cn bng v s bng thng ca ng truyn cha cao.
V vy, c ch qun l hng i GREEN ra i.
4.2. Nguyn l hot ng ca GREEN
Bng thng ca mt kt ni ph thuc nhiu yu t, trong c RTT v xc sut
m cc gi tin b nh ri trong mng. Bng thng mt kt ni p ng cc phng
trnh (6):
BW

MSS c

(6)

RTT p

Trong , BW l bng thng/thng lng ca kt ni, MSS l kch thc ti a

phn on, RTT l thi gian i vng gi tin, p l xc sut mt gi tin v c l mt hng s
ph thuc vo chin lc bo nhn c s dng v trng thi cc gi tin b mt nh k
hoc ngu nhin.
Gi s c N lung ang hot ng mt b nh tuyn vo v mt lin kt ra c
nng lc L. GREEN xem xt mt lung c hot ng nu n c t nht mt gi tin
i qua cc b nh tuyn trong mt ca s c thi gian nht nh. Chia s cng bng
bng thng cho mi lung l L/N. Thay L/N cho BW trong phng trnh trn, ta c xc
sut mt mt gi tin p, l:
N MSS c
p

L RTT

(7)

S dng gi tr ca p thng bo tnh trng tc nghn, GREEN buc cc lung

chia s cn bng tc gi. V p ph thuc vo s lng lung v RTT mi lung,
thng bo tc nghn s tch cc hn khi cho N ln v RTT nh.
5. nh gi hiu nng
Da trn cc kt qu nghin cu ca cc m hnh qun l hng i phn trn,
chng ti tin hnh ci t cc m hnh trn phn mm m phng NS-2

NGUYN KIM QUC, V THANH T

113

5.1. M hnh mng m phng

M hnh mng trong sut qu trnh thc nghim c m t theo m hnh sau:
iMac

iMac

iMac

iMac

i Mac

iMac

Hnh 1. M hnh m phng

Trong m phng, chng ti s dng N lung TCP v M lung UDP (gi tr ca

N, M c th thay i tin cho vic nh gi). Cc ng truyn t ngun TCP v
UDP n nt c chai v t nt c chai n cc ch u c bng thng l 100Mbps, cn
tr thay i t 1 n 20ms.
ng truyn c chai trong kch bn l lin kt gia hai b nh tuyn. Chng
ti t bng thng ti ng truyn ny l 45Mbps v tr l 20ms. B nh tuyn ti
nt tht c chai c ci t cc thut ton nh gi. Kch thc hng i ti nt tht
c chai thay i tng trng hp tin nh gi.
Ngoi ra, cc tham s nh kch thc gi tin ca c lung TCP v UDP u
c thit lp l 1000 Byte, kch thc ca s TCP l 2000 gi v tc truyn ca
lung UDP thay i trong m phng lm c s nh gi. Thi gian chn lm m
phng l 60 giy.
5.2. nh gi cc c ch theo kch thc hng i thay i
Th nghim vi 200 kt ni TCP qua ng truyn c chai, ln lt ci t c
ch qun l hng i tch cc RED, BLUE, REM v GREEN ti b nh tuyn tht c
chai vi gii hn kch thc hng i thay i t 100 n 1000 gi tin. Chng ti thu
c kt qu nh sau:
Xc sut mt gi tin: T th Hnh 2, chng ti thy rng khi kch thc hng
i tng th xc sut mt gi tin ti hng i ca hu ht cc thut ton u gim. Ring
RED c gia tc gim ln nht, gim t 4.7% xung 2%, nhng RED lun c xc sut
mt gi tin ln nht. GREEN v BLUE c t l mt gi tin nh nht, k c khi kch
thc hng i nh.

114

nh gi hiu nng ca mt s c ch qun l hng i tch cc

Hnh 2. T l mt gi tin ca cc thut ton theo kch thc hng i

Kch thc hng i trung bnh: Da vo kt qu m phng v th Hnh 3

biu din t l ca s dng kch thc hng i ca cc thut ton, chng ti nhn thy
rng: RED l thut ton s dng hng i nhiu nht v GREEN s dng hng i t
nht trong tt c cc trng hp.

Hnh 3. Hng i trung bnh ca cc thut ton theo kch thc hng i

5.3. nh gi cc c ch da trn ti np thay i

Th nghim vi kch thc hng i 200 ti c chai, ci t c ch qun l hng
i tch cc RED, BLUE, REM v GREEN ti b nh tuyn tht c chai vi s lung
kt ni TCP thay i t 10 n 300 thay i ti ngun pht. Chng ti thu c kt
qu nh sau:
Xc sut mt gi tin: th trn Hnh 4 th hin xc sut mt gi tin ca cc c
ch. Khi s lung kt ni nh (t ti) th t l mt gi tin ca cc thut ton rt thp, hu
ht di 1%. Nhng khi s lng kt ni tng (tng ti) th t l mt gi tin ca cc thut
ton tng dn. RED th hin r nht v s mt gi tin khi s lng kt ni tng. Ngc

NGUYN KIM QUC, V THANH T

115

li, GREEN lun th hin s n nh khi tng ti, v GREEN c t l mt gi tin thp
nht khi s lng kt ni ln n 300.

Hnh 4. T l mt gi tin ca thut ton theo s lung

Kch thc hng i: Hnh 5 th hin kch thc hng i trung bnh ca cc
thut ton. RED c kch thc hng i ln nht, c bit khi s lng kt ni ln th
kch thc hng i trung bnh ca RED gn xp x vi ngng maxth. Thut ton
BLUE c kch thc hng i trung bnh kh nh (chim t hn 30% gii hn khng
gian hng i).

Hnh 5. Kch thc hng i trung bnh cc thut ton khi s lung

5.4. So snh v phn lp cc c ch qun l hng i nh sau

Chng ta thy rng, hu ht cc c ch s dng thc o v tc nghn pht
hin v gii quyt vn ny da trn kch thc hng i, ti np. Ngoi ra, cng c
mt s thut ton b sung thm thng tin v lung pht hin tc nghn. tng hp
s phn lp ny, chng ti a ra bng tm tt c tnh cc c ch trong Bng 1 nh
sau:

nh gi hiu nng ca mt s c ch qun l hng i tch cc

116

Bng 1. Phn lp cc thut ton

RED BLUE

C ch

Phn
lp

REM

GREEN

Da vo kch thc hng i

Da vo ti np

Da vo hiu sut s dng ng truyn

Da vo thng tin lung

Mnh

Yu

Thch nghi
iu
khin
lung Khng thch nghi

Trong cc thut ton xut, RED ch da vo kch thc hng i pht

hin tc nghn m khng s dng thng tin v lung. RED khng pht hin v hn ch
c lung khng hi p. khc phc c vn ny, BLUE s dng s kin mt
gi tin (da vo ti np) v lch s hiu sut s dng ng truyn iu khin tc
nghn. Tuy vy, BLUE cng khng pht hin v hn ch c lung khng hi p.
REM v GREEN da vo kch thc hng i v ti np iu khin tc nghn,
nhng GREEN t ra thut ton mnh v ph hp vi nhiu mi trng mng. Tt c cc
thut ton u cung cp hiu qu s dng ng truyn cao.
Cng vi vic phn lp cc thut ton, chng ti a bng tm tt vic so snh
hiu nng ca cc thut ton t a ra gii php ng dng chng vo mi trng
mng:
Bng 2. nh gi hiu nng cc thut ton

RED

BLUE

REM

GREEN

Thng lng

Va

Cao

Cao

Cao

T l mt gi tin

Cao

Thp

Va

Thp

Khng gian b m

Ln

Nh

Va

Nh

C ch

6. Kt lun
Qua bi bo chng ti phn tch c hat ng ca cc c ch qun l hng
i khc nhau. T a ra c cc bng so snh v nh gi mc hiu qu ca
tng c ch qun l hng i khc nhau, nh t Bng 1 v 2 chng ta thy rng: Nu
kch thc b m ln, chng ta c th dng c ch RED, cn nu kch thc b m
nh chng ta c th dng BLUE. Tuy nhin, GREEN l thut ton m bo s cng
bng gia cc lung, c kh nng hn ch lung khng thch nghi (bo v lung yu,
chng li lung mnh v hn ch lung khng hi p). Do , vi mi trng mng c

NGUYN KIM QUC, V THANH T

117

hn hp cc lung ny, nu c khng gian b m nh v ti ln th c th s dng

GREEN. V vy, c th ni GREEN l c ch nng cao hiu nng TCP tt nht. Trong
thi gian tip theo chng ti s nghin cu ci tin s hot ng ng b ca cc c ch
qun l hng i tch cc trong mi trng mng th h mi.

TI LIU THAM KHO

[1]. Apu Kapadia, Wu-chun Feng and Roy H. Campbell, GREEN: A TCP Equation-Based
Approach to Active Queue Management, U.S Department of Energy through Los
Alamos National Laboratory contract W-7045-ENG-36, 2011.
[2]. Arash Dana and Ahmad Malekloo, Performance Comparison between Active and
Passive Queue Management, IJCSI International Journal of Computer Science Issues,
Vol. 7 Issue 3 No 5, (2010).
[3]. Arkaitz Bitorika, Mathieu Robin, Meriel Huggard and Mc Goldrick, A Comparative
Study of Active Queue Management Schemes, Department of Computer Science Trinity
College Dublin, Ireland, 2011.
[4]. Bartek Peter Wydrowski, Techniques in Internet Congestion Control, Electrical and
Electronic Engineering Department The University of Melbourne, 2003.
[5]. Bartek Wydrowski and Moshe Zukerman, GREEN: An Active Queue Management
Algorithm for a Self, ARC Special Research Centre for Ultra-Broadband Information
Networks, EEE Department, The University of Melbourne, Parkville, Vic. 3010,
Australia, 2010.
[6]. G.Thiruchelvi and J.Raja, A Survey On Active Queue Management Mechanisms,
IJCSNS International Journal of Computer Science and Network Security, Vol.8 No.12,
(2008).
[7]. Go Hasegawa and Masayuki Murata, Analysis of dynamic behaviors of many TCP
connections sharing Tail-Drop - RED routers, CybermediaCenter, Osaka University,
Japan, 2003.
[8]. Himanshu Chandra, Ajay Agarwal and T. Velmurugan, Analysis of Active Queue
Management Algorithms & Their Implementation for TCP/IP Networks Using OPNET
Simulation Tool, International Journal of Computer Applications (0975 8887), Vol.6
No.11, (2010).
[9]. Jae Chung and Mark Claypool, Analysis of Active Queue Management, Computer
Science Department Worcester Polytechnic Institute Worcester, MA 01609, USA,
2008.
[10]. K.Chitra and G.Padamavathi, Classification and Performance of AQM-Based

118

nh gi hiu nng ca mt s c ch qun l hng i tch cc

Schemes for Congestion Avoidance, (IJCSIS) International Journal of Computer
Science and Information Security, Vol.8 No.1, (2010).
[11]. Kevin Fall and Kannan, The ns Manual, A Collaboration between researchers at UC
Berkeley, LBL, USC/ISI, and Xerox PARC, 2010.
[12]. Long Le, Kevin Jeffay, F. Donelson Smith, A Loss and Queuing-Delay Controller for
Router Buffer Management, Proceedings of the 26th IEEE International Conference on
Distributed Computing Systems (ICDCS06), 2006.
[13]. Long Le, Jay Aikat, Kevin Jeffay and F. Donelson Smith, The Effects of Active Queue
Management and Explicit Congestion Notication on Web Performance, IEEE/ACM
Transactions On Networking, Vol.15 No.6, (2007).
[14]. Minseok Kwon and Sonia Fahmy, A Comparison of Load-based and Queue-based
Active Queue Managgement Algorithms, Dept. Of computer Science, Purdue
University, West Lafayette, IN 47906-1398, USA, 2010.
[15]. Mujdat Soyturk, Design and Analysis of TCP/IP Networks, M.Soyturk, Design and
Analysis of TCP/IP Networks, G.Y.T.E., Spring, 2011.
[16]. Sanjeewa Athuraliya, Steven H. Low, Victor H. Li and Qinghe Yin, REM Active
Queue Management, IEEE Network, (2006).
[17]. Shakeel Ahmad, Adli Mustafa, Bashir Ahmad, Arjamand Bano And Als Ammarraie
Hosam, Comparative Study Of Congestion Control Techniques In High Speed Networks,
IJCSIS, Vol.6 No.2, (2009).
[18]. T.Bhaskar Reddy, Ali Ahammed and Reshma Banu, Performance Comparison of
Active Queue Management Techniques, IJCSNS International Journal of Computer
Science and Network Security, Vol.9, No.2, (2009).
[19]. Wu-chang Feng, Kang G. Shin, Dilip D. Kandlur, Debanjan Saha, The BLUE Active
Queue Management Algorithms, IEEE, (2006).
[20]. Wu-chang, Fengy Dilip, D. Kandlurz Debanjan and Sahaz Kang G. Shin, BLUE-A
New Class of Active Queue Management Algorithms, Department of EECS Network
Systems Department University of Michigan, (2009).

NGUYN KIM QUC, V THANH T

119

PERFORMANCE EVALUATION OF SOME ACTIVE QUEUE

MANAGEMENT MECHANISMS BASED ON QUEUE SIZE AND LOADING
Nguyen Kim Quoc1, Vo Thanh Tu2
1
2

Nguyen Tat Thanh University

College of Sciences, Hue University

Abstract. The Internet is facing an explosion in the number of connected computers and
the diversity of application layers deployed on it. Active queue management is one of the
solutions to congestion control on the Internet. In recent years, network researchers have
proposed various mechanisms for active queue management. This paper will evaluate the
performance of the mechanisms of active queue management basing on queue size and
traffic load, in order to classify and implement these mechanisms to adapt to different
network environments.