SFES: A scalable, fault-tolerant, efficient search scheme in a peer-to-peer network  

作　　者：李振武 杨舰 史旭东 白英彩 

机构地区：[1]Dept. of Computer Science and Engineering, Shanghai Jiaotong University, Shanghai 200030,China [2]Dept. of Computer Science and Engineering, Fudan University, Shanghai 200433,China

出　　处：《Journal of Harbin Institute of Technology(New Series)》2004年第4期452-460,共9页哈尔滨工业大学学报（英文版）

摘　　要：This paper presents SFES: a scalable, fault-tolerant, efficient search scheme in a peer-to-peer network. The idea is based on the fact that data distribution in an information society has structured features. We designed an algorithm to cluster peers that have similar interests. When receiving a query request, a peer will preferentially forward it to another peer which belongs to the same cluster and shares more similar interests. By this method, search efficiency will be remarkably improved and at the same time good resistance against peer failure (the ability to withstand peer failure) is reserved. Keyword partial-match is supported, too.This paper presents SFES: a scalable, fault-tolerant, efficient search scheme in a peer-to-peer network. The idea is based on the fact that data distribution in an information society has structured features. We designed an algorithm to cluster peers that have similar interests. When receiving a query request, a peer will preferentially forward it to another peer which belongs to the same cluster and shares more similar interests. By this method, search efficiency will be remarkably improved and at the same time good resistance against peer failure (the ability to withstand peer failure) is reserved. Keyword partial-match is supported, too.

关 键 词：peer-to-peer network CLUSTER OVERLAY STRUCTURED request path length 

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