首页 | 本学科首页   官方微博 | 高级检索  
     检索      

ISS: Efficient Search Scheme Based on Immune Method in Modern Unstructured Peer-to-Peer Networks
作者姓名:GUAN  Zhitao  CAO  Yuanda  ZHU  Liehuang  ZHANG  Changyou  FAN  Xiumei
作者单位:School of Computer Science and Technology, Beijing Institute of Technology, Beijing 100081, China
基金项目:Supported by the National Natural Science Foundation of China (90604012)
摘    要:Flooding is the most famous technique for locating contents in unstructured P2P networks. Recently traditional flooding has been replaced by more efficient dynamic query (DQ) and different variants of such algorithms. Dynamic query is a new flooding technique which could estimate a proper time-to-live (TTL) value for a query flooding by estimating the popularity of the searched files, and retrieve sufficient results under controlled flooding range for reducing network traffic. However, all DQ-like search algorithms are "blind" so that a large amount of redundant messages are caused. In this paper, we proposed a new search scheme, called Immune Search Scheme (ISS), to cope with this problem. In ISS, an immune systems inspired concept of similarity-governed clone proliferation and mutation for query message movement is applied. Some assistant strategies, that is, shortcuts creation and peer traveling are incorporated into ISS to develop "immune memory" for improving search performance, which can make ISS not be blind but heuristic.

关 键 词:P2P  动态询问  免疫方法  网络
文章编号:1007-1202(2007)05-0866-05
收稿时间:12 January 2007
修稿时间:2007-01-12

ISS: Efficient search scheme based on immune method in modern unstructured peer-to-peer networks
GUAN Zhitao CAO Yuanda ZHU Liehuang ZHANG Changyou FAN Xiumei.ISS: Efficient search scheme based on immune method in modern unstructured peer-to-peer networks[J].Wuhan University Journal of Natural Sciences,2007,12(5):866-870.
Authors:Guan Zhitao  Cao Yuanda  Zhu Liehuang  Zhang Changyou  Fan Xiumei
Institution:(1) School of Computer Science and Technology, Beijing Institute of Technology, Beijing, 100081, China
Abstract:Flooding is the most famous technique for locating contents in unstructured P2P networks. Recently traditional flooding has been replaced by more efficient dynamic query (DQ) and different variants of such algorithms. Dynamic query is a new flooding technique which could estimate a proper time-to-live (TTL) value for a query flooding by estimating the popularity of the searched files, and retrieve sufficient results under controlled flooding range for reducing network traffic. However, all DQ-like search algorithms are “blind” so that a large amount of redundant messages are caused. In this paper, we proposed a new search scheme, called Immune Search Scheme (ISS), to cope with this problem. In ISS, an immune systems inspired concept of similarity-governed clone proliferation and mutation for query message movement is applied. Some assistant strategies, that is, shortcuts creation and peer traveling are incorporated into ISS to develop “immune memory” for improving search performance, which can make ISS not be blind but heuristic. Biography: GUAN Zhitao(1979–), male, Ph.D. candidate, research direction: P2P computing.
Keywords:peer-to-peer  dynamic query  immune method  clone proliferation and mutation
本文献已被 维普 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号