Bao Cao

TRNG I HC KHOA HC T NHIN
KHOA CNG NGH THNG TIN

B MN H THNG THNG TIN
LA PHNG THANH L TH THANH THY
NGHIN CU K THUT CNG TC KHO D LIU LU

GIA CC CLIENTS TRONG H THNG THNG TIN DI NG
DA TRN KIN TRC P2P
KHA LUN TT NGHIP C NHN CNTT
TP. HCM, 2010
TRNG I HC KHOA HC T NHIN

KHOA CNG NGH THNG TIN
B MN H THNG THNG TIN
LA PHNG THANH - 0612390

L TH THANH THY - 0612440
NGHIN CU K THUT CNG TC KHO D LIU LU

GIA CC CLIENTS TRONG H THNG THNG TIN DI NG
DA TRN KIN TRC P2P
KHA LUN TT NGHIP C NHN CNTT
GIO VIN HNG DN

Th. S NGUYN TRN MINH TH
KHA 2006 - 2010
LI CM N
Sau su thng tm hiu v thc hin, kha lun Nghin cu k thut cng tc
kho d liu lu gia cc clients trong H thng thng tin di ng da trn kin
trc P2P trn c bn hon thnh. t c kt qu nh hm nay chng em
c gng rt nhiu v cng c s gip , s ng h ca gia nh, cc thy c v
bn b.
Trc ht, chng em xin chn thnh cm n Khoa Cng Ngh Thng Tin,
trng i Hc Khoa Hc T Nhin TpHCM to iu kin thun li cho chng em
thc hin kha lun tt nghip ny.
Chng em xin by t lng bit n su sc n c Nguyn Trn Minh Th
tn tnh hng dn, ch bo chng em trong sut thi gian thc hin kha lun.
Chng con xin chn thnh cm n ng B, Cha M chm sc, nui dy
chng con thnh ngi.
Xin chn thnh cm n cc thy c, cc anh ch v cc bn ng h, gip
v ng vin chng em trong thi gian hc tp v nghin cu.
Kha lun hon thnh vi mt s kt qu nht nh, tuy nhin vn khng
trnh khi sai st. Knh mong s ng gp kin ca cc thy c v cc bn.
Sinh vin thc hin

La Phng Thanh L Th Thanh Thy
07-2010
Khoa Cng Ngh Thng Tin

B mn H Thng Thng Tin
CNG CHI TIT

Tn ti: Nghin cu k thut cng tc kho d liu lu gia cc clients trong
H thng thng tin di ng da trn kin trc P2P.
Gio vin hng dn: Ths. Nguyn Trn Minh Th
Sinh vin thc hin:
La Phng Thanh
MSSV: 0612390
Email: phuongthanh712@gmail.com
in thoi: 0902054500
L Th Thanh Thy
MSSV: 0612440
Email: thanhthuy1240@gmail.com
in thoi: 0908195336
Loi ti: Nghin cu v th nghim
Mc tiu ti:
Ngy nay cng ngh thng tin (CNTT) ni chung v h thng thng tin di
ng ni ring pht trin mt cch mnh m cng vi s pht trin ca k thut
mng khng dy kt hp vi cc loi thit b di ng ngy cng hin i mang
li nhiu tin ch cho ngi dng trong vic trao i thng tin v d liu. H thng
thng tin di ng c pht trin u tin vi kin trc mng client/server. M
hnh mng client/server c rt nhiu im u vit, ni bt l mi x l s nm trn
server, do trnh cho cc client nhng tnh ton nng n. Tuy nhin vi s pht
trin khng ngng ca h thng thng tin di ng th kin trc mng client/server
khng cn ph hp v gy ra nhc im khi s lng my khch tng ln. L do
ii
chnh l khi s lng my khch tng ln th nhu cu truy xut d liu v bng
thng tng, dn n server gim kh nng cung cp dch v cho cc clients. c
bit trong mi trng mng khng dy kt ni yu hoc thng xuyn mt kt ni
th kin trc client/server ny hon ton khng cn ph hp na. khc phc cc
nhc im ca kin trc client/server, cc nh khoa hc nghin cu a ra mt
m hnh kin trc mi ph hp trong mi trng h thng thng tin di ng, l
m hnh cng tc chia s d liu v thng tin gia cc clients vi nhau hn ch
vic truy xut n server.
i vi m hnh ny th client l cc thit b di ng c kh nng x l, lu
tr. Tuy nhin cc thit b di ng hn ch v nng lng, kh nng tnh ton v
khng gian lu tr thp, v vy ngi ta mun cc thit b di ng chia s cng tc
kho lu tr (cache). Vic ny gip gim thi gian ch v tng kh nng ly c
d liu trong mt mi trng t kt ni.
Nhiu cng trnh nghin cu a ra cc chin lc v k thut lu tr li
d liu (caching). Cc k thut x l, lu tr hiu qu gip tng hiu sut ca m
hnh cng tc chia s d liu. T gim chi ph truyn thng gia cc client v
server cng nh rt ngn thi gian hi p truy vn d liu.
Do , mc tiu ca chng ti t ra trong ti ny l nghin cu tm hiu
cc m hnh cng tc chia s d liu trong h thng thng tin di ng. Sau , xy
dng v hin thc ha mt kin trc h thng, ci t th nghim kim tra tnh
hiu qu ca kin trc.
Ni dung ti:
Tm hiu cc m hnh cng tc chia s d liu trong cc h thng thng tin di
ng. i vi mi m hnh tm hiu cn nm c thng tin v tng, gii
php thc hin v nh gi c cc u khuyt im ca tng m hnh.
T hin trng kho st sinh vin xy dng m hnh cng tc chia s d liu trong
h thng thng tin di ng. Trong m hnh xut cn quan tm n vn iu
phi truy vn cho cc thit b ln cn ng thi x l h tr truy vn cho nhiu
hng mc d liu.
xut gii php lu tr, chia s, truy vn d liu cho m hnh ngh, trong
iii
gii php thc hin sinh vin c th k tha hoc k tha c ci tin hoc xut
gii php mi thc hin cho m hnh xut.
Xy dng ng dng th nghim cho m hnh xut.
So snh, nh gi vi cc gii php ca cc m hnh xut theo tng tiu
ch t ra trong kin trc h thng thng tin di ng (nu c th).
nh gi nhn xt cho m hnh sau khi chy thc nghim vi cc b d liu
nh gi c hiu qu ca vic chia s d liu trong m hnh ngh.
Yu cu t c:
V mt l thuyt:
o Nghin cu m hnh cng tc chia s d liu trong h thng thng tin di
ng
o xut m hnh truy vn a d liu cho h thng thng tin di ng c p
dng kin trc P2P v xy dng gii php, thut ton hin thc ha
m hnh
V mt ng dng:
o Ci t v nh gi hiu qu gii php ngh.
o ng dng minh ha
K hoch thc hin:
Giai on 1:(T 20/12/2009 15/03/2010) Thu thp, nghin cu, tng hp ti
liu tham kho
Kho st m hnh cng tc chia s d liu p dng trn mi trng di ng.
nh gi cc m hnh
xut m hnh v la chn gii php lu tr, chia s, truy vn d liu
trong m hnh cng tc d liu trn h thng di ng
Giai on 2:(T 16/03/2010 15/05/2010) Ci t th nghim
Trin khai ci t th nghim m hnh v gii php lu tr, chia s, truy
vn d liu
Xy dng ng dng minh ha
Giai on 3:(T 16/05/2010 30/06/2010) nh gi, kim nghim v vit bo
iv
co
Kim tra tnh ng n ca chng trnh.
Hon thin cc chc nng cn li.
M rng chc nng nu c. Hon thin bo co lun vn.
Xc nhn ca GVHD
Ngy
thng
nm 2010
SV thc hin
Th.S Nguyn Trn Minh Th
La Phng Thanh L Th Thanh Thy
MC LC
LI CM N ...................................................................................................... i
CNG CHI TIT ...................................................................................... ii
MC LC ...........................................................................................................vi
DANH MC HNH V .................................................................................... xii
DANH MC CC BNG ................................................................................xiv
TM TT ........................................................................................................xvii
Chng 1 - M U ...........................................................................................1
1.1 Gii thiu ti ............................................................................................1
1.2 Mc tiu ti ..............................................................................................2
1.3 Hng tip cn v gii quyt bi ton ...........................................................2
1.4 Ni dung ti .............................................................................................3
Chng 2 - TNG QUAN V M HNH CNG TC CHIA S D LIU
TRONG MI TRNG DI NG ........................................................................5
2.1 Gii thiu m hnh cng tc chia s d liu ..................................................5
2.1.1 nh ngha m hnh cng tc chia s d liu ..........................................5
2.1.2 u im ca m hnh cng tc chia s d liu .......................................6
2.2 Cc chin lc qun l v thay th kho lu tr trong m hnh cng tc ........6
2.2.1 Thut ton thay th (Replacement Algorithm) ........................................6
2.2.1.1 Thut ton da trn vng nh tm (Temporal Locality Based
Algorithm) ........................................................................................................6
2.2.1.2 Thut ton da trn li ch (hoc da trn chi ph):..........................7
2.2.2 Chin lc nht qun kho lu tr ...........................................................7
2.2.3 Chin lc iu phi truy vn v tng hp d liu .................................7
2.3 S lc cc cng trnh nghin cu v cng tc chia s d liu ......................7
2.3.1 Dn nhp................................................................................................7
2.3.2 Kin trc MIX........................................................................................8
2.3.2.1 Phng thc hot ng .................................................................. 10
2.3.2.2 Kin trc v nguyn l hot ng .................................................. 10
vi
2.3.3 K thut lu tr theo nhm v truy vn tng hp d liu phn tn ....... 14

2.3.3.1 K hoch truy vn d liu ti mt MU da trn chin lc lu tr
nhm .............................................................................................................. 14
2.3.3.2 Xy dng k hoch truy vn d liu ti nhiu MU da trn chin
lc lu tr nhm ........................................................................................... 16
2.3.4 Chin lc thay th cache vi gi tr LUV ........................................... 20
2.3.5 CCCM - Kin trc cng tc chia s kho lu tr .................................... 22
2.3.5.1 Lu tr .......................................................................................... 23
2.3.5.2 Khm ph ...................................................................................... 23
2.3.5.3 Nht qun ...................................................................................... 24
2.3.5.4 Thay th ........................................................................................ 25
2.4 So snh nh gi cc gii php ................................................................... 27
2.4.1 Bng so snh nh gi cc gii php .................................................... 27
2.4.2 nh gi u im, khuyt im ca cc gii php ................................ 27
2.5 Kt lun ...................................................................................................... 29
Chng 3 - XUT KIN TRC MNG P2P TRONG MI TRNG DI
NG ...................................................................................................................... 30
3.1 Dn nhp .................................................................................................... 30
3.2 Kin trc h thng thng tin di ng p dng mng P2P............................. 32
3.2.1 Gii thiu ............................................................................................. 32
3.2.2 Phng thc hot ng ca h thng.................................................... 32
3.3 Kin trc v nguyn l hot ng ............................................................... 34
3.3.1 Lp Cooperative Caching Process ........................................................ 35
3.3.1.1 Lp Local Cache Process............................................................... 35
3.3.1.2 Lp Zone Process .......................................................................... 36
3.3.1.3 Lp Routing Process...................................................................... 36
3.3.2 Lp Query Process ............................................................................... 37
3.3.2.1 Module Local Query .................................................................. 37
3.3.2.2 Module Zone Query ................................................................... 37
3.3.2.3 Module Route Query .................................................................. 37
3.4 Thut ton x l ti MU ............................................................................. 38
vii
3.4.1 Lung x l ti lp Cooperative Caching Process ................................ 39

3.4.1.1 Lung x l ti lp Local Cache Process ....................................... 39
3.4.1.1.1 Thut ton phn loi d liu .................................................... 39
3.4.1.1.2 Thay th d liu ...................................................................... 40
3.4.1.1.3 Thay i ph hp vi truy vn a hng mc ............................ 40
3.4.1.2 Lung x l ti lp Zone Process .................................................. 42
3.4.1.2.1 Thut ton Lu tr thng tin trong bng RRT ...................... 42
3.4.1.2.2 Thut ton nh tuyn trong vng ....................................... 44
3.4.1.3 Lung x l ti lp Routing Process .............................................. 44
3.4.2 Lung x l ti lp Query Process ....................................................... 45
3.4.2.1 Thut ton x l module Local Query ........................................... 45
3.4.2.2 Thut ton x l module Zone Query ............................................ 47
3.4.2.2.1 Thut ton x l ti MU d liu khi nhn c JoinResquest t
MU ngun ................................................................................................... 47
3.4.2.2.2 Thut ton x l ti MU ngun khi nhn c RJoinRequest t
MU d liu ................................................................................................. 49
3.4.2.2.3 Thut ton x l ti MU d liu khi nhn c DataRequest t
MU ngun ................................................................................................... 51
3.4.2.2.4 Thut ton x l tng hp d liu ti MU d liu ................... 52
3.4.2.3 Thut ton x l module Route Query ........................................... 53
3.5 Xy dng c s d liu............................................................................... 55
3.5.1 Cu trc lu tr .................................................................................... 55
3.5.2 Cu trc x l ...................................................................................... 58
3.6 Kt lun ...................................................................................................... 59
Chng 4 - XY DNG CHNG TRNH M PHNG ............................. 61
4.1 Gii thiu ................................................................................................... 61
4.2 Network Simulation 2 NS2 ...................................................................... 61
4.2.1 Gii thiu ............................................................................................. 61
4.2.2 Kin trc ca NS2 ................................................................................ 61
4.3 Cu trc chng trnh m phng ................................................................ 62
4.4 Chng trnh to kch bn m phng E-MIX Demo ................................ 63
viii
4.4.1 Gii thiu ............................................................................................. 63

4.4.2 Giao din chnh ca E-MIX Demo ....................................................... 64
4.4.2.1 Mn hnh Main........................................................................... 65
4.4.2.2 Mn hnh Configuration node..................................................... 66
4.4.2.3 Mn hnh Model......................................................................... 67
4.4.2.4 Mn hnh Animation .................................................................. 68
4.4.2.5 Mn hnh Result ......................................................................... 69
4.5 Thc thi kch bn m phng ....................................................................... 70
4.6 Kin trc E-MIX ........................................................................................ 70
4.6.1 Giao thc EMIXAgent ..................................................................... 70
4.6.2 K thut lu tr trong kin trc E-MIX ................................................ 71
4.6.2.1 Lp RRT ....................................................................................... 71
4.6.2.2 Lp MyCache ................................................................................ 73
4.6.2.3 Lp numNeighNeigh ..................................................................... 75
4.6.2.4 Lp MyList ................................................................................... 75
4.6.2.5 Lp EMixAgent ............................................................................ 77
4.6.3 K thut x l trong kin trc E-MIX .................................................. 83
4.6.3.1 Lp RRT ....................................................................................... 83
4.6.3.2 Lp MyCache ................................................................................ 84
4.6.3.3 Lp MyList ................................................................................... 86
4.6.3.4 Lp numNeighNeigh ..................................................................... 87
4.6.4 K thut truyn v nhn gi tin trong giao thc .................................... 87
4.6.5 Danh sch cc gi tin s dng trong giao thc E-MIX ......................... 89
4.6.6 K thut to gi tin .............................................................................. 89
4.6.7 Gi gi tin............................................................................................ 91
4.6.8 K thut xp lch thi gian ................................................................... 91
4.6.9 S lung x l thng tin cc module ca giao thc EMixAgent ...... 93
4.6.10 Bin dch NS-2................................................................................... 94
4.7 Kt lun ...................................................................................................... 94
Chng 5 - KT QU M PHNG ................................................................ 95
5.1 Gii thiu ................................................................................................... 95
ix
5.2 M phng kim nghim kin trc ............................................................... 95

5.2.1 Cc tiu ch m phng th nghim ....................................................... 95
5.2.1.1 Tiu ch 1: T l a yu cu ln knh uplink ................................ 95
5.2.1.2 Tiu ch 2: Thi gian p ng ca mt yu cu d liu .................. 95
5.2.1.3 Tiu ch 3: S lng thng ip ca mt yu cu d liu ............... 96
5.2.1.4 Tiu ch 4: S lng thng ip ca mt yu cu d liu ............... 96
5.2.1.5 Tiu ch 5: S lng thng ip trung bnh ca mt yu cu d liu
....................................................................................................................... 96
5.2.2 Th nghim kim tra tnh hiu qu ca kin trc E-MIX...................... 96
5.2.3 Cc trng hp th nghim kin trc E-MIX ....................................... 97
5.3 Cu hnh m phng chung .......................................................................... 98
5.3.1 Cu hnh tham s th nghim ............................................................... 98
5.3.2 B d liu th nghim.......................................................................... 99
5.3.3 Kch bn v kt qu th nghim E-MIX-3............................................ 99
5.3.3.1 M phng 10 MUs......................................................................... 99
5.3.3.1.1 Tiu ch s lng thng ip ca mt yu cu d liu ............. 99
5.3.3.1.2 Tiu ch thi gian p ng ca mt yu cu d liu............... 101
5.3.3.2 M phng 20 MUs....................................................................... 103
5.3.3.2.1 Tiu ch s lng thng ip ca mt yu cu d liu ........... 103
5.3.3.3 M phng 30 MUs....................................................................... 107
5.3.3.3.1 Chi tit qu trnh chn la DN gi d liu ti QN trong
trng hp th nghim 3 ........................................................................... 107
5.3.3.4 M phng 40 MUs....................................................................... 111
5.3.3.4.3 Tiu ch t l a yu cu ln knh uplink ............................. 114
5.3.3.5 M phng 50 MUs....................................................................... 115

5.3.3.6 M phng 60 MUs....................................................................... 118
5.3.4 nh gi kt qu th nghim E-MIX ................................................. 121
5.4 Kt lun .................................................................................................... 123
Chng 6 - KT LUN ................................................................................... 125
6.1 Kt lun .................................................................................................... 125
6.2 Hng pht trin lun vn ........................................................................ 125
TI LIU THAM KHO ............................................................................... 127
xi
DANH MC HNH V
Hnh 2-1 M hnh kin trc h thng ...........................................................................9
Hnh 2-2 Nguyn l hot ng ca kin trc ............................................................. 10
Hnh 2-3 Kin trc ti MU ........................................................................................ 11
Hnh 2-4 M hnh kin trc MIX ............................................................................... 11
Hnh 2-5 X l Routing Process ................................................................................ 13
Hnh 2-6 X l Route Discovery Phase ..................................................................... 13
Hnh 2-7 V d truy vn ti nhiu MU trong Group-Caching based Query Processing
........................................................................................................................... 19
Hnh 2-8 M hnh kin trc h thng ......................................................................... 22
Hnh 3-1 M hnh kin trc h thng mng ............................................................... 31
Hnh 3-2 Nguyn l hot ng kin trc xut........................................................ 33
Hnh 3-3 Kin trc ti mi MU ................................................................................. 34
Hnh 3-4 M hnh kin trc xut ........................................................................... 35
Hnh 3-5 Lung x l ti lp Middleware ................................................................. 38
Hnh 3-6 Module "Cache Management" .................................................................... 39
Hnh 3-7 V d bng RRT ......................................................................................... 43
Hnh 3-8 X l ti MU ngun khi gi thng ip n MUs ln cn ........................... 46
Hnh 3-9 Minh ha qu trnh x l ti MU ngun khi nhn c RJoinRequest t MU
d liu ................................................................................................................ 50
Hnh 3-10 Lu thut ton x l ti MU d liu khi nhn c DataRequest t MU
ngun ................................................................................................................. 51
Hnh 3-11 Lu thut ton x l tng hp d liu ti MU d liu ......................... 52
Hnh 3-12 Thut ton tm kim RD trong cc MUs mng .......................................... 54
Hnh 4-1 NS-2 theo quan im ngi dng ............................................................... 62
Hnh 4-2 Cu trc chng trnh m phng ................................................................ 63
Hnh 4-3 S lin kt cc mn hnh ........................................................................ 64
Hnh 4-4 Mn hnh Main ........................................................................................... 65
Hnh 4-5 Mn hnh "Configuration node" .................................................................. 66
xii
Hnh 4-6 Mn hnh Model ......................................................................................... 67

Hnh 4-7 Mn hnh Animation .................................................................................. 68
Hnh 4-8 Mn hnh "Result" ...................................................................................... 69
Hnh 4-9 V d NS-2 thc thi mt kch bn ............................................................... 70
Hnh 4-10 S lin kt cc lp trong giao thc EMixAgent.................................... 71
Hnh 4-11 S lung x l cc module ca giao thc EMixAgent.......................... 93
Hnh 4-12 Qu trnh bin dch NS-2 .......................................................................... 94
Hnh 5-1 Kt qu s lng thng ip vi s lng 10 MUs ................................... 101
Hnh 5-2 Kt qu thi gian p ng so vi s lng 10 MUs .................................. 103
Hnh 5-4 Kt qu thi gian p ng ca mt RD vi s lng 20 MUs ................... 106
Hnh 5-9 Kt qu tiu ch a yu cu ln knh uplink ............................................ 114
Hnh 5-10 Kt qu s lng thng ip vi s lng 50 MUs ................................. 116
Hnh 5-11 Kt qu thi gian p ng ca mt RD vi s lng 50 MUs ................. 118
Hnh 5-12 Kt qu s lng thng ip vi s lng 60 MUs ................................. 120
Hnh 5-13 Kt qu thi gian p ng ca mt RD vi s lng 60 MUs ................. 121
Hnh 5-14 Thi gian p ng trung bnh ca mt yu cu d liu............................ 122
Hnh 5-15 S lng thng ip trung bnh ca mt yu cu d liu......................... 123
xiii
DANH MC CC BNG
Bng 2-1 Thut ton truy vn ti mt MU trong Group-Caching based Query
Processing .......................................................................................................... 15
Bng 2-2 Thut ton truy vn ti nhiu MU trong Group-Caching based Query
Processing .......................................................................................................... 19
Bng 3-1 M gi thut ton x l thay th d liu ..................................................... 42
Bng 3-2 M gi "X l lu tr thng tin trong RRT" ............................................... 44
Bng 3-3 M gi thut ton "nh tuyn trong vng" ................................................ 44
Bng 3-4 Thut ton ti module "Local Query" ......................................................... 46
Bng 3-5 Thut ton x l ti MU d liu khi nhn c JoinResquest t MU ngun
........................................................................................................................... 49
Bng 3-6 Thut ton x l ti MU ngun khi nhn c RJoinRequest t MU d liu
........................................................................................................................... 51
Bng 3-7 Thut ton x l tng hp d liu ti MU d liu...................................... 53
Bng 3-8 M gi x l thut ton tm kim RD trong cc MUs mng ........................ 55
Bng 4-1 Chi tit cc giao din chnh ca E-MIX Demo ........................................... 64
Bng 4-2 Chc nng mn hnh "Main" ...................................................................... 66
Bng 4-3 Chi tit mn hnh "Configuration node" ..................................................... 67
Bng 4-4 Chi tit mn hnh "Model" ......................................................................... 68
Bng 4-5 Chi tit mn hnh "Animation" ................................................................... 69
Bng 4-6 Chi tit mn hnh "Result".......................................................................... 69
Bng 4-7 Chc nng cc lp trong giao thc EMixAgent .......................................... 71
Bng 4-8 Cu trc d liu ca lp RRT..................................................................... 72
Bng 4-9 Cc hm chc nng ca lp RRT ............................................................... 73
Bng 4-10 Cu trc d liu ca lp MyCache ........................................................... 74
Bng 4-11 Cc hm chc nng ca lp MyCache ...................................................... 75
Bng 4-12 Cu trc d liu ca lp numNeighNeigh ................................................ 75
Bng 4-13 Cu trc d liu ca lp MyList ............................................................... 76
Bng 4-14 Cc hm chc nng ca lp MyList ......................................................... 77
xiv
Bng 4-15 Cu trc d liu lp EMixAgent .............................................................. 80

Bng 4-16 Cc hm chc nng ca lp EMixAgent .................................................. 83
Bng 4-17 K thut x l ti lp RRT ....................................................................... 84
Bng 4-18 K thut tnh gi tr utility trong lp MyCache ......................................... 84
Bng 4-19 K thut x l phn loi v thm d liu trong lp MyCache ................... 86
Bng 4-20 K thut x l ti lp MyList ................................................................... 87
Bng 4-21 K thut x l ti lp numNeighNeigh..................................................... 87
Bng 4-22 Hm comand ............................................................................................ 88
Bng 4-23 Hm recv ................................................................................................. 89
Bng 4-24 Danh sch gi tin ..................................................................................... 89
Bng 4-25 Cu trc thng tin iu hng .................................................................. 90
Bng 4-26 Cu trc thng tin "hdr_cmn *ch=HDR_CMN(Packet *)" ....................... 90
Bng 4-27 Cu trc gi tin "reply_numberNeigh_pkt" .............................................. 90
Bng 4-28 Cc thuc tnh trong gi tin "reply_numberNeigh_pkt" ............................ 91
Bng 4-29 Qu trnh gi gi tin n cc MU xc nh ............................................... 91
Bng 4-30 Lp PktMU_Neighs_Timeout .................................................................. 92
Bng 4-31 Khi ng timeout ................................................................................... 92
Bng 4-32 Phng thc expire .................................................................................. 93
Bng 5-1 Cc trng hp tng qut phn b d liu .................................................. 97
Bng 5-2 Chi tit cc trng hp DN ........................................................................ 97
Bng 5-3 Cc trng hp m phng th nghim kin trc E-MIX-3 ......................... 98
Bng 5-4 Cu hnh tham s th nghim ..................................................................... 99
Bng 5-5 Kt qu s lng thng ip vi s lng 10 MUs .................................. 100
Bng 5-6 Kt qu thi gian p ng ca mt RD vi s lng 10 MUs .................. 102
Bng 5-7Kt qu s lng thng ip vi s lng 20 MUs ................................... 104
Bng 5-8 Kt qu thi gian p ng ca mt RD vi s lng 20 MUs .................. 106
Bng 5-9 Kt qu s lng thng ip vi s lng 30 MUs .................................. 109
Bng 5-10 Kt qu thi gian p ng ca mt RD vi s lng 30 MUs ................ 110
Bng 5-11 Kt qu s lng thng ip vi s lng 40 MUs................................. 112
Bng 5-13 Kt qu tiu ch a yu cu ln knh uplink ......................................... 115
xv

Bng 5-18 Kt qu s lng thng ip trung bnh v thi gian p ng trung bnh vi
tng s lng MUs .......................................................................................... 122
Bng 5-19 So snh vi kin trc MIX ..................................................................... 124
xvi
TM TT
Trong bi cnh mi trng di ng hin nay, cc thit b di ng hn ch v
nng lng, kh nng tnh ton v khng gian lu tr. V vy, khi cc thit b ng
truy vn d liu cn phi tnh ton n hiu qu nng lng, hiu qu x l v hiu
qu lu tr. Trong kin trc client/server, cc client thng xuyn truy vn d liu n
server lm tng chi ph truyn thng, bng thng tng, thi gian hi p di. V vy,
ngi ta mun cc thit b di ng chia s cng tc kho lu tr (cache) gim thi
gian ch v tng kh nng ly c d liu trong mt mi trng t kt ni. V mt
nng lng, cc kin trc cng cn c mt c ch truy vn, tng hp d liu hiu qu
hn.
Nhiu cng trnh nghin cu a ra cc chin lc v k thut lu tr li d
liu (caching). Cc k thut x l, lu tr hiu qu gip tng hiu sut ca m hnh
cng tc chia s d liu. T gim chi ph truyn thng gia cc client v server
cng nh rt ngn thi gian hi p truy vn d liu.
Do , trong ti ny chng ti s tm hiu v cc vn sau:
V mt l thuyt: Nghin cu tm hiu cc m hnh cng tc chia s d liu
trn mi trng di ng.
V mt ng dng: Chng ti hin thc ha mt m hnh cng tc chia s d
liu trong mi trng c s d liu di ng, ci t th nghim thut ton v
a ra kt qu thc nghim cho bi ton.
xvii
Chng 1 - M U
1.1 Gii thiu ti
Theo xu th hin nay, cng ngh thng tin (CNTT) tr thnh mt phn tt
yu trong cuc sng. CNTT h tr trong nhiu lnh vc nh kinh t, thng mi,
dch v, x hi...Vi s pht trin mnh m ca k thut mng khng dy cng vi
cc loi thit b di ng ngy cng hin i mang li nhiu tin ch cho ngi
dng trong vic trao i thng tin v d liu. H thng thng tin di ng c pht
trin u tin vi kin trc mng client/server. Theo kin trc ny, cc my khch
(clients) s kt ni n mt my ch (server) thng qua mt giao thc nht nh
(www, fpt, telnet, ..). M hnh mng client/server c rt nhiu im u vit, ni bt l
mi x l s nm trn server, do trnh cho cc client nhng tnh ton nng n.
Tuy nhin, kin trc mng client/server khng cn ph hp v gy ra nhc
im khi s lng my khch tng ln. L do chnh l khi s lng my khch tng
ln th nhu cu truy xut d liu v bng thng tng, dn n server gim kh nng
cung cp dch v cho cc clients. c bit trong mi trng mng khng dy kt ni
yu hoc thng xuyn mt kt ni th kin trc client/server ny hon ton khng
cn ph hp na. khc phc cc nhc im ca kin trc client/server, cc nh
khoa hc nghin cu a ra mt m hnh kin trc mi ph hp trong mi trng
h thng thng tin di ng, l m hnh cng tc chia s d liu v thng tin gia
cc clients vi nhau hn ch vic truy xut n server.
i vi m hnh ny cc mobile user (MUs) c vai tr nh nhau, mi MU ng
vai tr va l my ch va l my khch. Client l cc thit b di ng c kh nng
x l, lu tr. Tuy nhin cc thit b di ng hn ch v nng lng, kh nng tnh
ton v khng gian lu tr thp, v vy ngi ta mun cc thit b di ng chia s
cng tc kho lu tr (cache). Vic ny nhm gim thi gian ch v tng kh nng ly
c d liu trong mt mi trng t kt ni. Vi c ch ny, kin trc a ra s gii
quyt c vn qu ti do mt s lng ln cc clients truy xut n server, cng
nh vn clients vn hon ton truy xut c d liu trong trng hp my ch
ngng cung cp dch v do mi trng mt kt ni hoc kt ni yu. Bn cnh ,
kin trc c th em li nhiu hiu qu hn trong vic khai thc, tn dng ngun ti
nguyn sn c ca tt c cc MUs trong h thng mng, nh vic phn b lu
lng thng tin khi cn mt cch hp l trnh tc nghn trn mng.
Hin nay hng nghin cu ny ang c xem l vn nng v thu ht,
c nhiu s quan tm, u t ca cc nh nghin cu. y cng l l do chng ti
chn nghin cu v thc hin ti Nghin cu k thut cng tc kho d liu lu
gia cc clients trong H thng thng tin di ng da trn kin trc P2P.
1.2 Mc tiu ti
Trong bi cnh mi trng di ng hin nay, cc thit b di ng hn ch v
nng lng, kh nng tnh ton v khng gian lu tr. V vy, khi cc thit b ng
truy vn d liu cn phi tnh ton n hiu qu nng lng, hiu qu x l v hiu
qu lu tr. Trong kin trc client/server, cc client thng xuyn truy vn d liu
n server lm tng chi ph truyn thng, bng thng tng, thi gian hi p di. V
vy, ngi ta mun cc thit b di ng chia s cng tc kho lu tr (cache) gim
thi gian ch v tng kh nng ly c d liu trong mt mi trng t kt ni.
Nhiu cng trnh nghin cu a ra cc chin lc v k thut lu tr li d
liu (caching). Cc k thut x l, lu tr hiu qu gip tng hiu sut ca m hnh
cng tc chia s d liu. T gim chi ph truyn thng gia cc client v server
cng nh rt ngn thi gian hi p truy vn d liu.
Do , mc tiu ca chng ti t ra trong ti ny l nghin cu tm hiu cc
m hnh cng tc chia s d liu cho h thng thng tin di ng. Sau , xy dng v
hin thc ha mt kin trc h thng, ci t th nghim kim tra tnh hiu qu
ca kin trc.
1.3 Hng tip cn v gii quyt bi ton

Vi mc tiu ti nh vy, gii quyt bi ton chng ti s tm hiu ln
lt cc cng trnh nghin cu v cng tc chia s d liu gia cc thit b di ng,
k thut lu tr li (caching), k thut x l truy vn (query processing), cc vn
nh tuyn (routing). trong mi trng di ng.
Mt s cng trnh m chng ti tm hiu nh: Caching and Query Processing

in MANETs ca tc gi Jinbao Li [7], Cooperative caching in mobile ad hoc
networks based on data utility ca tc gi Narottam Chanda [9], An Improved
Architecture for Complete Cache Management In Mobile Computing Environments
ca tc gi G. AnandHaraj [11]. Sau chng ti rt ra mt s u im v khuyt
im ca tng kin trc, so snh xy dng mt kin trc hiu qu trong mi
trng thng tin di ng.
1.4 Ni dung ti
Vi mc tiu ca ti t ra l nghin cu v tm hiu cc m hnh cng
tc d liu trong h thng thng tin di ng, sau xut mt kin trc v ci t
kim tra tnh hiu qu. Ni dung lun vn c chia thnh cu trc nh sau:
Chng 1: M u
Chng 2: Tng Quan V Cc M Hnh Cng Tc Chia S D Liu Trong Mi
Trng Di ng. Trong chng ny, chng ti s gii thiu mt s m hnh cng
tc chia s d liu trong mi trng di ng, cc thut ton qun l v thay th
kho lu tr, thut ton x l truy vn phn tn. ng thi tm hiu tng chnh
ca cc k thut lu tr trong mi trng di ng.
Chng 3: Kin Trc H Thng Thng Tin Di ng S Dng M Hnh Cng
Tc Chia S D Liu. Trong chng ny, chng ti s tm hiu xut mt kin
trc h thng thng tin di ng hiu qu vn dng m hnh cng tc chia s d
liu.
Chng 4: Ci t Th Nghim. Trong chng ny, chng ti s ci t th
nghim kin trc xut chng 3 kim tra tnh hiu qu.
Chng 5: Kt Qu Th Nghim. Trong chng ny, chng ti trnh by cc kt
qu thc nghim m chng ti ci t v so snh cc kt qu ny vi cc cng
trnh khc kim tra tnh hiu qu.
Chng 6: Tng Kt. Trong chng ny chng ti s tm tt cc vn t
c, nhng vn cn tn ti v hng pht trin trong tng lai.
Chng em c gng hon thnh lun vn mc tt nht. Tuy nhin, do kinh
nghim nghin cu cn non tr v thi gian lm lun vn hn ch nn lun vn c th
cn nhiu thiu st. Chng em xin chn thnh cm n v trn trng nhng kin ng
gp ca Thy C v cc bn hon thin lun vn hn.
Chng 2 - TNG QUAN V M HNH CNG TC

CHIA S D LIU TRONG MI TRNG DI NG
2.1 Gii thiu m hnh cng tc chia s d liu
Vi mc tiu nghin cu, tm hiu v cc m hnh cng tc chia s d liu trong
mi trng h thng thng tin di ng nh c trnh by chng 1, trong chng
ny chng ti s trnh by tng quan v cc m hnh cng tc d liu cng nh trnh
by cc hin trng nghin cu ca cc bi bo v kin trc ny. Bn cnh chng ti
cng a ra bng so snh cc kin trc ca cc nh nghin cu, ng thi rt ra kt
lun v hin thc ha kin trc ra.
phn 2.1, chng ti trnh by cc khi nim tng quan v m hnh cng tc d
liu trong h thng thng tin di ng. Trong phn 2.2, chng ti trnh by v mt s
k thut lu tr, chia s, v truy vn d liu c p dng trong m hnh cng tc d
liu trn mi trng h thng thng di ng. Mt s k thut ny c chng ti p
dng trong kin trc xut c trnh by trong chng 3. phn 2.3 v 2.4, chng
ti trnh by hin trng nghin cu ca cc bi bo v m hnh cng tc d liu v so
snh nh gi cc gii php trong mi bi bo a ra.
2.1.1nh ngha m hnh cng tc chia s d liu
i vi m hnh ny cc mobile user (MUs) c vai tr nh nhau, mi MU ng
vai tr va l my ch va l my khch. Client l cc thit b di ng c kh nng x
l, lu tr. Tuy nhin cc thit b di ng hn ch v nng lng, kh nng tnh ton
v khng gian lu tr thp, v vy ngi ta mun cc thit b di ng chia s cng tc
kho lu tr (cache). Vic ny nhm mc ch gim thi gian ch v tng kh nng ly
c d liu trong mt mi trng t kt ni. Vi c ch ny, kin trc a ra s gii
quyt c vn qu ti do mt s lng ln cc clients truy xut n server, cng
nh vn clients vn hon ton truy xut c d liu trong trng hp my ch
ngng cung cp dch v do mi trng mt kt ni hoc kt ni yu. Bn cnh ,
kin trc c th em li nhiu hiu qu hn trong vic khai thc, tn dng ngun ti
nguyn sn c ca tt c cc MUs trong h thng mng, nh vic phn b lu

lng thng tin khi cn mt cch hp l trnh tc nghn trn mng.
Khi nim cng tc chia s d liu ngy nay ci tin theo nhiu mc ch s dng
khc nhau, khng ch ti u kho lu tr gia cc thit b di ng m cn gim ti bng
thng truy xut n server, c bit trong m hnh mng c nhiu client vi tn sut
truy vn d liu cao.
2.1.2u im ca m hnh cng tc chia s d liu
Nh vic chia s kho lu tr gia cc thit b di ng, m hnh cng tc ny gim
thiu thi gian ch hi p truy vn d liu v tng kh nng ly c d liu trong
mt mi trng t kt ni. V mt nng lng, cc kin trc vi c ch truy vn, tng
hp d liu hiu qu hn gip gim chi ph truyn thng gia cc client v server.
2.2 Cc chin lc qun l v thay th kho lu tr trong m hnh

cng tc
Vi nhng ng dng trong mi trng khng dy v cc thit b di ng, chng ta
s gp phi cc kh khn v qun l d liu, v d nh khng m bo c tnh nht
qun d liu, khng tn dng c khng gian lu tr ton cc Trong phn ny,
chng ti trnh by ngha ca cc k thut qun l kho lu tr, chia s, v truy vn
d liu c nghin cu s dng trong h thng thng tin di ng.
2.2.1Thut ton thay th (Replacement Algorithm)
Thut ton thay th c s dng quyt nh d liu no s b xa khi kho lu
tr y, dnh ch cho mt n v d liu mi. Khi thm mt n v d liu mi,
thut ton thay th s chn n v d liu tn ti c u tin thp nht trong kho
lu tr v tin hnh thay th vi n v d liu mi. Mi thut ton s c mt phng
php nh u tin khc nhau v c phn thnh hai nhm t tng chnh:
2.2.1.1Thut ton da trn vng nh tm (Temporal Locality Based

Algorithm)
Cc thut ton thuc nhm ny nh LRU (Least Recently Used). tng chnh
ca thut ton l ghi nhn thi im cui cng truy cp ca mt n v d liu
chn thay th n v d lu nht cha c truy cp. Do nhn t chnh quyt

nh thay th chnh l tn sut truy xut.
2.2.1.2Thut ton da trn li ch (hoc da trn chi ph):

LUV (Least Utility Value) [9], LRV (Least Relevant Value) [11]. Thut ton ny
chn i tng c gi tr LUV hoc LRV thp nht thay th. Cc gi tri ny c
tnh da trn tn sut truy cp d liu, khong cch, kch thc mc d liu,
2.2.2Chin lc nht qun kho lu tr
Mi n v d liu trong kho lu tr s c gn mt gi tr TTL [9], [11], gi tr
ny c th c lng da trn lch s cp nht ca n v d liu . V d, chng ta
c lng gi tr TTL da trn tui ca mi n v d liu. Khi ngi dng yu cu
n v d liu x, nu thi gian c tr ca n v d liu x vt qu gi tr TTL ca
n th MU ngun s gi mt thng ip n my ch. Da vo s hi p ca MU d
liu, MU ngun c th ly mt bn sao ca x t MU d liu hoc ch dng bng sao
lu tr tr li yu cu (nu n v d liu x khng c b sung k t ln cui cng
c lu tr li).
2.2.3Chin lc iu phi truy vn v tng hp d liu
tng chnh ca chin lc ny l chn la v yu cu cc nt ln cn c
chn tng hp gip cc hng mc d liu. Qu trnh ny nhm gip s dng hiu qu
nng lng cc nt trong mng, gim thi gian, chi ph truy vn d liu. Vic chn
la nt tng hp d liu da trn chi ph tng hp d liu cc nt ng vin, t a
ra k hoch truy vn thch hp v hiu qu [7].
Trong phn tip theo chng ti s trnh by hin trng v cc cng trnh nghin
cu c xut.
2.3 S lc cc cng trnh nghin cu v cng tc chia s d liu

2.3.1Dn nhp
Trong m hnh mng client (hay cn gi MU) base station (hay cn gi l BS)
server, cc client thng xuyn truy vn d liu n server lm tng chi ph truyn
thng, bng thng tng, thi gian hi p di. V vy, ngi ta mun cc thit b di
7
ng cng tc chia s kho lu tr gim thi gian ch v tng kh nng ly c d

liu trong mt mi trng t kt ni. V mt nng lng, cc kin trc cng cn c
mt c ch truy vn, tng hp d liu hiu qu hn.
Trong m hnh cng tc chia s d liu, cc MU l thit b di ng c th truyn
thng v trao i chia s d liu vi nhau. Tuy nhin cc thit b di ng ny c mt
s hn ch nh: b nh lu tr thp, nng lng thp, tc x l chm. Bn cnh
, cc thit b di ng c kh nng di chuyn dn n kh nng thay i m hnh
mng v kh nng mt kt ni gia cc thit b thng xuyn xy ra. V th c
nhiu cng trnh nghin cu ra cc k thut lu tr, truy vn hiu qu trong m
hnh cng tc trn h thng di ng, chng ti s trnh by trong phn tip theo.
Trong h thng thng tin di ng ngy nay, cc nh khoa hc a ra mt m
hnh cng tc chia s d liu c ng dng cho cc thit b di ng. Cc thit b di
ng thng c b nh thp, iu ny lm cho kh nng lu tr ca cc MU b hn
ch.
Nhm tc gi ca bi bo [J.Li_2005] [7] ra chin lc x l truy vn da trn
c ch qun l d liu theo nhm rt ngn thi gian truy xut d liu gia cc MU.
Vi chin lc ny th chi ph giao tip gia cc MU c rt ngn v hiu qu hn.
Trong mi trng di ng, cc MU thng xuyn di chuyn, kh nng mt kt ni xy
ra cao, do nhm tc gi ca bi bo [N.Chand_2007][9], [G.AnandHaraj_2009] [3]
nghin cu cc vn v qun l kho lu tr vi bn vn chnh: lu tr, khm
ph, thay th v nht qun kho lu tr. Vic thay th kho lu tr da vo cc tham s
tn sut truy cp, khong cch, kch thc mc d liu, tng hiu qu qun l kho
lu tr.
2.3.2Kin trc MIX
gii quyt hiu qu vic chia s d liu gia cc MUs trong vng cng tc
nhm h tr vic truy xut d liu, hai sinh vin Phm Minh T H L Th Kim
Nhung xut kin trc MIX trong lun vn c nhn thng 03/2010 [12]. Trong
qu trnh tm nghin cu xut kin trc MIX, nhm tc gi tm hiu cc cng
trnh Caching and Query Processing in MANETs ca tc gi Jinbao Li, a ra gii
php lu tr v thay th d liu theo nhm, cng trnh Improving On-Demand Data
Access Efciency in MANETs with Cooperative Caching ca tc gi Yu Du, xut

ra mt lc cng tc cho cc ng dng truy xut d liu trong mng P2P, chia cc
MU theo vng, t s tm kim d liu yu cu theo vng
Kin trc gm cc phn chnh nh sau: my ch (server), base station (BS), v cc
thit b di ng (MU).
Server: l ni qun l ton b d liu ca h thng v cung cp d liu
cho cc BSs.
BS: l ni lu tr v cung cp d liu cho cc thit b di ng trong
phm vi ca n. Phm vi ca BS l vng din tch m BS c th giao
tip c vi thit b di ng thng qua mng v tuyn. D liu ca
BS c cung cp bi Server thng qua mng hu tuyn.
MU: l cc thit b di ng c kh nng x l thng tin nh PDA,
Laptop Hot ng ca cc MU c chia thnh nhiu vng, mi
vng cha mt s MU, mi MU c th trao i thng tin, d liu vi
MU khc trong cng vng hot ng ca n. Cc MU c th truy xut
d liu t BSs n kt ni c hoc t cc MUs khc thng qua ng
nh tuyn (routing). Lin lc gia cc BSs v MUs cng nh gia cc
MUs thng qua mng v tuyn.
Hnh 2-1 M hnh kin trc h thng
2.3.2.1Phng thc hot ng

Nguyn l hot ng ca kin trc c minh ha Hnh 2-1: Ngi dng s
dng cc thit b di ng (MU) tm kim d liu. Khi yu cu c pht ra, vic
tm kim d liu s c thc hin tm kim cc b ti chnh kho d liu cc b, nu
d liu khng c tm thy ti kho lu tr cc b mi c gi yu cu n cc
MUs khc trong vng hoc n BS c hi p. Nu d liu khng c tm thy
ti MUs ln cn th yu cu s c gi n BS. Tt c cc MUs lin lc u thng
qua mng v tuyn.
Hnh 2-2 Nguyn l hot ng ca kin trc
Trong Hnh 2-2, tc gi nh ngha cc thnh phn trong kin trc xut nh sau:
Nt vng l cc MUs giao tip vi nhau trong phm vi bn knh truyn thng ca MU,
nt mng l cc MUs giao tip vi nhau thng qua MU trung gian(getways). V d
nh trong Hnh 2-2, MU2 c cc nt vng l MU3, MU4, MU9, MU6, cc nt mng l
MU1, MU11,MU5,MU7
2.3.2.2Kin trc v nguyn l hot ng

Trong kin trc cc MUs c th lin lc vi nhau thng qua mng v tuyn v mi
MU gm c ba lp x l chnh: User Application, Middleware v Network Protocol
c th hin Hnh 2-3.
10
Hnh 2-3 Kin trc ti MU
Lp User Application c nhim v nhn yu cu d liu ca ngi dng, chuyn

yu cu n lp Middleware x l, sau tr kt qu v cho ngi dng. Ngi dng
khng cn bit v kin trc mng, trng thi m hnh mng, phng thc x l ca
lp Middleware, ngi dng nhn kt qu tr v nh l mt MU cc b. Lp
Middleware c nhim v nhn yu cu d liu t lp User Application, lp ny c
chia thnh ba lp con: Caching Process, Zone Process, Routing Process. Lp Network
Protocol c nhim v giao tip v truyn thng tin, d liu gia cc thnh phn trong
h thng. Kin trc chi tit ca cc lp c minh ha Hnh 2-4.
Hnh 2-4 M hnh kin trc MIX
Trong Hnh 2-4, nguyn l hot ng ca kin trc ny c th hin: trc tin
MU s tm d liu ti b nh cc b c x l ti lp Caching Process, nu d liu
11
c tm thy, kt qu s tr v cho ngi dng. Ngc li, MU ny gi yu cu n

cc MUs trong vng c x l ti lp Zone Process. Nu d liu c tm thy ti
cc MUs trong vng ca n, n s nhn kt qu tr v t cc MUs trong vng ca n,
n s nhn kt qu tr v t ngi dng. Nu d liu khng c tm thy, n s gi
yu cu d liu n cc MUs xa hn, c gi l cc nt mng.
Lp Caching Process: Mi MU c mt b nh cc b (Local Cache - LC) lu
tr d liu, khi mt hng mc d liu c thm vo LC, lp ny x l thay th d
liu khi cache b y da trn thut ton LRU1. Trong LC, tc gi chia thnh hai loi
n v d liu c lu tr: d liu chnh (Primary Data - PD) v d liu
ph(Secondary Data - SD), trong PD c u tin cao, SD c u tin thp hn.
Khi c mt hng mc d liu mi c thm vo cache, SD c u tin thp nht s
b loi b v hng mc d liu mi s c thm vo. PD c thay th gi tr mi
khi gi tr TTL2 ca n khng cn hp l.
Lp Zone Process: Nu d liu khng c tm thy trong LC, MU s gi yu cu
tm d liu n cc MUs khc trong vng. Lp Zone Process c hai module RRT v
IDNeighs. Mc tiu ca bng RRT l cho bit MU no c d liu yu cu, khi
MU ngun s truy xut n MU ly d liu, trnh tnh trng loang ht (loang
m) n cc MUs khc trong vng. Trong bng IDNeighs ghi nhn cc MUs trong
vng ca MU ngun. Khi d liu yu cu khng c trong RRT ca MU ngun th MU
ngun s gi d liu yu cu n cc nt trong vng ca n.
Lp Routing Process: Khi MU khng tm thy d liu yu cu (Request Data RD) ti cc MUs khc trong vng, MU s gi yu cu n cc MUs trong mng.
Trong k thut nh tuyn, mt MU c th i n cc MUs khc trong mng,
ng nh tuyn s chn v lu li trong MU trung gian no c nhiu MU khc trong
vng ca n nht trong ng nh tuyn. K thut ny lm tng kh nng tm thy d
liu vi s bc nhy t nht. Trong qu trnh da vo nh tuyn n cc MUs
ly d liu, nu tng s bc nhy ln hn R (R l bn knh rng buc s bc nhy
1
LRU (Least Recently Used): tng ca thut ton l chn v thay th cc n v d liu lu
nht cha c truy xut

2
TTL (Time to live): Gi tr TTL c s dng thay th gi tr mi khi chu k sng ca gi tr
khng hp l
12
cho mi MU) th vic tm d liu s c dng li v yu cu ca MU s c gi

n BS yu cu d liu. Qu trnh x l c minh ha Hnh 2-5.
Hnh 2-5 X l Routing Process
Ti mi MUj s gii quyt yu cu d liu da vo kin trc MIX. Lp Routing

Process c 2 module: Route Discovery Phase, Route Selection Phase.
Trong giai on Route Discovery Phase: Nhim v ca module ny l tm cc
MUs c nhiu nt mng nht trong vng bn knh r ca mt MUi bt k. Trong vng
bn knh giao tip r, mi MUi u c thng tin profile ca cc MU trong vng. Profile
ny cho bit thng tin ID ca MU, s lng nt mng n c th lin kt v cc ID nt
mng c th. Qu trnh x l c minh ha nh Hnh 2-6.
Hnh 2-6 X l Route Discovery Phase
13
Trong giai on Route Selection Phase: Nhim v ca module ny l tm MUj c

s nt mng ln nht v gi yu cu d liu da vo nhng thng tin lu ti Route
Cache.
2.3.3K thut lu tr theo nhm v truy vn tng hp d liu phn tn
Bi bo [7] - [Group-Caching] ca nhm tc gi J.Li trnh by nm 2005 c
c cp trong lun vn [12] [MIX_2010]. Nu nh lun vn [12] ch quan tm
n cc k thut gom nhm v chin lc lu tr nhm th chng ti mun cp
thm v k thut truy xut d liu da trn chin lc lu tr nhm. K thut ny
gip h thng c th truy vn d liu phn tn v ti u ha v thi gian, tc x l.
Cc MU c th a ra k hoch truy vn da trn vic qun l chi ph truy vn. Chi
tit v k thut ny, chng ti s trnh by phn tip theo sau y.
2.3.3.1K hoch truy vn d liu ti mt MU da trn chin lc lu tr

nhm
Da vo chin lc lu tr nhm c trnh by trong hin trng ca ti liu
[12], cc MU a ra k hoch truy vn gia cc kho d liu chia s trong v ngoi
nhm. Mt truy vn n gin ti mt bng trong MU c th hin nh sau:
SELECT Node.Table.Attr1, Node.Table.Attr2,..
FROM Node.Table
WHERE <iu kin>
Sau khi nhn mt lnh truy vn t ngi dng, MU c yu cu c gi l
MU truy vn s tin hnh phn tch cu truy vn v khi to mt k hoch truy vn.
Da trn chin lc lu tr nhm, kt qu tr v c th l d liu cc b ca chnh
MU truy vn, d liu t MU khc c lu tr ti MU truy vn hoc ti kho lu tr
nhm, hoc d liu phi ly trc tip t MU khc.
Chi tit thut ton c nhm tc gi cp theo Bng 2-1 nh sau:
1. Nu MU truy vn nhn c mt truy vn
o
NU l truy vn cc b, MU s tm kim trong kho

d liu cc b
NGC LI
Kim tra ch mc lu tr cc b v xc nh tp
14
d liu tha iu kin truy vn (tp so khp)
Chuyn n MU ch cu truy vn m tp so khp

khng tn ti trong kho lu tr cc b.
2. NU MU ch nhn c truy vn
o
NU MU c lu tr d liu (MU d liu) thuc nhm

th gi truy vn n MU d liu
NGC LI, tm kim ch mc trong kho lu tr

nhm, xc nh tp con d liu tha iu kin truy
vn v c lu tr trong nhng MU thuc nhm
Khi to mt truy vn con t truy vn ban u v

tng ng vi tp con d liu trong bc trn
Gi truy vn con va khi to n MU thnh vin

lu tr tp d liu con trong truy vn
3. NU MU d liu nhn c truy vn

o
Thc thi cu truy vn trong d liu cc b hoc

trong ch mc lu tr cc b ca n
Gi kt qu ca truy vn con ny n MU truy vn
4. MU truy vn nhn c tt c kt qu ca cc truy vn

con t nhng MU khc v ly kt qu cui cng.
Bng 2-1 Thut ton truy vn ti mt MU trong Group-Caching based Query

Processing
Trong thut ton ny, bi bo [7] [Group-Caching] trnh by cng thc tnh
thi gian p ng cho mt truy vn. Cng thc c trnh by nh sau:
Gi S l kch thc ca mt n v d liu trong bng truy vn, D l s bc nhy
gia MU truy vn v MU cha d liu, r l t l truy xut kho lu tr, Vdisk l tc
c ca a, Vnet l tc ng truyn khng dy.
Xem r . S l kch thc d liu c th ly t kho lu tr nhm cho mt truy vn, r .
S . Vdisk l thi gian c d liu t a. Trong chin lc lu tr nhm ca bi bo
ny, khong cch ti a gia hai MU trong cng nhm l hai bc nhy. Do nu
kt qu truy vn c ly t ch mc trong kho lu tr nhm, th thi gian ti a
truyn d liu gia hai MU cng nhm l 2 . r . S . Vnet. Tng t vi vic truyn kt
qu gia MU d liu v MU truy vn, xem (1 r) .S l kch thc tp kt qu c th
ly t MU d liu, (1 r) .S .Vdisk l thi gian c d liu t a v (1 r) . S . Vnet .
15
D l thi gian truyn d liu. Nh vy thi gian p ng cho truy vn ti mt MU

c tnh nh sau:
r . S . Vdisk + 2 . r . S . Vnet + (1 r) . S . Vdisk + (1 r) . S . Vnet . D
Vi gi thit l tc c a rt nhanh so vi tc truyn, cng thc trn c
thu gn thnh:
2 . r . S . Vnet + (1 r) . S . Vnet . D
Nu khng s dng chin lc lu tr li nhng d liu t MU khc, thi gian p
ng truy vn s l S . Vnet . D. Vy t l gia vic c v khng s dng kho lu tr s
l (1 r + (2r/D))
Trong bi bo [7] [Group-Caching], cc tc gi a ra cc php ton so snh
hiu qu ca vic s dng kho lu tr theo nhm so vi vic khng s dng kho lu
tr. Tuy nhin nhm tc gi cha a ra cu trc c th cho k thut ny, cng nh
cc bin php gii quyt li pht sinh (nu c), nh l d liu khng tm thy trong
nhm v cc nhm khc th s gii quyt nh th no... Hn na, cc MU trong
nhm ph thuc vo MU ch nhng vi mi trng mng khng dy ty bin cao, rt
d xy ra cc trng hp MU ch b mt kt ni hoc c mc nng lng thp lm
nh hng n lu tr ca cc nhm. Tc gi vn cha a ra cch thc ti cu
trc cc nhm khi cu trc mng thay i. Phn tip theo, nhm tc gi xut vn
truy vn d liu ti nhiu MU da trn chin lc lu tr nhm.
2.3.3.2Xy dng k hoch truy vn d liu ti nhiu MU da trn chin

lc lu tr nhm
Trong chin lc lu tr nhm, nhm tc gi bi bo [7] [Group-Caching] quan
tm n vic xy dng k hoch truy vn d liu trn nhiu MU nhm mc ch ti u
chi ph truy vn.
Trong h thng d liu phn tn di ng, chi ph truy vn thng c xc nh
da vo chi ph truyn thng, kch thc d liu truyn, khong cch ng truyn, v
nng lng ca MU. Bi bo gi lp rng kh nng truy vn v kh nng truyn thng
trong mng khng dy ca tt c MU l nh nhau. Trong mng ty bin khng dy,
chi ph truyn thng l chi ph chnh, c xc nh da trn ng nh tuyn, bng
16
thng, v kh nng truyn thng. Cc tc gi trnh by cng thc xc nh chi ph

truy vn Q nh sau:
Q = S * D + C;
Trong , S l kch thc d liu c truyn, D l s bc nhy trn ng
truyn, C l chi ph truy vn cc b ti MU truy vn hoc MU d liu.
Vic ti u truy vn phn tn l kt qu ca hai qu trnh: ti u cc b v ti u
chi ph x l phn tn. Trong , ti u chi ph x l phn tn thng c xem trng
hn. Bi bo [7] [Group-Caching] a ra tng ti u truy vn, kt hp hai
phng thc trn xy dng k hoch truy vn cho trng hp thu gn vi mt MU
truy vn v hai Mu d liu. tng chnh ca thut ton ny nh sau: Khi nhn c
yu cu t MU truy vn, cc MU d liu cng tin hnh tm kim trong b nh v kho
lu tr cc b nh k hoch truy vn ti mt MU. Tuy nhin, thay v gi trc tip
tp kt qu tm c v cho MU truy vn, th MU d liu s chn la gia ba gii
php: mt l gi kt qu cho MU d liu cn li MU tng hp trc khi gi v
MU truy vn, hai l i kt qu t MU d liu cn li gi n tng hp trc khi
gi v MU truy vn, hoc ba l gi trc tip kt qu v MU truy vn t x l. Cc
MU d liu s chn la gii php c chi ph truy vn ti u nht.
Chi tit thut ton c th c m t theo Bng 2-2 bn di:
1. MU truy vn gi cu truy vn n hai MU d liu
2. Sau khi MU d liu chp nhn truy vn:
o
Thc thi cu truy vn vi danh sch thuc

tnh v iu kin chn ng vi b nh cc b
Tnh khong cch t MU d liu n MU truy

vn (Own_D) v kch thc tp kt qu ca
truy vn con trn d liu cc b (Own_S)
Gi Own_D v thng tin v tp kt qu ca

truy vn con (Info) n MU d liu cn li
3. Sau khi MU d liu nhn c thng tin khong cch

Other_D v kt qu truy vn con Info t MU d liu
kia gi n:
o
Tnh khong cch t chnh n n cc MU d

liu cn li (Between_D), tnh Join_S l
kch thc d liu sau khi kt tp kt qu
17
cc b v tp kt qu t MU d liu kia gi
n (Info)
o
xut ba chn la tng hp kt qu truy

vn con v mu chi ph cho mi trng hp:
P1: c hai MU d liu chuyn kt qu
ca truy vn con v cho MU truy vn t
tng hp.
Q1
Own_S
Own_D
Other_S
Other_D
P2: MU d liu hin ti gi kt qu
n MU d liu cn li. MU d liu cn
li tng hp d liu v tr kt qu
cui cng v cho MU truy vn
Q2
Own_S
Between_D
Join_S*OtherD
P3: MU d liu cn li gi kt qu n
MU d liu hin ti. Mu hin ti s t
tng hp v gi kt qu cui cng v
MU truy vn
Q3 = Other_S*Between_D + Join_S*Own_D
o
Trng hp tng ng vi Q nh nht s c

chn
Nu P1 c chn, MU d liu chuyn
kt qu v MU truy vn
P2 c chn, MU d liu chuyn kt
qu v cho MU d liu cn li
P3 c chn, i kt qu t MU d
liu cn li chuyn ti
4. NU MU d liu nhn thnh cng kt qu truy vn

con t MU d liu cn li:
o
Thc hin php kt gia kt qu truy vn con

cc b vi kt qu truy vn con va nhn
c.
ng gi kt qu cui cng, gi v MU truy

vn
18
5. Nu MU truy vn nhn c gi tin kt qu t MU d

liu, xut kt qu cho ngi dng
6. Nu MU ngun chp nhn hai kt qu ca truy vn

con t MU d liu, thc hin php kt gia hai kt
qu truy vn con. Sau , xut kt qu cho ngi
dng.
Bng 2-2 Thut ton truy vn ti nhiu MU trong Group-Caching based Query
Processing
Qu er yN od e
Qu er yN o d e
Da ta N o de 1
Da ta N o de 2
Da ta N o de 1
Da ta N o de 2
Tr uy v n c on
Tr uy v n c on
Tr uy v n c on
Tr uy v n c on
QueryNode gi truy v n n Datanode s
Cc Da taNode trao i thng tin t ruy vn con
Q uer yN od e
Q u er yN o de
Subquery
Result
Subquery
Result
Da ta N o de 1
Qu er yN o d e
Da ta N o de 2
Da ta N ode 1
Da ta N o de 2
K t t ru y v n con ti
Da ta N o de 1
Da ta N o de 2
K t tru y v n co n ti
Da ta N o de 1
Da ta N o de 2
P lan 1
Plan 2
Plan 3
Three plans query
Hnh 2-7 V d truy vn ti nhiu MU trong Group-Caching based Query

Processing
Bi bo [12] [Group-Caching] trnh by nhng gii php lu tr, thay th,

truy vn d liu da trn chin lc lu tr nhm. Kin trc xut rt ngn c
thi gian p ng truy vn, v gim thng lng bng thng khi truyn gi d liu.
Tuy nhin, vic d liu c cp nht thng xuyn, s hn ch v dung lng b
19
nh, thiu ht bng thng, v tnh di ng ca cc MU trong mng thc s l mt th

thch trong vic qun l kho lu tr. Trong bi bo [9] [LUV], cc tc gi xut
gii php Least Utility Value (LUV) thay th hng mc d liu trong kho lu tr.
Gii php nhm tng kh nng tn ti d liu trong b nh cc b. Chng ti s trnh
by chi tit trong phn tip theo.
2.3.4Chin lc thay th cache vi gi tr LUV
Chin lc thay th hng mc d liu trong kho lu tr c s dng khi MU cn
b sung mt hng mc d liu mi vo kho lu tr, nhng kho lu tr y. Do ,
thc hin vic thm hng mc d liu mi, MU phi quyt nh loi b mt s
hng mc d liu hin c. Trong mng ty bin khng dy, cc thut tan thay th
trong kho lu tr cn gp phi nhng vn sau y: phi x l thay th d liu c
vi kch thc d liu thay i v kch thc hng mc d liu trong mng ty bin
khng dy c th khng c nh; thi gian truyn d liu c th ph thuc vo kch
thc d liu v khong cch truyn nhn gia hai MU, do t l lu tr thnh cng
c th khng phi l thc o chinh xc duy nht trong chin lc thay th d liu.
Trong bi bo [9] [LUV], nhm tc gi xut gii php Least Utility Value (LUV).
Theo , cc hng mc d liu s b loi b khi kho lu tr nu c gi tr utility thp
nht. Vic tnh ton gi tr utility c da trn bn tham s: xc sut truy cp,
khong cch, nhn thi gian, v kch thc d liu. C th vic tnh ton bn tham s
v utility c trnh by nh sau:
Xc sut truy cp (A):
Tham s ny c s dng nhm ngha nhng hng mc c xc sut truy
cp t nht trong kho lu tr s c chn loi b. xc nh xc sut Ai
ca mt hng mc d liu di c truy xut trong tng s ln truy xut n tt
c cc hng mc d liu ti MU ang xt, cc tc gi trnh by cng thc:
Ai = ai / (a1 + a2 + + ai)
Trong , ai l tn sut truy cp ca hng mc d liu di. ai c c lng
l tn sut truy cp trong K ln truy cp gn nht. H thng duy tr nhn thi
gian ca K ln truy cp gn nht (ts1i, ts2i, , tski) i vi mt hng mc d liu di.
Cng thc tnh tn sut truy cp ai c trnh by nh sau:
20
ai = K / (tc - tski)
Trong tcl thi gian hin ti v tski l nhn thi gian ca ln truy cp u
tin trong K ln truy cp gn nht. t kt qu c lng tt nht, nhm tc
gi ty chn gi tr K trong khong 2 hoc 3. Nu mt hng mc d liu c
tng s ln truy cp t trc n nay nh hn K, tn sut truy cp s c tnh
da theo tng s ln truy cp .
Khong cch (dt):
Khong cch c xc nh bng s bc nhy gia MU yu cu v MU
p ng d liu. Tc gi s dng khong cch tnh utility nhm mc ch
u tin gi li cc hng mc c lu tr gc ti nhng MU xa hn. Vic
ny nhm tit kim bng thng v hn ch tr khi phi gi truy vn n
MU gc ly d liu.
Nhn thi gian (TTL):
Nhn thi gian TTLi ca hng mc di cho bit thi gian hp l ca mc d
liu . Nhng hng mc d liu c d liu m khong thi gian hp l cn li
ngn hn s b u tin thay th.
Kch thc d liu (sz):
Nhng hng mc d liu c kch thc ln hn s c u tin thay th
nhng ch cho cc hng mc d liu khc nh hn. Vic ny nhm mc
ch tng s lng hng mc d liu c lu tr, cng ng ngha vi vic
tng s lng yu cu d liu m MU s p ng c.
Da trn nhng tham s c xc nh nh trn, gi tr utilityi ca hng mc di
c tnh ton theo cng thc sau:
Utilityi = Ai.dti.TTLi / szi
Chin lc thay th kho lu tr theo gi tr LUV trong bi bo [9] [LUV] gip
tng kh nng truy cp thnh cng kho lu tr v hn ch tr truy vn. Cng nhm
mc ch gim thiu tr, gim ti mng, v hn ch s ph thuc ca MU vo
server, bi bo [11] [CCCM] xut mt kin trc cng tc chia s kho lu tr. Chi
tit v kin trc ny s c chng ti trnh by ngay sau y.
21
2.3.5CCCM - Kin trc cng tc chia s kho lu tr

hn ch chi ph chia s kho lu tr, ti u ha c ch nht qun v thay th d
liu, G. Anandharaj v R.Anitha xut kin trc Combine and Complete Cache
Manegement (CCCM) nm 2009 [11]. C th, nhm tc gi xut bn thut ton
gii quyt cho bn vn chnh: lu tr (Cache Placement), khm ph (Cache
Discovery), nht qun (Cache Consistency), thay th (Cache Replacement)
Trong kin trc CCCM, hnh mng c chia thnh cc vng nh, gi l cell.
Mi cell c mt Base Station (BS), v mt s Mobile Terminals (MTs). M hnh kin
trc h thng mng c th hin Hnh 2-8. Giao tip gia cc node mng trong v
ngoi cell thng qua BS. Trong m hnh, cho php MT di chuyn trong cell hoc gia
cc cell. Mt MT c th kt ni vi BS qua mng khng dy, hoc khng kt ni
(trng thi power-save)
Gi C1, C2,, Cn, l cc cell trong mng. cell Ci c mt BSi, mt database Dsi, v
tp client S1, S2,, Sm. y xem nh database ch c cp nht bi server.
Hnh 2-8 M hnh kin trc h thng
Mt DSi c th cha nhiu database. Trong kin trc ny, ch xt nhng giao tip,
x l trong phm vi mt cell, khng xt cc trng hp database c cache client
bn ngoi cell, hoay lin lc gia cc client khc cell.
22
2.3.5.1Lu tr
Khc vi cc m hnh chia s d liu khc, ti kin trc CCCM, nhm tc gi
xut tng tuyn chn mt tp nt c bit theo cc tiu ch ring lu tr d liu.
Tp nt c tuyn chn lu tr d liu gi l nhng nt active. Cc tiu ch la
chn tp nt active c nhm tc gi a ra bao gm: bng thng, tc CPU, tim
nng truy xut, t l lu tr thnh cng. Da vo cc tham s , bi bo xut thut
ton chn la tp nt lu tr, c th nh sau:
Vi mi vng Cj, j=1, 2,, n trong hnh mng, xt tt c nt Si, i=1, 2,, m
trong vng. Vi mi nt, nh ngha bn tham s: BWi l bng thng hin ti, SPi l
tc CPU, ALi l tim nng truy xut, CRi l t l lu tr thnh cng. T cc tham
s trn, tnh gi tr Weight (trng s) ca mi nt vi cng thc:
Wi = (BWi + SPi + CRi) / ALi
Tng hp tt c vector {Si, Wi} ng vi mi nt Si v sp xp theo th t gim dn
ca ID nt. Thut ton xc nh c tp nt active Sk, con ca tp nt Si (0 k m)
vi iu kin Wk > , vi l gi tr trng s ti thiu cho trc. Tp nt active ny s
c lu tr d liu.
2.3.5.2Khm ph
Khi c mt yu cu d liu ti nt, nt tm mc d liu trong kho lu tr ca
chnh n. Nu khng tm thy d liu yu cu, nt broadcast gi tin yu cu d liu
n tp nt active.. Khi mt nt active nhn c mt gi tin yu cu d liu, v tm
thy mc d liu trong kho lu tr ca n, n s gi mt gi tin Ack n nt yu cu
xc nhn.
Cc nt di ng thuc tp nt active to thnh h thng kho lu tr hp tc cho cc
nt cn li. C 3 trng hp khi c yu cu d liu ti nt:
-
Local hit: khi bn sao ca d liu yu cu c lu tr trong kho lu tr

ca nt c yu cu. Nu mc d liu vn hp l, n s c rt trch
p ng cu truy vn.
Active hit: Khi d liu yu cu lu ti kho lu tr ca mt hoc nhiu nt

active lng ging ca nt yu cu.
Global hit: d liu phi ly t database server.
23
gii quyt vn khm ph d liu trong m hnh trn, cc tc gi xut thut

ton nh sau:
Khi tp nt active c to, server broadcast vector {Sk, dki} n tt c nt, vi dkj,
j=1, 2,l ch mc n mc d liu c lu tr trong nt nt active Sk, k = 1,
2,Khi ti nt c mt yu cu d liu, u tin, nt tm kim trong kho lu tr ca
chnh n (local hit). Nu khng tm thy, nt broadcast gi tin yu cu n tp nt
active. Khi mt nt active nhn gi tin yu cu, v c d liu yu cu c trong kho lu
tr ca n (active hit), n s gi mt gi tin Ack n nt yu cu d liu xc nhn
n c cha d liu. Gi tin Ack c cc field: nhn thi gian Ts v gi tr trng s W.
Nhn thi gian gip chn bn sao d liu mi nht ca d liu yu cu, gi tr trng s
gip chn nt nt tt nht gi (tng kh nng gi d liu v thnh cng). Khi nt
yu cu d liu nhn li c gi tin Ack t nt active, n chn nt active tt nht vi
max (Ts, W) v gi xc nhn gi tin xc nhn n nt active c chn. Sau , nu
nt c nhn c nhng gi tin ack ca d liu yu cu tng t th nhng gi tin
cng b b qua. Khi nt active tt nht c c gi tin xc nhn, n hi p gi
tr d liu thc c yu cu n nt yu cu
2.3.5.3Nht qun
Cc thut ton duy tr nht qun kho lu tr c chia lm hai dng: stateful
(Kahol et al., 2001) v stateless (Cao, 2003), da vo vic trng thi kho lu tr c
c duy tr nt ngun d liu hay khng. Cc thut ton duy tr nht qun kho lu
tr gn y (Huang et al., 2006, 2007) ch yu l dng stateless.
Kin trc ny xut mt thut ton duy tr nht qun kho lu tr dng stateful,
da trn tng Adaptive Push. Mi nt duy tr gi tr nhn thi gian xc nh thi
gian ht hn ca hng mc c lu tr. y, server s quyt nh tp nt active
thc hin cp nht da theo trng thi (state) kho lu tr ca nt , da trn hai quy
tc:
-
Nu c bt k truy vn no ang thc hin, cp nht nhng bn sao lu tr

cn thit.
Gi thng tin cp nht trc khi nhn thi gian ht hn
24
Nu server cp nht data set DSi, server s quyt nh tp nt active {Sui} c

cp nht, da trn nhn thi gian Ts, ti node Si gn ht hn hay cha.
Sau khi server chn c tp nt active {Sui} cp nht, h thng s dng c ch
sau truyn d liu cp nht n nhng node c chn .
-
Server gi thng ip UPDATE n nt gn nht trong {Sui}
Sau khi nhn c thng ip UPDATE, nt active xc nhn li bng cch

gi thng ip ACK v forward thng ip UPDATE n nt gn tip theo
trong {Sui}
Qu trnh c lp i lp li cho n khi mi nt trong {Sui} nhn c

thng ip UPDATE v gi thng ip ACK ht
Sau khi tng hp cc thng ip ACK, server bit c ID v nhn thi

gian ca cc nt. Server s truyn d liu cp nht ng thi cp nht nhn
thi gian mi cho tt c nt ca {Sui}
Nu sau khi gi thng ip UPDATE mt khong thi gian Ta cho trc,

server cha nhn c thng ip ACK, n s xa ID ca node tng ng
trong {Sui}
2.3.5.4Thay th
Trong kin trc, tc gi xut gi tr Least Relevant Value (LRV) lm c s cho
ch thay th kho lu tr. D liu c LRV nh nht s b xa khi kho lu tr. Vic
tnh ton gi tr LRV c da trn ba tham s: xc sut truy cp, khong cch, v
kch thc d liu. C th vic tnh ton ba tham s v gi tr LRV c trnh by nh
sau:
Xc sut truy cp (A):
Tham s ny c s dng nhm ngha nhng hng mc c xc sut truy
cp t nht trong kho lu tr s c chn loi b. xc nh xc sut Ai
ca mt hng mc d liu di c truy xut trong tng s ln truy xut n tt
c cc hng mc d liu ti MU ang xt, cc tc gi trnh by cng thc:
Ai = ai / (a1 + a2 + + ai)
Trong , ai l tn sut truy cp ca hng mc d liu di. ai c c lng
l tn sut truy cp trong K ln truy cp gn nht. H thng duy tr nhn thi
25
gian ca K ln truy cp gn nht (ts1i, ts2i, , tski) i vi mt hng mc d liu di.

Cng thc tnh tn sut truy cp ai c trnh by nh sau:
ai = K / (tc - tski)
Trong tcl thi gian hin ti v tski l nhn thi gian ca ln truy cp u
tin trong K ln truy cp gn nht. t kt qu c lng tt nht, nhm tc
gi ty chn gi tr K trong khong 2 hoc 3. Nu mt hng mc d liu c
tng s ln truy cp t trc n nay nh hn K, tn sut truy cp s c tnh
da theo tng s ln truy cp .
Khong cch (dt):
Khong cch c xc nh bng s bc nhy gia MU yu cu v MU
p ng d liu. Tc gi s dng khong cch tnh utility nhm mc ch u
tin gi li cc hng mc c lu tr gc ti nhng MU xa hn. Vic ny
nhm tit kim bng thng v hn ch tr khi phi gi truy vn n MU gc
ly d liu.
Kch thc d liu (sz):
Nhng hng mc d liu c kch thc ln hn s c u tin thay th
nhng ch cho cc hng mc d liu khc nh hn. Vic ny nhm mc
ch tng s lng hng mc d liu c lu tr, cng ng ngha vi vic
tng s lng yu cu d liu m MU s p ng c.
Da trn nhng tham s c xc nh nh trn, gi tr LRV Fi ca hng mc di
c tnh ton theo cng thc sau:
Fi = (Ai.dti) / szi
Bi bo [11] [CCCM] xut kin trc vi gii php cho bn vn chnh:
lu tr, khm ph, nht qun v thay th d liu trong kho lu tr. Chin lc thay th
kho lu tr theo gi tr LRV cng gip tng kh nng truy cp thnh cng kho lu tr
v hn ch tr truy vn. Tuy nhin, kin trc cha bn ti tnh di ng ca cc nt,
vic truy xut d liu ch bn ti trong ni b tng vng.
26
2.4 So snh nh gi cc gii php

2.4.1Bng so snh nh gi cc gii php
Vi cc cng trnh nghin cu c tm hiu trn, trong phn ny chng ti lp
bng so snh hiu qu ca cc gii php da trn kh nng chng khc phc c
nhng yu t hn ch trong mi trng tnh ton di ng.
2005
[J.Li_2005]
2007
[N.Chand_2007]
Tiu Ch nh
Gi Gii Php
2009
[G.Anand
Haraj_2009]
2010
[Tu.P.M_
Nhung.H.L.T.
K_2010]
[7] - GroupCaching based
[9] - LUV
[11] - CCCM
[12] - MIX
Lu tr d liu
nh tuyn
Query
Processing
Thay
th
nh
Cu
trc
liu
iu phi truy
vn
2.4.2nh gi u im, khuyt im ca cc gii php

Da vo bng so snh hiu qu cc cng trnh nghin cu trn, chng ti a ra
cc nh gi tng qut v cc gii php trong phn trn. Ngoi ra, chng ti s hin
thc ha li mt s tng ca cc gii php ny v kt hp mt s tng ca
chng ti xut ra mt m hnh cng tc chia s d liu thch hp trong mi
trng di ng, phn ny s c trnh by chng 3.
27
Bng nhn xt tng qut

u im
Khuyt im
Group-Caching Based Query Processing

Lu tr v thay th d Trong trng hp d
liu theo nhm.
liu khng c trong nhm,
C mt MUs ng vai tr hoc nhm khc th Node

l master qun l cc MUs Grouping khng cp
thnh vin trong nhm.
n vn ly d liu t
Qun l bc nhy - Rt server.

ngn thi gian p ng truy Khng gii quyt trng
[7] [Group-Caching]
cp d liu, gim thng hp link-fail.

lng bng thng.
Ch cp n vic
xut tng truy vn phn chia truy vn v tng

nhiu hng mc d liu da hp d liu cho hai nt
trn chin lc lu tr khc, cha xut trng
hp tng qut cho n nt.
nhm.
a ra gii php phn
chia v tng hp cc hng
mc d liu yu cu cho cc
nt khc.
Cooperative caching
Chia cc MUs theo vng, Khng cp chn nt

tm kim theo vng.
lu tr cache.
ra c ch qun l kho Khng cp sa li

[9] [LUV]
lu tr vi y bn vn khi nt di ng.
chnh: lu tr, khm ph, Lu tr nhiu tham s
nht qun, thay th.
lm c s tnh ton, dn
Thay th d liu da trn n tn b nh,

gi tr LUV.
ra tng nh tuyn.
28
CCCM
Chia cc MUs theo vng, B qua trng hp nu
tm kim theo vng.
ti server cng khng tm
ra c ch qun l kho thy d liu.

lu tr vi y bn vn Cha bn ti tnh di
chnh: lu tr, khm ph, ng ca nt, gii quyt
[11] [CCCM]
nht qun, thay th.
khi nt di chuyn.
Thay th d liu da trn Ch xt truy xut trong

gi tr LRV.
ni b mt vng.
Nht qun d liu da

trn TTL.
ra tng nh tuyn.
Kin trc MIX

Gii quyt hiu qu vic Cha gii quyt ng b
chia s d liu gia cc d liu.
[12] [MIX]
MUs trong vng cng tc.
Cha bn ti tnh di
Hiu qu v bng thng.
ng ca nt, gii quyt
Rt ngn thi gian truy khi nt di chuyn.

vn d liu.
Hiu qu v nng lng.
2.5 Kt lun
Trong chng ny, chng ti trnh by tng quan cc m hnh cng tc chia s d
liu trong h thng thng tin di ng. Da vo , trong chng 3, chng ti s trnh
by kin trc xut Kin trc E-MIX v nguyn l hot ng ca kin trc E-MIX.
29
Chng 3 - XUT KIN TRC MNG P2P TRONG

MI TRNG DI NG
3.1 Dn nhp
Ngy nay cc k thut v cng ngh pht trin mt cch mnh m, ngi dng c
th s dng cc thit b di ng lin lc, truyn thng vi nhau. Tuy nhin vi hn
ch v dung lng b nh, nng lng ca cc thit b di ng v hn ch v bng
thng ng truyn th vic lu tr d liu i hi phi ch n ti u khi lng
lu tr v iu phi truy vn. Trong thc t, bn cnh giao tip truyn thng, ngi
dng cng c th truy vn n cc h thng d liu ln hn tm kim thng tin.
Hin nay c rt nhiu cng trnh nghin cu trn th gii ang cp v vn
ny v c bit y cng l mt vn c xut v ang c thc hin trong
lun n tin s ca gio vin hng dn ti. Trong phm vi lun vn tt nghip c
nhn, c s ng v hng dn ca gio vin hng dn chng ti mong mun
hin thc ha v th nghim mt m hnh cng tc chia s d liu trong mi trng di
ng c th hin Hnh 3-1. M hnh c bit c quan tm n vn truy vn
nhiu hng mc d liu v iu phi truy vn cho cc kho lu tr. Kin trc xut
c tham kho t cng trnh nghin cu trong lun n tin s ca gio vin hng
dn cng nh bo co nghin cu ni b ti b mn H thng thng tin ai hc
khoa hc t nhin TP HCM [14].
30
Data
BS
10
MU
3
4
MU
MU
MU
MU
MU
6
5
MU
MU
8
MU
9
MU
Hnh 3-1 M hnh kin trc h thng mng
Vi mong mun xy dng mt m hnh cng tc chia s gia cc kho lu tr h

tr truy vn ti u nht, chng ti xut kin trc E-MIX. Ngoi vic cung cp mt
m hnh chia s d liu v qun l kho lu tr nh nhng m hnh cng tc chia s d
liu khc, kin trc E-MIX cho php x l truy vn cng lc vi nhiu hng mc d
liu, ng thi c c bit ch trng n vic lp k hoch phn phi cu truy vn cho
cc MU khc. Vic ny gip E-MIX gim ti sc nng nng lng dn vo MU truy
vn, ti u ha thi gian v chi ph truy vn.
31
3.2 Kin trc h thng thng tin di ng p dng mng P2P

3.2.1Gii thiu
Kin trc E-MIX c xy dng trong ng cnh mt h thng thng tin di ng c
p dng kin trc mng lai, c th hin Hnh 3-1. H thng bao gm cc phn
chnh nh sau: my ch (server), base station (BS), v cc thit b di ng (MU).
Trong , server s l ni qun l ton b d liu ca h thng v cung cp d liu
cho cc BS. BS l ni lu tr v cung cp d liu cho cc thit b di ng trong phm
vi n c th giao tip c vi thit b di ng thng qua mng v tuyn. MU l cc
thit b di ng c kh nng x l d liu. Cc MU c th truy xut d liu t BS hoc
t cc MU khc thng qua ng nh tuyn (routing). Lin lc gia cc BS v MU
cng nh gia cc MU thng qua mng v tuyn.
3.2.2Phng thc hot ng ca h thng
Trong kin trc E-MIX, hot ng ca cc MU c chia thnh nhiu vng, mi
vng cha mt s MU, mi MU c th trao i thng tin, d liu vi MU khc trong
phm vi bn knh truyn thng ca MU. lin lc vi nhng MU ngoi vng, cc
MU phi giao tip vi nhau thng qua MU trung gian (gateways). Chng ti nh
ngha nt vng l cc MU thuc cng mt vng vi nhau, nt mng l cc MU nm
ngoi vng, phi giao tip vi nhau thng qua MU trung gian.
Mt v d n gin v cc thnh phn trong kin trc c th hin Hnh 3-2.
MU2 c cc nt vng l MU3, MU4, MU9, MU6, cc nt mng l MU1,
MU11,MU5,MU7
32
BS
MUs mng
MUs vng
10
Cache
3
4
1
5
8
9
Hnh 3-2 Nguyn l hot ng kin trc xut
Khi ngi s dng yu cu tm kim cc d liu trn cc MU, trc tin vic tm
kim s c thc hin cc b ti chnh kho lu tr ca MU. Vi tp d liu cn li
khng c tm thy ti kho lu tr cc b, thay v phi trc tip broadcast yu cu
n cc MU khc trong vng, MU ngun ch iu phi phn chia cc truy vn con ng
vi tp d liu cho cc MU ln cn tng hp gip. Nu cc MU ln cn khng th
tng hp d liu yu cu th MU ngun mi trc tip broadcast yu cu cho nhng
d liu cn thiu n tt c MU trong vng. Sau bc ny, nu vn cha c d liu
c yu cu th MU ngun mi gi yu cu n cc MU ngoi vng trong mt phm
vi gii hn trc. Nu d liu yu cu vn cha tng hp y trong phm vi quy
nh th yu cu s c gi n BS. Tt c cc MUs lin lc u thng qua mng v
tuyn.
33
Vi nguyn l hot ng nh vy, chng ti gii quyt cc vn cn phi quan

tm trong kin trc ny nh vn nh tuyn, ng b, tch hp, lu tr, thay th, v
truy vn d liuc bit ch trng n cc k thut nht qun thng tin lu tr, iu
phi truy vn nhiu hng mc d liu. Vn ny chng ti s trnh by chi tit trong
phn tip theo.
3.3 Kin trc v nguyn l hot ng

Trong phn ny chng ti s trnh by chi tit kin trc ti mi MU. Trong kin
trc cc MUs c th lin lc vi nhau thng qua mng v tuyn v mi MU gm c ba
lp x l chnh: User Application, Middleware v Network Protocol c th hin
Hnh 3-3.
Hnh 3-3 Kin trc ti mi MU
Lp User Application c nhim v nhn yu cu d liu ca ngi dng, chuyn

yu cu n lp Middleware x l, sau tr kt qu v cho ngi dng. Ngi dng
khng cn bit v kin trc mng, trng thi m hnh mng, phng thc x l ca
lp Middleware, ngi dng nhn kt qu tr v nh l mt MU cc b. Lp
Middleware c nhim v nhn yu cu d liu t lp User Application, lp ny c
chia thnh hai lp con chnh: Query Process v Cooperative Caching Process. Lp
Network Protocol c nhim v giao tip v truyn thng tin, d liu gia cc thnh
phn trong h thng. Kin trc chi tit ca cc lp c minh ha hnh sau:
34
Hnh 3-4 M hnh kin trc xut
Trong hnh trn, nguyn l hot ng ca kin trc ny c trnh by nh sau:

3.3.1Lp Cooperative Caching Process
Lp ny phc trch qun l vic cng tc chia s d liu gia cc kho lu tr. Lp
ny li c t chc thnh ba lp con Local Cache Process, Zone Process, Routing
Process qun l cc thnh phn d liu tng ng.
3.3.1.1Lp Local Cache Process

Chu trch nhim qun l kho lu tr ti mi nt, lp ny s ph trch vic phn
loi v lu tr hng mc d liu vo b nh cc b.
Mi MU c mt b nh cc b (Local Cache - LC) lu tr d liu, khi mt
hng mc d liu c thm vo LC, lp ny x l thay th d liu khi cache b y
35
da trn thut ton LUV [9]. Trong LC, chng ti chia thnh hai loi n v d liu
c lu tr: d liu chnh (Primary Data - PD) v d liu ph(Secondary Data - SD)
[12], trong PD c u tin cao, SD c u tin thp hn. Vic phn loi hai
loi d liu chnh ph nhm bo m kh nng tn ti t nht mt bn sao hng mc
d liu trong vng. Nhng SD c u tin thp nht s b u tin thay th nu
cache b y, trong khi nhng PD ch b loi b khi gi tr TTL3 ca n khng cn hp
l. Ngoi ra, vic thay th cc hng mc d liu nu cache b y cn ph thuc vo
vic hng mc d liu c ang nm trong lt yu cu hay khng. X l ny nhm
bo m cc hng mc d liu (d l SD hay PD) nu ang c yu cu truy vn
nhng cha xut kt qu cho ngi dng s khng b xa trong kho lu tr. Nh vy,
khi cn thm mt hng mc d liu mi vo kho lu tr v kho lu tr b y, SD
khng nm trong lt yu cu c u tin thp nht s b loi b, hng mc d liu
mi c thm vo. Nhng PD khng nm trong lt yu cu v c gi tr TTL khng
cn hp l s b loi b.
3.3.1.2Lp Zone Process

Qun l cc thng tin v nhng MU trong vng v nhng d liu lu tr ti mi
MU thng qua hai bng RRT v IDNeighs. Mc tiu ca bng RRT l cho bit MU
no c d liu yu cu, khi MU ngun s truy xut n MU ly d liu, trnh
tnh trng loang ht (loang m) n cc MUs khc trong vng. Trong khi , bng
IDNeighs ghi nhn cc MUs trong vng ca MU ngun. Lp ny ng thi s m
nhn vic duy tr thng tin m bo chnh xc cho hai bng trn.
3.3.1.3Lp Routing Process

Qun l nh tuyn nh kin trc MIX [12] xut, da trn tng xy dng
v duy tr Route Cache b lu tr thng tin nh tuyn lm c s chn la ng
nh tuyn tt nht trong qu trnh truy vn d liu ca kin trc.
TTL (Time to live): Gi tr TTL c s dng thay th gi tr mi khi chu k sng ca gi tr
khng hp l
36
3.3.2Lp Query Process

Lp ny chu trch nhim x l truy vn d liu khi c yu cu. ng vi mi
phm vi truy vn, Query Process c t chc thnh ba module: Local Query, Zone
Query, Route Query.
3.3.2.1Module Local Query

L module u tin thc hin nhim v khi bt u nhn mt truy vn t ngi
dng. Module gi nhim v tm kim hng mc d liu c yu cu t kho lu tr
cc b c qun l bi Cache Process.
3.3.2.2Module Zone Query

Vi nhng hng mc d liu cha c tm thy kho lu tr cc b, Module
Local Query s chuyn giao hot ng cho module Query Process tin hnh
lp k hoch phn phi yu cu truy vn cho cc MU ln cn. Da vo thng tin t
lp Zone Process, module Zone Query s t chc iu phi, phn chia vic truy vn
v tng hp cc hng mc cn thiu cho cc MU ln cn mt bc nhy. Nu cc MU
ln cn ny c th tng hp c mt s hng mc d liu MU ngun yu cu, MU
ngun da vo s lng hng mc d liu c th tng hp, v thi gian tng hp
chn la MU ln cn tng hp d liu.
Nu cc MU ln cn khng th tng hp s d liu yu cu, module Zone Query
tip tc broadcast yu cu truy vn n tt c MU trong vng tm kim nhng d
liu cn thiu.
3.3.2.3Module Route Query

Nu d liu khng c tm thy y t ni b vng, module Route Query
bt u lm vic. Yu cu truy vn ng vi nhng d liu cn thiu s c gi n
cc MU xa hn, c gi l cc nt mng trong mt phm vi gii hn cho trc.
Ton b d liu c tng hp sau cng s c gi tr v cho ngi dng.
37
3.4 Thut ton x l ti MU

Da vo m hnh kin trc xut Hnh 3-4, chng ti a ra gii php c th
thc hin kin trc ny bao gm m t cc lung x l ca lp Middleware v cc
thut ton x l ti mi tng lp con trong lp Middleware.
Hnh 3-5 Lung x l ti lp Middleware
38
Nh trnh by trn, lp Middleware c vai tr ch yu gii quyt cc yu cu

d liu t ngi dng. Lp Middleware gm c hai lp con chnh: Cooperative
Caching Process v Query Process. Mi lp li c t chc thnh cc lp con nh
gi nhng nhim v x l v t chc khc nhau c m t trong Hnh 3-5. Lung x
l c th ti mi lp chng ti s trnh by phn tip theo.
3.4.1Lung x l ti lp Cooperative Caching Process
3.4.1.1Lung x l ti lp Local Cache Process

Lp Local Cache Process vi thnh phn lu tr l kho d liu cc b, thnh phn
x l l module Cache Management chu trch nhim qun l kho d liu lu tr ti
mi MU. Cache Management bao gm hai thao tc chnh l: qun l vic phn loi
khi tip nhn cc hng mc d liu v qun l chin lc thay th d liu khi kho lu
tr b y. Hnh 3-6 Module "Cache Management"
.
Hnh 3-6 Module "Cache Management"
3.4.1.1.1Thut ton phn loi d liu

xc nh d liu l d liu chnh (Primary Data - PD ) hay d liu ph
(Secondary Data - SD) khi tip nhn mt hng mc d liu mi ti kho lu tr, chng
39
ti s dng thut ton phn loi d liu c gii thiu trong [12] [MIX]. tng
chnh ca thut ton ny l: Nu d liu hi p c gn nhn l d liu chnh
(Primary Data - PD) th d liu s c lu li vi nhn l d liu ph (Secondary
Data - SD). Nu d liu c gn nhn l SD th MU gi phi gi km thm thng tin
ID ca MU gi d liu chnh PD, nu ID ca MU gi d liu chnh thuc vng ca
MU ngun(v d: MU1 Hnh 3-6) th d liu s c lu li gn nhn l SD, nu ID
ca MU gi d liu chnh khng thuc nt vng ca MU ngun th d liu s c
lu li gn nhn l PD.
V d Hnh 3-6, MU ngun (MU1 yu cu d liu A) nhn d liu hi p t
MU3 vi nhn d liu l SD, v MU3 gi km thng tin ID ca MU4 gi A vi nhn
l PD (do MU4 khng thuc nt vng ca MU ngun nn MU ngun lu A vi nhn
d liu l PD).
3.4.1.1.2Thay th d liu
Thng thng, cc m hnh cng tc d liu thng s dng cc gi tr LRU, TTL
[12], hoc tn sut truy cp [7],... lm tiu ch thay th kho lu tr. Tuy nhin, vi
nhng c tnh ring ca mng ty bin khng dy, chng ti nhn thy LRU, TTL,
tn sut truy cpc th khng phi l thc o chinh xc duy nht trong chin lc
thay th d liu v b qua cc thng s quan trng khc. Do , chng ti s dng gi
tr LUV [9], ph thuc vo bn tham s quan trng: xc sut truy cp, khong cch,
TTL, v kch thc d liu lm c s cho chin lc thay th d liu.
xy dng chin lc thay th thay th d liu va gim ti tr, va tng kh
nng lu tr thnh cng, chng ti p dng hai tiu ch LUV v TTL lm c s cho
vic thay th ty d liu, c th nh sau: khi mt hng mc d liu mi D c thm
vo kho lu tr cc b, nu kch thc kho lu tr cc b y, MUi s tm nhng
hng mc d liu l d liu ph c lu trong kho lu tr cc b, MUi s loi b
nhng hng mc d liu no c u tin thp nht theo thut ton LUV [9], sau
hng mc d liu D s c thm vo kho lu tr cc b. Theo mt chu k thi gian,
MUi s thay th nhng hng mc d liu l primary data nu gi tr TTL ca n
khng cn hp l.
3.4.1.1.3Thay i ph hp vi truy vn a hng mc
40
Vi truy vn ch yu cu mt hng mc d liu trong mt lt truy vn, th vic

thay th d liu c th n gin xt theo u tin ca SD v PD. V ngay sau khi
nhn c d liu hi p, MU ngun s tr kt qu v cho ngi dng v kt thc
lt truy vn. kin trc E-MIX, chng ti cho php ngi dng c th yu cu
nhiu hng mc d liu ngay trong mt lt truy vn. MU ngun ch tr kt qu v
cho ngi dng khi thc hin xong qu trnh tm kim ton b hng mc d liu
c yu cu. Nh vy, MU ngun c th nhn d liu hi p trong sut qu trnh
tm kim, nhng ch tr kt qu v cho ngi dng khi tm tt c hng mc d
liu hoc kt thc qu trnh tm kim.
trnh tnh trng cc hng mc d liu ang nm trong lt truy vn nhng b
thay th khi kho lu tr y, chng ti xy dng c ch thay th kho lu tr ca kin
trc E-MIX ph hp vi qu trnh truy vn nhiu hng mc d liu. C th l, qu
trnh thay th cc hng mc d liu khi cache b y ngoi vic da vo phn loi d
liu chnh, d liu ph cn ph thuc vo vic hng mc d liu c ang nm
trong lt yu cu hay khng. Tt c hng mc d liu trong kho lu tr ban u u
c nh du cho php xa. Khi bt u lt truy vn, cc hng mc d liu c
ngi dng yu cu s c nh du khng c xa. Ch sau khi kt thc lt truy
vn, cc hng mc c yu cu trong lt truy vn mi c nh du cho php
xa tr li. Khi cn thm mt hng mc d liu mi vo kho lu tr v kho lu tr b
y, SD cho php xa c u tin thp nht s b loi b, hng mc d liu mi
c thm vo. Nhng PD cho php xa v c gi tr TTL khng cn hp l s b loi
b. X l ny nhm bo m cc hng mc d liu (d l SD hay PD) nu ang c
yu cu truy vn nhng cha xut kt qu cho ngi dng s khng b xa trong kho
lu tr.
M gi x l thut ton X l thay th d liu c trnh by trong Bng 3-1.
M gi
D liu D: sender, request_data, TTL
u vo: D
u ra: delD (d liu b thay th)
1. Nu Cache y
1.1.
iSMin = -1, iPMin = -1;
41
1.2.
Lp i n Cache.Index
1.2.1.
Nu Cache[i] l PD
1.2.1.1. Nu Cache[i].TTL khng hp l

1.2.1.1.1.
Xa Cache[i]
1.2.1.1.2.
Thm D
1.2.1.1.3.
Tr v Cache[i]
1.2.1.2. Ngc li
1.2.1.2.1.
Nu iPMin = -1
1.2.1.2.1.1.
1.2.1.2.2.
iPMin = i
Ngc li
1.2.1.2.2.1.
Nu Cache[i].time < Cache[iPMin].time
1.2.1.2.2.1.1.
1.2.2.
iPMin = i
Ngc li
1.2.2.1. Nu iSMin = -1
1.2.2.1.1.
iSMin = i
1.2.2.2. Ngc li
1.2.2.2.1.
Nu Cache[i].utility < Cache[iSMin].utility
1.2.2.2.1.1.
1.3.
iSMin = i
Nu iSMin != -1
1.3.1.
Xa Cache[iSMin]
1.3.2.
Thm D
1.3.3.
Tr v Cache[iSMin]
1.4.
Ngc li
1.4.1.
Xa Cache[iPMin]
1.4.2.
Thm D
1.4.3.
Tr v Cache[iPMin]
Bng 3-1 M gi thut ton x l thay th d liu
3.4.1.2Lung x l ti lp Zone Process

Lp Zone Process vi thnh phn lu tr l hai bng RRT v IDNeighs, thnh
phn x l l module Zone Management s m nhn qun l v cp nht thng tin
v cc MUs trong vng v d liu lu ti mi MUs .
3.4.1.2.1Thut ton Lu tr thng tin trong bng RRT
42
Trong kin trc chng ti trnh by trn, mc tiu lu tr bng RRT l MU

ngun bit MU no c d liu yu cu, khi MU ngun s truy xut n MU
ly d liu, trnh tnh trng loang (loang m) n cc MUs khc trong vng. Xt thy
tm quan trng ca bng RRT trong hiu qu truy vn, chng ti xut c ch cp
nht RRT khi mt hng mc d liu c ghi nhn ti MU. tng chnh ca thut
ton ny nh sau: Khi mt d liu yu cu D c ghi nhn ti MU, MU s ghi nhn
cc thng tin: MUj (MU hi p), d liu yu cu D, nhn thi gian(time stamp) vo
trong RRT4 c th hin Hnh 3-7. Da vo nhng thng tin ny, MU bit chnh
xc d liu D c lu tr ti MUj, ln sau c th gi yu cu n MUj m khng
phi gi n tt c MUs khc trong vng. Khi cn ghi nhn mt thng tin mi vo
RRT nu bng RRT y, thut ton s chn thng tin t c truy xut nht trong
bng thay th. M gi x l thut ton ny chng ti trnh by trong Bng 3-2.
Hnh 3-7 V d bng RRT
M gi
D liu D: sender, request_data, TTL
u vo: D
2. Nu MU nhn D t MU khc
1.1 Kim tra kch thc RRT
1.2 Nu kch thc RRT y
1.2.1 Lp i n RRT.Length
1.2.1.1
Nu RRT[i].TTL khng hp
l
1.2.1.1.1
1.2.2 Ghi D vo RRT
RRT: bng lu thng tin d liu ca cc MUs ln cn
43
Xa RRT[i]
1.3 Ngc li
1.3.1 Ghi D vo RRT
Bng 3-2 M gi "X l lu tr thng tin trong RRT"
3.4.1.2.2Thut ton nh tuyn trong vng

Trong kin trc xut, mc tiu ca bng IDNeighs l cho bit trong vng gm
nhng MUs no, lp Query Process t chc iu phi, phn chia truy vn v tng
hp d liu yu cu cho nhng MUs . Ni cch khc IDNeighs lu tr ton b
thng tin nh tuyn trong vng. Do , bo m chnh xc ca thng tin trong
IDNeighs, chng ti la chn gii php duy tr IDNeighs theo chu k thi gian [12].
Theo mt chu k thi gian cc MU s pht ra mt thng ip HELLO trong vng bn
knh r. Khi cc MUs trong vng ca n s pht li thng ip RHELLO xc nhn
l ln cn ca MU. Cc thng tin trao i ny c qun l bi IDNeighs ti mi MU.
IDNeighs ghi nhn cc thng tin(info) gm: a ch, tn ca cc MU ln cn. M gi
thut ton nh tuyn trong vng c th hin trong Bng 3-3.
M gi
MU gi: IDNode_S
u vo: d liu, IDNode_S
1. Lp i n IDNeighs.Length
1.1 Nu IDNode_S khc
1.2
ID_Neighs[i]
Gi d liu n ID_Neighs[i]
Bng 3-3 M gi thut ton "nh tuyn trong vng"
3.4.1.3Lung x l ti lp Routing Process

Vi ngha v chi tit hot ng va c trnh by trn, c th xem lp Zone
Process l lp m nhn vic qun l thng tin nh tuyn trong vng. Vi mc ch
tng t, chng ti xut lp Routing Process qun l thng tin nh tuyn ngoi
vng. Lp ny s chu trch nhim qun l v duy tr d liu nh tuyn ngoi vng,
cung cp thng tin cho lp Query Process khi MU cn truy cp n nhng MU
mng ly d liu. Chng ti p dng c ch nh tuyn trong [12] [MIX] cho x
l ti lp ny.
44
3.4.2Lung x l ti lp Query Process

Nu lp Cooperative Caching Process vi ba lp con v cc thnh phn x l nh
trn hon thnh nhim v qun l kho lu tr cc b ti mi MU cng nh kho
thng tin chia s cho cc MU trong, ngoi vng vi nhau th lp Query Process s
chu trch nhim thc hin mi yu cu truy vn t ngi dng. Tt c x l tip
nhn, lp k hoch, iu phi truy vn d liu trong kin trc u s c thc hin
trong lp Query Process. Query Process c t chc thnh ba module Local
Query, Zone Query, Route Query ng vi vic qun l vic truy vn d liu ti
b nh cc b, t chc iu phi, phn chia truy vn, tng hp d liu cho cc nt
trong vng, v truy vn d liu ngoi vng.
3.4.2.1Thut ton x l module Local Query

Khi nhn c mt yu cu d liu, Module Local Query tin hnh kim tra kho
lu tr cc b tm kim d liu yu cu. Nu khng tm d liu yu cu, MU
ngun tin hnh gi thng ip cho cc MUs ln cn mt bc nhy ca n, yu cu
tng hp gip d liu. Da vo thng tin t RRT, MU ngun xc nh c cc thng
tin nh x l minh ha Hnh 3-8, bao gm:
-
Danh sch cc hng mc d liu c yu cu v c lu tr trong RRT, gi

l ListKnownItem
Danh sch cc dng trong RRT, gi l ListRRT cha nhng hng mc

trnListKnowItem
Danh sch cc hng mc d liu c yu cu v khng c lu tr trong

RRT, gi l ListUnknownItem.
Ton b cc thng tin ny s c MU ngun gi km trong thng ip

JoinResquest n MUs ln cn mt bc nhy. Vic gi km thng tin t bng RRT
nhm gip cc MUs d liu tng kh nng tm thy d liu.
Chi tit thut ton ny c trnh by ti Bng 3-4.
45
Hnh 3-8 X l ti MU ngun khi gi thng ip n MUs ln cn
M gi
1. MU ngun kim tra trong kho lu tr cc b c hng
mc d liu cn hay khng?
1.1.
Nu ng, bo kt qu cho ngi dng.
1.2.
Nu sai,
1.2.1.
MU ngun Kim tra RRT ca chnh n
1.2.2.
T RRT, xc nh
ListKnownItem: Danh sch cc hng mc d

liu c th xc nh nh RRT
ListUnknownItem: Danh sch cchng mc d

liu cha xc nh c
ListRRT: Danh sch cc record t RRT c

lin quan n ListKnownItem
1.2.3.
ng
gi
danh
sch
trn
vo
JoinRequest, gi n cc MU ln cn mt bc
nhy
Bng 3-4 Thut ton ti module "Local Query"
46
3.4.2.2Thut ton x l module Zone Query

Khi nhn c cc thng tin yu cu truy vn t MU ngun, module Zone Query
iu phi vic truy vn v tng hp d liu ti cc MU d liu trong vng. Chi tit x
l ca module ny c chia thnh bn thut ton tng ng vi cc giai on x l
ti MU ngun v MU d liu trong qu trnh iu phi, s c chng ti trnh by c
th phn sau.
3.4.2.2.1Thut ton x l ti MU d liu khi nhn c JoinResquest t MU ngun
tng chnh ca thut ton ny l: Sau khi nhn c gi tin JoinResquest yu
cu tng hp t MU ngun, MU d liu s tm kim trong kho lu tr cc b ca
chnh n. Nu tm tt c cc hng mc d liu MU ngun yu cu, MU d liu gi
trc tip kt qu v cho MU ngun. Nu ch tm c mt s hng mc d liu hoc
khng tm thy g c, MU d liu s da vo bng RRT ca chnh n xc nh cc
hng mc n c kh nng tng hp c t cc MU ln cn ca n gi v cho MU
ngun. ng thi, MU d liu tnh ton c tng chi ph cho qu trnh tng hp d
liu gip MU ngun. Danh sch cc hng mc c th tng hp c v chi ph va
xc nh s c MU d liu gi v cho MU ngun trong gi tin RJoinResquest.
Nu t l gia s lng hng mc MU d liu c th tng hp c so vi tng s
lng hng mc MU ngun yu cu ln hn mt gi tr alpha cho trc th MU d
liu c th tin hnh tng hp ngay d liu m khng cn i hi p ca MU ngun
sau gi tin RJoinResquest. T kt qu thc nghim, chng ti nhn xt rng gi tr
alpha trong khong 30% - 50% s cho mt kt qu hiu qu v thi gian v nng
lng.
xc nh tng chi ph Q ca qu trnh tng hp d liu ca MU d liu cho MU
ngun, chng ti trnh by cng thc:
Q = C + Ci + Qi + Qsource
Trong , C l chi ph truy vn cc b ti MU d liu, Ci l chi ph truy vn cc b
ti MU ln cn th i c MU d liu yu cu gi d liu v, Qi l chi ph truyn d
liu t MU ln cn th i v cho MU d liu, Qsource l chi ph truyn d liu t MU d
liu v MU ngun. Xt thy trong mi trng mng ty bin khng dy, chi ph truy
47
vn cc b l khng ng k so vi chi ph truyn gi d liu. Do , cng thc c

thu gn thnh:
Q = Qi + Qsource
Chi ph truyn gi d liu li c phn tch thnh:
Qtruyn = (i=0nSi) * D
Trong , N l s lng hng mc d liu c truyn gi, Si l kch thc mt
hng mc d liu d liu c truyn, D l s bc nhy trn ng truyn. Chng
ti quy c kch thc cc hng mc d liu l nh nhau tt MU trong h thng.
Nh vy, cng thc cui cng xc nh chi ph truy vn ti MU d liu l nh sau:
Q = S * [(Ni * Di) + (Ni) * Dsource]
V MU d liu l cc MU ln cn mt bc nhy vi MU ngun. Do :
Q = S * [(Ni * Di) + Ni]
Vi S l kch thc mt hng mc d liu trong kin trc, Ni l s lng hng mc
MU d liu yu cu MU ln cn th i ca n gi v, Di l s bc nhy gia MU d
liu v MU ln cn th i ca n.
Chi tit thut ton c trnh by ti Bng 3-5.
M gi
1. MU d liu kim tra kho lu tr cc b
2. Nu
tm
thy
liu
trong
ListKnownItem
hoc
ListUnknownItem, to danh sch ListLocalItem cha ch

mc cc hng mc d liu tm thy
3. T RRT ca MU d liu v MU ngun, to ListSubDN1
cha cc MU, tha
Thuc IDNeighs
C cha hng mc d liu thuc ListJoinItem1 =

ListUnknownItem \ ListLocalItem
4. Tnh ton chi ph Cost = tng hp ListJoinItem1 ti

MU d liu v gi ListJoinItem1 + ListLocalItem v
MU ngun
5. Gi RJoinRequest1 v MU ngun gm ListJoinItem1 +
ListLocalItem v Cost
6. Nu hiu sut tng hp H1 = (ListLocalItem.Count +
ListJoinItem1.Count)
48
(ListKnownItem.Count
ListUnknownItem.Count) >= B (B cho trc)

6.1.
MU d liu tin hnh tng hp ListJoinItem1
6.2.
Update RRT lin quan cc ListSubDN1[j] v
hng mc d liu nhn c

7. Ngc li,
7.1.
T RRT ca MU d liu v MU ngun, to
ListSubDN2 gm cc MU tha
o
Thuc ListNeighborDN
cha
hng
mc
ListJoinItem2
liu
thuc
ListKnownItem
ListLocalItem
7.2.
Tnh
ton
chi
ph
Cost
tng
hp
ListJoinItem2 ti MU d liu v gi ListJoinItem2

+ ListLocalItem v MU ngun
7.3.
Gi
RjoinRequest2
MU
ngun
gm
ListJoinItem2 + ListLocalItem v Cost

7.4.
Nu
hiu
sut
(ListLocalItem.Count
tng
hp
H2
ListJoinItem2.Count)
=
/
(ListKnownItem.Count + ListUnknownItem.Count) >=

C (C cho trc)
7.4.1.
MU
liu
tin
hnh
tng
hp
ListJoinItem2
7.4.2.
Update
RRT
lin
quan
cc
ListSubDN2[j] v hng mc d liu nhn c
Bng 3-5 Thut ton x l ti MU d liu khi nhn c JoinResquest t MU ngun
3.4.2.2.2Thut ton x l ti MU ngun khi nhn c RJoinRequest t MU d

liu
tng chnh ca thut ton ny l: Sau khi nhn c thng tin v cc hng mc
d liu v chi ph tng hp t MU d liu gi v, MU ngun s la chn cc MU d
liu no gi d liu v cho mnh da trn chi ph tng hp trung bnh v tng s lng
hng mc m MU d liu gi v (v d Hnh 3-9). Chi tit thut ton c th
hin Bng 3-5.
49
Hnh 3-9 Minh ha qu trnh x l ti MU ngun khi nhn c RJoinRequest t

MU d liu
M gi
1. MU ngun tng hp ListDN gm cc MU d liu gi
RjoinRequest v
2. MU ngun sp xp ListDN theo u tin mt l tng dn
theo gi tr (chi ph trung bnh) = (chi ph DN tng
hp) / (s lng hng mc d liu DN gi v), v u
tin hai l gim dn theo s lng hng mc d liu
DN c th gi v
3. Gi
ListNotHaveItem
ListKnownItem
ListUnknownItem: danh sch cc hng mc d liu MU

ngun cn thiu
4. Vi mi DN trong ListDN
4.1.
Nu ListNotHaveItem khc rng
4.1.1.
To ListItemRequest = ListNotHaveItem
50
GIAO
(ListDN[i].ListLocalItem
ListDN[i].ListJoinItem)
4.1.2.
Gi DataRequest cha ListItemRequest
n MU d liu
4.1.3.
ListNotHaveItem
ListNotHaveItem
ListItemRequest
4.2.
Update
RRT
lin
quan
ListDN[i]
ListDN[i].ListLocalItem
Bng 3-6 Thut ton x l ti MU ngun khi nhn c RJoinRequest t MU d

liu
3.4.2.2.3Thut ton x l ti MU d liu khi nhn c DataRequest t MU ngun

MU d liu tng hp nhng hng mc d liu m n c th tng hp c theo
thut ton th hin Hnh 3-10, sau n gi thng tin v cho MU ngun.
Hnh 3-10 Lu thut ton x l ti MU d liu khi nhn c DataRequest t

MU ngun
51
3.4.2.2.4Thut ton x l tng hp d liu ti MU d liu

MU d liu gi cc yu cu d liu n cc MU khc trong vng, v nhn d liu
tr v theo thut ton c th hin Hnh 3-11. Sau MU d liu s yu cu lp
Zone Process cp nht bng RRT ca n. Chi tit thut ton c trnh by Bng
3-7.
Hnh 3-11 Lu thut ton x l tng hp d liu ti MU d liu
M gi
1. Vi mi MU trong ListSubDN
1.1.
MU d liu gi yu cu ly d liu ListSubDN
[i].ListItem ti ListSubDN[i].MU
1.2.
ListSubDN[i].MU phn hi cc hng mc d
liu
1.3.
Lu tr hng mc d liu va nhn vo b nh
cc b ca MU d liu
52
1.4.
MU d liu yu cu lp Zone Process cp nht
cc dng trong RRT lin quan n cc hng mc d

liu va nhn c
Bng 3-7 Thut ton x l tng hp d liu ti MU d liu
3.4.2.3Thut ton x l module Route Query

Thut ton tm kim RD trong cc MUs mng c t trong ng cnh MU ngun
vn cha tm cc hng mc d liu c yu cu ti b nh cc b v trong vng.
MU ngun bt u tm kim cc hng mc d liu cn thiu trong cc MUs mng.
tng chnh ca thut ton tm kim RD trong cc MUs mng ny l: Trong gii hn
nh tuyn (<= 3), da vo thng tin cc MUs mng t Route Cache [12], vic x l
d tm nh tuyn c thc hin theo thut ton module Route Selection Phase
[12] chn cc MUs mng gi yu cu d liu n. Nu c tm c t nht mt
hng mc d liu cn thiu, d liu tm thy c gi v tng hp ti MU ngun,
ngc li, lp li qu trnh tm kim RD trong cc MUs mng. Khi tng hp d liu
tm thy ti MU ngun, nu cha cc hng mc d liu yu cu, lp li qu trnh
tm kim RD trong cc MUs mng. Nu vt qu gii hn nh tuyn, MU ngun vn
cha c cc hng mc d liu yu cu, cc hng mc cn thiu s c yu cu
n server. Lu x l thut ton ny c th hin Hnh 3-12. M gi x l thut
ton ny c trnh by trong Bng 3-8.
53
Hnh 3-12 Thut ton tm kim RD trong cc MUs mng
M gi
data: ListNotHaveItem(Danh sch cc hng mc d
liu cn thiu), d(d liu tm c ti MUs mng)
MU ngun: IdNode_S
1. X l d tm nh tuyn
2. Nu cn trong gii hn nh tuyn
2.1.
Di chuyn n MUs mng nh tuyn
2.2.
Nu tm c d thuc ListNotHaveItem
2.2.1.
Gi d v cho IdNode_S
2.2.2.
ListNotHaveItem
ListNotHaveItem d
2.2.3.
Nu ListNotHaveItem khc rng
2.2.3.1. Quay li bc 1
54
2.3.
Ngc li,
2.3.1.
Quay li bc 1
3. Ngc li,
3.1.
Gi yu cu d liu ln server
Bng 3-8 M gi x l thut ton tm kim RD trong cc MUs mng
3.5 Xy dng c s d liu

Vi cc thut ton x l ti mi lp con trong lp Middlware c trnh by
phn trn, trong phn ny chng ti a ra cch t chc thit k c s d liu cho cc
module trn.
3.5.1Cu trc lu tr
Da vo lung x l ca lp Middleware Hnh 3-5, chng ti a ra cu trc d
liu ti MU nh sau:
Cache Process
Data:
Data
Index
Ch mc d liu
Data
D liu lu tr
Label
Nhn d liu chnh hoc ph
Zone Process
RRT:
RRT
Time stamp
Nhn thi gian ca mt yu cu d liu

c hi p
Sender
a ch MUs gi d liu.
Request Data
Yu cu d liu ca ngi dng
55
IDNeighs:
IDNeighs
ID
S ID
IDMU
a ch MU
posX
Ta X ca IDNode
posY
Ta Y ca IDNode
Name
Tn MU
JoinRequest:
JoinRequest
QN
ListKnownItem
ListUnknownItem
ListRRT
a ch QN
Danh sch cc hng mc d liu d
liu QN bit ni lu tr
Danh sch cc hng mc d liu d
liu QN cha bit ni lu tr
Danh sch cc record trong RRT c
lin quan n ListKnownItem
RJoinRequest:
RJoinRequest
DN
a ch DN
QN
a ch QN
ListLocalItem
ListZoneItem
Danh sch cc hng mc d liu DN

c cha ti local
Danh sch cc hng mc d liu DN
c th tng hp trong zone
Chi ph tng hp ListZoneItem v
Cost
gi ListLocalItem v ListZoneItem
v QN
56
Cu trc mi phn t ca ListDN:

Phn t ca ListDN
DN
a ch DN
ListItem
Danh sch ton b cc hng mc d

liu DN c th gi v
Chi ph tng hp ListZoneItem v
Cost
gi ListLocalItem v ListZoneItem
v QN
Cu trc mi phn t ca ListSubDN:

Phn t ca ListSubDN
ID ca MU s gi d liu v cho
MU
MU d liu
Danh sch ton b cc hng mc d
ListItem
liu MU c th gi v cho MU d
liu
DataRequest:
DataRequest
QN
a ch QN
DN
a ch DN
ListItemRequest
Danh sch cc hng mc d liu QN

yu cu DN gi v
Routing Process
Route Cache
Route Cache
ID
S ID
IDMU_S
a ch MU trong vng
Num
S lng nt mng ca MU trong vng
57
rlNumNeigh
RD_Request
IDMU_S
a ch MU gi
IDMU_D
a ch MU nhn
Num
S lng nt mng MU gi
IDMUs
Cc ID ca MU thuc nt vng
3.5.2Cu trc x l
Cache
Struct Cache
{
K t label;
S nguyn item;
a ch IDMU;
Thi gian time;
Bin lun l allowDel;
//Tn sut truy cp
S thc utility;
};
RRT
Struct RRT
{
S nguyn sender;
S nguyn request_data;
Thi gian timestamp;
};
IDNeighs
58
Struct IDNeighs
{
S nguyn
ID;
S nguyn
IDMU;
S nguyn
posX;
S nguyn
posY;
Chui
name;
};
Route Cache
struct RD_requestCache
{
S nguyn ID;
S nguyn IDMU_S;
S nguyn Num;
Danh sch
IDMUs;
};
rlNumNeigh
struct rlNumNeigh
{
S nguyn IDMU_S;
S nguyn IDMU_D;
S nguyn Num;
Danh sch
IDMUs;
};
3.6 Kt lun
Trong chng ny chng ti trnh by kin trc v nguyn l hot ng ti mi
MU, cng nh xut cc k thut lin quan n kin trc v phng thc t chc c
59
s d liu ti MU. Trong chng tip theo, chng ti s trnh by cc cng c h tr,
k thut xy dng m hnh kin trc E-MIX v chng trnh ci t th nghim kin
trc E-MIX vi cc tiu ch nh sau:
S lng thng ip ca mt yu cu d liu
S lng thng ip trung bnh ca mt yu cu d liu
Thi gian hi p ca mt yu cu d liu
Thi gian hi p trung bnh ca mt yu cu d liu
T l a mt yu cu d liu ln knh uplink
60
Chng 4 - XY DNG CHNG TRNH M PHNG

4.1 Gii thiu
Da vo cc tiu ch th nghim chng 3, trong chng ny chng ti xy
dng chng trnh m phng thc nghim kin trc E-MIX. Chng trnh m phng
gm cc phn sau:
a. Xy dng kin trc E-MIX
vi s h tr cng c m ngun m
Network Simulation 2 (NS-2) [16]

b. Kch bn, m hnh v kt qu m phng cc tiu ch c xy dng trn
nn tng .NET framword 3.5
Trong chng ny chng ti gii thiu nhng phn chnh trong NS-2 v chng
trnh m phng thc nghim kin trc E-MIX. Chi tit v NS-2 v chng trnh m
phng chng ti trnh by phn ph lc B.
4.2 Network Simulation 2 NS2

4.2.1Gii thiu
NS-2 l mt b cng c m phng mng c p dng rng ri trong cng ng
nghin cu mng. Khi a ra cc kin trc, giao thc, cc nh nghin cu s dng
NS-2 m phng v kim chng tnh hiu qu trc khi p dng trong thc t. Chi
tit v NS-2 chng ti s trnh by trong phn ph lc B.
4.2.2Kin trc ca NS2
NS-2 l mt cng c m ngun m c vit bi 2 ngn ng: C++ v Otcl. Otcl l
ngn ng kch bn Tcl c m rng thm phn hng i tng. C++ dng to ra
cc thnh phn c bn ca mng nh: link, node, tcp, udp, packet, ftp,, OTcl lin
kt cc thnh phn mng v to ra kch bn m phng. Theo quan im ngi dng
NS-2 c minh ha Hnh 4-1.
L do NS-2 vit trn 2 ngn ng l: C++ quan trng trong vic tnh ton hiu qu
cc bytes, gi tin, tc chy thi gian thc nhanh hn vi tp d liu ln. Otcl gip
61
cc nh nghin cu mng thay i tham s, d dng cu hnh li kch bn m phng

nhanh.
Hnh 4-1 NS-2 theo quan im ngi dng
Theo quan im ca ngi dng th NS-2 Hnh 4-1 nh sau: u vo ca NS-2

l kch bn m phng (ngn ng Otcl) v u ra NS-2 l kt qu ca kch bn m
phng.
Kch bn m phng gm tp cc s kin c xp lch theo thi gian, cc tham s
cu hnh mng. Kch bn m phng ny c thc thi bi NS-2, sau kt qu m
phng c kt xut cc nh nghin cu phn tch v nh gi. Vi s h tr ca
NS-2, chng ti xy dng chng trnh m phng kin trc E-MIX, chi tit c trnh
by trong phn tip theo.
4.3 Cu trc chng trnh m phng

Chng ti xy dng chng trnh m phng da vo cc tiu ch t ra trong
chng 3, i vi mi tiu ch th nghim l mt kch bn m phng ring. Kin trc
E-MIX c xy dng v tch hp vo NS-2. Sau gi NS-2 thc thi cc kch bn
v cho kt qu m phng.
u tin, chng ti to ra kch bn m phng (*.tcl) v phn tch kt qu da vo
chng trnh m chng ti gi l Chng trnh to kch bn m phng E-MIX
Demo, chng trnh ny chng ti trnh by chi tit trong phn tip theo.
E-MIX Demo c xy dng trn nn tng .NET framwork 3.5, ngn ng C# v
s dng cng c thit k giao din DevExpress 9.3 [17]
Kin trc E-MIX c xy dng trn ngn ng C++ v Otcl, mi trng xy
dng Eclipse 3.5 tch hp C++. Sau chng ti tch hp kin trc E-MIX ny vo
62
NS-2, bin dch v thc thi kch bn m phng. Kt qu m phng c chng ti

phn tch v tnh ton da trn cc tiu ch th nghim. Cu trc tng quan ca
chng trnh m phng c minh ha Hnh 4-2.
Chng trnh m phng
Chng trnh to kch bng m phng
Giao din chng trnh
To kch bn m phng
Phn tc h
Network simulator 2
K ch bn (.tcl)
K t qu (.txt)
E-MIX
OTcl
Hnh 4-2 Cu trc chng trnh m phng
Trong phn tip theo chng ti trnh by v chng trnh to kch bn m phng
E-MIX Demo v xy dng kin trc E-MIX.
4.4 Chng trnh to kch bn m phng E-MIX Demo

4.4.1Gii thiu
Nh trnh by phn trn, kch bn m phng mng c vit bng ngn ng
kch bn OTcl (OTcl l ngn ng kch bn tcl, m rng phn hng i tng).
Chng trnh to kch bn m phng kt xut ra tp tin cha nhng dng lnh cu
hnh cn thit cho m phng mng.
M hnh mng P2P bao gm cc thit b di ng c kh nng lu tr v tnh ton
trong mi trng di ng, v vy NS-2 c nh ngha cc thnh phn c bn ca mt
thit b di ng (mobile node), chi tit xem chng 16 [16]
Chng trnh to kch bn m phng E-MIX Demo gm cc chc nng nh sau:
63
Cu hnh tham s c bn cho mt mobile node.

T pht sinh cc file script gi lp cc trng hp truy vn d liu
da trn hnh va xy dng.
To m hnh kin trc mng P2P.
To cc hiu ng minh ha qu trnh cng tc chia s gia cc
clients.
Phn tch kt qu v v biu da vo tp tin kt qu m phng.
Bng 4-1
4.4.2Giao din chnh ca E-MIX Demo
Chi tit cc giao din chnh ca E-MIX Demo c lit k trong Bng 4-1 v s
cc mn hnh c trnh by Hnh 4-3.
STT
Tn mn hnh
ngha /Ghi ch
Form Main
Mn hnh chnh
Tab Configuration node
Cu hnh mobile node
Tab Model
To m hnh P2P
Tab Animation
To hiu ng
Tab Result
V biu kt qu
Bng 4-1 Chi tit cc giao din chnh ca E-MIX Demo
Hnh 4-3 S lin kt cc mn hnh
64
4.4.2.1Mn hnh Main

Giao din
Hnh 4-4 Mn hnh Main
M t chc nng
K hiu
Nt nhn
Gii thch
Cu hnh tham s cho mobile node
Xut tp tin lu vt
Tab Configuration
Xc nh v tr ca tng mobile node
node
Tc di chuyn
To kch thc m hnh mng
Chn cc tiu ch m phng.
To m hnh mng P2P
Cho php ko th xc nh v tr theo mong
Tab Model
mun
Thm d liu cho tng mobile
Xc nh d liu yu cu
65
Xem bn knh v cc ng kt ni gia cc
mobile
3
Tab Animation
Tab Result
To cc hot ng nhn gi cc gi tin cho
mobile node da vo kt qu m phng.
Hin th kt qu m phng bng cc dng biu
Bng 4-2 Chc nng mn hnh "Main"
4.4.2.2Mn hnh Configuration node

Giao din
Hnh 4-5 Mn hnh "Configuration node"
M t chc nng
K hiu Chc nng
Gii thch
Mobile node
Cc tham s cu hnh cho mobile node.
Trace
Chn tp tin lu vt cc s kin m phng mng
Position
Xc nh v tr ca tng mobile node
66
Movement
Model
Chn ngu nhin pht sinh v tr
Xc nh v tr ch m mobile node di chuyn
Xc nh tc di chyn (m/s)
Xc nh giao thc
Xc nh kch thc m hnh m phng(chiu
rng v chiu cao)

6
Criteria
Export
Cancel
La chn tiu ch mun m phng
Xut ra tp tin m phng (*.tcl) sau khi m t chi
tit cc kch bn m phng.
Thot chng trnh
Bng 4-3 Chi tit mn hnh "Configuration node"
4.4.2.3Mn hnh Model

Giao din
Hnh 4-6 Mn hnh Model
67
M t chc nng
K hiu
Nt nhn
Random
View radio
View link
Gii thch
Pht sinh ngu nhin v tr tng mobile node, ko
th tng mobile node xc nh v tr mong mun.
Xem bn knh phm vi truyn sng v tuyn ca
tng mobile node
Xem cc ng kt ni gia cc mobile node trong
m hnh
Bng 4-4 Chi tit mn hnh "Model"
4.4.2.4Mn hnh Animation

Giao din
Hnh 4-7 Mn hnh Animation
M t chc nng
K hiu
1
Nt nhn
Play
Gii thch
Kch hot hiu ng hot ng truyn gi tin gia cc
68
thit b mobile
2
Open
Chn tp tin kt qu m phng(*.txt)

Bng 4-5 Chi tit mn hnh "Animation"
4.4.2.5Mn hnh Result

Giao din
Hnh 4-8 Mn hnh "Result"
M t chc nng
K hiu
Nt nhn
Gii thch
Chn tiu ch phn tch kt qu m phng v v
Criteria
Option
Chn v biu hnh ct hoc ng gp khc.
Select
Chn tp tin kt qu m phng (*.txt)
biu .
Bng 4-6 Chi tit mn hnh "Result"
69
4.5 Thc thi kch bn m phng

Sau khi to kch bn m phng, chng ti dng NS-2 tch hp kin trc MIX
thc thi kch bn. NS-2 chy trn h iu hnh Linux, tuy nhin chng ti thc hin
trn h iu hnh Window vi s h tr ca b gi lp Cygwin [18]. Chng ti minh
ha NS-2 thc thi mt kch bn th hin Hnh 4-9
Hnh 4-9 V d NS-2 thc thi mt kch bn
Kch bn m phng c vit bng ngn ng OTcl, ngn ng ny s c gii

thiu phn ph lc B cng vi qu trnh download v ci t cygwin.
4.6 Kin trc E-MIX

hin thc kin trc E-MIX trnh by chng 3, chng ti phi xy dng mt
giao thc gi l giao thc EMixAgent. Trong giao thc EMixAgent chng ti xy
dng cu trc d liu v cc thut ton trnh by chng 3 nh: k thut x l nhn
v gi gi tin, xp lch thi gian(timer), c tham kho t cc ti liu k thut [16]
4.6.1Giao thc EMIXAgent
Chi tit cc lp trong giao thc EMixAgent c trnh by trong Hnh 4-10 v
chc nng cc lp c m t trong Bng 4-7.
70
EMixAgent
RRT
MyCache
numNeighNeigh
MyList
Hnh 4-10 S lin kt cc lp trong giao thc EMixAgent
STT
Lp
M t
ng vai tr l lp giao tip gi v nhn cc gi
EMixAgent
tin d liu, c nhim v lin kt cc lp con to

thnh mt giao thc hin thc kin trc E-MIX.
RRT
MyCache
Thc hin nhim v lu tr thng tin ca d liu

yu cu, chc nng c trnh by chng 3.
ng vai tr kho lu tr d liu.
Nhim v lu tr thng tin(profile) s nt vng
numNeighNeigh ca tng mobile, phc v tm ng nh tuyn

gii quyt yu cu d liu.
MyList
Nhim v lu tr thng tin hng xm ca mt

mobile node.
Bng 4-7 Chc nng cc lp trong giao thc EMixAgent
4.6.2K thut lu tr trong kin trc E-MIX
4.6.2.1Lp RRT
Cu trc d liu
71
RRT c chc nng lu tr thng tin ca d liu yu cu, v th chng ti dng k

thut bng bm lu tr thng tin bng RRT . Cu trc d liu nh sau:
class objRRT {
public:
int _index;
nsaddr_t _sender;
int _item;
int _time;
};
typedef std::multimap<int, objRRT> mapRRT;
class RRT {
public:
mapRRT _mapRRT;
int _size;
int _index;
int TTL;
void Refresh(receiveData, int);
void SaveData(receiveData, int);
nsaddr_t searchItem(int);
int isFull();
void print_RRT();
void init();
void setTTL(int);
int getTTL();
void deleteItem(int);
void deleteItem(int, nsaddr_t);
void sortBySender();
RRT* splitBySender(int &);
int* ConvertRRTToArray(int &);
};
Bng 4-8 Cu trc d liu ca lp RRT
Cc hm chc nng
STT
1
Tn hm
M t chc nng
void Refresh(receiveData,
Cp nht nhn thi gian cho
int)
thng tin
void SaveData(receiveData,
Lu tr thng tin d liu vo
int)
RRT
nsaddr_t searchItem(int)
72
Tm kim thng tin d liu yu

cu
int isFull()
Kim tra kch thc RRT
void print_RRT()
Xut thng tin lu tr trong RRT
void init()
Khi to thng tin cho RRT
void setTTL(int)
Gn thi gian qu hn
int getTTL()
Ly thi gian qu hn
void deleteItem(int)
Xa phn t trong RRT
10
Xa phn t trong mt dng
void deleteItem(int,
trong RRT vi phn t v MU
nsaddr_t)
gi xc nh.
11
void sortBySender()
12
RRT* splitBySender(int &)
13
Sp xp bng RRT theo MU gi

Chia bng RRT thnh mng cc
bng RRT theo tng MU gi
int* ConvertRRTToArray(int
Ly danh sch cc hng mc d
&)
liu c tn ti trong RRT

Bng 4-9 Cc hm chc nng ca lp RRT
4.6.2.2Lp MyCache
Cu trc d liu
Lp MyCache ng vai tr l kho lu tr ti mi thit b mobile, chng ti dng
bng bm lu tr d liu. Cu trc d liu:
class data {
public:
char _label;
int _item;
nsaddr_t _IDMU;
int _time;
bool _allowDel;
//Dng tnh gi tr LUV
int _last;
float _a;
int _dem;
float _utility;
void init();
};
typedef std::multimap<int, data> ITEM;
73
class MyCache {
public:
int _index;
int _size;
ITEM _item;
int _TTL;
MyCache();
void init();
int getSize();
void setSize(int);
data getItem(int);
data addItemp(data);
data* addArrayItem(data*, int, int&, int);
void calcUtility(int);
void deleteitem(int);
void setAllowDel(data, bool);
int searchItem(int, int);
void UpdateItem(data, int);
void print_item();
int isFull();
void setTTL(int);
int getTTL();
};
Bng 4-10 Cu trc d liu ca lp MyCache
Cc hm chc nng
STT
Tn hm
M t chc nng
MyCache()
void init()
int getSize()
Ly kch thc cache
void setSize(int)
Thit lp kch thc cache
data getItem(int)
data addItemp(data)
7
8
Hm khi to
Khi to cc gi tr ban u cho
cache
Ly d liu trong cache da vo

ch mc
Lu tr d liu vo kho lu
tr(cache)
data* addArrayItem(data*,
Thm vo cache mt mng cc
int, int&, int)
hng mc d liu.
void calcUtility(int)
Tnh gi tr utility cho ton b
74
cache
void deleteitem(int)
Xa d liu trong cache
void setAllowDel(data,
Thit lp c c php xa cho
bool)
hng mc d liu
11
int searchItem(int, int)
Tm kim d liu trong cache
12
void UpdateItem(data, int)
13
void print_item()
Xut thng tin trong cache
14
int isFull()
Kim tra cache y
15
void setTTL(int)
Thit lp gi tr TTL
16
int getTTL()
Ly gi tr TTL
9
10
Cp nht thng tin hng mc d

liu
Bng 4-11 Cc hm chc nng ca lp MyCache
4.6.2.3Lp numNeighNeigh
Cu trc d liu
class numNeighNeigh
{
public:
int id;
int num;
MyList idNeigh;
};
typedef std::map<int,numNeighNeigh>BUFFER;
Bng 4-12 Cu trc d liu ca lp numNeighNeigh
M t chc nng
Lp numNeighNeigh l thuc tnh ca lp EMixAgent, c nhim v lu tr thng
tin v s lng nt vng ca mt MU.
4.6.2.4Lp MyList
Cu trc d liu
Lp MyList c dng lu tr thng tin cc hng xm ca MU. Chng ti
dng danh sch lin kt n qun l lp MyList, cu trc d liu ti mi node l
thng tin ca mt thit b mobile.
75
struct node
{
int info;
int _postX;
int _posY;
char*name;
node* pnext;
};
struct list
{
node* phead;
node* ptail;
int n;
};
class MyList
{
public:
list l;
public:
void init(list &);
node* getNode(int);
void addNode(list &,node*);
void input(list &,int );
void output(list);
int seachInfo(list,int);
void output_neighbors(list);
void convertArray(list,int[]);
int getNumNode(list);
int isExists(list,int);
int find_MU_previous(list,int);
int getMU_Head(list);
int isEmpty(list);
};
Bng 4-13 Cu trc d liu ca lp MyList
Cc hm chc nng
STT
Tn hm
M t chc nng
void init(list &)
Khi to danh sch lin kt n
node* getNode(int)
Ly a ch mt node
void addNode(list &,node*)
Thm mt node vo danh sch

lin kt n
76
Thm thng tin vo node
void input(list &,int )
void output(list)
int seachInfo(list,int)
void output_neighbors(list)
void convertArray(list,int[])
int getNumNode(list)
10
int isExists(list,int)
11
int find_MU_previous(list,int)
12
int getMU_Head(list)
13
int isEmpty(list)
Xut thng tin danh sch lin kt

n
Tm thng tin trong danh sch
lin kt n
Xut thng tin hng xm ca
mt MU
Chuyn i danh sch lin kt
n thnh mng
Ly s lng hng xm trong
danh sch lin kt n
Kim tra mt MU c trong danh
sch lin kt n.
Tm ID MU trong danh sch lin
kt n.
Ly MU u danh sch lin kt
n
Kim tra danh sch lin kt n
rng.
Bng 4-14 Cc hm chc nng ca lp MyList
4.6.2.5Lp EMixAgent
Cu trc d liu
Chng ti xy dng giao thc EMixAgent c k tha t giao thc Agent ca
NS-2, trong giao thc ny c s dng cc thnh phn mng c bn ca NS-2. Do tnh
cht k tha nn giao thc m chng ti xy dng c s dng cc thuc tnh v
phng thc c sn trong NS-2 nh:
packet
nsaddr_t
command(int,const char*const*)
recv(Packet*, Handler*)
77

class EMixAgent: public Agent {
public:
friend class EMixAgent_PktTime;
friend class PktTime_Timeout;
friend class PktNumNeigh_Timeout;
friend class PktMUInter_Timeout;
friend class PktMU_RRT_Timeout;
friend class PktMU_Neighs_Timeout;
friend class PktMU_receive_result_Timeout;
friend class PktMU_wait_result_Timeout;
friend class PktMU_find_neighs_Timeout;
friend class Pkt_resolve_request_Timeout;
friend class Pkt_join_resquest_Timeout;
friend class Pkt_relay_join_Timeout;
friend class Pkt_resquest_data_for_DN_Timeout;
friend class Pkt_resquest_data_for_broadcast_Timeout;
RRT _RRT;
int _sizeCache;
nsaddr_t id;
int counter;
bool result;
int sl;
int dem;
int currentTime;
int X;
int Y;
int numNode;
int *request_items;
int* original_request_items;
int request_items_size, original_request_items_size;
bool result_routing;
int TH;
MyList id_neighbors;
MyList id_neighbors_temp;
MyList buffer_temp;
BUFFER _buffer;
STORE_PACKET _store_packet;
STORE_REQUEST _store_request;
STORE_PROFILE _profile;
int trace;
int traceThongDiepMau;
int traceThoiGian;
int traceUplink;
MyCache _myCache;
fstream write;
fstream writeThoiGian;
78
fstream writeNeighs;
fstream writeUplink;
receiveData d;
int firstTime;
bool bJoinTimeout, bBroadcastTimeout;
bool bOutputResult;
myRelayJoinClass* lstRelayJoin1;
myRelayJoinClass* lstRelayJoin2;
nsaddr_t* lstRelayJoinSender1;
nsaddr_t* lstRelayJoinSender2;
int lstRelayJoinSize1, lstRelayJoinSize2;
EMixAgent(nsaddr_t);
int command(int, const char* const *);
void handleRD_request(Packet*);
void recv(Packet*, Handler*);
void Queue(int*, int);
void timeOut();
void print_position();
bool delItem(int*, int&, int);
void receive_request_Data(Packet*);
void Filter(Packet*);
void replay_result(Packet*);
void request_data_routing();
void reset_numNeigh(MyList);
void initNum();
void update_numNeighs(int, int);
MyList get_idNeighs(int);
int find_max_numNeigh(MyList);
Packet *getPacket();
void SaveNumNeighs(Packet*);
void MU_Inter_request_data_routing();
void MU_Inter_find_Mu_routing();
void find_neighbors();
void MU_inter_receive_request(Packet*);
void feedback(Packet*);
void Save_neighbors(Packet*);
void output_neighbors();
void receive_position(Packet*);
void Print_Buffer();
void replay_find_Mu_routing(nsaddr_t _src);
void receive_rrt_routing(Packet*);
void receive_neighs_routing(Packet*);
void SolveToSource(Packet *, int);
void request_Data(int*, int);
myJoinResquestClass CreateJoinResquestPkt(int*, int&);
void Solve_When_Receive_Join_Resquest(Packet*);
void MU_join_resquest_1();
void DN_receive_resquest_data_1(Packet*);
79
void QN_broadcast_in_zone();
void QN_output_data();
void output_time(int type);
void output_time(int type, nsaddr_t Mu_gui);
void output_message(nsaddr_t, int);
void output_message(int, nsaddr_t, int);
protected:
EMixAgent_PktTime pkt_timer_;
PktTime_Timeout pkt_timeout;
PktNumNeigh_Timeout pkt_numNeigh_timeout;
PktMUInter_Timeout pkt_MUInter_timeout;
PktMU_RRT_Timeout pkt_MU_RRT_timeout;
PktMU_Neighs_Timeout pkt_MU_Neighs_timeout;
PktMU_receive_result_Timeout pkt_MU_receive_result_timeout;
PktMU_wait_result_Timeout pkt_MU_wait_result_timeout;
PktMU_find_neighs_Timeout pkt_MU_find_neighs_timeout;
Pkt_resolve_request_Timeout pkt_resolve_reuqest_timeout;
Pkt_join_resquest_Timeout pkt_join_resquest_timeout;
Pkt_relay_join_Timeout pkt_relay_join_timeout;
Pkt_resquest_data_for_DN_Timeout
pkt_resquest_data_for_DN_timeout;
Pkt_resquest_data_for_broadcast_Timeout
pkt_resquest_data_for_broadcast_timeout;
void reset_EMixAgent_pkt();
void numNeigh_timeout();
void MU_Neighs_timeout();
void MU_wait_result_timeout();
void MU_find_neighs_timeout();
};
Bng 4-15 Cu trc d liu lp EMixAgent
Cc hm chc nng chnh

STT
1
Tn hm
Hm khi to
EMixAgent(nsaddr_t)
int
M t chc nng
command(int,
const
char*
const *)
void handleRD_request(Packet*)
3
void recv(Packet*, Handler*)
c cc lnh t script tcl

Thng bo nhn gi tin ra mn
hnh
Hm dng x l cc gi tin c
nhn v
To hng i cc lnh yu cu d
void Queue(int*, int)
liu
80
Ht thi gian thc hin truy vn,
void timeOut()
phi thng bo kt qu
Tm kim v xut cc MU ln cn
void print_position()
mt bc nhy ca mt nt
7
bool delItem(int*, int&, int)
Xa mt mc d liu trong mng

cc hng mc d liu.
void
Hm x l khi mt MU nhn c
receive_request_Data(Packet*)
yu cu d liu t mt MU khc.
Hm x l khi mt MU nhn c
void Filter(Packet*)
d liu tht
10
Hm x l khi MU vng c kt
void replay_result(Packet*)
qu, thng bo v cho MU ngun
11
Hm x l yu cu d liu trong
void request_data_routing()
phm vi nh tuyn
12
Cp nht li danh sch cc nt hng

void reset_numNeigh(MyList)
xm
13
14
Khi to s lng hng xm
void initNum()
void update_numNeighs(int, int)
15
Cp nht s lng hng xm ca

mt nt
16
MyList get_idNeighs(int)
Ly danh sch hng xm
17
int find_max_numNeigh(MyList)
Tm MU c nt vng ln nht
18
Packet *getPacket()
Ly thng tin gi d liu

Hm x l lu tr s lng nt
void SaveNumNeighs(Packet*)
mng ca cc MU trong vng.
19
void
20
MU_Inter_request_data_routing()
void MU_Inter_find_Mu_routing()
21
MU trung gian yu cu d liu

Cc MU trung gian gii quyt yu
cu d liu.
Nhim v tm hng xm ca MU
void find_neighbors()
khi MU gia nhp vo mng.
22
81
void
Mu trung gian nhn d liu yu cu
MU_inter_receive_request(Packet
23
*)
Hng xm phn hi li nhng
void feedback(Packet*)
thng tin cn thit cho MU ngun.
24
25
v x l
Lu nhng hng xm ca MU.
void Save_neighbors(Packet*)
Xut thng tin cc hng xm ra

void output_neighbors();
mn hnh.
26
27
void receive_position(Packet*)
Ghi nhn cc MU ln cn
Xut danh sch cc MU ln cn ca
void Print_Buffer()
mt nt
28
void
replay_find_Mu_routing(nsaddr_t
29
30
31
MU hi p thng tin d liu
_src)
void
D liu yu cu c gii quyt
receive_rrt_routing(Packet*)
da vo RRT
void
Yu cu d liu c gi n cc
receive_neighs_routing(Packet*)
nt vng.
void
*, Cc MU x l khi gi tin t cc nt
SolveToSource(Packet
32
int)
mng truyn v cho n MU ngun
33
void request_Data(int*, int)
MU ngun nhn yu cu d liu
myJoinResquestClass
To thng tin d liu trong gi tin
CreateJoinResquestPkt(int*,
34
35
MU ngun gi cho cc MU h tr
int&)
void
MU h tr thc hin tm kim, tnh
Solve_When_Receive_Join_Resques
chi phi v thng bo v cho MU
t(Packet*)
ngun
MU ngun nhn thng bo t MU
36
h tr v yu cu chnh xc n cc
void MU_join_resquest ()
MU h tr
37
MU h tr sau khi nhn tr v d
void
82
DN_receive_resquest_data(Packet
liu tht khi nhn c yu cu
*)
chnh xc t MU ngun
38
void QN_broadcast_in_zone()
MU ngun thc hin loang vng
39
void QN_output_data()
40
void output_time(int type)
41
42
43
void
output_time(int
MU ngun thng bo kt qu truy

vn
Xut thng bo ra tp tin lu tr v
thi gian p ng
type,
nsaddr_t Mu_gui)
void
thi gian p ng
output_message(nsaddr_t, Xut thng bo ra tp tin lu tr v
int)
void
Xut thng bo ra tp tin lu tr v
s lng thng ip
output_message(int, Xut thng bo ra tp tin lu tr v
nsaddr_t, int)
s lng thng ip
Hm x l ca EmixAgent vi chu
44
void reset_EMixAgent_pkt()
45
void numNeigh_timeout()
46
void MU_Neighs_timeout()
47
void MU_wait_result_timeout()
48
void MU_find_neighs_timeout()
k 50ms
Hm x l tin hnh yu cu d
liu trong phm vi nh tuyn
Hm kim tra trong hng xm c
d liu hay khng
Hm x l n nt mng ly d
liu nu c
Hm x l trao i thng tin s
lng, ID ca hng xm
Bng 4-16 Cc hm chc nng ca lp EMixAgent
4.6.3K thut x l trong kin trc E-MIX
4.6.3.1Lp RRT
Trong lp RRT, chng ti p dng Thut ton lu tr thng tin ti RRT trnh
by Error! Reference source not found..
void
void
RRT::SaveData(receiveData
RRT::SaveData(receiveData
d, d,
intint
counter)
counter)
{ {
83
objRRT obj;
obj._item = d._item;
obj._sender = d._sender;
obj._time = counter;
int temp = 0;
if (isFull() == 1) {
mapRRT::iterator pos;
for (pos = _mapRRT.begin(); pos != _mapRRT.end(); ++pos) {
if (counter > (pos->second._time + TTL)) {
_mapRRT.erase(temp);
_mapRRT.insert(pair<int, objRRT> (temp, obj));
return;
}
temp++;
}
} else {
_mapRRT.insert(pair<int, objRRT> (_index, obj));
_index++;
}
}
Bng 4-17 K thut x l ti lp RRT
4.6.3.2Lp MyCache
Trong lp MyCache, chng ti p dng tnh gi tr utility v thut ton xc nh
d liu chnh v d liu ph c trnh by Bng 4-18 v Bng 4-19.
void MyCache::calcUtility(int counter) {
ITEM::iterator pos;
float temp = (float) NEAR_ACCESS_NUM;
float res = 0;
for (pos = _item.begin(); pos != _item.end(); pos++) {
if (counter > pos->second._last)
pos->second._a = temp / (float) (counter - pos->second._last);
else
pos->second._a = 0;
res += pos->second._a;
}
if (res > 0)
for (pos = _item.begin();
pos->second._utility =
>second._time);
}
else
for (pos = _item.begin();
pos->second._utility =
}
}
pos != _item.end(); pos++) {

((pos->second._a / res) * pos-
pos != _item.end(); pos++) {

pos->second._time;
Bng 4-18 K thut tnh gi tr utility trong lp MyCache
84
data *MyCache::addArrayItem(data *lstData, int iSize, int& iDelSize,

int counter) {
int iCount = 0;
calcUtility(counter);
iDelSize = _index + iSize - _size;
data* lstDelData;
int* lstDelIndex;
if (iDelSize > 0) {
lstDelData = new data[iDelSize];
lstDelIndex = new int[iDelSize];
while (iCount < iDelSize) {
data d;
d.init();
ITEM::iterator pos;
ITEM::iterator pos2;
int flag1 = 0;
int temp1 = _item.begin()->first;
int item1 = 0;
float flag;
int iIndexPMin = 0;
pos2 = _item.begin();
for (pos = _item.begin(); pos != _item.end(); pos++) {
if (pos->second._allowDel) {
if (pos->second._label == 'P') {
if (counter - pos->second._time >= getTTL()) {
d = getItem(pos->second._item);
_item.erase(pos->first);
lstDelData[iCount] = d;
lstDelIndex[iCount] = pos->first;
iCount++;
pos--;
} else if (pos->second._time < pos2->second._time) {
pos2 = pos;
iIndexPMin = pos->first;
}
}
if (flag1 == 0) {
if (pos->second._label == 'S') {
flag = pos->second._utility;
flag1 = 1;
temp1 = pos->first;
item1 = pos->second._item;
}
}
if (pos->second._label == 'S' && pos->second._utility
< flag) {
flag = pos->second._utility;
temp1 = pos->first;
item1 = pos->second._item;
}
}
}
85
if (item1 != 0) {
d = getItem(item1);
if (d._allowDel) {
_item.erase(temp1);
lstDelIndex[iCount] = temp1;
iCount++;
}
} else {
d = getItem(pos2->second._item);
if (d._allowDel) {
_item.erase(pos2->first);
lstDelIndex[iCount] = pos2->first;
iCount++;
}
}
}
} else
iDelSize = 0;
for (int i = 0; i < iSize; i++) {
if (i < iCount) {
if (lstDelIndex[i] != _index) {
this->_item.insert(pair<int, data> (lstDelIndex[i],
lstData[i]));
} else {
if (_index < _size) {
this->_item.insert(pair<int, data> (lstDelIndex[i],
lstData[i]));
_index++;
}
}
} else {
if (_index < _size) {
this->_item.insert(pair<int, data> (_index, lstData[i]));
_index++;
}
}
}
return lstDelData;
}
Bng 4-19 K thut x l phn loi v thm d liu trong lp MyCache
4.6.3.3Lp MyList
Trong lp MyList, chng ti x l lu tr thng tin cc hng xm ca MU bng
cu trc danh sch lin kt n.
void MyList::addNode(list &lst,node*p)
{
if(lst.phead==NULL)
lst.phead=lst.ptail=p;
86
else
{
lst.ptail->pnext=p;
lst.ptail=p;
}
}
void MyList::input(list &l,int info)
{
node*p=getNode(info);
addNode(l,p);
}
Bng 4-20 K thut x l ti lp MyList
4.6.3.4Lp numNeighNeigh
Ti lp numNeighNeigh, chng ti x l lu tr thng tin s lng nt vng ca
cc MU hng xm bng bng bm, hm SaveNumNeighs thc hin lu tr thng tin
nh sau:
void EMixAgent::SaveNumNeighs(Packet*p) {
replay_numberNeigh_pkt*S = REPLAY_NUMBER_NEIGH_PKT(p);
numNeighNeigh numNeigh;
numNeigh.num = S->numNeigh;
numNeigh.idNeigh = S->id_neighs;
numNeigh.id = S->src_;
_buffer.insert(pair<int, numNeighNeigh> ((int) S->src_, numNeigh));
result_routing = TRUE;
}
Bng 4-21 K thut x l ti lp numNeighNeigh
4.6.4K thut truyn v nhn gi tin trong giao thc

Cc chc nng truyn v gi gi tin c vit trong lp chnh EMixAgent. Chng
ti to ra cc gi tin v ng k cc gi tin vi lp packet.h trong NS-2. Sau NS-2
s m nhn cng vic gi v nhn gi tin. Bt k mt giao thc no k tha t giao
thc trong NS-2 u phi nh ngha li 2 hm chc nng sau:
command(int argc, const char* const * argv)
Thc hin cc lnh ca giao thc, v d trong giao thc ca chng ti, lnh
rq_data c cu hnh trong tp tin kch bn (*.tcl) s c gi trong hm command
ny.
int EMixAgent::command(int argc, const char* const * argv) {
if (strcasecmp(argv[1], "rq_data") == 0) {
int n = argc - 2;
87
cout << Scheduler::instance().clock();

int* _items = new int[n];
for (int i = 0; i < n; i++) {
_items[i] = atoi(argv[i + 2]);
}
currentTime = Scheduler::instance().clock();
Queue(_items, n);
id_neighbors.output(id_neighbors.l);
return TCL_OK;
}
Bng 4-22 Hm comand
recv(Packet* p, Handler*h)
Hm ny x k gi tin nhn c t MU gi n. Cc thuc tnh cn thit ca mt

gi tin chng ti trnh by phn sau.
void EMixAgent::recv(Packet* p, Handler* h) {
hdr_cmn* ch=HDR_CMN(p);
if(ch->ptype()==PT_PROTONAME)
{
hdr_protoname_pkt* hdr=HDR_PROTONAME_PKT(p);
switch (hdr->ptype)
{
case rd_request:
handleRD_request(p);
break;
case search_neighbors:
feedback(p);
break;
case neighbor_feedback:
Save_neighbors(p);
output_neighbors();
break;
}
}
88
Bng 4-23 Hm recv
4.6.5Danh sch cc gi tin s dng trong giao thc E-MIX

STT
Tn gi tin
M t
Gi tin duy tr danh sch MU ln
hdr_protoname_pkt
request_numberNeigh_pkt
replay_numberNeigh_pkt
request_data_pkt
Gi tin yu cu d liu
request_data_routing_pkt
Gi tin duy tr nh tuyn
replay_data_routing_pkt
Gi tin tr li duy tr nh tuyn
join_resquest_pkt
relay_join_pkt
cn
Gi tin xc nh nt mng ca mt
nt
Gi tin tr li cho gi tin xc nh
nt mng
Gi tin nh tng hp d liu ca

MU ngun
Gi tin tr li cho yu cu nh tng
hp
Bng 4-24 Danh sch gi tin
4.6.6K thut to gi tin

Cc gi tin c cc thuc tnh khc nhau ph thuc vo tng giao thc, tng chc
nng. Trong NS-2, cc gi tin cn c cc cu trc thng tin iu hng, ngha l n
hng dn gi gi tin n a ch xc nh hoc pht qung b gi tin trong phm vi
pht sng ca MU.
Cu trc thng tin iu hng trong NS-2 c nh ngha phn u (header)
mi gi tin, cu trc thng tin iu hng c nh ngha l hdr_ip
*ip=HDR_IP(Packet*). Mt s thuc tnh quan trng ca cu trc c th hin
Bng 4-25:
Thuc tnh
saddr()
ngha
a ch ca MU ngun
89
a ch MU ch m MU ngun gi gi tin n hoc pht

gi
daddr()
tin
qung
cc
MU
xung
quanh
(IP_BROACAST).
Gi tr ttl mc nh trong NS-2
ttl()
Bng 4-25 Cu trc thng tin iu hng
Ngoi
ra
NS-2
cn
kiu
gi
tin
thng
dng
nh
hdr_cmn
*ch=HDR_CMN(Packet*). Mt s thuc tnh quan trong ca gi tin th hin Bng

4-26.
Thuc tnh
ngha
Kch thc gi tin
size()
Gi lp gi tin b li khi truyn
error()
next_hop()
Xc nh MU ch.
Bng 4-26 Cu trc thng tin "hdr_cmn *ch=HDR_CMN(Packet *)"
Trong giao thc EMixAgent, mt trong nhng gi tin m chng ti xy dng l

gi tin replay_numberNeigh_pkt, gi tin ny c nhim v hi p thng tin s lng
nt vng ca mt MU. Cu trc gi tin c trnh by trong Bng 4-27. Chi tit thuc
tnh cc gi tin c th hin trong Bng 4-28.
struct replay_numberNeigh_pkt {
int id_pkt;
nsaddr_t src_;
nsaddr_t des_;
int numNeigh;
MyList id_neighs;
static int offset_;
inline static int& offset() { return offset_; }
inline static replay_numberNeigh_pkt* access(const Packet* p) {
return (replay_numberNeigh_pkt*)p->access(offset_);
}
};
Bng 4-27 Cu trc gi tin "reply_numberNeigh_pkt"
90
Thuc tnh
ngha
ID ca gi tin
id_pkt
src_
a ch ngun ca gi tin
des_
a ch ch gi tin chuyn n
numNeigh
S lng nt vng ca MU
id_neighs
Cc thng tin hng xm ca MU
Bng 4-28 Cc thuc tnh trong gi tin "reply_numberNeigh_pkt"
4.6.7Gi gi tin
Sau khi to ra gi tin ca giao thc EMixAgent, chng ti thc hin ng k gi
tin trong NS-2. Qu trnh ng k c trnh by trong phn ph lc.
Tip theo chng ti thc hin gi gi tin n MU xc nh. Qu trnh gi c
trnh by trong Bng 4-29.
1. void EMixAgent::MU_find_neighs_timeout()
2. {
3.
int num=id_neighbors.getNumNode(id_neighbors.l);
4.
Packet *p=allocpkt();
5.
replay_numberNeigh_pkt *hdr=REPLAY_NUMBER_NEIGH_PKT(p);
6.
hdr_ip*ip=HDR_IP(p);
7.
hdr_cmn *ch=HDR_CMN(p);
8.
hdr->src_=id;
9.
hdr->id_neighs=id_neighbors;
10.
hdr->numNeigh=num;
11.
hdr->des_=IP_BROADCAST;
12.
ip->daddr()=IP_BROADCAST;
13.
ch->ptype()=RL_NUMNeigh;
14.
send(p,0);
15. }
Bng 4-29 Qu trnh gi gi tin n cc MU xc nh
4.6.8K thut xp lch thi gian

K thut xp lch thi gian ng vai tr quan trng trong giao thc EMixAgent,
khi mt yu cu d liu khng c tm thy ti nt vng v nt mng, yu cu s
91
c chuyn n BS gii quyt. V vy MU cn phi nh mt khong thi gian t,

sau mt khong thi gian t nu yu cu d liu khng c tm thy th yu cu
chuyn n BS.
Chng ti p dng k thut ny da vo lp TimerHandler trong NS-2, chng ti
k tha t lp ny v nh khong thi gian t nu yu cu d liu khng tm thy s
chuyn yu cu n BS. Mt trong nhng lp nh thi gian m chng ti xy dng l
lp PktNumNeigh_Timeout, lp PktNumNeigh_Timeout k tha t TimerHandler.
Cc lp ny c nhim v xc nh thi gian ch cc MUs nt vng hi p yu cu d
liu v MU ngun. Chi tit lp PktNumNeigh_Timeout c trnh by trong Bng
4-30:
1. class PktMU_Neighs_Timeout:public TimerHandler {
2. public:
3. PktMU_Neighs_Timeout(EMixAgent *agent):TimerHandler() {
4.
_agent=agent;
5.
6. protected:
7.
EMixAgent * _agent;
8.
virtual void expire(Event*);
9. };
Bng 4-30 Lp PktMU_Neighs_Timeout
Dng 8: Phng thc expire(Event*) k tha t lp TimerHandler v chng ti

nh ngha li ph hp vi giao thc EMixAgent, phng thc ny s gi thc thi tp
s kin sau khi ht mt chu k thi gian t. Chi tit phng thc expire c trnh by
trong Bng 4-31. C th trong giao thc EMixAgent chng ti thc hin nh sau:
pkt_MU_Neighs_timeout.resched(10.0);
Bng 4-31 Khi ng timeout
92
void PktMU_Neighs_Timeout::expire(Event *e)

{
_agent->MU_Neighs_timeout();
}
Bng 4-32 Phng thc expire
Phng thc resched(10.0): sau khong thi gian 10.0 ms chng trnh gi thc
thi
phng
thc
expire(Event
*e)
gi
thc
thi
phng
thc
MU_Neighs_timeout()trong giao thc EMixAgent.

4.6.9S lung x l thng tin cc module ca giao thc EMixAgent
Trong phn ny, chng ti trnh by c th lung x l cc module m chng ti
xy dng, chi tit c th hin Hnh 4-11.
Hnh 4-11 S lung x l cc module ca giao thc EMixAgent
93
4.6.10Bin dch NS-2

Sau khi xy dng giao thc EMixAgent, chng ti tch hp giao thc ny vo NS2 v bin dch li NS-2. Khi bin dch hon tt, chng ti c NS-2 tch hp giao
thc EMixAgent th hin kin trc E-MIX.
Qu trnh tch hp chng ti gii thiu trong phn ph lc B, bin dch li NS-2
chng ti dng lnh make trn cygwin, qu trnh bin dch th hin Hnh 4-11.
Hnh 4-12 Qu trnh bin dch NS-2
4.7 Kt lun
Trong chng ny, chng ti trnh by cc kin thc c bn v NS-2 v chng
trnh m phng kin trc E-MIX theo cc tiu ch ra trong chng 3. Chi tit v
NS-2, mi trng th nghim cygwin v chng trnh m phng s c trnh by c
th trong phn ph lc B. chng tip theo, chng ti tin hnh thc hin cc th
nghim theo tiu ch v so snh nh gi kt qu vi cc cng trnh nghin cu m
chng ti nu ra trong chng 2.
94
Chng 5 - KT QU M PHNG
5.1 Gii thiu
Trong chng 3, chng ti a r
a mt kin trc P2P trong mi trng h
thng thng tin di ng kin trc E-MIX. Da vo kin trc ny, chng ti tin hnh
thc hin cc m phng kim tra tnh hiu qu ca kin trc E-MIX. Cc tiu ch
th nghim chng ti t ra nh sau:
T l a yu cu d liu ln knh uplink
Thi gian p ng ca mt yu cu d liu
Thi gian p ng trung bnh ca mt yu cu d liu
S lng thng ip cho mt yu cu d liu.
S lng thng ip thng ip trung bnh cho mt yu cu d liu.
Trong chng ny, chng ti chia ra lm ba phn: Phn 5.2.1 trnh by cc tiu
ch, ngha v mc tiu a ra tiu ch th nghim. Phn l thc hin m phng kim
nghim tnh hiu qu ca kin trc E-MIX theo cc tiu ch c t ra.
5.2 M phng kim nghim kin trc

5.2.1Cc tiu ch m phng th nghim
5.2.1.1Tiu ch 1: T l a yu cu ln knh uplink

Chng ti a ra tiu ch ny nh gi hiu qu chia s d liu trong mt vng
cng tc ca cc MUs. Mc tiu ca tiu ch ny l hn ch cc MUs truy vn d liu
ti BS thng qua knh uplink. iu ny lm gim chi ph truyn thng, rt ngn thi
gian hi p truy vn d liu, gim bng thng v tit kim nng lng cho cc MUs.
5.2.1.2Tiu ch 2: Thi gian p ng ca mt yu cu d liu

Chng ti a ra tiu ch ny nh gi kh nng hiu qu v thi gian hi p
ca mt d liu yu cu. Mc tiu ca tiu ch ny l rt ngn thi gian hi p truy
vn d liu da vo vng cng tc ca cc MUs.
95
5.2.1.3Tiu ch 3: S lng thng ip ca mt yu cu d liu

Chng ti a ra tiu ch ny nh gi kh nng hiu qu v nng lng v
bng thng. Khi s lng thng ip cng nhiu s gy tn nhiu nng lng cho cc
MUs v bng thng trong vng cng tc ca cc MUs . S lng thng ip t l
thun vi s lng cc MUs, kt qu thc nghim s ch ra c th iu ny.
5.2.1.4Tiu ch 4: S lng thng ip ca mt yu cu d liu

Chng ti a ra tiu ch ny nh gi kh nng hiu qu v nng lng v
bng thng. Khi s lng thng ip cng nhiu s gy tn nhiu nng lng cho cc
MUs v bng thng trong vng cng tc ca cc MUs . S lng thng ip t l
thun vi s lng cc MUs, kt qu thc nghim s ch ra c th iu ny.
5.2.1.5Tiu ch 5: S lng thng ip trung bnh ca mt yu cu d liu

Tng t nh tiu ch 4, chng ti a ra tiu ch ny nh gi kh nng hiu
qu v nng lng v bng thng. Da vo cc kt qu cc kt qu ca tiu ch 4,
chng ti tnh s lng thng ip trung bnh nh gi s khc nhau v s lng
thng ip trung bnh so vi s lng cc MUs.
5.2.2Th nghim kim tra tnh hiu qu ca kin trc E-MIX
Trong phn th nghim ny, chng ti gi s mt yu cu d liu (RD) c nhiu
hng mc d liu v cc hng mc d liu ny phn b ti nhiu MU xc nh, v d
RD = {111, 135, 209}. V th chng ti t ra cc trng hp tng qut theo s phn
b ca cc hng mc d liu, chi tit c trnh by trong Bng 5-1.
Cc trng hp phn b d liu
1
LC5
DN6
Zone7
LC (Local) - D liu c tm thy ti kho lu tr cc b ca MU ngun
Thng tin d liu tm thy ti MU ln cn ca MU ngun
D liu tm thy ti cc MU vng hoc MU mng.
96
BS8
LC, DN
LC, Zone
LC, BS
DN, Zone
DN, BS
10
Zone, BS
11
LC, DN, Zone
12
LC, DN, BS
13
DN, Zone, BS
14
LC, Zone, BS
15
LC, DN, Zone, BS
Bng 5-1 Cc trng hp tng qut phn b d liu
Tuy nhin, vi nguyn l hot ca kin trc E-MIX (E-MIX- 39), chng ti phn
tch cc trng hp trong Bng 5-1 thnh cc trng hp chi tit hn c th hin
trong Bng 5-2.
Trng hp
ngha
Thng tin d liu c tm
D0
thy ti local ca cc MU d
liu (DN)
DN
D1
Thng tin d thy ti liu tm

RRT ca DN
Bng 5-2 Chi tit cc trng hp DN
5.2.3Cc trng hp th nghim kin trc E-MIX

Trong phn m phng kin trc E-MIX, chng ti a ra mt s trng hp th
nghim, c th c trnh by trong Bng 5-3. Chng ti k hiu DN=D, Zone=Z.
D liu c truy cp ti Base station
MIX 3: phm vi bn knh rng buc s bc nhy l 3
97
Cc trng hp th nghim E-MIX

1
LC
D0
D1
BS
LC, D0
LC, D1
LC, BS
D0, D1
10
LC, D0, D1
11
D0, D1, Z
12
D0, D1, BS
13
LC, D0, D1, Z
14
LC, D0, D1, BS
15
D0, D1, Z, BS
16
LC, D0, D1, Z, BS
Bng 5-3 Cc trng hp m phng th nghim kin trc E-MIX-3
5.3 Cu hnh m phng chung

5.3.1Cu hnh tham s th nghim
Chng ti thit lp cc tham s cu hnh cho chng trnh m phng c minh
ha trong Bng 5-4.
Tham s
Gi tr
Vng m phng
950m x 510m
S lng MU
10 100
Bng thng
2 Mb/s
Phm vi giao tip ca MU
250 m
Bn knh rng buc s bc nhy
2-3 bc nhy
98
S lng hng mc d liu
S lng MU x 10
Kch thc kho lu tr mi MU
10 hng mc d liu
Bng 5-4 Cu hnh tham s th nghim
5.3.2B d liu th nghim

Chng ti pht sinh 1000 hng mc d liu (items) tun t cho tt c 100 MUs,
mi MUs cha ti a 10 items trong kho lu tr. Chi tit 1000 items pht sinh tun t
c trnh by trong phn ph lc A.
Ti mi MU, chng ti xy dng mt cng thc tnh cch phn b cc items trong
kho lu tr ca MU. Cng thc tnh nh sau:
item = (IDMU *10) + 100
V d minh ha:
MU c ID 13 s bt u lu tr item: (13*10) +100 = 230. V th MU13 s bt u
lu tr t item 230. Nh vy MU13 s lu tr cc items t 230 n 23910.
Tng t: item (MU14) = (14*10) +100 = 240, MU14 lu tr cc items t 240 n
249.
5.3.3Kch bn v kt qu th nghim E-MIX-3
Vi 16 trng hp th nghim trong Bng 5-3, chng ti ln lt tin hnh m
phng vi 10 MUs, 20 MUs, 30 MUs, 40 MUs, 50MUs v 60 MUs
5.3.3.1M phng 10 MUs

Mi lin quan cc hng xm ca 10 MUs c trnh by ph lc A.
Gi s thng tin trong bng RRT ca cc MU nh trong ph lc A.
D liu yu cu ti cc MU trong mi trng hp c trnh by trong ph
lc A.
5.3.3.1.1Tiu ch s lng thng ip ca mt yu cu d liu
Kt qu m phng theo tiu ch v s lng thng ip ca mt yu cu d liu
nh sau:
10
Kch thc kho lu tr ti mi MU c qui nh l 10 items.
99
Bng kt qu
Trng
hp
MU
D liu yu cu
Kt qu
(RD)
(S lng thng ip)
{136, 139}
{136, 139}
14
{199, 205, 185}
22
{182}
28
{2000}
28
{144, 145, 136, 139}
14
10
11
12
13
14
15
16
{144, 145, 199, 205,

185}
{144, 145, 2000}
{136, 139, 199, 205,
185}
{144, 145, 136, 139, 199,
205, 185}
{136, 139, 199, 205, 185,
182}
{136, 139, 199, 205, 185,
2000}
{144, 145, 136, 139, 199,
205, 185, 182}
{144, 145, 136, 139, 199,
205, 185, 2000}
{136, 139, 199, 205, 185,
182, 2000}
{144, 145, 136, 139, 199,
205, 185, 182, 2000}
22
28
30
30
52
52
52
52
52
52
Bng 5-5 Kt qu s lng thng ip vi s lng 10 MUs
S
100
Hnh 5-1 Kt qu s lng thng ip vi s lng 10 MUs
Nhn xt:
Kt qu Hnh 5-1 cho thy i vi trng hp 1, 2, 3, 6, 7, 9, 10 th s lng thng

ip thp, bi v d liu ch ti b nh cc b, hay trong vng ca MU ngun v c
t thng tin ca MU tng hp d liu. Vi thng hp 4, 5 th s lng thng ip
vn thp d l yu cu d liu trn ng nh tuyn 1-2-3 bc nhy, nhng bi
hnh nh nn s lng thng ip vn thp. Cc trng hp khc d liu c tm
thy ti b nh cc b ca MU ngun, t d liu cc MU tng hp d liu gi v v
c cc MU trn ng nh tuyn 1-2-3 bc nhy, khi s lng thng ip tng,
mt khc s lng thng ip tng ph thuc vo s lng ca cc MU trong vng,
bi v MU ln cn cng tng th s lng thng ip pht ra cng nhiu. S lng
thng ip pht ra nhiu nht i vi cc trng hp a yu cu d liu n BS khi
d liu khng tm thy trong vng cng tc.
5.3.3.1.2Tiu ch thi gian p ng ca mt yu cu d liu
Kt qu m phng theo tiu ch v thi gian p ng ca mt yu cu d liu nh
sau:
-
Bng kt qu
Trng
hp
MU
D liu yu cu
Kt qu
(RD)
(Thi gian p ng)
{136, 139}
{136, 139}
20
101
{199, 205, 185}
50
{182}
330
{2000}
330
{144, 145, 136, 139}
20
10
11
12
13
14
15
16
{144, 145, 199, 205,

185}
{144, 145, 2000}
{136, 139, 199, 205,
185}
{144, 145, 136, 139, 199,
205, 185}
{136, 139, 199, 205, 185,
182}
{136, 139, 199, 205, 185,
2000}
{144, 145, 136, 139, 199,
205, 185, 182}
{144, 145, 136, 139, 199,
205, 185, 2000}
{136, 139, 199, 205, 185,
182, 2000}
{144, 145, 136, 139, 199,
205, 185, 182, 2000}
50
342
50
50
354
354
366
366
360
372
Bng 5-6 Kt qu thi gian p ng ca mt RD vi s lng 10 MUs
102
Hnh 5-2 Kt qu thi gian p ng so vi s lng 10 MUs
Nhn xt
Kt qu Hnh 5-2 cho thy thi gian p ng ti trng hp 1, 2, 6, 7, 9, 10 thp,

v d liu c tm thy ti kho lu tr cc b v t cc MU tng hp d liu gi v.
Cc trng hp khc, thi gian p ng tng dn khi d liu tm thy ti cc MU vng
v MU trn ng nh tuyn 1-2-3 bc nhy. Kt qu cng cho thy trng hp xu
nht khi yu cu d liu c pht n BS, bi v mt khong thi gian tm kim d
liu trong vng cng tc gia cc MUs. Thi gian p ng cng t l thun vi s
lng thng ip, v s lng thng ip pht ra cng nhiu, thi gian ch hi p
cng cao, do thi gian p ng di.

lc A.
nh sau:
-
Bng kt qu
Trng
hp
MU
D liu yu cu
Kt qu
(RD)
(S lng thng ip)
103
18
{287, 286, 288}
18
{222, 226}
22
18
{299, 112}
30
18
{245, 122}
54
18
{2000}
54
18
{283, 288, 222, 226}
22
18
{283, 288, 299, 112}
30
18
{283, 288, 2000}
54
18
{222, 226, 299, 112}
33
10
18
11
18
12
18
13
18
14
18
15
18
{283, 288, 222, 226,

299, 112}
{222, 226, 299, 112,
245, 122}
{222, 226, 299, 112,
2000}
{283, 288, 222, 226,
299, 112, 245, 122}
{283, 288, 222, 226,
299, 112, 2000}
{222, 226, 299, 112,
245, 122, 2000}
33
60
60
60
60
60
{283, 288, 222, 226,

16
18
299, 112, 245, 122,
60
2000}
Bng 5-7Kt qu s lng thng ip vi s lng 20 MUs
104
Nhn xt
Tng t cc trng hp thc nghim vi 10 MUs, i vi 20 MUs: cc trng

hp 1, 2, 3, 6, 7, 9, 10 cho kt qu s lng thng ip ging vi 10 MUs do d liu
tm thy ti vng, RRT, kho lu tr cc b. Tuy nhin cc trng hp khc s lng
thng ip tng khc nhau v s lng MUs khc nhau, cc MUs trong vng cng tc
cng tng th s lng thng ip pht ra cng nhiu. Cc trng hp d liu tm thy
ti cc MU vng v inh tuyn 1-2-3 bc nhy th s lng thng ip trung bnh t
l thun vi s lng MUs, chng ti thc nghim tiu ch ny phn sau.
sau:
-
Bng kt qu
Trng
hp
MU
D liu yu cu
Kt qu
(RD)
(Thi gian p ng)
18
{287, 286, 288}
18
{222, 226}
20
18
{299, 112}
50
18
{245, 122}
591
18
{2000}
580
18
{283, 288, 222, 226}
20
18
{283, 288, 299, 112}
50
105
18
{283, 288, 2000}
602
18
{222, 226, 299, 112}
50
10
18
11
18
12
18
13
18
14
18
15
18
{283, 288, 222, 226,

299, 112}
{222, 226, 299, 112,
245, 122}
{222, 226, 299, 112,
2000}
{283, 288, 222, 226,
299, 112, 245, 122}
{283, 288, 222, 226,
299, 112, 2000}
{222, 226, 299, 112,
245, 122, 2000}
50
624
613
646
635
635
{283, 288, 222, 226,

16
18
299, 112, 245, 122,
657
2000}
Hnh 5-4 Kt qu thi gian p ng ca mt RD vi s lng 20 MUs
Nhn xt
106
Tng t nh tiu ch s lng thng ip, thi gian p ng t l thun vi s

lng MUs, v vy thi gian p ng trung bnh t l thun s lng MUs. Chng ti
thc nghim tiu ch ny phn sau.

lc A.
5.3.3.3.1Chi tit qu trnh chn la DN gi d liu ti QN trong trng hp th
nghim 3
-
Danh sch cc DN gi RJoinResquest v cho QN 23

Danh sch hng
Chi ph tng
S lng hng
Chi ph tng
hp
mc tng hp
hp trung bnh
17
{173, 334}
25
{366}
DN
mc d liu tng
hp
Danh sch cc DN sau khi sp xp theo chi ph trung bnh v s lng hng
mc
Danh sch hng
Chi ph tng
S lng hng
Chi ph tng
hp
mc tng hp
hp trung bnh
17
{173, 334}
25
{366}
DN
mc d liu tng
hp
Danh sch hng mc d liu QN ang cn thiu (tnh n thi im nhn gi

tin RJoinResquest): 173, 334, 366
Danh sch hng mc d liu QN chnh thc yu cu DN gi v

DN
Danh sch hng mc d liu tng hp
107
17
{173, 334}
25
{366}

nh sau:
-
Bng kt qu
Trng
hp
MU
D liu yu cu
Kt qu
(RD)
(S lng thng ip)
23
{334, 335, 336}
23
{356, 359}
20
23
{334, 173, 366}
31
23
{154}
49
23
{2000}
49
23
{334, 336, 356, 359}
20
23
23
23
10
23
11
23
12
23
13
23
14
23
{334, 336, 334, 173,

366}
{334, 336, 2000}
{356, 359, 334, 173,
366}
{334, 336, 356, 359,
334, 173, 366}
{356, 359, 334, 173,
366, 154}
{356, 359, 334, 173,
366, 2000}
{334, 336, 356, 359,
334, 173, 366, 154}
{334, 336, 356, 359,
108
31
49
31
31
48
48
48
48
334, 173, 366, 2000}

23
15
{356, 359, 334, 173,
48
366, 154, 2000}

{334, 336, 356, 359,
23
16
334, 173, 366, 154,
48
2000}

sau:
-
Bng kt qu
Trng
hp
MU
D liu yu cu
Kt qu
(RD)
(Thi gian p ng)
23
{334, 335, 336}
23
{356, 359}
20
23
{334, 173, 366}
50
23
{154}
530
23
{2000}
530
23
{334, 336, 356, 359}
20
109
23
23
23
10
23
11
23
12
23
13
23
14
23
15
23
{334, 336, 334, 173,

366}
{334, 336, 2000}
{356, 359, 334, 173,
366}
{334, 336, 356, 359,
334, 173, 366}
{356, 359, 334, 173,
366, 154}
{356, 359, 334, 173,
366, 2000}
{334, 336, 356, 359,
334, 173, 366, 154}
{334, 336, 356, 359,
334, 173, 366, 2000}
{356, 359, 334, 173,
366, 154, 2000}
50
550
50
50
570
570
590
590
580
{334, 336, 356, 359,

16
23
334, 173, 366, 154,
600
2000}

110

lc A.
nh sau:
-
Bng kt qu
Trng
hp
MU
D liu yu cu
Kt qu
(RD)
(S lng thng ip)
35
{334, 335, 336}
35
{431, 366}
34
35
{233, 465, 314}
49
35
{501}
72
35
{2000}
72
35
{456, 455, 431, 366}
34
35
35
35
10
35
11
35
12
35
13
35
{456, 455, 233, 465,

314}
{456, 455, 2000}
{431, 366, 233, 465,
314}
{456, 455, 431, 366,
233, 465, 314}
{431, 366, 233, 465,
314, 501}
{431, 366, 233, 465,
314, 2000}
{456, 455, 431, 366,
111
49
72
54
54
75
75
75
233, 465, 314, 501}

14
35
15
35
{456, 455, 431, 366,
75
233, 465, 314, 2000}

{431, 366, 233, 465,
75
314, 501, 2000}

{456, 455, 431, 366,
35
16
233, 465, 314, 501,
75
2000}

sau:
-
Bng kt qu
Trng
hp
MU
D liu yu cu
Kt qu
(RD)
(Thi gian p ng)
35
{334, 335, 336}
35
{431, 366}
20
35
{233, 465, 314}
50
112
35
{501}
730
35
{2000}
730
35
{456, 455, 431, 366}
20
35
35
35
10
35
11
35
12
35
13
35
14
35
15
35
{456, 455, 233, 465,

314}
{456, 455, 2000}
{431, 366, 233, 465,
314}
{456, 455, 431, 366,
233, 465, 314}
{431, 366, 233, 465,
314, 501}
{431, 366, 233, 465,
314, 2000}
{456, 455, 431, 366,
233, 465, 314, 501}
{456, 455, 431, 366,
233, 465, 314, 2000}
{431, 366, 233, 465,
314, 501, 2000}
50
758
50
50
786
786
814
814
800
{456, 455, 431, 366,

16
35
233, 465, 314, 501,
828
2000}
113
5.3.3.4.3Tiu ch t l a yu cu ln knh uplink

Mc tiu ca tiu ch ny l xc nh s lng yu cu d liu a ln knh uplink
(c ngha l xc nh s lng yu cu d liu c gii quyt ti BS). V th, chng
ti xy dng mt kch bn p dng m phng tiu ch ny. Kch bn thc hin
tiu ch ny nh sau: vi s lng l 40 MUs, chng ti tin hnh cho tt c cc MUs
cng thc hin truy vn d liu yu cu, chi tit mi MU truy vn d liu s c
trnh by trong ph lc A.
-
Kt qu thc hin m phng c trnh by trong Hnh 5-9 v chi tit c th

trong Bng 5-13.
Hnh 5-9 Kt qu tiu ch a yu cu ln knh uplink
114
T l a yu cu ln knh uplink
Uplink
14%
Zone
86%
Bng 5-13 Kt qu tiu ch a yu cu ln knh uplink
Nhn xt:
Kt qu Hnh 5-9 cho thy s lng yu cu d liu c gii quyt trong vng
cng tc gia cc MUs l 86%, ti BS l 14%. Chng ti thc nghim tiu ch ny
nh gi tnh hiu qu chia s d liu trong vng cng tc, gim chi ph truyn thng,
rt ngn thi gian hi p truy vn d liu, gim bng thng ln BS v tit kim nng
lng cho cc MUs.

lc A.
nh sau:
-
Bng kt qu
Trng
hp
MU
D liu yu cu
Kt qu
(RD)
(S lng thng ip)
31
{419, 411, 416}
31
{162, 131}
58
31
{184, 505, 555}
70
31
{355}
113
31
{2000}
113
31
{416, 419, 162, 131}
58
31
{416, 419, 184, 505,
70
115
555}
8
31
31
10
31
11
31
12
31
13
31
14
31
15
31
{416, 419, 2000}

{162, 131, 184, 505,
555}
{416, 419, 162, 131,
184, 505, 555}
{162, 131, 184, 505,
555, 355}
{162, 131, 184, 505,
555, 2000}
{416, 419, 162, 131,
184, 505, 555, 355}
{416, 419, 162, 131,
184, 505, 555, 2000}
{162, 131, 184, 505,
555, 355, 2000}
113
73
73
145
145
145
145
145
{416, 419, 162, 131,

16
31
184, 505, 555, 355,
145
2000}
116

sau:
-
Bng kt qu
Trng
hp
MU
D liu yu cu
Kt qu
(RD)
(Thi gian p ng)
31
{419, 411, 416}
31
{162, 131}
50
31
{184, 505, 555}
50
31
{355}
1330
31
{2000}
1330
31
{416, 419, 162, 131}
50
31
31
31
10
31
11
31
12
31
13
31
14
31
15
31
16
31
{416, 419, 184, 505,

555}
{416, 419, 2000}
{162, 131, 184, 505,
555}
{416, 419, 162, 131,
184, 505, 555}
{162, 131, 184, 505,
555, 355}
{162, 131, 184, 505,
555, 2000}
{416, 419, 162, 131,
184, 505, 555, 355}
{416, 419, 162, 131,
184, 505, 555, 2000}
{162, 131, 184, 505,
555, 355, 2000}
{416, 419, 162, 131,
117
50
1382
50
50
1434
1434
1486
1486
1460
1512
184, 505, 555, 355,

2000}

lc A.
nh sau:
-
Bng kt qu
Trng
hp
MU
D liu yu cu
Kt qu
(RD)
(S lng thng ip)
51
{648, 644, 645}
51
{656, 659}
54
51
{231, 407, 313}
91
118
51
{688}
98
51
{2000}
98
51
{648, 644, 656, 659}
54
51
51
51
10
51
11
51
12
51
13
51
14
51
15
51
16
51
{648, 644, 231, 407,

313}
{648, 644, 2000}
{656, 659, 231, 407,
313}
{648, 644, 656, 659, 231,
407, 313}
{656, 659, 231, 407, 313,
688}
{656, 659, 231, 407, 313,
2000}
{648, 644, 656, 659, 231,
407, 313, 688}
{648, 644, 656, 659, 231,
407, 313, 2000}
{656, 659, 231, 407, 313,
688, 2000}
{648, 644, 656, 659, 231,
407, 313, 688, 2000}
91
98
94
94
116
116
116
116
116
116
119

sau:
-
Bng kt qu
Trng
hp
MU
D liu yu cu
Kt qu
(RD)
(Thi gian p ng)
31
{419, 411, 416}
31
{162, 131}
20
31
{184, 505, 555}
50
31
{355}
1230
31
{2000}
1230
31
{416, 419, 162, 131}
20
31
31
31
10
31
{416, 419, 184, 505,

555}
{416, 419, 2000}
{162, 131, 184, 505,
555}
{416, 419, 162, 131, 184,
505, 555}
120
50
1278
50
50
11
31
12
31
13
31
14
31
15
31
16
31
{162, 131, 184, 505, 555,

355}
{162, 131, 184, 505, 555,
2000}
{416, 419, 162, 131, 184,
505, 555, 355}
{416, 419, 162, 131, 184,
505, 555, 2000}
{162, 131, 184, 505, 555,
355, 2000}
{416, 419, 162, 131, 184,
505, 555, 355, 2000}
1326
1326
1374
1374
1350
1398
5.3.4nh gi kt qu th nghim E-MIX

Da vo cc kt qu th nghim kin trc E-MIX vi cc s lng MUs nh: 10,
20, 30 v 40, 50, 60, chng ti tin hnh tnh s lng thng ip trung bnh v thi
gian p ng trung bnh ca mt yu cu d liu.
121
Kt qu m phng theo tiu ch v s lng thng ip trung bnh v thi gian p

ng trung bnh ca mt yu cu d liu c trnh by trong Bng 5-18, Hnh 5-14 v
Hnh 5-15:
-
Bng kt qu
S lng
Thi gian p ng
S lng thng ip
MUs
trung bnh (ms)
trung bnh
10
213
33
20
364
43
30
334
37
40
455
59
50
822
101
60
758
92
Bng 5-18 Kt qu s lng thng ip trung bnh v thi gian p ng trung bnh
vi tng s lng MUs
Hnh 5-14 Thi gian p ng trung bnh ca mt yu cu d liu
122
Hnh 5-15 S lng thng ip trung bnh ca mt yu cu d liu
Nhn xt:
Kt qu 2 biu cho thy s lng thng ip trung bnh v thi gian p ng

trung bnh t l thun vi s lng MUs, khi s lng MUs trong vng cng tc tng,
s thng ip pht ra cng nhiu, thi gian ch cc MUs vng hi p cng di. V
vy kt qu Hnh 5-14, Hnh 5-15 cho thy s lng MUs cng tng th s lng
thng ip trung bnh v thi gian p ng trung bnh cng tng.
5.4 Kt lun
Nh cp chng 3, chng ti pht trin kin trc E-MIX da trn vic k
tha kin trc MIX [12]. Sau khi xy dng hon chnh v kim tra kt qu m phng
ca kin trc E-MIX, chng ti p ng y cc yu cu ca kin trc MIX,
ngoi ra kin trc E-MIX cn p ng vic truy vn cho nhiu hng mc d liu. Chi
tit so snh gia hai kin trc MIX v E-MIX s c trnh by Bng 2-1.
Kin trc MIX
Kin trc E-MIX
Yu cu
Lu tr hng Lu tr theo hng mc d liu Lu tr theo hng mc d liu
mc d liu
chnh v ph
chnh v ph, c s dng c u

tin i vi nhng hng mc
trong danh sch yu cu
Thay
th Thay th cc hng mc d liu Thay th cc hng mc d liu
trong kho lu chnh theo nhn thi gian.
123
chnh theo nhn thi gian.
tr
Thay th hng mc d liu ph Thay th cc hng mc d liu

bng thut ton LRU
ph bng thut ton LUV
Duy tr lch Cp nht cc lch s trao i d liu khi nhn hng mc d liu.
s trao i d
liu
Duy tr ng nh k theo thi gian pht gi tin cp nht bng nh tuyn
nh
tuyn
trong
ngoi vng
Truy vn d Mi truy vn ch yu cu duy Cho php yu cu nhiu hng
liu
nht mt hng mc d liu
mc d liu trong mt truy vn
H tr tng Khng c
Yu cu v chn la cc nt ln
hp
cn tng hp ph d liu ti
u chi ph tng hp (Xem minh
ha qu trnh chn node ti
5.3.3.3.1).
Tiu ch th nghim
S lng thng ip
Thi gian p ng
T l c d liu
S lng thng ip trung bnh
Thi gian p ng trung bnh
Bng 5-19 So snh vi kin trc MIX
124
Chng 6 - KT LUN
6.1 Kt lun
Sau 6 thng thc hin ti, chng em t c cc kt qu nh sau:
V mt l thuyt:
M hnh cng tc chia s d liu gia cc kho lu tr trong mng P2P
p ng truy vn cho nhiu hng mc d liu trong cng mt lt yu cu
Xy dng chin lc lu tr, thay th d liu h tr cho truy vn a hng
mc
K hoch iu phi, chn la client tng hp d liu thay cho nt ngun
V ng dng minh ha:
Chng em hin thc ha mt kin trc cng tc chia s d liu hiu qu trong
m hnh mng P2P vo mi trng c s d liu di ng. Sau , ci t th nghim
thut ton v a ra kt qu thc nghim cho bi ton.
nh gi kin trc khi c ci t v th nghim:
Chng em xy dng mt kin trc cho thy hiu qu trong vic chia s d liu
gia cc MU trong vng cng tc. Kin trc gii quyt c truy vn a hng mc d
liu t ngi dng, ng thi vn p ng y cc x l cn thit cho h thng
cng tc d liu so vi kin trc KIX. Ngoi ra, chin lc lp k hoch iu phi v
chn la gii php tng hp d liu gip tng hiu qu v bng thng, rt ngn thi
gian truy vn d liu, hiu qu v nng lng.
Vi phm vi ca ti lun vn v khong thi gian thc hin ngn, chng em gp
rt nhiu kh khn trong vic a ra gii php gii quyt bi ton v hon thnh ti.
Tuy nhin, vi s hng dn tn tnh ca c Nguyn Trn Minh Th chng em
xut c kin trc hiu qu trong mng P2P p dng trong mi trng h thng
thng tin di ng v hon tt c mc tiu ra.
6.2 Hng pht trin lun vn

Lun vn khp li vi nhng kt qu t c theo yu cu ca ti. Tuy
nhin trong qu trnh nghin cu, chng em nhn thy trin khai s dng thc
t kin trc xut th cn pht trin thm mt s chc nng sau ng dng hon
125
thin hn. Do , chng em xin trnh by cc chc nng nh l hng pht

trin ca ti:
Ci t thc nghim vi d liu XML(do NS-2 khng h tr XML)
ng b d liu
Trin khai m hnh c server (do NS-2 khng h tr server)
126
TI LIU THAM KHO

Cng trnh nghin cu
[1] Albert Y.Zomaya, "Algorithms And Protocols For Wireless And Mobile Ad
Hoc Networks" , Wiley, 2009
[2] Mohammad Ilyas, Imad Mahgoub, Mobile Computing Handbook, CRC Pr I
Llc, NewYork, 2005
[3] Amitava Mukherjee, Somprakash Bandyopadhyay, Debashis Saha, Location
Management and Routing in Mobile Wireless Networks, ArtechHouse,
Boston, London, 2003
[4] Stefano Basagni, Marco Conti, Silva Giodano, Ivan Stojmenovic, Mobile Ad
hoc Networking, IEEE, Wiley Interscience, 2004
[5] Ben Liang, Zygmunt J.Haas, Hybrid Routing in Ad Hoc Networks with a
Dynamic Virtual Backbone, 2006
[6] Liangzhong Yin, Guohong Cao, Supporting Cooperative Caching in Ad Hoc
Networks, IEEE, 2004
[7] Jinbao Li, Yingshu Li, My T.Thai, Ianzhong Li, Caching and Query
Processing in MANETs, IEEE, 2005
[8] Yi-Wei Ting, Yeim-Kuan Chang, A Novel Cooperative Caching Scheme for
Wireless Ad Hoc Networks: GroupCaching, IEEE, 2007
[9] Narottam Chanda, R.C.Joshi, Manoj Misrab, Cooperative caching in mobile
ad hoc networks based on data utility, IOS Press, 2007
[10]
Improving On-Demand Data Access Efciency in MANETs with
Cooperative Caching [2009], Yu Du, Sandeep K.S. Gupta, Georgios

Varsamopoulos
[11]
G. AnandHaraj, R.Anitha, An Improved Architecture for Complete
Cache Management In Mobile Computing Environments, Medwell Journals,

2009
127
[12]
Phm Minh T, H L Th Kim Nhung, Nghin cu, vn dng m hnh
mng P2P vo kin trc h thng thng tin di ng hiu qu, Lun vn c
nhn Khoa Cng ngh thng tin, i hc Khoa hc t nhin, 2010
[13]
Implementing a New Manet Unicast Routing Protocol in NS2 [2004],
Francisco J. Ros, Pedro M. Ruiz

[14]
Thu.N.T.M, Thuy.D.T.B, "A mobile information system achitecture
supports effective query in mobile environment" , Internal Research Report,

2009
Cc website
[15] http://en.wikipedia.org/wiki/Peer-to-peer
[16] http://www.isi.edu/nsnam/ns/doc/index.html
[17] http://www.devexpress.com/
[18] http://www.cygwin.com/
128

Bao Cao

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

Bao Cao

Uploaded by

Copyright:

Available Formats

TRNG I HC KHOA HC T NHIN

KHOA CNG NGH THNG TIN

LA PHNG THANH L TH THANH THY

NGHIN CU K THUT CNG TC KHO D LIU LU

KHA LUN TT NGHIP C NHN CNTT

TP. HCM, 2010

TRNG I HC KHOA HC T NHIN

LA PHNG THANH - 0612390

NGHIN CU K THUT CNG TC KHO D LIU LU

KHA LUN TT NGHIP C NHN CNTT

GIO VIN HNG DN

KHA 2006 - 2010

Sinh vin thc hin

Khoa Cng Ngh Thng Tin

CNG CHI TIT

Th.S Nguyn Trn Minh Th

La Phng Thanh L Th Thanh Thy

2.3.3 K thut lu tr theo nhm v truy vn tng hp d liu phn tn ....... 14

3.4.1 Lung x l ti lp Cooperative Caching Process ................................ 39

4.4.1 Gii thiu ............................................................................................. 63

5.2 M phng kim nghim kin trc ............................................................... 95

5.3.3.5.2 Tiu ch thi gian p ng ca mt yu cu d liu............... 117

Hnh 4-6 Mn hnh Model ......................................................................................... 67

Bng 4-15 Cu trc d liu lp EMixAgent .............................................................. 80

Bng 5-14 Kt qu s lng thng ip vi s lng 50 MUs................................. 116

1.3 Hng tip cn v gii quyt bi ton

Mt s cng trnh m chng ti tm hiu nh: Caching and Query Processing

Chng 2 - TNG QUAN V M HNH CNG TC

nguyn sn c ca tt c cc MUs trong h thng mng, nh vic phn b lu

2.2 Cc chin lc qun l v thay th kho lu tr trong m hnh

2.2.1.1Thut ton da trn vng nh tm (Temporal Locality Based

chn thay th n v d lu nht cha c truy cp. Do nhn t chnh quyt

2.2.1.2Thut ton da trn li ch (hoc da trn chi ph):

2.3 S lc cc cng trnh nghin cu v cng tc chia s d liu

ng cng tc chia s kho lu tr gim thi gian ch v tng kh nng ly c d

Access Efciency in MANETs with Cooperative Caching ca tc gi Yu Du, xut

Hnh 2-1 M hnh kin trc h thng

2.3.2.1Phng thc hot ng

Hnh 2-2 Nguyn l hot ng ca kin trc

2.3.2.2Kin trc v nguyn l hot ng

Hnh 2-3 Kin trc ti MU

Lp User Application c nhim v nhn yu cu d liu ca ngi dng, chuyn

Hnh 2-4 M hnh kin trc MIX

c tm thy, kt qu s tr v cho ngi dng. Ngc li, MU ny gi yu cu n

nht cha c truy xut

TTL (Time to live): Gi tr TTL c s dng thay th gi tr mi khi chu k sng ca gi tr

cho mi MU) th vic tm d liu s c dng li v yu cu ca MU s c gi

Hnh 2-5 X l Routing Process

Ti mi MUj s gii quyt yu cu d liu da vo kin trc MIX. Lp Routing

Hnh 2-6 X l Route Discovery Phase

Trong giai on Route Selection Phase: Nhim v ca module ny l tm MUj c

2.3.3.1K hoch truy vn d liu ti mt MU da trn chin lc lu tr

NU l truy vn cc b, MU s tm kim trong kho

d liu tha iu kin truy vn (tp so khp)

Chuyn n MU ch cu truy vn m tp so khp

NU MU c lu tr d liu (MU d liu) thuc nhm

NGC LI, tm kim ch mc trong kho lu tr

Khi to mt truy vn con t truy vn ban u v

Gi truy vn con va khi to n MU thnh vin

3. NU MU d liu nhn c truy vn

Thc thi cu truy vn trong d liu cc b hoc

Gi kt qu ca truy vn con ny n MU truy vn

4. MU truy vn nhn c tt c kt qu ca cc truy vn