I HC QUC GIA H NI TRNG I HC CNG NGH

Mai Hu Tin

CHNG TN CNG CHE KHUT TRONG CC MNG NGANG HNG

KHO LUN TT NGHIP I HC H CHNH QUY

Ngnh: Cng ngh thng tin

Cn b hng dn: TS. Nguyn i Th

H NI - 2009

CHNG TN CNG CHE KHUT TRONG CC MNG NGANG HNG

Li cm n
Trc tin, ti xin chn thnh cm n cc thy c gio trong khoa Cng ngh Thng tin trng i hc Cng Ngh - i hc Quc gia H Ni dy d v ch bo nhit tnh cho ti trong sut bn nm hc qua. Ti xin gi li cm n su sc nht ti TS. Nguyn i Th - ph ch nhim b mn Mng v Truyn thng my tnh, l ngi hng dn trc tip cho ti trong qu trnh thc hin kha lun. Thy cho ti nhiu tng v kinh nghim qu bu hon thnh kha lun ny. Ti xin chn thnh cm gia nh, bn b v ngi thn lun ng vin v gip ti trong thi gian qua. y l ch da tinh thn vng chc v l ngun ng vin to ln gip ti vt qua kh khn trong thi gian thc hin kha lun cng nh trong cuc sng. Ti xin chn thnh cm n! H Ni, ngy 24/05/2009 Sinh vin

Mai Hu Tin

Tm tt
Kha lun tt nghip 2 Mai Hu Tin

CHNG TN CNG CHE KHUT TRONG CC MNG NGANG HNG Trong mng ngang hng, mt node mun giao tip vi cc node khc trong mng u phi thng qua cc node m n c lin kt trc tip ti, cc node ny c gi l cc hng xm ca n. Trong qu trnh cc thng ip c gi, cc node hng xm ng vai tr nh cc b nh tuyn, n gip chuyn tip cc thng ip ti ch mt cch chnh xc. c trng ny ca mng ngang hng l im yu m k tn cng mun li dng. Mt k tn cng nu iu khin c cc node hng xm ca node chun th n c th che khut node chun vi cc node khc trong mng, hnh thc tn cng nh vy c gi l tn cng che khut. C mt phng php phng chng tn cng che khut hiu qu c Atul Singh mt ging vin ca trng i hc Rice (M) cng cc ng nghip a ra c trnh by trong bi bo [1] l phng php kim tra n danh da vo vic gii hn bc ca cc node trong mng. c th nh gi hiu qu ca phng php ny, ti xy dng mt chng trnh m phng phng php kim tra n danh, kt qu th nghim cho thy c ti hn 90% cc node gy hi b pht hin.

Kha lun tt nghip

Mai Hu Tin

CHNG TN CNG CHE KHUT TRONG CC MNG NGANG HNG

Mc lc
Li cm n.......................................................................................................................... 2 Tm tt................................................................................................................................ 2 Mc lc............................................................................................................................... 4 Cc ch vit tt................................................................................................................... 6 Hnh nh.............................................................................................................................7 th.................................................................................................................................. 7 M u................................................................................................................................ 1 Chng 1. TNG QUAN V MNG XP CHNG........................................................4 1.1. Gii thiu mng xp chng..........................................................................................4 1.2. Mng xp chng ngang hng.......................................................................................5 1.2.1. Tng quan mng xp chng ngang hng khng c cu trc......................................6 1.2.2. Tng quan mng xp chng ngang hng c cu trc.................................................6 1.3. Mng xp chng ngang hng c cu trc Pastry..........................................................9 1.3.1. Khng gian nh danh...............................................................................................9 1.3.2. Thng tin dng trong nh tuyn.............................................................................10 1.3.3. Trng thi node.......................................................................................................11 1.3.4. Phng php nh tuyn..........................................................................................12 1.3.5. Kh nng t t chc................................................................................................13 1.3.6. Thc hin nh tuyn..............................................................................................15 Chng 2. TN CNG TRONG MNG NGANG HNG............................................17 2.1. Tn cng mo nhn....................................................................................................18 2.2. Tn cng che khut....................................................................................................19 2.3. So snh tn cng mo nhn v tn cng che khut.....................................................20 Chng 3. CC C CH PHNG CHNG TN CNG CHE KHUT............................................................................................................................22 3.1. Mt s phng php phng chng tn cng che khut..............................................22 3.2. C ch gii hn bc....................................................................................................23 3.3. C ch kim tra n danh.............................................................................................26 Chng 4. M PHNG V NH GI C CH KIM TRA N DANH DA TRN PASTRY........................................................................................................................... 31 Kha lun tt nghip 4 Mai Hu Tin

CHNG TN CNG CHE KHUT TRONG CC MNG NGANG HNG 4.1. Hnh trng mng v cc file th vin lin kt ng trong m phng..........................31 4.1.1. Hnh trng mng m phng.....................................................................................31 4.1.2. Cc file th vin lin kt ng trong chng trnh..................................................32 4.2. Xy dng chng trnh m phng kim tra n danh..................................................33 4.2.1. M t chng trnh..................................................................................................33 4.2.2. Cc file chng trnh...............................................................................................36 4.3. Th nghim v nhn xt..............................................................................................39 4.3.1. Th nghim 1...........................................................................................................39 4.3.2. Th nghim 2...........................................................................................................41 4.3.3. Nhn xt..................................................................................................................42 Chng 5. KT LUN ....................................................................................................44 Ti liu tham kho............................................................................................................45

Kha lun tt nghip

Mai Hu Tin

CHNG TN CNG CHE KHUT TRONG CC MNG NGANG HNG

Cc ch vit tt

T vit tt CRT DHT GT-ITM

T gc Constraints routing table Distributed hash table Georgia Tech Internetwork Topology Models Proximity neighbor selection Peer to peer

Ngha ting Vit Rng buc bng nh tuyn Bng bm phn tn M hnh topo lin mng ca trng Georgia La chn hng xm ln cn Mng ngang hng

PNS P2P

Kha lun tt nghip

Mai Hu Tin

CHNG TN CNG CHE KHUT TRONG CC MNG NGANG HNG

Hnh nh
Hnh 1: Khng gian nh danh Pastry 4 bit vi su kha c nh x vo nm node.......10 Hnh 2: Bng nh tuyn, tp l, tp ln cn ca node c nh danh 10233102................11 Hnh 3: Cc node gy hi chia mng xp chng ra lm hai mng con.............................19 Hnh 4: Tp Con tr ngc - Back pointer set..................................................................26 Hnh 5: A kim tra B thng qua node trung gian I............................................................27 Hnh 6: Minh ha mng giao vn nhnh Transit stub.....................................................31 Hnh 7:Cc loi thng ip trong kim tra n danh...........................................................35

th
Biu 1: T l node gy hi b pht hin trong th nghim 1..........................................39 Biu 2: T l node chun khng vt qua c kim tra trong th nghim 1 .............40 Biu 3:T l node gy hi b pht hin trong th nghim 2...........................................41 Biu 4: T l node chun b kt lun nhm l node gy hi trong th nghim 2............41

Kha lun tt nghip

Mai Hu Tin

M u
S ngi dng Internet tnh n nm 2008 l hn 1,46 t ngi (s liu t trang Internetworldstats.com) so vi 35.000 ngi nm 1987 v tng ti 46% trong hai nm t 2006 n 2008 (theo t Washington Post), iu ny chng t Internet ang c tc tng trng rt cao trn ton th gii. Vi s pht trin nhanh ca s ngi dng Internet nh vy, m hnh phc v client-server ang dn bc l im yu ca mnh l vic qu ti bng thng dn n server khng th p ng ht tt c yu cu t pha client khi lng client kt ni ti server qu cao. Mt trong nhng cng ngh c hi vng c th gii quyt vic qu ti bng thng trong m hnh client-server chnh l cng ngh mng ngang hng. Ngy nay, mng ngang hng ang dn tr nn ph bin v thu ht c rt nhiu s quan tm ca ngi dng, cc nh pht trin ng dng v cc nh nghin cu. Ging nh m hnh client-server, mng ngang hng cng phi i mt vi nguy c b tn cng t pha nhng k xu mun ph hoi mng v khng ch my tnh ca ngi s dng. Mt trong nhng mc ch chnh ca ngi s dng Internet l chia s d liu m mnh c nh cc b phim, hnh nh, bi ht vi ngi thn v nhng ngi khc trn ton th gii, cng ngh mng ngang hng c th p ng tt nhu cu ny v n ang c s dng ph bin. C nhng lc cao im, mng chia s file ngang hng chim ti 90% bng thng ca mng Internet (theo t Washington Post). Ngoi ng dng chia s file, cn c mt ng dng ni bt da trn mng ngang hng khng th khng ni ti l ng dng gi tin nhn tc thi vi cc nh cung cp dch v ni ting nh ICQ, Yahoo, AOL,... Mng ngang hng qu ph bin v ang l mc tiu ph hoi ca nhng k xu. S l thm ha ln cho ngi dng khi b k xu tn cng, nht l trong mng ngang hng, bi cc my tham gia vo mng u bnh ng vi nhau, thng khng c mt s qun l tp trung no trong mng. Do , k tn cng c th d dng gia nhp vo mng thc hin cc hnh vi ph hoi nh ngn cn giao tip gia cc my, khng ch vic gi v nhn d liu, cy cc chng trnh ph hoi vo my ngi dng, pht tn cc m c Cc dng tn cng thng gp trong mng ngang hng l: tn cng mo nhn, tn cng che khut, tn cng bng cc file c Trong cc cch tn cng ny, th tn cng che khut l ph bin v kh phng chng nht. Mun thc hin tn cng che khut, k tn cng phi a cc node gy hi vo trong tp hng xm ca cc node chun,

nu t l node gy hi trong tp hng xm ca cc node chun cng cao th hiu qu ca tn cng che khut s cng cao. c th a cc node ph hoi vo cc tp hng xm, node ph hoi thng li dng qu trnh node mi tham gia vo mng v qu trnh cp nht tp hng xm theo chu k. Trong cc qu trnh ny, tp hng xm ca cc node chun s c b xung node mi v thay th cc node li, y thi c thch hp node gy hi c a vo trong tp hng xm ca cc node chun. Khi chim c nhiu v tr trong tp hng xm ca cc node chun, node gy hi c th che khut cc node chun vi cc node khc trong mng, bi khi gi thng ip cho cc node khc u phi qua cc node gy hi trong tp hng xm, do mi giao tip ca node chun vi cc node khc u b node gy hi khng ch v kim sot. Vi cch thc tn cng nh vy, cc node gy hi c th khng ch ton b bng thng v d liu truyn trong mng khi che khut c nhiu node chun. Trc cc tc hi do tn cng che khut c th gy ra, vn cp thit l cn c mt c ch hiu qu ngn chn cc hnh vi che khut ca cc node gy hi trong mng ngang hng m bo cho mng hot ng bnh thng v n nh. Phng php chng tn cng che khut c th c p dng trong khng li ca mng v xy dng m hnh khng li Byzantine[7] trong mng ni chung v mng ngang hng ni ring. S nguy him ca tn cng che khut cng vi s ph bin ca mng ngang hng cho ta thy ngha to ln v tm quan trng ca chng tn cng che khut trong thc tin. Do cc yu cu thc t , kha lun ny s nghin cu phng php phng chng tn cng che khut, c th l phng php c nu ra trong bi bo [1] ca tc gi Atul Singh cng cc ng nghip ti trng i hc Rice ca M. Trong bi bo ny a ra mt phng php phng chng tn cng che khut bng cch tin hnh kim tra n danh cc node hng xm, kt hp vi vic gii hn bc ca cc node tham gia vo mng tm ra cc node gy hi v loi b chng ra khi tp hng xm. Phng php ny ly tng t thc t l mt node gy hi mun thc hin tn cng che khut cn c bc trong v bc ngoi (hay s lin kt vo v lin kt ra ca node) rt cao, cao hn bc trong v bc ngoi ca cc node chun khc, do hn ch tn cng cn lm gim bc ca cc node gy hi, v c th pht hin cc node gy hi bng vic kim tra n danh cc node c trong mng. ng ch l phng php ny c th p dng cho c hai dng mng ngang hng c cu trc v khng c cu trc.

Do khng c c m ngun chng trnh ca tc gi dng trong bi bo[1], ti vn dng kin thc tm hiu c trong bi bo t xy dng mt chng trnh m phng hot ng ca c ch kim tra n danh trong mng ngang hng c cu trc Pastry. Sau khi chy chng trnh m phng c ch kim tra n danh pht hin cc node gy hi trong mng, kt qu thu c l rt cao, c ti 90% cc node gy hi b pht hin da vo c ch kim tra ny. Kha lun ny c trnh by theo nm chng chnh, ni dung chnh gm: Chng 1. Tng quan v mng xp chng: gip ta hiu mng xp chng l g v cc dng mng xp chng ph bin ca n, cng vi m t chi tit mng xp chng ngang hng c cu trc Pastry. Chng 2. Tn cng trong mng ngang hng : cp n hai dng tn cng chnh trong mng ngang hng l tn cng che khut v tn cng mo nhn. Chng 3. Cc c ch phng chng tn cng che khut: nu ra cc bin php chng tn cng che khut vi bin php chnh l kim tra n danh da vo gii hn bc ca cc node trong mng. Chng 4: M phng v nh gi c ch kim tra n danh da trn Pastry : trnh by v xy dng chng trnh m phng cng vi kt qu v nhn xt cc th nghim m phng. Chng 5. Kt lun: a ra cc nhn xt tng qut v chng tn cng che khut da vo kim tra n danh.

Chng 1. TNG QUAN V MNG XP CHNG

1.1. Gii thiu mng xp chng S pht trin nhanh chng ca khoa hc my tnh ang bin i cuc sng ca chng ta tng ngy. Cha bao gi con ngi c th giao tip, trao i thng tin v d liu cho nhau thun tin v d dng nh ngy nay, l nh vo mng Interner. Mng Internet gip lin kt cc vng min, cc quc gia, cc chu lc, n mang c th gii n gn nhau hn bt chp khong cch a l. Mng Internet l mt dng mng xp chng ph bin nht, a phn cc mng m chng ta ang s dng l mng xp chng. Vy mng xp chng l g? nh ngha cho mng xp chng [5] l: Mng xp chng l mt mng o bao gm cc node v cc kt ni vt l c xy dng da trn mt mng c sn vi mc ch cung cp cc dch v mng m mng n da trn khng th p ng c. Mng xp chng l mt lp ca kim trc mng o da trn mng vt l, chng cung cp kh nng tng tc trc tip vi ngi dng. Mng Internet chng ta ang s dng l mt mng xp chng c xy dng da trn mng cc b (v d nh Ethernet), ng in thoi. Mng xp chng cung cp cho chng ta rt nhiu tin ch cng vi c hi tip cn v s dng mt lng ln ti nguyn khng ngng tng cao c trn mng Internet. Mng xp chng cho php cc nh pht trin mng cng ngi s dng c th thit k v ci t d dng mi trng truyn thng ca ring mnh hay mt giao thc thc da trn mng Internet, cng nh nh tuyn d liu v qun l cc file c chia s. Vic nh tuyn d liu trong mng xp chng rt linh hot, n c th pht hin v trnh tc nghn mng mt cch nhanh chng bng cch chuyn i tuyn ng i da trn nhiu o khc nhau, v d nh thm d tr. Cc node trong mng xp chng c lin kt ti rt nhiu cc node khc nh vo c ch nh tuyn mm do. Cng ging nh cc lin kt mng vt l c, mt node c th giao tip lin tc vi mt node khc thng qua mng xp chng. Vi nhng li ch m mng xp chng mang li, vic pht trin mng xp chng l mt xu hng tt yu trong tng lai. Vi vic c cng nhiu node tham gia vo mng xp chng s gip cho vic chia s lng ln ti nguyn thng tin mng Internet cng t hiu qu cao.

Cc dng in hnh ca mng xp chng bao gm: Mng xp chng a pht (Multicast overlay) Mng xp chng ngang hng (Peer-to-peer overlay)

Mng xp chng ti file song song (Parallel file downloading overlay) Mng nh tuyn xp chng (Routing overlay)

C rt nhiu ng dng ca mng xp chng ang c s dng rng ri trong cuc sng nh ng dng chia s file BitTorrent, hay in thoi VoIP ca Skyper Nhng trong bi kha lun ny ch ch trng n mng xp chng ngang hng. Mng xp chng ngang hng c chia ra lm hai dng chnh l mng xp chng c cu trc (Structured overlay network) v mng xp chng khng c cu trc (Unstructured overlay network). 1.2. Mng xp chng ngang hng Mng ngang hng da trn h thng mng xp chng thu ht c rt nhiu s quan tm ca cc nh nghin cu v c nhiu h thng c xy dng v a vo s dng trong cuc sng hng ngy. C th k n nh ng dng chia s file ngang hng Gnutella, Kazaa. Ngoi ra, cn c rt nhiu cc nghin cu hot ng ca Bng bm phn tn (Distributed Hash Table) trn mng xp chng nh CAN, Chord v Pastry. H thng xp chng ngang hng c m t nh mt h thng phn tn, trong tt c cc node c vai tr nh nhau v tt c giao tip l i xng. H thng ny c rt nhiu kh nng quan trng nh: phn quyn iu khin, t t chc, kh nng iu chnh v m rng. Mt trong nhng yu cu quan trng trong mng xp chng ngang hng l cung cp thut ton hiu qu cho vic duy tr lin kt trong mng. Mi node trong mng xp chng ngang hng duy tr nhng con tr ti tp cc node hng xm, l mt tp cha lng nh cc node ca mng xp chng. Cc con tr c s dng duy tr lin kt xp chng, mi node c th lin kt ti bt k node no trong mng nh vo cc con tr hng xm. Cc con tr hng xm cng c dng p ng cc chc nng chng trnh ng dng. Hn na, cp nht tp hng xm s thay i thng tin thnh vin, cc node hng xm c truy vn cung cp thng tin v cc con tr hng xm .

1.2.1. Tng quan mng xp chng ngang hng khng c cu trc Mt mng ngang khng c cu trc khi cc lin kt gia cc node trong mng xp chng c thit lp mt cch ngu nhin (hay khng theo mt quy lut no). Nhng mng nh th vy d dng c xy dng v mt my mi khi mun tham gia mng c th ly cc lin kt c sn ca mt my khc ang trong mng to thnh lin kt mi ca ring mnh. Khi mt node mun tm mt d liu trong mng xp chng khng cu trc, yu cu tm kim s c truyn trn ton mng tm ra cng nhiu my chia s cng tt. H thng ny th hin r nhc im l: khng m bo tm kim s thnh cng. i vi tm kim cc d liu ph bin c chia s trn nhiu my, t l thnh cng l kh cao, ngc li, nu d liu ch c chia s trn mt vi my th xc sut tm thy l kh thp. Tnh cht ny l hin nhin v trong mng ngang hng khng cu trc, khng c bt k mi tng quan no gia mt my tnh v d liu n qun l trong mng, do yu cu tm kim c chuyn i mt cch ngu nhin n mt s my trong mng. S lng my trong mng cng ln th kh nng tm thy thng tin cng nh. Mt nhc im khc ca h thng ny l do khng c nh hng, mt yu cu tm kim thng c chuyn cho mt s lng ln my trong mng lm tiu tn mt lng ln bng thng ca mng, dn n hiu qu tm kim chung ca mng thp. Cc mng xp chng ngang hng ph bin hin nay l Napster, Gnutella, Fasttrack v eDonkey2000. 1.2.2. Tng quan mng xp chng ngang hng c cu trc Mng xp chng ngang hng c cu trc khc phc nhc im ca mng ngang hng khng c cu trc bng cch s dng h thng Bng bm phn tn (Distributed Hash Table - DHT). H thng ny nh ngha lin kt gia cc node trong mng xp chng theo mt thut ton c th, ng thi xc nh cht ch mi node s chu trch nhim i vi mt phn d liu chia s trong mng. Vi cu trc ny, khi mt my cn tm mt d liu, n ch cn p dng mt giao thc chung xc nh node no chu trch nhim cho d liu v sau lin lc trc tip n node ly kt qu. Giao thc ny s dng bng bm vi cc kha. DHT to ra mt h tng c s c th s dng xy dng ln cc dch v phc tp, mt s h thng s dng mng xp chng c c ch DHT l:

 BitTorrent: Phn tn file. BitTorrent la chn s dng mt DHT nh mt ngi theo di phn phi cung cp theo k hoch gia client ang download mt file c bit. The Circle: Chia s file v tn gu. Codeen: Web caching. Coral Content Distribution Network. CSpace: Cc giao tip an ton. Dijjer: Freenet-like mng phn tn. eMule: Chia s file. FAROO: Cng c nghin cu Web Peer to Peer. GNUnet : Freenet-like mng phn tn. I2P: Mng nc danh. JXTA: M ngun m P2P. Limewire:P2P Chia s file c gn java applet gi DHT. NEOnet: Chia s file. Warez P2P: Chia s file. YaCy: Cng c nghin cu phn tn. 1.2.2.1. Bng bm phn tn DHT l mt lp cc h thng phn tn khng tp trung cung cp dch v tra cu tng t nh mt bng bm: cp kha-gi tr c lu tr trong DHT, v nhng node tham gia c th truy vn d liu thun tin bng cch a ra mt kha. Vic duy tr nh x t kha ra gi tr c phn tn gia cc node, bng cch ny s thay i trong mt tp cc node tham gia ch gy ra s gin on nh. iu ny cho php DHT c th m rng ra mt s lng rt ln cc node v kim sot c s tham gia ca node mi, s ra i hay li ca cc node c.

DHT nhn mnh vo cc thuc tnh sau: Phi tp trung (Decentralization): Cc node tham gia cu thnh h thng khng c thnh phn trung tm lm iu phi mng. Kh nng m rng: H thng vn c th hot ng hiu qu vi hng nghn hoc hng triu node. Kh nng chu li: H thng vn c th lm vic n nh ngay c khi c cc s kin node tham gia, ri b, li din ra lin tc. K thut kha c s dng t c mc ch l mi node ch cn lin kt vi mt s t cc node khc trong h thng, thng l O(logN) vi N l s node tham gia. V vy s thay i trong cc thnh vin ch nh hng n mt phn nh ca h thng. Khi cc thnh phn ny c t ng v tr ca n, th cch thc s dng DHT cho vic lu tr v truy vn d liu s c din ra nh sau: Khng gian kha c s dng l mt s rt ln, c th l cc chui 160 bit. lu tr mt file vi tn gi filename v d liu data trong DHT, gi tr bm ca filename theo thut ton SHA-1 c tnh ton, to ra mt kha k c di 160 bit,v mt thng ip put(k,data) c gi ti mt node bt k tham gia trong DHT. Thng ip c chuyn t node ny sang node khc thng qua mng xp chng cho n khi n ti node cui cng chu trch nhim qun l kha k, c xc nh nh cch thc phn chia khng gian kha, cp (k,data) c lu tr. Mi node c th truy xut ni dung ca file bng cch bm filename sinh ra kha k v hi mt node bt k trong DHT tm d liu ng vi kha k vi mt thng ip get(k). Thng ip li c nh tuyn qua mng xp chng ti node chu trch nhim qun l kha k, node ny s tr li vi d liu data c lu tr. Mt s thit k DHT tm n tnh bo mt chng li nhng ngi tham gia c mu xu v cho php ngi tham gia n danh tnh, mc d iu ny khng ph bin trong cc h thng mng chia s file ngang hng. DHT phi gii quyt nhng vn c bn ca cc h thng phn tn l: cn bng ti, ton vn d liu, hiu nng. 1.2.2.2. Cch thc phn chia khng gian kha Hu ht DHT u s dng mt dng bm nht qun (Consistent hash) nh x cc kha vo cc node. K thut ny p dng mt hm (k1, k2) nh ngha mt khi nim tru tng v khong cch gia hai kha k1 v k2. Mi node c gn mt kha n

c gi l nh danh (identifier). Mt node vi nh danh i s hu tt c cc kha m i l nh danh gn nht ca cc kha ny, c lng theo hm . V d : H thng Chord c khng gian nh danh dng vng trn, v (k1, k2) l khong cch i theo chiu kim ng h xung quanh ng trn t kha k1 ti kha k2. Do , khng gian kha ng trn c chia thnh cc cung lin tip m im cui ca cung ny l cc nh danh ID ca cc node. Nu i1 v i2 l hai ID lin k nhau th node c nh danh ID i2 s hu tt c cc kha nm gia i1 v i2. Hm bm nht qun c mt thuc tnh quan trng thuc v bn cht l vic g b hay thm vo cc node ch lm thay i mt tp cc kha s hu bi cc node c nh danh lin k, v cc node khc th khng b nh hng. V mi thay i trong quyn s hu u gy ra nhng di chuyn tn km bng thng ca cc i tng c lu tr trong DHT t node ny n node khc, nn vic gim thiu vic sp xp li s tng tnh hiu qu cho vic h tr cc yu cu vo ra ca node hay cc s c li ca cc node. Khng gian kha trong DHT rt a dng, c th l khng gian nh danh mt chiu nh Chord v Pastry hoc a chiu nh CAN. 1.3. Mng xp chng ngang hng c cu trc Pastry Mng xp chng c cu trc Pastry s c s dng trong m phng c trnh by trong chng 4, do kha lun ny s trnh by chi tit v h thng Pastry, i din cho mng xp chng ngang hng c cu trc. H thng nh tuyn phn tn Pastry c a ra bi Rowstron v Druschel vo nm 2001. c xy dng da trn c ch DHT. Mc ch chnh ca n l to ra mng ngang hng phi tp trung hon ton. Vic nh tuyn ca h thng c da trn vic nh s gn nhau gia cc nh danh. Ngoi vic ch trng ti s bc trong nh tuyn, Rowstron v Druschel cng quan tm ti min mng nh gi hiu qu nh tuyn trong Pastry. 1.3.1. Khng gian nh danh Trong Pastry, mi node v thnh phn d liu c gn vi l bit nh danh, l mt s nguyn nm trong khong t 0 cho ti 2l-1, thng thng l bng 128. Khng gian

nh danh ca Pastry c b tr dng vng trn ging nh Chord. i vi node, nh danh c hiu l NodeId, cn vi d liu th n l kha (key).

Hnh 1: Khng gian nh danh Pastry 4 bit vi su kha c nh x vo nm node Trong hnh 1 l khng gian nh danh ca Pastry vi l = 4, s nh danh c th c trong h thng l 24 = 16, b = 2 nn cc nh danh l cc s trong h c s 2 2 = 4. Cc node c trong h thng l N01 c nh danh l 01, N10, N21, N23, N33 v N01. Cc kha l K01 c nh danh l 01, K03, K22, K32 v K33 nh danh trong Pastry l mt chui s c s 2b, thng thng b bng 4 tc nh danh l cc s trong h c s 16. Mt kha c t (qun l) ti node c nodeId c nh s gn vi kha nht. V d nh kha K01 c t ti node N01, kha K03 c t ti node N10. chnh gia gi tr ca kha K22 vi hai node N21 v node N23 l bng nhau, do kha K22 c th c hai node qun l. 1.3.2. Thng tin dng trong nh tuyn Trng thi ca mt node Pastry c chia lm 3 thnh phn chnh, l: Bng nh tuyn (Routing table) Tp l (Leaf set) Tp ln cn (Neighborhoot set)

Bng nh tuyn dng cha cc lin kt ti cc node khc trong khng gian nh danh. Tp l ca mt node cha cc node c nh danh gn vi nh danh vi n. Cc node gn nhau v mt v tr mng s c a vo trong tp ln cn. Pastry o v tr mng da trn o ln cn mng v hng, o ny da trn h tng c s mng c th da trn s bc IP hoc khong cch a l ca cc node.

Hng th 0 Hng th 3 Mc thm

Hnh 2: Bng nh tuyn, tp l, tp ln cn ca node c nh danh 10233102 Trong qu trnh nh tuyn, cc node ch s dng thng tin lin kt t tp l v bng nh tuyn ca mnh xc nh node ch nhn d liu. 1.3.3. Trng thi node 1.3.3.1. Bng nh tuyn Bng nh tuyn c k hiu l tp R. Bng nh tuyn ca mt node Pastry bao gm l/b hng, vi 2b-1 mc trong mi hng. Th t hng trong bng nh tuyn c tnh t 0, hng 0 l hng trn cng ca bng. Trong bng nh tuyn ca node n, mc hng th i cha cc nh danh ca node Pastry c i s u tin trong nodeId ging vi i s u tin trong nodeId ca node n, vic so snh ny c tnh ln lt tng v tr tng ng vi nhau ca hai nh danh v bt u t s u tin bn tri. Nu khng c nh danh ca

node no tha mn tnh cht trn th v tr trong bng nh tuyn trng. Do khng gian nh danh l rt ln so vi s lng node c th tham gia vo mng, nn cc hng nh s cng cao cng tha hay s cc mc trong bng nh tuyn trng cng nhiu. Qu trnh nh tuyn s la chn node c cc s u trong nh danh ph hp, v n cng khai thc v tr mng la chn node gn theo o ln cn mng. d hiu hn, ta s xem xt bng nh tuyn ca node c nodeId l 10233102 nh trong hnh 2. Trong mc c khoanh hnh 2, mc ny ch n node c nodeId l 10222302, n hng th ba, do n c ba s u tin trong nodeId l 102 ging vi ba s u trong nodeId ca node ch bng nh tuyn ny. Sau ba s u tin l s v tr th t c gi tr l 2, tng ng vi gi tr ca mc c thm trong cng mt ct vi n. 1.3.3.2. Tp l Bng nh tuyn sp xp cc nodeId theo cc s u nh danh. tng hiu qu tm kim tp l L ca mt node n cha 2*2b node c nh s (nh danh) gn n nht. Tp l ca node n c chia thnh hai phn bng nhau, mi phn c 2b nh danh node, mt phn cha nh danh ca cc node c nodeId ln hn nodeId ca n v mt phn cha cc nh danh ca node c nodeId nh hn nodeId ca n. Bng nh tuyn v tp l l hai ngun thng tin chnh cho vic nh tuyn. 1.3.3.3. Tp ln cn Thay cho vic lu nh danh cc node c nh s gn nhau nh tp l, tp ln cn M ca node n cha cc node gn vi node n theo o ln cn mng. Tuy nhin, tp ny khng c s dng trong qu trnh nh tuyn, n ch dng duy tr v tr mng trong thng tin nh tuyn. 1.3.4. Phng php nh tuyn nh tuyn trong Pastry c chia lm hai bc chnh. u tin, node tin hnh kim tra xem kha k c nm trong phm vi tp l ca n khng. Nu c, iu c ngha rng kha k c qun l bi node gn vi cc node trong tp l. Do , node s chuyn truy vn t node trong tp l c nh s gn vi kha k nht. Trong trng hp l chnh n tc node ang xt c nh danh gn vi kha k nht th qu trnh nh tuyn thnh cng.

Nu kha k khng nm trong phm vi ca tp l, th truy vn cn chuyn tip da vo bng nh tuyn. Trong trng hp ny, node n s c gng chuyn truy vn ti node trong bng nh tuyn c s lng ch s u trong nodeId ging vi cc s u trong kha k nhiu hn so vi n. Nu khng c mc no trong bng nh tuyn ph hp, th truy vn c chuyn tip cho node c s ch s u trong nodeId ging vi cc ch s u trong kha k nhiu nh vi nodeId ca n nh gn hn n. 1.3.5. Kh nng t t chc Trong thc t, Pastry cn gii quyt cc vn node mi tham gia vo h thng, node ri khi h thng v node li c th xy ra bt cht trong khi vn phi duy tr tt hot ng nh tuyn. Node mi tham gia h thng Trng khi tham gia vo h thng Pastry, mt node cn la chn nodeId. Pastry cho php mt node t la chn nodeId ca chnh n. Tuy nhin vic tham gia c th c nhiu yu cu hn ch. Thng thng, mt nodeId c to ta bng cch bm gi tr kha cng khai ca node hoc a ch IP ca node. tham gia, node mi n cn bit mt node Pastry k da vo o ln cn mng. Sau , node n cn khi to cc trng thi cho mnh bao gm bng nh tuyn, tp l, tp ln cn. Do k gn vi n, nn cc node trong tp ln cn ca k l s la chn ph hp cho n, do n sao chp tp ln cn ca k to ra tp ln cn cho ring mnh. to bng nh tuyn v tp l, node n cn tm kim thng tin v cc node Pastry gn vi n trong khng gian nh danh. lm c iu , n tin hnh gi mt thng ip join c bit thng qua node k vi kha l nh danh ca n. Theo quy tc nh tuyn chun, th truy vn c chuyn ti ch l node c c nodeId c nh s gn nht vi nodeId ca n. Do , tp l ca node c ph hp vi n, nn n sao chp tp l ca c to tp l cho mnh. Yu cu gia nhp tc ng ti tt c cc node, vi vic c chuyn tip yu cu hng ti c, cc thng tin nh tuyn trong cc ln chuyn tip c cung cp cho n. Bng nh tuyn ca node n c khi to t thng tin nh tuyn ca cc node bt u t hng th 0. Hng ny khng lin quan n nodeId ca n, nn n c th s dng cc mc hng th 0 ca bng nh tuyn node K lm hng s 0 trong bng nh tuyn ca mnh.

Nu n v k khng c s u nh danh ca c hai node ging nhau th node n khng th s dng thm cc hng khc ca k. Thng ip yu cu tham gia t n ti c thng qua cc node v1, v2...vn, vi s lng tng dn cc ch s u nh danh ging nhau gia n v vi. Do vy, hng th nht ca bng nh tuyn ca v1 l mt la chn tt cho hng th nht trong bng nh tuyn ca node n. Tng t cho hng th hai trong bng nh tuyn ca n vi node v2. Da vo cc thng tin nh tuyn , bng nh tuyn ca node n c hnh thnh. Cui cng, node mi n gi trng thi ca n ti tt c cc node trong d liu nh tuyn ca mnh. Cc node c th cp nht li bng nh tuyn ca mnh cho ph hp. Do mi node ch cha thng tin v mt lng nh cc node trong Pastry, nn vic n v ri i ca mt node ch nh hng n mt lng nh cc node trong h thng Pastry. Node li Node li c pht hin khi c mt node th lin lc vi node li. Ch khi nh tuyn i hi phi tip xc vi cc node trong bng nh tuyn v tp l, chnh l nguyn nhn gy ra chm tr trong pht hin node li. Vi cc node trong tp ln cn, do chng khng tham gia vo qu trnh nh tuyn nn cn kim tra chng thng xuyn theo chu k. Cc node li cn a ra khi bng nh tuyn m bo cho qu trnh nh tuyn din ra mt cch chnh xc. thay th node li mc i hng j ca bng nh tuyn ( ta k hiu l R j ), node lin h vi mt node khc tham kho hng i. Cc mc trong hng j tng ng ca node t xa c xem xt cho v tr trong bng nh tuyn cn thay th.
i Do n c th sao chp mc R j ca node t xa cho bng nh tuyn ca n sau khi i

kim tra s tn ti ca node c dng thay th. Trng hp node trong mc nh sao
i chp cng li th c th thm d node khc trong hng j thay th mc R j . Nu khng

c node no cn sng c cc s u trong nodeId ph hp c th dng c bng phng php ny, th tin hnh m rng xem xt cc node thng qua truy vn cc node trong hng Rj-1. Phng php thay th ny c xc sut thnh cng cao.

Node ri h thng Pastry c th duy tr trng thi thng tin nh tuyn khi xut hin node li, vic x l node ri h thng cng c thc hin tng t nh vy, nhng c thm qu trnh x l d liu lin quan n node ri i. 1.3.6. Thc hin nh tuyn Pastry ti u ha vic nh tuyn v xc nh v tr node chu trch nhim v kha, n c gng ng thi vic gim s bc chuyn tip ti c node ch v khai thc v tr mng lm gim chi ph cho mi bc nhy. di nh tuyn Lc nh tuyn trong Pastry v c bn chia khng gian nh danh thnh hai min vi kch thc 2n vi n l cp s nhn ca 2b. Ch dn nh tuyn t min bc cao ti min bc thp, do lm gim lng khng gian nh danh phi tm kim trong mi bc. S bc nh tuyn trung bnh s l mt hm logarithm ca kch thc h thng. Nu tt c thng tin nh tuyn ca tt c cc node l chnh xc v khng c node li no, s c ba trng hp trong s nh tuyn: Trng hp th nht, cc node chuyn tip truy vn thng qua bng nh tuyn, truy vn c chuyn tip ti node c s ch s u trong nodeID trng vi kha truy vn nhiu hn so vi node hin thi. S node c nodeId nh vy s c gim theo vi h s thp nht l 2b trong tng bc. Do thng ip ti ch ch trong vng log2n(N) bc. Trng hp thc hai, thng ip truy vn c chuyn tip qua tp l. N lm tng s bc ln mt. Trng hp th ba, kha khng nm trong min tp l v cng khng c mc no trong bng nh tuyn ph hp hn node hin thi. Do , truy vn c chuyn tip cho node c chung s ch s u trong nodeId bng vi s ch s u ca nodeId hin thi chung vi kha, nhng node c chn chuyn tip thng ip c nodeId gn vi kha hn node hin thi. Vic ny s lm tng s bc nh tuyn. Vi tp l c kch thc va phi |L| = 2*2b, xc sut trng hp ny xy ra nh hn 0.6%. Mc phc tp trung bnh ca phn nh tuyn cn li l O(log2b(N)), cao hn gi tr ca b nhng phi tr gi cho vic nh tuyn nhanh hn ny l tng cc trng thi

cn qun l trong mi node. Do , vi b thng thng bng 4 nhng hot ng ca Pastry c th la chn s nh i thch hp i vi tng ng dng.

V tr mng Bng cch khai thc v tr mng, ti u nh tuyn trong Pastry khng ch hng ti vic lm gim s bc m cn gim chi ph cho mi bc. Nh s dng bng nh tuyn ca node gi thng ip, n c th chn node c cc s u trong nh danh ph hp trong cc mc ca bng nh tuyn. Bng vic la chn cc node gn theo tiu ch v tr ca mng, di ca mi tuyn ng s c gim n mc ti thiu.

Chng 2. TN CNG TRONG MNG NGANG HNG

Mng my tnh mang li nhiu li ch thit thc cho con ngi, tuy nhin n cng lun n cha nhng nguy him cho my tnh v ngi s dng n. Nhng nguy him n t nhng k c mc ch xu, chng lun mun li dng mng my tnh thc hin nhng hnh vi ph hoi. Tht kh c th tng tng ni hu qu ca vic mt cp thng tin trong thi bui pht trin mnh m ca ngnh cng ngh thng tin ngy nay. K xu c th tn cng vo my tnh ca bn, ph hot h thng mng hoc my tnh bn s dng. Ti liu c nhn ca bn c th b nh cp, v ch mt giy sau n c th c cng b cho ton b th gii bit n. Mt cng ty c th b ph sn nu ti liu mt v sn phm mi hay k hoch kinh doanh b i th cnh tranh nm c. An ninh quc gia cng b nh hng ln nu thng tin b mt qun s b k xu c c v a ln mng cho ton th gii bit n Mng my tnh cng pht trin th nguy c b tn cng cng tng cao. Khng c g l hon ho c, do lun c nhng l hng trong mng k xu li dng vo nhng hnh ng ph hoi. Trong m hnh giao tip thng thng gia my khch v my ch, th bn b tn cng cao thng l my ch. Khi my ch b tn cng, h thng b t lit, k tn cng c th thc hin nhng hnh vi en ti ca mnh. vi mng xp chng ngang hng, cc my tnh tham gia c vai tr nh nhau, va ng vai tr my khch va c vai tr l my ch. Mt c im quan trng trong mng xp chng ngang hng l, mt node s dng cc node khc trong mng nh mt b nh tuyn. Do d liu v thng tin truyn i gia hai node c s tham gia ca nhiu node khc. S rt nguy him nu mt trong cc node tham gia nh tuyn chuyn tip d liu li l mt node gy hi. S bnh ng trong mng ngang hng gip k tn cng d dng tham gia vo mng v ph hoi s n nh ca mng. Do vic nghin cu v tm gii php chng li nhng k xu mun tn cng mng l mt yu cu quan trng v ang thu ht nhiu s quan tm ca mi ngi. Mc tiu ca kha lun ny l tm hiu cc phng php chng tn cng trong mng xp chng. C hai dng tn cng chnh thng c k xu s dng tn cng mng ngang hng l tn cng mo nhn (Sybil attack) v tn cng che khut (Eclipse attack). Ni dung m kha lun ny cp n l phng php chng tn cng che khut, tuy

nhin cng cn phi ni qua v tn cng mo nhn, bi tn cng mo nhn cng c mt vi c im ging vi tn cng che khut. 2.1. Tn cng mo nhn Trc ht ti xin a ra nh ngha v tn cng mo nhn [2] nh sau: Tn cng mo nhn l dng tn cng m k tn cng ph hoi h thng mng ngang hng bng cch to ra mt lng ln cc node o v s dng chng to ra nh hng ln trong mng ngang hng. H thng mng ngang hng c th gp nguy him bi qu trnh khi to nh danh cho mi node mi mun gia nhp vo mng. Mc nguy him ca mng ph thuc v mc cho php cc i tng mi khng c mt lin kt ng tin cy no tham gia vo mng. Tn cng mo nhn li dng c tnh ca mng ngay hng, l mi node cn duy tr lin kt ti cc node hng xm ca n, c tnh ny gip cho mng xp chng hnh thnh v duy tr. Kiu tn cng ny s rt nguy him i vi h thng mng ngang hng c cu trc s dng c ch bng bm phn tn nh mng CAN, Chord, Pastry v Tapestry. Bi, trong c ch DHT mi node cn duy tr mt tp cc node hng xm m n lin kt ti, v tp ny c hnh thnh vi nhng quy tc ring i vi mi loi mng dng DHT. K tn cng c th bit d dng nh danh ca mt node trong mng, t n c th sinh ra cc nh danh o trong mng a cc nh danh o vo tp hng xm ca cc node. Khi t c mc tiu, tc trong mng c rt nhiu nh danh o do k tn cng sinh ra th n c th kim sot lu lng, d liu v cc thng tin truyn trong mng. Bi mi node trong mng mun truyn thng ip hay d liu th cc node m n lin h gi d liu i l cc node trong tp hng xm ca n, nh vy cc node s gi d liu ti node tn cng mng. K tn cng c quyn quyt nh chuyn tip hay khng d liu . S rt nguy him khi k tn cng c th nm c mt lng ln cc nh danh trong mng xp chng c cu trc. Nu t l node o m n sinh l v hn th n c th chim ti gn nh l 100% cc node trong mng, nh vy n c th che khut cc node chun khc trong mng. Nh vy, ch cn mt node gy hi c th khng ch ton b mng xp chng ngang hng.

2.2. Tn cng che khut Tn cng che khut l mt dng chung ca tn cng trong mng xp chng. Trong tn cng che khut, mt k tn cng iu khin mt lng ln cc i tng l thnh vin trong tp hng xm ca node chun. Trong trng hp ny, mt nhm cc node gy hi lin kt vi nhau la cc node chun bng cch a cc node gy hi vo tp hng xm ca cc node chun. Bng vic thc hin tn cng che khut, k tn cng c th iu khin mt phn ng k ca mng xp chng. Hn na, mt lng ln cc node gy hi c th che khut nhiu node chun iu khin ton b mng xp chng. Cc node xp chng khng th chuyn tip mt cch chnh xc cc thng ip v mng s khng c qun l.

Hnh 3: Cc node gy hi chia mng xp chng ra lm hai mng con. Tn cng che khut li dng tp hng xm ca cc node tin hnh tn cng mng xp chng. c th tn cng, k tn cng nhm ti tp hng xm ca cc node chun. Chng tm cch a cc node gy hi vo tp trong cc tp hng xm ca cc node chun, khi thnh cng cc node chun mun gi d liu cng nh cc thng ip u i qua cc node gy hi trc. Nh vy, cc node gy hi c th quyt nh gi hay khng gi cc d liu v thng ip ti node ch. Cc node gy hi c th a cc node gy hi khc vo trong tp hng xm ca cc node chun nh da vo qu trnh xin tham gia vo mng ca cc node mi. Nu node mi tham gia lin h u tin vi mt node gy hi, th tp hng xm m n c chnh l tp cc node do node gy hi a cho v hin nhin tp ny cha cc node gy hi c

thng ng vi node gy hi m node mi lin h u tin. Ngoi ra, node gy hi cn c th xm nhp vo tp hng xm ca cc node trong qu trnh duy tr lin kt mng c thc hin theo chu k. Qu trnh ny s tm v loi b cc node li ra khi cc tp hng xm v thay th vo l cc node khc ang hot ng. Cc node gy hi li dng qu trnh ny lm tng s lng cc node gy hi trong cc tp hng xm ca cc node chun. Tn cng che khut cn mt lng nht nh cc node gy hi thng ng vi nhau mi c th thc hin thnh cng. Chng lin kt vi nhau, che khut mng, lm cho cc node chun ch bit n chng v mi lin h ti cc node chun khc u b chi phi v khng ch. Tn cng che khut ging nh dng nng cao ca tn cng ngi gia (Man in the middle attack). Nu ch c mt node gy hi thc hin tn cng che khut (iu ny rt kh thc hin c), th n c th thc hin cc hnh ng nh: Node gy hi tn cng mt phng iu khin (control plane) bng cc v hiu ha vic nh tuyn li cc thng ip. Node gy hi c th loi b cc thng ip m n nhn c, nhm mc ch chia ct mng. Node gy hi c th tn cng mt phng d liu (data plane) bng cch tim nhim file c hoc yu cu li cc file c nhn danh mt node v hi, cc file s c lu vo b m hoc sao chp nhiu ln. Nh vy, ch vi mt k thc hin tn cng che khut cng c th gy nh hng ti h thng, tuy nhin cuc tn cng t hiu qu cao th cn c nhiu node cng tham gia tn cng. Vi ch mt lng nh cc node cng c th thc hin tn cng che khut. 2.3. So snh tn cng mo nhn v tn cng che khut Tn cng mo nhn mt mc no cng ging vi tn cng che khut. C hai dng tn cng u hng ti mc ch kim sot tp hng xm ca cc node chun. Bi ch c nh vy, chng mi c th chi phi c qu trnh giao tip ca node chun vi cc node khc trong mng, khng ch c lu lng trong mng v iu khin mng theo mu ca mnh.

Tuy nhin, tn cng mo nhn cn sinh ra cc node o, cng nhiu node o th kh nng thnh cng ca tn cng mo nhn cng cao. Nhng vic to cc node o s kh thnh cng khi h thng mng kim sot cht ch vic cp nh danh cho cc node mi mun tham gia vo mng. Trong tn cng che khut li khc, n dng cc node thc, chnh l cc node gy hi. Thay v a cc node o vo trong tp hng xm ca node chun, cc node gy hi trong tn cng che khut a cc node gy hi khc vo. Tn cng che khut c th thnh cng vi lng nh cc node gy hi trong mng cng thng ng vi nhau. Trong tn cng mo nhn, mt node gy hi hot ng n l sinh ra rt nhiu node o tn cng mng.

Chng 3. CC C CH PHNG CHNG TN CNG CHE KHUT

3.1. Mt s phng php phng chng tn cng che khut Ta c th nhn thy rng phng php tn cng che khut mng xp chng u tp trung vo kim sot tp hng xm ca cc node. Do , c th phng chng tn cng hiu qu cn tp chung qun l tp hng xm, cn sinh ra mt c ch m bo cho tp hng xm lun an ton trc cc node gy hi chng li cc cuc tn cng. c cc bin php bo v phi tp trung chng li cc cuc tn cng che khut c a ra, cc bin php ny i hi phi b xung thm cc quy tc la chn tp hng xm. Cc phng php ny u hng ti hai loi: rng buc cu trc v rng buc ln cn. Rng buc cu trc cht ch hn Stronger structural constraints Cc mng chng nh CAN, Chord nguyn bn v Pastry vi bng nh tuyn c rng buc nht nh (Constraints routing table CRT)[5] ci thin mnh m rng buc cu trc trong tp hng xm. Mi thnh vin trong tp hng xm c xc nh l mt node trong mng xp chng c nh danh gn nht vi mt im ring bit trong khng gian nh danh. Rng buc ny nh bi cc cuc tn cng che khut vi hai iu kin nh sau: u tin, mi im nt c mt nh danh duy nht v khng th gi mo c. Vic ny c th c thc hin c nh da vo mt c quan ngoi tuyn ng tin cy a ra bn m ha ca nh danh c k, bng cch ny c th chng c tn cng mo nhn. Th hai, mng xp chng cn c c ch tm ra node ang sng trong mng c nh danh gn nht vi mt v tr bt k c yu cu trong khng gian nh danh. C ch ny m bo rng mt truy vn n mt node c nh danh c chn ngu nhin c kh nng l node gy hi cng bng xc sut chn ngu nhin mt node l node gy hi. Phng php nh tuyn c in c th t c iu ny bng cch kt hp vi vic xc thc nh danh tin cy, kim tra mt nh danh, nhn bit nh tuyn d tha bng cch s dng bng nh tuyn. iu tr ngi ln nht trong vic s dng rng buc cu trc mnh l n s lm mt tnh linh hot trong vic la chn hng xm, cn tr vic

ti u ha mng xp chng bng cch s dng c ch la chn hng xm gn (Proximity neighbor selection PNS)[6]. Hn na, m bo an ton cho nh tuyn c in s tn chi ph rt cao. Proximity constraint Rng buc gn Hildrum v Kubiatowicz [3] a ra mt phng php bo v chng li tn cng che khut hon ton khc bit vi phng php c a ra trn, phng php ny da trn vic la chn cc hng xm gn. Mi node la chn cc node lm tp hng xm cho mnh sao cho lin kt ti cc node c ch nh nht v chng tha mn yu cu rng buc cu trc ca mt tp hng xm. Ch c mt lng nh cc node gy hi c th p ng c tr mng thp, do cc node gy hi kh c th tng cng tn cng che khut h thng. Phng php bo v ny cn m bo rng vic o tr khng b thao tng bi cc phn t tn cng. Nu chnh xc ca php o l 1ms v c mt lng ln cc node xp chng c gi tr o nm trong khong ny th vic phng chng khng c hiu qu. Trn thc t, c rt nhiu node khc nhau cng xut hin trong di tr hp. Hn na kt qu thc nghim ch ra rng vi cc gi tr tr thc t c o tnh trn mng Internet, hiu qu ca bin php phng th da trn PNS s gim dn khi kch thc mng chng tng ln. Nhn xt C th nhn thy rng vic duy tr nhng rng buc cu trc c th to ra mt phng tuyn bo v hiu qu chng li cc cuc tn cng che khut, nhng n cng to ra nhng khon chi ph ph tri v cn tr vic ti u ha nhng ng dng quan trng nh PNS. Mt khc, phng php phng th da trn rng buc gn ch c hiu qu vi mng c kch thc nh.

3.2. C ch gii hn bc c th chng tn cng che khut, c mt phng php c a l c ch gii hn bc [1]. C ch gii hn bc c th p dng cho c mng ngang hng c cu trc v mng ngang hng khng c cu trc. y l mt c ch kh hu hiu chng tn cng che khut. Bc y dng ch cc lin kt ti cc node trong mng xp chng.

Bc trong ca mt node l s cc lin kt tr ti node , bc ngoi l s lin xut pht t n i ti cc node khc. Mt node A c cha node B trong tp hng xm ca n, nh vy c ngha l node A tr ti node B, ta gi lin kt t A ti node B l mt lin kt ngoi ca node A. S lin kt ngoi ca A c gi l bc ngoi ca A, bc ngoi ca mt node bng s node c trong tp hng xm ca node . Node A tr t node B, lin kt c coi l lin kt trong ca node B, s lin kt trong l bc trong ca B. tng c bn ng sau cho c ch phng chng ny rt n gin: Trong tn cng che khut, bc trong ca cc node gy hi cao hn gi tr bc trong trung bnh ca cc node chun. Bi cc node gy hi nm trong rt nhiu tp hng xm ca cc node chun trong mng th mi c th tin hnh che khut khng ch mng v cc node. Do , nu chng ta gii hn bc trong ca mi node, th s lm gim s node gy hi c trong tp hng xm ca cc node chun, lm cho k tn cng kh c th thc hin che khut ca mnh. Khi ta p dng c ch p gii hn bc, cc node chun c th chn cc hng xm ca n t mt tp ph cc node xp chng c bc trong nh hn gii hn cho php. C ch cng bao gm vic gii hn bc ngoi ca cc node, nu khng cc node gy hi c th s dng bc trong ca cc node chun chn cc node chun tr ti cc node chun khc. Vy cc node chun cn chn cc hng xm t mt tp gm cc node xp chng c bc trong v bc ngoi nh hn gii hn cho php. Phng php gii hn bc i hi mi node cn c mt chng nhn xc thc, mi nh danh ca node c gn km vi mt kha cng khai. Ngoi ra, mng xp chng cn phi h tr vic nh tuyn an ton nguyn thy s dng CRT.

nh gi Phng php gii hn bc rt hu hiu trong phng chng tn cng che khut, n c th khng ch t l node gy hi c trong tp hng xm ca cc node chun. C th chng minh iu ny bng ton hc mt cch d dng. Gi N l tng s node trong h thng v gi tr trung bnh ca bc trong v bc ngoi ca cc node tng ng l O v I. Gi f l t l cc node gy hi, f l t l cc mc

hng xm ca node chun tham chiu ti cc node gy hi. Ta d dng a ra nhn xt rng tng cc lin kt ch ti ti node gy hi l: Ttotal=NfI Tng cc lin kt i ra t node chun l : Ototal=N( 1-f )O Vi f Ototal l tng s cc lin kt t node chun ch ti cc node gy hi, ta c: f Ototal Ttotal Sau khi gin c bt ng thc trn ta c f (1 f )O . Lm cho I=O chng ta c: f (1 f ) Nh vy, t l cc node gy hi trong tp hng xm khng vt qu t l ca node gy hi so vi s node chun c trong mng khi ta thit lp s bc trong bng s bc ngoi. Khi tng gi tr trung bnh bc trong I lm tng f , node gy hi c th li dng t l ln bc trong ca cc node chun v tng hiu qu ca tn cng che khut. C ch phn phi gii hn bc thc thi k thut ny, cn gii hn bc trong v bc ngoi i vi mi node. Chng ta tm tt c ch phn tn da trn truy vn m bo vic gii hn bc. Chng ta gi nh rng c mt k thut xc nhn thng ip ngn cc node gy hi gia phn hi gi cc truy vn, ging nh ch k s. Mi thng ip truy vn bao gm thi gian lc truy vn c xc thc trong trong phn hi m bo tnh chun xc. Chng ta cng gi nh trong mng tn ti mt c ch m bo rng vic phn phi nh danh node mt cch chnh xc, chc chn rng cc node gy hi khng th s hu nhiu nh danh v khng th chn nh danh m chng mun. Mi node A trong mng xp chng cn duy tr mt tp cha tt c cc node m trong tp hng xm ca n c cha node A. Chng ta gi l tp Con tr ngc (Back pointer set) ca A. Theo nh k, A kim tra tng thnh vin trong tp hng xm ca n
f fI

thng qua vic hi tp con tr ngc ca node . Nu s mc trong tp con tr ngc tr v ln hn gii hn bc trong hoc A khng nm trong tp con tr ngc th A loi b thnh vin khi tp hng xm ca n. Trong qu trnh kim tra, chng ta cn m bo rng node ang c kim tra khng bit c node A. Nu khng, node c kim tra c th to d dng mt tp con tr ngc vi kch thc ph hp v c A.

Hnh 4: Tp Con tr ngc - Back pointer set ngn chn k tn cng chi phi bc trong ca node chun, mi node B kim tra thng xuyn cc thnh vin trong tp con tr ngc ca n bng vic hi chng tp hng xm m n s hu. Nu B khng nm trong tp hng xm c tr v hoc kch thc tp hng xm tr v ln hn gii hn bc ngoi, B loi b cc node khi tp con tr ngc ca mnh. Cc node c kim tra cng khng c bit c B. K thut ny c th dng m bo rng gi tr trung bnh ca bc trong v bc ngoi c gii hn. Khi gii hn c thit lp ti gi tr trung bnh ca th xp chng, t l tp hng xm ca node chun b iu khin bi node gy hi ch l f/(1-f) vi f l t l node gy hi trong mng xp chng. 3.3. C ch kim tra n danh k thut c trnh by trn hot ng, chng ta cn s dng mt ng kt ni n danh (Anonymous channel) gia node tin hnh kim tra v node ang b kim tra.

Vi vic kim tra n danh ta c th pht hin cc node gy hi, t loi b chng ra khi tp hng xm ca node chun. S thm d l kim tra n danh thng qua mt node trung gian ngu nhin trong mng xp chng. Nu node trung gian l mt node chun th n s chuyn tip yu cu ti node ch m khng l danh tnh ca node yu cu. Nu node trung gian l node gy hi, n c th lm l danh tnh ca node yu cu cho node b kim tra (nu node b kim tra l node gy hi) hoc n c th vt b thng ip kim tra (nu nh node c kim tra l node chun). Hn na, mt node gy hi c th quyt nh loi b yu cu kim tra khi node trung gian l node chun.

Hnh 5: A kim tra B thng qua node trung gian I Tuy nhin, khi node gy hi la chn tr li yu cu kim tra ti n thng qua node trung gian chun, n c th li bng mt tp con ngu nhin vi kch thc cho php vi cc node ly t tp con tr ngc ca n. t c hiu qu cao, chng ta cn thc hin kim tra mi node nhiu ln, vi cc node trung gian ngu nhin khc nhau c th thu thp d liu t a ra quyt nh node b kim tra l node gy hi hay node chun. C ch kim tra i vi mi node hng xm, chng ta tin hnh n cuc kim tra trc khi nh gi, mi yu cu kim tra i hi node hng xm tr v mt tp con tr ngc ca chnh n. Trong lc kim tra, mt node ngu nhin c chn trong mng xp chng chuyn tip thng ip kim tra ti node hng xm b kim tra. Nu nh tp con tr ngc tr v c

cha node yu cu kim tra th l mt cuc kim tra thnh cng. Nu tp con tr ngc tr v khng cha node thc hin kim tra, th l mt cuc kim tra tht bi. Nu mt phn hi nhn c khng nm trong khong gii hn thi gian cho php th n s c xem xt nn loi b hay khng. Sau n ln kim tra hon thnh hoc c mt li xy ra, cc bc thc hin k tip l: Bc 1: Nu li xy ra trong tt c cc cuc kim tra th node ch l mt node gy hi. Nu khng ta chuyn sang bc 2. Bc 2: Ta tnh t l thnh cng trong n cuc kim tra thc hin. Nu t l nh hn (1-k/n), th node c kim tra b coi nh l node gy hi. Gi tr ca k l s tht bi chng ta cho php xy ra trong n ln kim tra. Phn tch Trc tin chng ta cn nh ngha cc thut ng c ni n trong qu trnh phn tch. Khi mt node gy hi nhn mt thng ip kim tra thng qua mt node chun, n quyt nh tr li hay khng vi mt xc sut c v tp tr v cha node thc hin kim tra c xc sut p. Xt node A cha B trong tp hng xm, B l node gy hi v A l node chun. Gi s rng A gi thng ip kim tra thng qua I, I l mt node trung gian ngu nhin. Xc sut I l node gy hi l f. Kch thc tp con tr ngc ca B l |M|, vi |M|>X, trong X l gii hn cho php ca tp con tr ngc. Vi mi ln kim tra, xc xut A c trong tp kt qu tr v l f+(1-f )pc, ng ngha vi vic B s qua c cuc kim tra d I l node gy hi hay khng v B tr li cuc kim tra bng mt tp node cha A vi xc sut p. i vi node chun, gi tr k vng ca s phn hi thnh cng l n(1-f ) trong s n cuc kim tra, ta ch tnh cc cuc kim tra i qua node trung gian l node chun. Tuy nhin, vic mt node chun b tnh nghi l node gy hi c th xy ra (xc thc li). Xc thc li c th xy ra khi t l node trung gian c chn l node gy hi ln hn f v chng loi b cc thng ip kim tra, l nguyn nhn lm cho node chun b coi l node gy hi. Do , trong qu trnh kim tra chng ta cn nh du node gy hi ngay khi s phn hi thnh cng m ta nhn c nh hn n-k. k l mt gi tr c th quy nh s xc thc li m ta cho php.

Chng ta cn xc nh gi tr thch hp ca k. Xc sut k node trong n node trung gian l node gy hi c tnh bi cng thc C kn f k(1-f )n-k, gi s rng mi node trung gian l node gy hi vi xc sut f. Cng cn ch rng n-k cn phi ln hn nf, nu khng mt node gy hi ch c th phn hi khi thng ip kim tra ti thng qua mt node gy hi khc v s khng bao gi phn hi khi thng ip kim tra n t mt node chun. Chng ta gn cho k mt gi tr sao cho xc sut trn l rt nh v cng tha mn yu cu n - k > nf. By gi chng ta tm gi tr ca p v c mt node gy hi c th c trnh n khi cuc kim tra. trnh b pht hin, node gy hi cn phi a ra c tr li chnh xc t nht l n-k ln, do :
i (1, n)

{f +(1 f)p c } n k
i i

Sau khi gin c cc s hng ta c:

i (1, n)

p c
i

k (1 f)

C pi v ci u nh hn 1, nn ta c th vit:
i (1, n)

i (1, n)

p c
i

Do chng ta c:

i (1, n)

k (1 f)

Chia c 2 v cho n ta c:
i (1, n)

p
n

k n(1 f)

V bn tri l gi tr trung bnh ca p trong n ln kim tra, k hiu l pavg. Ta cng k hiu cavg l gi tr trung bnh c c trong n ln kim tra. Theo , nh vic duy tr xc

sut trung bnh l

k n(1 f)

trong n ln kim tra i vi c hai gi tr c v p, mt node

gy hi c th trnh b pht hin trong bc 2 ca qu trnh kim tra. Gi tr ca p v c nh hn gi tr trn, th chng s b pht hin l node gy hi trong bc 2. By gi cn tnh gi tr ln nht ca kch thc tp con tr ngc m mt node gy hi c th c m khng b pht hin trong bc 2 ca qu trnh kim tra. Mt node gy hi phn hi li vi mt tp ngu nhin c kch thc X l tp con ca tp con tr ngc c kch thc |M| ca n khi c yu cu kim tra t mt node trung gian chun.

Do , ta c: pavg = | M | , kt hp vi: pavg= 1 n(1 f) Ta c:

k X 1 n(1 f) |M | k

iu ny c ngha l mt node gy hi c th duy tr mt tp con tr ngc c kch thc: |M|

X (1 k ) n(1 f )

Gi tr ny ln hn X, v nh vy node gy hi s khng b pht hin trong bc 2 ca qu trnh kim tra. Tuy nhin, ch rng xc sut ca thng ip phn hi m tp con tr ngc khng cha node thc hin kim tra trong mi ln kim tra l (1-f)(1-p)c. Ngha l, mt thng ip kim tra n t mt node chun v node gy hi la chn phn hi bng mt tp con tr ngc khng cha node kim tra. Vi xc sut ny ln hn khng, mt node gy hi cui cng cng s b pht hin trong bc 1 ca qu trnh kim tra.

Chng 4. M PHNG V NH GI C CH KIM TRA N DANH DA TRN PASTRY

4.1. Hnh trng mng v cc file th vin lin kt ng trong m phng 4.1.1. Hnh trng mng m phng m phng mng Pastry, m hnh mng c s dng l m hnh mng giao vn nhnh (Transit-stub). M hnh mng giao vn phn nhnh to ra th phn cp bng cch sinh ra cc kt ni giao vn v cc min nhnh (stub domain). C th miu t mt cch n gin v d hiu cch hnh thnh mng giao vn nhnh nh sau: u tin dng ln th kt ni ngu nhin; Mi node trong th tng trng cho ton b mt min giao vn (transit domain). Mi node trong th sau c thay th bi mt th kt ni ngu nhin khc, i din cho topo xng sng ca mt min giao vn. Tip , t mi node trong tng min giao vn, chng ta sinh ra mt th kt ni ngu nhin i din cho min nhnh gn vo node . Cui cng chng ta thm cc cnh lin kt gia cc node, mt u cnh t min giao vn v mt t min nhnh hay t cc min nhnh ring bit vi nhau. Hin nhin, nu th ngu nhin c sinh ra l kt ni hon ton (lin thng hon ton), th m hnh c xy dng l th lin thng.

Hnh 6: Minh ha mng giao vn nhnh Transit stub

M hnh mng dng trong m phng c to ra bi chng trnh sinh m hnh mng GT-ITM . Cc file d liu cho m hnh mng bao gm: ts5050.sc ts5050-distances.out ts5050-routes.out M hnh mng m phng ny c 5050 b nh tuyn v c th m phng cho 505.000 node. 4.1.2. Cc file th vin lin kt ng trong chng trnh c th thc hin m phng mng Pastry, cn s dng b th vin cc lp v hm cho mng ngang hng c cu trc Pastry do hng Microsoft xy dng v pht trin.B th vin ny gm ba file l:
Simulator.dll MessageRouting.dll Pastry.dll

File th vin MessageRouting.dll cung cp cc lp v lp tru tng dng x l cc thng ip trong mng Pastry, lp tru tng quan trng nht m file ny cung cp c s dng trong m phng l public abstract class Application. Lp ny c hai phng thc ng quan tm l:
public abstract bool

ContinueRouting(MessageRouting.RouteMsg msg) Phng thc ny c thc thi trong qu trnh chuyn tip thng ip trong mng.
protected abstract void

ProcessMessage(MessageRouting.RouteMsg msg) Khi thng ip c chuyn ti ch, phng thc ny c gi v thc thi. File th vin ng Simulator.dll cung cp cc lp ti m hnh mng m phng vi lp chnh c s dng l public class Sim.Trong chng trnh m phng, ta

cn khi to mt i tng lp Sim vi cc tham s truyn vo l ba file mng m phng sinh bi chng trnh GT-ITM c nu trn. File Pastry.dll cung cp cc lp m t cc i tng c trong mng Pastry bao gm: public class LeafSet public class RouteTable public class NeighbourhoodSet
public class Node : MessageRouting.Node

public class NodeIdAddressBind : MessageRouting.NodeIdAddressBind public class NodeId : MessageRouting.NodeId 4.2. Xy dng chng trnh m phng kim tra n danh 4.2.1. M t chng trnh Chng trnh c vit bng ngn ng C#, vi cc file th vin c xy dng v pht trin bi hng Microsoft. C ch kim tra n c thc hin da trn chng trnh m phng mng Pastry, mng Pastry y c khng gian nh danh vi l = 128 bit, tc c th nh nh danh cho 2128 node hoc kha. S ca nh danh l s trong h c s 16. C ch kim tra n danh da vo vic gii hn bc pht hin ra cc node gy hi trong h thng. Do , ta cn n nh mt s node trong mng lm node gy hi v chn ra mt gii hn bc trong ph hp. Gi t l node gy hi c trong mng l f, ta s chn cc node lm node gy hi l cc node c s bc trong cao nht, tc l nhng node c kch thc tp con tr ngc ln nht. Gi s node c trong mng l N, ta chn xp x f*N node lm node gy hi v mt gii hn bc b sao cho tt c cc node gy hi c chn c bc trong cao hn gii hn bc b v tt c cc node chun c bc trong nh hn hoc bng gii hn bc cho php . Trong tn cng che khut, cc node gy hi thng ng vi nhau thc hin che khut cc node khc trong mng, do mt node gy hi bit cc node gy hi khc l cc node no. Truy vn kim tra n danh i hi node b kim tra tr v tp con tr ngc ca n. Tp con tr ngc ny phi cha node tin hnh kim tra v kch thc tp con tr ngc phi nh hn bng gii bc cho php th mi c coi l kim tra thnh cng. Do node gy hi cn c nhiu node chun cha n trong tp hng xm c th thc hin m mu che khut, nn cc node gy hi c kch thc tp con tr ngc rt ln. Mi khi

c truy vn kim tra n danh ti, n s phi quyt nh c tr li hay khng. Nu khng tr li th s b tnh nghi l node gy hi, nu tr li n phi chn mt tp con ngu nhin t tp con tr ngc ca n phn hi v cho node kim tra. Tp con tr ngc tr li cho cuc kim tra c th c hoc khng cha node tin hnh kim tra, v xc sut c node kim tra bng gii hn bc ca mng chia cho kch thc tp con tr ngc ca n. Chng trnh kim tra n danh s cho tt c cc node chun thc hin kim tra n danh i vi cc node c trong tp hng xm ca n. S ln kim tra n danh i vi mi node hng xm s c thay i vi cc gi tr khc nhau. y l c ch kim tra n danh nn trong qu trnh kim tra cn mt node trung gian chuyn tip thng ip truy vn kim tra t node kim tra ti node b kim tra nhm che du danh tnh node tin hnh v node b kim tra. Node trung gian trong mi truy vn kim tra s c chn ngu nhin t cc node c trong h thng v khc vi node kim tra v b kim tra. Do node trung gian chn ngu nhin, nn n c th l mt node gy hi, nu node trung gian c chn l node gy hi n s thc hin hnh ng ph hoi cuc kim tra. Nu node b kim tra l node chun, n s loi b yu cu kim tra v tr li cho node kim tra rng kim tra tht bi. Nh vy node kim tra s tnh nghi node hng xm chun ca n l node gy hi. Nu node b kim tra l node gy hi, n s thng ng vi node gy hi v gi cho node kim tra mt tp con tr ngc c cha node kim tra, v node kim tra coi l mt truy vn kim tra n danh thnh cng. Thng ip ci t dng trong kim tra n danh c chia lm bn loi thng ip: CHALLENGE_REQ_1: Thng ip truy vn gi t node kim tra ti node trung gian. CHALLENGE_REQ_2: Thng ip truy vn gi t node trung gian ti node b kim tra.

CHALLENGE_REQ_1

CHALLENGE_REQ_2

CHALLENGE_RES_2

CHALLENGE_RES_1

Hnh 7:Cc loi thng ip trong kim tra n danh CHALLENGE_RES_1: Thng ip phn hi t node b kim tra gi cho node trung gian. CHALLENGE_RES_2: Thng ip phn hi t node trung gian gi cho node tin hnh kim tra.

Da vo loi thng ip ta c th xc nh cc hnh ng tip theo ca mi node nhn c thng ip ca qu trnh kim tra n danh. 4.2.2. Cc file chng trnh File Test.cs File Test l file chnh ca chng trnh m phng, c cha hm main ca chng trnh. Cc thuc tnh quan trng trong lp ny bao gm: Mng lu tr tp hng xm ca tt c cc ndoe trong mng: public static ArrayList[] NeighborSet Mng lu tr con tr ngc ca tt c cc node trong mng: public static ArrayList[] BackPointerSet

Mng cha tt c cc node trong mng: public static ArrayList All_Node Mng cha cc node gy hi trong mng public static ArrayList MaliciousNodes T l node gy hi trong mng: static double F Gii hn bc trong ca cc node: public static int bound Mt s phng thc chnh ca lp Test: Phng th public void createMaliciousNodeSet(double

fMaliciousNode):Phng thc ny s khi to cc node gy hi v lu vo trong mng MaliciousNodes, s lng cc node gy hi s chim t l fMaliciousNode trong tng s cc node trong mng, ng thi phng thc ny cng s xc nh gii hn bc trong bound ca mng. Gi tr bound c

xc nh sao cho tt c cc node gy hi c bc trong cao hn gi tr ny, v cc node chun c bc trong nh hn hoc bng gi tr bound. Phng thc public static Node CreateNodes(int

numNodes):Dng khi to mt lng node bng numNodes cho mng. Phng thc public static void SendMessages(int nodes, int time): Phng thc ny c gi gi cc thng ip kim tra trong mng. Hai tham s truyn vo l s node mng v lng thi thi gian gi cc thng ip truy vn. Cc node chun c dng gi cc thng ip truy vn kim tra n danh, ch ca thng ip chnh l cc node trong tp hng xm ca n. Phng thc khi to: public Test(): Trong phng thc ny s khi tp mng m phng Sim s = Sim(string netFile, string routesFile, string distancesFile, Simulator.CheckIgnore ignore), trong cc file netFile, routesFile, distancesFile l cc file m hnh mng c sinh ra bi GT-ITM. Ngoi cc phng thc trn cn c cc phng thc li k kt qu kim tra showResult(), phng thc khi to tp hng xm getNeighbor(Pastry.NodeIdAddressBind NodeBind) v tp con tr

ngc createBackPointerSet() ca cc node trong mng. File AuditingApplication.cs File ny m t lp AuditingApplication c k tha t lp tru tng MessageRouting.Application c trong file th vin MessageRouting.dll. Lp AuditingApplication c thuc tnh quan trng l : private Node myServer: Cha node ch ca thng ip c gi i. Trong lp ny c cc phng thc x l cc thng ip kim tra, mi qu trnh x l cc thng ip kim tra c gi i u c x l trong phng thc: protected override ProcessMessage(MessageRouting.RouteMsg mrMsg) void

Phng thc ny s nhn dng loi thng ip kim tra da vo thuc tnh MessageType ca thng ip. C bn loi thng ip, hai thng ip truy vn v hai thng ip phn hi c ni n trong phn 4.1.2. Nu node trung gian trong kim tra l node gy hi n s bo cho node tin hnh kim tra rng khng c phn hi khi node b kim tra l node chun. V n tr v mt thng ip cho node kim tra gip node b kim vt qua ln kim tra . Nu node trung gian l node chun, n s chuyn tip thng ip kim tra i ch. Nu node ch l node chun, n s phn gi phn hi li cho node trung gian, v tt nhin n qua c ln kim tra ny. Nu node gy hi l node ch ca cuc kim tra, n s chn tr li hoc khng tr li. Nu tr li, n s sinh mt tp con t tp con tr ngc ca n vi cc node trong tp con c ly ngu nhin, kch thc tp con ny c th bng gii hn bc trong. File Message.cs Trong file ny m t lp Message, lp ny c k tha t t lp RouteMsg c cung cp trong file th vin Pastry.dll. Lp ny m t cc thng ip c gi i, cc thuc tnh ca lp ny l: Danh sch tp con tr ngc tr v: public ArrayList list Tp con tr ngc ca node b kim tra tr v s c lu trong mng ny. Thuc tnh lu thng tin node kim tra v node ch: public Pastry.NodeIdAddressBind aud_sour public Pastry.NodeIdAddressBind aud_dest Thuc tnh xc nh c phn hi t node b kim tra hay khng public bool has_res Khi c phn hi t node b kim tra, gi tr ca thuc tnh ny c thit lp bng true, hoc khi node trung gian l node gy hi thc hin ph hoi loi cuc kim tra th n s sinh thng ip phn hi cho node ch vi gi tr thuc tnh ny thit lp bng false. Ngoi ra cn c bn gi tr thit lp cho bn loi thng ip trong kim tra c thit lp gi tr khng i cho lp ny l:

public public public public

const const const const

int int int int

CHALLENGE_REQ_1 CHALLENGE_REQ_2 CHALLENGE_RES_1 CHALLENGE_RES_2

= = = =

2111; 2222; 3111; 3222;

4.3. Th nghim v nhn xt Ti s tin hnh hai th nghim nh gi hiu qu ca phng php kim tra n danh. Trong hai th nghim, s node trong mng u khng i v bng 5000. T l node gy hi l 0.2, tc trong mng s c khong 1000 node l node gy hi v 4000 node l node chun. Mi th nghim s chy chng trnh m phng nm ln, mi ln chy c s ln lp kim tra trn mi node l khc nhau. Gi s ln kim tra trn mi node l n, gi tr tng ng ca n trong mi ln chy chng trnh l 8, 12, 16, 20 v 24. Gi k l s cuc kim tra m mt node b kim tra phi vt qua c coi l node chun, ngc li nu khng qua s b coi l node gy hi. Ta s thay k ln lt bng n/4, n/2 v 3n/4, v t tnh t l node gy hi b pht hin c tng ng vi mi gi tr k. 4.3.1. Th nghim 1 Trong th nghim 1 ny, ta gi nh kch thc tp con tr ngc ca node gy hi trong mng ln hn 1.2 ln kch thc tp con tr ngc ca cc node chun, tc xc sut node gy hi chn c tp con tr ngc phn hi kim tra c cha node kim tra l xp x 1/1.2 hay 83%, iu ny c ngha rng kh nng node ph hoi vt qua cuc kim tra l rt cao. Kt qu Biu 1: T l node gy hi b pht hin trong th nghim 1

Trong biu trn, trc tung l t l node gy hi b pht hin, trc honh l s kim tra i vi mi node. Ta c th thy rng, tng s lng kim tra s tng t l node gy hi b pht hin trong mng, nhng vi k = n/4 th ngc li, t l node gy hi b pht hin c xu hng gim v gi tr k ny, t l node gy hi b pht hin l thp nht, gn nh bng 0. Ta tng gi tr ca k ln n/2 v 3n/4 th t l node gy hi b pht hin tng r rt, c bit vi k = 3n/4 t l pht hin u trn 0.8 v gn ti 1. Biu 2: T l node chun khng vt qua c kim tra trong th nghim 1

Trong biu ny, trc tung l t l node chun b kt lun nhm l node gy hi, trc honh l s ln kim tra vi mi node. 4.3.2. Th nghim 2 Trong th nghim ny, ta thit lp t l node gy hi trong mng l 0.2, cc node gy hi c chn l cc node c kch thc tp con tr ngc ln nht bi tp con tr ngc ln chnh l c im ni bt ca mt node gy hi. Chng trnh tin hnh chn t ng v chn ra c 985 node ng vai tr node gy hi. Cc node gy hi ny c tng kch thc tp con tr ngc l 107258, chim ti 42% tng kch thc tp con tr ngc ca tt c cc node trong mng. Gii hn bc c chng trnh chn y bng 62. Tc tt c cc node gy hi c bc trong ln hn 62 v cc node chun c bc trong nh hn hoc bng 62. Kch thc trung bnh tp con tr ngc ca node gy hi l 108. Xc sut trung bnh tp con tr ngc do node gy hi tr v c cha node kim tra l xp x 57%. Kt qu Biu 3:T l node gy hi b pht hin trong th nghim 2

Biu 4: T l node chun b kt lun nhm l node gy hi trong th nghim 2

Trong c hai bi trn, trc tung l t l pht hin v trc honh l s ln kim tra vi mi node. 4.3.3. Nhn xt Trong hai th nghim trn, t l node gy hi b pht hin l rt cao vi k = 3n/4. t t 0.8 n gn bng 1, c bit vi 24 cuc kim tra v k = 3n/4 s node gy hi b pht hin trong c hai ln th nghim u cao hn 0.97. Chng t phng php kim tra n danh rt hiu qu trong pht hin cc node gy hi. Trong hai biu 1 v 3, ch c ring ng t l node gy hi b pht hin vi k = n/4 c xu hng i xung khi ta tng s ln kim tra, tri vi hai ng n/2 v 3n/4 c xu hng i ln khi tng s ln kim tra. S i xung ca t l pht hin vi k = n/4 hon ton hp l v tun theo Quy tc phn phi xc sut nh thc[8]. Trong ba gi tr ca k c thit lp nh gi, ta thy vi k = 3n/4 t hiu qu cao nht trong pht hin node gy hi, tuy nhin n li c t l kt lun node chun l node gy hi cao nht, v t l ny nm trong khong 0.1 n 0.2. T l kt lun nhm i vi k = n/4 v n/2 l rt thp, v gn nh bng 0. Trong th nghim 1 c t l node gy hi b pht hin thp hn so vi t l node gy hi b pht hin trong th nghim 2, iu ny c th gii thch l do xc sut node gy hi chn c mt tp con tr ngc ph hp c cha node kim tra trong th nghim 1 l 83%, cao hn trong th nghim 2 l 57%, do s node gy hi c kh nng qua c

cuc kim tra cao hn. iu ny ng vi cng thc t l node gy hi qua c cuc kim tra: f+(1-f )pc c ni n trong phn 3.3. Trong f l t l node gy hi trong mng, p l xc sut node gy hi phn hi kim tra v c l xc sut node gy hi chn c tp con tr ph hp phn hi. l gii cho vic i xung ca hai ng k = n/4 trong th 1, ta s p dng quy tc tnh phn phi xc sut nh thc chng minh cho s i xung ca ng ny l ng. Trong th nghim 1, xc sut node gy hi qua c mt cuc kim tra l : S = f+(1-f )pc = 0.2 + (1-0.2)* 0.5 * 0.83 = 0.532 Vi gi thit rng, node gy hi chn tr li thng ip kim tra vi xc sut p=0.5. Theo quy tc tnh phn phi xc sut nh thc, t l node gy hi khng qua c t nht 2 trong 8 cuc kim tra l:
0 1 P1 = C 8 S0(1-S) 8 + C8 S1(1-S)

= 0.0232

T l node khng qua c t nht l 3 trong 12 cuc kim tra l:

0 P2= C12 S0(1-S)

12

1 + C12 S1(1-S)

11

2 + C12 S2(1-S)

10

= 0.0110

T l node khng qua c t nht l 4 trong 16 cuc kim tra l:

0 P3 = C16 S0(1-S)

16

1 + C16 S1(1-S)

15

2 + C16 S2(1-S)

14

3 + C16 S3(1-S)

13

0.0052 T l node khng qua c t nht 5 trong 20 cuc kim tra v 6 trong 24 cuc kim tra l: P4= 0.0025, P5 = 0.0012 . Ta thy rng P1> P2> P3 >P4 >P5 mc d s ln kim tra tng. Tuy nhin ch c ng k=n/4 i xung, 2 ng cn li u i ln. Tht vy, p dng cch chng minh trn ta c xc sut node gy hi khng qua c t nht l 4 trong 8 cuc kim tra l: P1 =

C S
i =0 i 8

(1 S ) 8i = 0.2957. Tng t ta c

xc sut node gy hi khng qua c t nht 6, 8, 10, 12 trong 12, 16, 20 v 24 cuc kim tra l: P2= 0.3039, P3= 0.3052, P4= 0.3040, P5=0.3013. Cc gi tr ca P1, P2, P3, P4, P5 u ph hp vi ng k = n/2 trong th 1.

S bin i ca cc ng trong cc th khc u c th chng minh c l ng n bng phng php chng minh trn. Nhn xt rng, kim tra n danh t hiu qu cao nht ta nn chn s ln kim tra l 24 vi s kim tra thnh cng c coi l node chun l 18, nh vy t l node gy hi b pht hin ln ti trn 0.9, v s node chun b kt lun nhm l node gy hi c t l nh hn 0.2. iu ny hon ton chp nhn c v gn nh l tt c cc node gy hi u b loi b v ta ch phi b xung li mt lng nh cc node chun b loi b nhm.

Chng 5. KT LUN
Phng php kim tra n danh pht hin cc node gy hi cn da vo c ch gii hn bc trong v bc ngoi ca cc node trong mng xp chng. Mi node ngoi vic phi duy tr tp hng xm cn phi duy tr tp con tr ngc, iu ny i hi tng chi ph duy tr tp con tr ngc. c th a ra gii hn bc, cn c mt s qun l tp chung cho tt c cc node trong mng, iu ny lm cho mng khng cn l l mng ngang hng ng ngha m tr thnh mng lai gia P2P v mng my khch-my ch. Phng php kim tra n danh t ra hu hiu trong pht hin cc node gy hi khi cc node ny c tp con tr ngc ln hn gii hn cho php. Tuy nhin, nu cc node gy hi c tp con tr ngc khng qu gii hn bc th s khng th pht hin c chng. Tuy nhin, nu node gy hi c tp con tr ngc ph hp vi gii hn bc th n cng c hiu qu trong tn cng thp, nhng mt phn no vn c th gy hi cho mng.

Ti liu tham kho

Ti liu ting Anh [1] Atul Singh, Tsuen-Wan .Johnny. Ngan, Peter Druschel., and Dan S. Wallach, Eclipse Attacks on Overlay Networks: Threats and Defenses , 2002 [2] J. R. Douceur. The Sybil Attack. In Proceedings of 1st International Workshop on Peer-to-Peer Systems (IPTPS), Cambridge, MA, Mar. 2002. [3] K. Hildrum and J. Kubiatowicz. Asymptotically ef_cient approaches to fault-tolerance in peer-to-peer networks. In Proceedings of 17th International Symposium on Distributed Computing, Sorrento, Italy, Oct. 2003. [4] Miguel Castro, Microsoft Research; Peter Druschel, Rice University; Ayalvadi Ganesh and Antony Rowstron, Microsoft Research; Dan S. Wallach, Rice University, Secure Routing for Structured Peer-to-Peer Overlay Networks [5] M. Castro, P. Druschel, A. Ganesh, A. Rowstron, and D. S. Wallach. Secure routing for structured peer-to-peer overlay networks. In Proceedings of USENIX Operating System Design and Implementation(OSDI), Boston, MA, Dec. 2002. [6] M. Castro, P. Druschel, Y. C. Hu, and A. Rowstron. Proximity neighbor selection in tree-based structured peer-to-peer overlays. Technical Report MSR-TR-2003-52, Microsoft Research, June 2003. [7] M. Castro and B. Liskov, "Practical Byzantine fault-tolerance and proactive recovery", ACM Transactions on Computer Systems (TOCS), Volume 20, Issue 4, November 2002. [8] R. Steinmetz and K. Wehrle (Eds.): P2P Systems and Applications, LNCS 3485, pp. 1-5, 2005. Ti liu ting Vit [8] Cao Ho Thi, Xc sut thng k, phn 5.2.2. Phn phi xc sut (Probability Distribution), trang 48, nm 2008. [9] http://vi.wikipedia.org