U nst ruct ured P2P Information Ret rieval Based on t he Ant Colony Algorit hm

Transcription

1 CN / TP ISSN X COMPU TER EN GIN EERIN G & SCIENCE Vol131,No1 8,2009 : X(2009) P2P 3 U nst ruct ured P2P Information Ret rieval Based on t he Ant Colony Algorit hm 1,2, 2, 1 LI Shao2zi 1,2,WANG Ting 2, ZHOU Chang2le 1 ( 1., ;2., ) ( 1. Department of Cognitive Science, Xiamen University, Xiamen ; 2. School of Computer Science, National University of Defense Technology, Changsha , China) : P2P,P2P,,, P2P, ;,,, P2P, Abstract :Unstructured P2P systems are inefficient but more popular. This paper present s a new approach to unstruc2 tured P2P information retrieval based on the ant colony algorithm and information recommendation services to improve the search efficiency. The ant colony algorithm is used to make routing decisions,and it makes searches turn to the most favora2 ble direction. Besides, information recommendation services reduce blind searches and raise the file2sharing efficiency. In or2 der to evaluate and validate the new algorithm, a simulated experiment is done. The result s show that the new searching al2 gorithm has good performance in the search success rate and load balancing. : P2P ; ; ; Agent Key words :unstructured P2P ;information retrieval ;information recommendation ;mobile agent : TP391 :A 1 ( Peer to Peer, P2P) P2P, ( Peer),,,,,,, () [1 ],,CPU [2 ] [3 ] [4 ] [5 ], P2P,P2P, P2P,,P2P, P2P P2P P2P, Napster [5 ] P2P Chord [6 ] P2P Gnutella [7 ] P2P P2P ( ),IP, (Nap ster ), 3 : ; : : ( ) ;(A ) :(19632),,,,,CCF ( E S), : ; Tel : (0592) ; E2mail edu. cn Address :Department of Cognitive Science,Xiamen University,Xiamen,Fujian ,P. R. China 99

2 P2P ( ),(, IP ) ;,, (Distributed Hash Table, D H T) (hops),,: (1) ; (2), P2P, P2P,,,,,,,, ( Time to Live, TTL) (),, P2P, P2P :,( ),Gnu2 tella,,, T TL P2P, Peer ( ),,,, P2P,,,,,,,,,, Gnutant, ,,,, P2P (, :, 100,Dorigo M [810 ] (Ant Colony Algorithm, ACA ) ACA,,t k i j P k ij : P k ij = ij ( t) s allowed k 0,otherwise ij ( t) is ( t) is ( t), j allowed k, ij ( t) t i j ; ij ( t) i j ; allowedk k ; i j ;,, 1 -, ij i j,n, (2) : ij ( t + n) (1) = ij ( t) + ij,(0,1) (2), ;,,,Stutzled T [11 ] MMAS ( Max2Min Ant System, MMAS), ; [12 ],, 2. 2 Anthill Anthill Montresor A [13,14 ] P2P,Anthill : Peer,P2P ; Agent,,, Anthill,P2P Anthill P2P, P2P,Montresor A Anthill Gnutella Freenet Gnutant [14 ] 3 P2P,P2P, P2P Gnutant), P2P

3 3. 1 Peer P2P,,Peer,, Peer : (1) : Peer, :, ;,, Peer, ;,, Peer,,, ; (Least2Recently2Used, L RU),,, (2) Agent :Agent 3. 2 P2P Peer, Agent, Peer :Agent,, Agent Peer,Peer Agent Agent Agent,,, :, ( Vector Agent :Agent Space Model, VSM), Agent ( Agent Agent d ) ( w1, d, w2, d,, w t, d), w i, di key i d Agent : Agent Agent, :Peer, Agent, ( ), Agent, ( First2In First2Out, FIFO) Agent (3) :Peer Agent Peer : :, ; :, Agent, Top2N ; :Agent, Agent (4) :P2P Peer :,, Peer, (5) :Peer :, Agent Agent : ; ; :,( Inverted Index) ( ) q ( w1, q, w2, q,, w t, q), w i, q key i q d q : sim ( t i = 1 d, q) = w i, d w i, q (3) t i = 1 w2 i, d t i = 1 w2 i, q, sim ( d, q), q d,, Peer, ij ( t) t i j q, ij ( t) i j q, : ij ( t) = Result ij ( q) + A d ij ( q) (4) ij ( t) = C/ dij (5), Resultij ( q) i j q, dij i j, A dij ( q) i j q Agent,: Step 1 Peer, (3) q,q Step 2 (4) (5),N 101

4 Step 3 (1) P q ij,, Step 4,,,Agent,, ;, Step (1) Step (4), T TL, :, 3. 3 P2P,,,,,, Gnutant,P2P, P2P :, Step 1,, Gnutant, Step (1), (1) : Peer ( ) (2) (6), M Step 3 Agent, (2) : (Recall), : sim ( t i = 1 d, p) = w i mi (6) P2P, t i = 1 w2 i t i = 1 m2 i, P2P,, w i key i d, mi p key i P2P,, [ 15 ] ;, P2P : ((4) ),, (),, :, 3. 4 Agent,P2P,Agent Peer,,, Agent,A2 gent, Agent ( T TL ) Peer / 102 Agent : Agent Agent Agent Agent : (1) Agent_ID :Agent (2) Peer_ID : Agent (3) Agent_ Type : Agent, (4) Query :, Agent (5) Visited_List : (6) T TL :, Agent, Agent Agent T TL 1 (7) Hop s : Agent (8) Query Hits : Agent, Query, ; Agent, ; A2 gent, 4 : Retrieved Recall = A nswer (7) A nswer CurrentA vailable, Recall, A nswer Ret rieved, A nswer CurrentA vailable,,,, 1 (3) :,,P2P,

5 ,, (4) :, CPU, P2P 2,, 2. 3,,,, : = (8) 4. 2 Anthill, Gnutant Montresor A Gnutant, Gnutella, P2P ,, Gnutant, Gnutant, : Peer 1 000,6, 5, T TL 10, 10, Gnutant, Gnutant,,,Gnutant, Gnu2 tant 58 %, 5,63 % 3, ( ),, 4 4 1,, 5, Gnutant 174, 168,,Gnutant 4 % 5 2,, Gnutant, 1,Gnutant (), 2,, 22 %, T TL ( Agent 10, 1 %), 3, Gnutant 5 P2P P2P,P2P,,, (139 ) 103

6 ,,, 5,,,,,, Canny,, : [1 ]. Canny [J ]., 2006,25 (1) : [ 2 ],,,. [J ]. (),2002,5 (42) : [ 3 ],,. [J ].,2005,39 (6) : [ 4 ],. [J ].,2003,8 (2) : [ 5 ] Sunde C, Avdic S, Pazsit I. Classification of Two2Phase Flow Regimes via Image Analysis and A Neuro2Wavelet Approach[J ]. Progress in Nuclear Energy, 2005,46(324) : [ 6 ] Bartolacci G, Pelletier P, Tessier J, et al. Application of Numerical Image Analysis to Process Diagnosis and Physical Parameter Measurement in Mineral Processes Part : Floatation Control Based on Froth Textural Characteristics [J ]. Minerals Engineering, 2006,19 (628) : (103 ) P2P,,P2P P2P,,, : [ 1 ] Gribble S, Halevy A, Ives Z, et al. What Can Databases Do for Peer to Peer[ C] Proc of Web DB, 2001 : [ 2 ] http :/ / setiat home. berkeley. edu/. [ 3 ] http :/ / www. icq. com/. [ 4 ] http :/ / office. microsoft. com/ zh2cn/ groove/ FX aspx. [ 5 ] http :/ / free. napster. com/. [ 6 ] Dabek F,et al. Building Peer2to2Peer Systems wit h Chord, a Distributed Lookup Service [ C] Proc of t he 8t h Workshop on Hot Topics in Operating Systems, 2001 : [ 7 ] http :/ / www. gnutelliums. com/. [ 8 ] Colorni A, Drigo M, Maniezzo V. Distributed Optimization by Ant Colonies[ C] Proc of t he 1st European Conf Artifi2 cial Life, 1991 : [9 ] Colorni A, Drigo M, Maniezzo V. An Investigation of some Properties of an Ant Algorit hm [ C ] Proc of PPSN 92, 1992 : [ 10 ] Dorigo M, Gambardella L M. Ant Colony System : A Coop2 erative Learning Approach to the Traveling Salesman Prob2 lem [J ]. IEEE Trans on Evolutionary Computation, 1997,1 (1) : [ 11 ] Stutzle T, Hoos H H. MAX2MIN Ant System and Local Search for the Traveling Salesman Problem[ C] Proc of IEEE Int l Conf on Evolutionary Computation,1997 : [ 12 ],,. [J ].,2004,32 (5) : [ 13 ] Alberto M. Ant hill : A Framework for t he Design and Anal2 ysis of Peer2to2Peer Systems [ C] Proc of t he 4t h European Research Seminar on Advances in Distributed Systems, 2001 :126. [ 14 ] Ozalp B, Hein M, Alberto M. Ant hill : A Framework for the Development of Agent2Based Peer2to2Peer System [ C ] Proc of ICDCS 02, 2002 :1216. [ 15 ]. :[ ] [ D ]. :,2004. (109 ) SN T,SN T with IIM 0. 9 = 1,, 6 P2P,,,,,P2P, P2P : [ 1 ] Yang B, Garcia2Molina H. Designing a Super2Peer Network [ C] Proc of t he 19t h Int l Conf on Data Engineering,2003 : [ 2 ] Jan S, Jim D, Raymond C,et al. Using Aggregation for A2 daptive Super2Peer Discovery on the Gradient Topology [ C ] Proc of Self Man 06,2006 : [ 3 ] Yang B, Garcia2Molina H. Designing a Super2Peer Network [ C] Proc of Int l Conf on Data Engineering,2003 : [ 4 ] http :/ / it. hexun. com/ / ht ml, [5 ] Zegura E W, Calvert K L,Bhattacharjee. How to Model an Internetwork[ C] Proc of t he IEEE INFOCOM 96, 1996 : [ 6 ],. P2P [J ]., 2007,18 (2) :