This paper presents a "cluster" based search scheme in peer-to-peer network. The idea is based on the fact that data distribution in an information society has structured feature. We designed an algorithm to...This paper presents a "cluster" based search scheme in peer-to-peer network. The idea is based on the fact that data distribution in an information society has structured feature. 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 way search efficiency will be remarkably improved and at the same time good resilience against peer failure (the ability to withstand peer failure) is reserved.展开更多
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 desig...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 a "cluster" based search scheme in peer-to-peer network. The idea is based on the fact that data distribution in an information society has structured feature. 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 way search efficiency will be remarkably improved and at the same time good resilience against peer failure (the ability to withstand peer failure) is reserved.
文摘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.
