[1]李绍滋,曹 阳,周昌乐.基于非结构化的P2P信息检索关键技术研究[J].智能系统学报,2006,1(2):74-78.
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.
点击复制
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.
基于非结构化的P2P信息检索关键技术研究
《智能系统学报》[ISSN 1673-4785/CN 23-1538/TP] 卷:
1
期数:
2006年第2期
页码:
74-78
栏目:
学术论文—知识工程
出版日期:
2006-10-25
- Title:
- Research on key techniques about unstructured P2P information retrieval
- 文章编号:
- 1673-4785(2006)02-0074-05
- Keywords:
- P2P; information retrieval; information recommendatio n
- 分类号:
- TP31
- 文献标志码:
- A
- 摘要:
- 如何在缺少集中控制、大规模、分布式的P2P（peertopeer）网络中找到并定位信息是所有的P2P共享系统面临的一个难题.现有的P2P信息检索机制存在着种种不足：基于结构化P2P网络的检索效率很高，然而由于构造过于严格，难以在Internet上普及，而且仅能支持粗粒度的文件共享；非结构化P2P网络实现简单，是P2P共享系统的主要实现方式，但是由于搜索的盲目性，其检索效率又普遍低下.建立了一个新的非结构化P2P共享原型系统.该系统利用改进的蚁群算法进行检索路由，使检索总是倾向于有利的方向.同时，有针对性的推荐服务能够减少盲目搜索，提高文件共享水平.仿真实验的结果表明，该系统所采用的信息检索与信息推荐相结合的策略能够有效地提高P2P信息检索的成功率，降低网络负载.
- Abstract:
- How to find and locate information in a decentralized and dynamic network is a big problem for all P2P（peertopeer） filesharing 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 filesharing 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 contentaddressabl e network［A］. In ACM SIGCOMM’01［C］.［S.l.］，2001.
［3］DABEK F， et al. Building PeertoPeer 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. MAXMIN 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 PeertoPeer 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 agentbased peertopeer system ［A］. In: Proc 2 2nd ICDCS’02［C］. Vienna, Austria,2002.
- 相似文献/References:
-
[1]王超,刘奕群,马少平.搜索引擎点击模型综述[J].智能系统学报,2016,11(6):711.[doi:10.11992/tis.201605023]
WANG Chao,LIU Yiqun,MA Shaoping.A survey of click models for Web browsing[J].CAAI Transactions on Intelligent Systems,2016,11():711.[doi:10.11992/tis.201605023]
[2]李锵,吴正彪,关欣.结合深度乐谱特征融合的钢琴指法生成方法[J].智能系统学报,2023,18(6):1287.[doi:10.11992/tis.202303018]
LI Qiang,WU Zhengbiao,GUAN Xin.Piano fingering generation with deep musical score feature fusion[J].CAAI Transactions on Intelligent Systems,2023,18():1287.[doi:10.11992/tis.202303018]
备注/Memo
收稿日期：2006-09-13.
基金项目：
国家自然科学基金资助项目(60373080)；福建省自然科学基金资助项目(A 0310009)；
厦门大学985二期信息技术创新平台资助项目(2004-2007)；厦门大学院士启动基金资助项目.
?作者简介：李绍滋，男，1963年生，教授，博士生导师，原机械工业部跨世纪学术骨干、河南省首批优秀中青年骨干教师和厦门大学中青年骨干教师，主要研究方向为人工智能与智能信息检索、网络多媒体与CSCW.E-mail: szlig@xmu.edu.cn.曹 阳，女，1980年生，厦门大学计算机科学系硕士研究生，主要研究方向为人工智能、P2 P信息检索.周昌乐，男，1959年生，教授，博士生导师，厦门大学信息科学与技术学院院长.长期从事人工智能及其应用技术、文理交叉学科领域的研究工作，主要研究方向为计算语言学、理论脑科学、智能中医学等.
更新日期/Last Update:
2009-05-05