[1]LI Shao-zi,CAO Yang,ZHOU Chang-le.Research on key techniques about unstructured P2P information retrieval[J].CAAI Transactions on Intelligent Systems,2006,1(2):74-78.
Copy

Research on key techniques about unstructured P2P information retrieval

CAAI Transactions on Intelligent Systems[ISSN 1673-4785/CN 23-1538/TP] Volume: 1 Number of periods: 2006 2 Page number: 74-78 Column: 学术论文—知识工程 Public date: 2006-10-25
Title:
Research on key techniques about unstructured P2P information retrieval
Author(s):
LI Shao-zi;  CAO Yang;  ZHOU Chang-le
Department of Computer Science, Xiamen University, Xiamen 3610 05, China
Keywords:
P2P;  information retrieval;  information recommendatio n
CLC:
TP31
DOI:
-
Abstract:
How to find and locate information in a decentralized and dynamic network is a big problem for all P2P（peertopeer） filesharing systems. Unfortunately, exi sting P2P searching mechanisms are usually dissatisfied. For example, structured P2P systems are efficient but lack of actual implementing on the Internet becau se of their complicated structures. Unstructured P2P systems are inefficient but more popular. In this paper, a new approach to P2P information retrieval based on unstructured P2P systems is presented by using ant colony algorithm and infor mat ion recommendation services to improve the search efficiency. Ant colony algorit hm is used to make routing decisions, which makes the searches tend to the most favorable direction. Besides, information recommendation services can reduce bli nd searches and raise the filesharing level. In order to evaluate and validate this model, a simulated P2P application consisted of a network of peer nodes is built. The results show that the searching mechanism has good performances on the search success rate and load balancing.
References:
［1］CLARKE I, SANDBERG O, WILEY B, et al. Freenet: a distributed anonymous information storage and retrieval system ［A］. ICSI Workshop on Design Issues in Anonymity and Unobservability［C］.［S.l.］，2000.
［2］RATNASAMY S, FRANCIS P, HANDLEY M, et al. A scalable contentaddressabl e network［A］. In ACM SIGCOMM’01［C］.［S.l.］，2001.
［3］DABEK F， et al. Building PeertoPeer systems with chord, a distributed lookup service ［A］. In: Proc of the 8th Workshop on Hot Topics in Operating Systems (HotOS)［C］. Schloss Elmau, Germany, 2001.
［4］COLORNI A, DRIGO M, MANIEZZO V. Distributed optimization by ant colonies ［A］. In: Proc 1st European Conf Artificial Life［C］. Pans, France: Elsevier, 1991.
［5］COLORNI A, DORIGO M, MANIEZZO V. An investigation of some properties of an ant algorithm［A］. In: Proc PPSN ’92［C］. London, 1992.
［6］DORIGO M, GAMBARDELLA LM . Ant colony system: a cooperative learning appr oach to the traveling salesman problem ［J］. IEEE Transactions on Evolutionary Computation, 1997, 1(1):53-66.
【7］STUTZLE T, HOOS H H. MAXMIN ant system and local search for the tra veling salesman problem［A］. In: IEEE Int’l Conf on Evolutionary Computation ［C］. Indianapolis: IEEE Press, 1997.
［8］黄国锐，曹先彬，王煦法.基于信息素扩散的蚁群算法［J］.电子学报，200 4，32(5)，865-868.
HUANG G R, CAO X B, WANG X F. An ANT colony optimization algorithm base d on pheromone diffusion ［J］. acta Electronica Sinica, 2004, 32(5):8 65-868.
［9］MONTRESOR A. Anthill: a framework for the design and analysis of PeertoPeer systems ［A］. In: Proc 4th European Research Seminar on Adv ances in Distributed Systems［C］. Bertinoro, Italy, 2001.
［10］BABAOGLU O, MELING H, MONTRESOR A. Anthill: a framewor k for the development of agentbased peertopeer system ［A］. In: Proc 2 2nd ICDCS’02［C］. Vienna, Austria,2002.
Similar References:

Memo

-

Last Update: 2009-05-05

Copyright © CAAI Transactions on Intelligent Systems