nh tuyn trong mng ngang hng th h mi

ThS. V Th Thy H, TS. L Nht Thng Mng ngang hng (Peer-to-Peer P2P) bt u xut hin t 1999 v thu ht s quan tm trong nhng nm gn y. c bit vic p dng cc m hnh P2P trong vic xy dng nhng ng dng chia s tp (file), video, in thoi trn nn Internet (Internet-based telephony) t c nhiu thnh cng. Hin nay cc ng dng P2P chim khong 50% (thm ch 75%) bng thng trn Internet. Cc mng ngang hng Peer-to-Peer (P2P) cung cp mt nn tng tt chia s d liu, phn phi ni dung cng vi cc ng dng truyn thng a hng mc ng dng phm vi rng. Cc mng P2P c kh nng cung cp mt kin trc nh tuyn hiu qu c tnh cht t t chc trn din rng, kt hp vi kh nng chu ng li, cn bng ti v quan im v v tr r rng. Bi bo ny a ra mt s nhn xt v hng nghin cu nng cao hiu nng ca cc thut ton nh tuyn trong mng ngang hng c cu trc. Gii thiu Cc h thng chia s d liu peer-to-peer (P2P) hin l mt trong nhng ng dng Internet ph bin nht v ang tr thnh ngun lu lng Internet chnh. Do vy, vic m rng quy m cho cc h thng ny l cc k quan trng. Tuy nhin, cc thit k ban u cho cc h thng P2P khng ph hp vi cc mng c quy m ln, v d nh Napster v Gnutella. Nhm p ng cc vn m rng quy m, mt s nhm nghin cu c lp to ra mt th h mi cc h thng P2P h tr tnh nng bng hm bm phn tn (DHT), trong s l Tapestry, Pastry, Chord v CAN (Content-Addressable Networks). Trong cc h thng ny (cn gi l cc h thng DHT), cc file c rng buc vi cc kho (key) - v d c to ra bng cch bm cc tn file v mi node trong h thng c trch nhim lu gi mt di cc key no . C mt ton t c bn trong cc DHT ny l tm kim lookup (key), n s tr li nhn dng (v d nh a ch IP) ca node lu gi i tng vi key . Ton t ny cho php cc node a v ly (put, get ) cc file trn c s key ca chng, nh h tr giao din dng bng bm [2]. Tnh nng DHT ny c chng minh l mt c s hu ch cho cc h thng phn phi ln; mt s cc d n ang c xut xy dng cc dch v ng dng DHT nh: cc h thng file phn tn, truyn thng a hng (multicast) mc ng dng, cc dch v khai bo s kin, v cc dch v tr chuyn (chat). Vi rt nhiu cc ng dng ang c pht trin trong thi gian qua, chng ta mong i tnh nng DHT s tr thnh mt phn tch hp trong P2P tng lai. Ct li ca cc h thng DHT ny l thut ton nh tuyn. Cc node DHT to mt mng chng vi mi node c mt vi node khc lm ln cn. Khi mt lookup(key) c to ra, vic truy tm c nh tuyn thng qua mng chng ti node c trch nhim vi key . Tnh m rng ca cc thut ton DHT ny gn lin vi hiu nng ca cc thut ton nh tuyn.

nh tuyn trong cc h thng P2P th h mi Hu nh cc thut ton hin ti ng dng trong mng ngang hng th h mi (mng c cu trc) u nh tuyn da trn key. N nhn mt key, v hi p, chng nh tuyn mt bn tin ti node c trch nhim vi key y. Cc key l cc chui s c mt di no y. Cc node l cc b nhn dng, ly t cng khng gian vi cc key (c ngha l cng s lng digits). Mi node lu gi mt bng nh tuyn bao gm mt tp nh cc node trong h thng. Cc thut ton nh tuyn u c gng nh tuyn ti node c key ph hp v qua t s hop nht. Di y l mt s thut ton nh tuyn hin ti: - nh tuyn da vo tin t (Prefix routing) - PRR: y l thut ton u tin cho vic tm kim v nh tuyn ca mng ngang hng. Bng cch nh x nhn dng i tng thnh khng gian a ch ca cc peers, PRR nh tuyn da trn key v c th tr gip cc thao tc: c, chn v xa i tng lu tr trong mng chng ph. Nguyn l ca thut ton ny l nn tng cho cc thit k DHT sau ny. PRR l nh tuyn da trn hu t, l trng hp i xng ca nh tuyn tin t. nh tuyn hu t v tin t u da trn s ging nhau tng v tr ca a ch ch ti mi hop dc theo ng cho n khi ch t ti. Thit k PPR da trn tp cc node tnh; khng quan tm ti thnh vin l cc node ng, khng c k thut cp nht bng nh tuyn khi node ra nhp hoc ri mng. Phin bn n gin ca PRR c gi l SPRR c a ra bi Li and Paxton. Mt s cc thut ton Tapestry, Pastry, P-Grid, Cycloid, and Z-Grid. Plaxton, Rajaraman u da trn PRR. - Plaxon et al [3]: Plaxon et al l mt phin bn ca PRR, y l thut ton u tin c s dng trn quy m ln bi cc DHT, nhng khng cung cp vic nh tuyn tm kim hiu qu. Thut ton ca Plaxton ban u c to ra nh tuyn cc truy vn Web ti cc cache ln cn, v n nh hng n thit k ca Pastry, Tapestry v Chord. Phng php Plaxton c phc tp tham gia/ri b theo hm loga. Plaxton m bo cc truy vn khng bao gi i xa hn trong khong cch mng so vi peer m lu gi key. Tuy nhin, Plaxton cng c mt s nhc im: yu cu hiu bit ton b xy dng mng chng; peer gc ca i tng l im li n; khng c s chn thm hoc xo b peer; khng c s trnh cc im tc nghn nng. i vi mt h thng n node, mi node c O(log n) ln cn, di ng nh tuyn O(log n) bc nhy -Tapetry [1]: S dng mt bin th ca thut ton Plaxon et al [3] v thm vo tnh nng ng cho cc pees trong mng chng. S dng nh tuyn da trn tin t, Tapestry s dng thut ton SHA-1 bm a ch cc node thnh cc ID biu din theo h c s 2b. Mi node lu gi mt bng nh tuyn gm log2b(N) hng v 2b-1 ct. Hng th nht trong bng nh tuyn cha cc node c ID khc vi ID ca node ch s th nht. Hng th hai trong bng nh tuyn cha cc node c ID ging vi ID ca node ch s th nht nhng khc ch s th hai. Cc hng cn li ca bng nh tuyn cng c t chc tng t. Qu trnh tm kim c thc hin bng cch so snh ln lt cc ch s tin t ca ID v d 4*** => 42** => 422* => 4227, qu trnh ny gi l nh x ln cn. Bng nh tuyn ca mt node X c chia thnh nhiu mc (log2b(N)), mi mc i bao gm cc lin kt (2b-1) n cc node c tin t ging n ch s th i-1 vi ID ca X. Khi mt node nh tuyn n node ch n s i theo ng n node c ID gn ging vi ID ch nht (da theo bng nh tuyn). Sau mi chng node tip theo s c mc cao hn t nht l 1, v vy sau nhiu nht l log2b(N) chng qu trnh tm kim s kt thc. Trong iu kin bnh thng phc tp tm kim ca Tapestry l O(log2b (N)). -Pastry: Trong Pastry vic nh tuyn bao gm vic chuyn truy vn ti node ln cn c tin t c chia s di nht vi key (v, trong trng hp cht ch, th ti node c b nhn dng gn nht v s i vi key). Pastry c O(log n) ln cn v nh tuyn trong vng O(log n) bc nhy . -Chord: Chord s dng mt khng gian ID vng trn kch thc N. Mt node Chord vi ID l u c mt con tr ti node u tin ng sau n trong khng gian ID theo chiu kim ng h, k hiu l Succ(u) v mt con tr ti node ng trc n trong khng gian ID, k hiu l Pred(u). Cc node to thnh mt danh sch lin kt hai chiu. Bn cnh , mt node Chord
2

lu M=log2(N) con tr gi l cc finger. Tp cc finger ca node ID u c xc nh nh sau F(u)={Succ(u+2i-1)}, 1 i M. Vi cch la chn finger th ny, trong mng Chord, cc node quan st khng gian ID ca vng trn bt u t ID ca chng. ng thi vi cch la chn finger ca Chord, khng gian ID s c chia i, na th nht cng c chia i, ri phn t th nht li c chia i Qu trnh tm kim l kt qu t nhin theo cch chia khng gian ID da trn vic tm ID successor. Trong iu kin thng thng, phc tp ca thut ton l O(log2(N)).
1

-CAN: CAN c mt hiu nng nh tuyn O(d .N d ) v trng thi nh tuyn trong bin 2.d. CAN chn cc key ca n t mt khng gian d chiu. Mi node c gn vi mt min lp phng ca khng gian key ny, v cc ln cn ca n l nhng node s hu cc khi lp phng k cn. nh tuyn bao gm chuyn ti ln cn gn key hn. CAN c tnh cht v hiu nng khc cc thut ton khc, cc node c O(d) ln cn v chiu di ng dn l
O ( dn ) hops. Tuy nhin, khi d = log n, CAN c O(log n) ln cn v chiu di ng dn O (log n), ging vi cc thut ton khc.
1 d

Mt s nhn xt v nh tuyn trong mng ngang hng c cu trc

Mng c cu trc, thng gi l cc mng P2P th h mi, thng s dng m hnh nh tuyn da trn bng bm phn tn DHT lm gim chi ph nh tuyn v cung cp mt gii hn cho s bc nhy c yu cu trong vic tm kim mt mc d liu. Cc h thng nh vy c cc u im nh: tnh phn tn, kh nng m rng, tnh sn sng, khong cch nh tuyn ngn, sc chu ng li. nh tuyn DHT da trn khi nim nh tuyn trn c s tin t, ban u c gii thiu bi Plaxton h tr s tham gia/ ri b ng ca cc peer v cung cp cc c ch khi phc khi gp li. Ni cch khc, cc mng P2P c cu trc c ngha l t p mng P2P c iu khin cht ch v cc cc i tng d liu c t ti cc v tr c th sao cho t c hiu nng truy vn tt hn. V d cho cc mng nh vy l Plaxton, Pastry, Tapestry, Chord v CAN, ang trin khai cc thut ton nh tuyn DHT khc nhau [5]. Cc c tnh l thuyt th c s dng xc nh v ci thin hiu nng ca cc h thng nh vy. Thng thng, cc th nh th thng c ng knh (log n ) v (log n ) mc ti mi node, n l s peers trong h thng. Mt vn quan trng ca cc h thng c cu trc lin quan n tnh n nh (churn) n nh hng nghim trng n hiu nng mng. Cc nhc im khc l mo u cao, thiu h tr cho truy tm keyword v cc truy vn phc tp. Tuy nhin, cc n lc gn y hng n vic pht trin ca mt nn tng thng nht cho cc h thng DHT khc nhau, l lm cho cc mng c cu trc ngy cng hp dn hn. Mt nn tng nh vy c mong i l s cung cp mt API trn c s KBR (nh tuyn trn c s Key), kt hp vi mt m hnh dch v DHT c bn trin khai cc ng dng DHT mt cch d dng. Mt vn quan trng khc l cc k thut nh tuyn tm kim s dng trong cc h thng P2P v cc cch ti u chng. Mt k thut nh tuyn m bo tnh hiu qu v QOS t u vo ngi dng. Thch thc t ra l vic pht trin cc m hnh nh tuyn ti u mi cho cc mng ln t vi nghn n vi chc nghn server v hng triu khch hng. Tiu chun c bn cho vic pht trin cc thut ton nh tuyn DHT hiu qu l cung cp tradeoff tt nht vi mt tp cc tham s nh: hiu qu nh tuyn, n hi vi node li, nh tuyn cc im nng v hiu nng trn c s th. Cc tham s khc nh tiu tn ti nguyn t nht cng quan trng khng km, c bit l trong trng hp cc mng Ad-hoc di ng.

Mt s hng nghin cu v ci thin hiu nng nh tuyn ca h thng P2P c cu trc

nh gi hiu nng ca cc ca cc chin lc nh tuyn trong mng ngang hng P2P c cu trc (P2P-DHT) nhm to c s cho vic a ra cc gii php ci tin hiu nng ca chng ng thi gip la chn, s dng cc thut ton hiu qu hn. Mt s hng nghin cu ca cng ng P2P ang n lc ci thin hiu nng tm kim ca h thng P2P- DHT: - iu chnh cu trc chng ph cnh tranh vi cu trc Internet tng di sao cho cc ln cn chng ph l gn v mt vt l do s gim thiu hao ph mi chng. - Mt phng php khc tng hiu nng tm kim ca h thng DHT l gim s bc nhy n ch hn l gim hao ph cho mi bc nhy. iu ny c thc hin bng cch tng mc kt ni ca mi peers. Phng php ny gim ng knh mng nhng li yu cu kch thc cc bng nh tuyn ln hn, s l thch thc khi mi trng khng n nh nh l P2P. - Cc xut khc kt hp u im ca c hai phng php trn cng c a ra, cho php cc peers la chn ln cn v ni dung mt cch thng minh v linh ng. Trong trng hp ny, s ti u chng ph dn n mt cu trc mng khng u, c ngha l cc node khc nhau c th qun l cc phn khng bng nhau ca khng gian bm, c th kt ni vi mt s lng node khc nhau, v cc kt ni c th ch n cc node mt cch ngu nhin, khng theo mt quy tc nht nh no c. Ngay c khi khng c s ti u mng, th s khng u cng c th xy ra do cc sp xp khng on trc c ca cc node tham gia v ri b mng.

Kt lun Khong mi nm tr li y, th gii chng kin s bng n ca Internet bng thng rng, cng vi n l s pht trin mnh m ca cc ng dng peer-to-peer. Vi nhiu u im ha hn nh tnh hiu qu, linh hot v kh nng m rng cao, cc mng peer-to-peer v ang thu ht c nhiu s quan tm t cng ng nghin cu. Mng peer-to-peer pht trin qua nhiu th h, th h hin nay l mng c cu trc da trn kh nng lu tr v tm kim d liu hiu qu theo c ch Bng bm phn tn (DHT). Vn ct li ca P2P l cc thut ton nh tuyn, n ng vai tr quyt nh hiu qu hot ng khi thit lp cc dch v h thng nn tng ca mng ngang hng ni ring v mng o trn Internet ni chung. Ti liu tham kho
[1] Z. H. TAN, W. CHENG, G. R. CHANG, X. X. GAO, and H. WANG, A Structured P2P Overlay Routing Protocol Based on Distributed Selection Algorithm, Journal of Computer Science, China. Vol. 35, No 4B, pp. 96-98, April 2008. [2] WAN FARIZA BINTI, WAN ABDUL RAHMAN, FARHAT ANWAR, Performance Evaluation on Peer-to-peer (P2P) Distributed Hash Table (DHT) Protocols, Proceedings of the International Conference on Electrical Engineering and Informatics, Bandung, Indonesia, June 17-19, 2007. [3]. K. LUA, J. C. MARCELO PIAS, R. SHARMA and S. LIM, A Survey and Comparison of Peer-to-Peer Overlay Network Schemes, IEEE Communications Survey and Tutorial, Vol. 7, No 2, 2005. [4] J. LI, J. STRIBLING, T. M. GIL, R. MORRIS, and M. F. KAASHOEK, Comparing the Performance of Distributed Hash Tables Under Churn, in 3rd International Workshop on Peer-to-Peer Systems (IPTPS 04), (San Diego, CA, USA), February 2004. [5]ALEXANDRU POPESCU, DAVID ERMAN, MARKUS FIEDLER and DEMETRES KOUVATSOS, Routing in Content Addressable Networks Algorithms and Performance, 20th ITC Specialist Seminar, 18-20. May 2009, Hoi An, Vietnam. Bi vit do Cng ty Vin thng Quc t VTI ti tr