基于文件分类的非结构化P2P网络搜索算法  

Unstructured P2P Search Algorithm Based on File Classification

作　　者：邵国金[1] 高俊[2] 曾家国[3] 

机构地区：[1]河南城建学院计算机科学与工程系,河南平顶山467036 [2]河南省科学技术信息研究院,郑州450003 [3]重庆大学计算机学院,重庆400035

出　　处：《河南师范大学学报（自然科学版）》2011年第5期165-168,175,共5页Journal of Henan Normal University(Natural Science Edition)

基　　金：河南省重点科技攻关项目(102102210020;102102210395)

摘　　要：为了解决现有的非结构化对等网络的搜索机制不灵活,效率低下的问题,提出了一种新算法.在该算法中,将网络结点按照拓扑分类,同时把要搜索的资源根据其流行程度和位置划分为不同类型,在搜索过程中对不同类型结点在查找不同类型文件时应用不同的搜索策略,提高了搜索效率.实验结果表明,该算法具有较高的灵活性和自治性,且比传统搜索算法有较高的效率.To solve the problem of inflexibility and inefficient in search mechanism of unstructured P2P,a new search algorithm has been proposed.In the algorithm,the network nodes are classified into different types according to their position and the network topology,the resources are also divided into different types,and different search strategies will be taken for the searching of different documents in different style nodes.This mechanism has increased the overall search efficiency.Experiment results show that the algorithm is more flexible,autonomatic and efficienct than traditional ones.

关 键 词：非结构化对等网络 效率 拓扑 分类 灵活性 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]