Abstract: A service search network system includes a plurality of file search nodes. Each file search node has a file repository that stores files searchable by a file search request. A first and a second service search node is provided, each having a service repository for storing services that can be searched. When the first service search node receives a service search request for a particular service stored in the second service search node, the first service search node formats the service search request into a format recognized by the file search nodes such that the service request can be propagated to the second service search node via some of the file search nodes. The structure of each service search node is also described. A method of searching a specific service in a search network having file search nodes and service search nodes is also described.

Abstract: Peers (p) monitor responses received from other peers (s, q) to requests for information and rate the responding peers on their ability to provide information of interest. When a responding peer (s) is discovered to frequently provide good results, the requesting peer (p) attempts to move closer to the responding peer (s) by creating a direct connection (p-s) with that peer and thereby promote the “good” peer to an “immediate” peer. If such a promotion would result in too many direct connections, the least important immediate peer is demoted to an “indirect” peer. The criteria (Imp) used for evaluating the relative importance of at least the immediate peers is preferably a time weighted average (Imp*(t)=?·Imp(t)+?·Imp*(t?1)) that also measures consistency and reliability and preferably includes factors not only representative of the peer's ability to provide requested information (Hits), but also of its proximity to the source of that information (1/Hops) so that it can prove that information efficiently.

Abstract: A method and apparatus is disclosed for representing data available in a peer-to-peer network of processing nodes. In one arrangement, respective Bloom-Filters may be formed at the nodes as a function of data available via the nodes. The Bloom-filters may be communicated between peer-to-peer coupled nodes of the peer-to-peer network that have formed connections using incentive-based criteria to control whether one node connects to another node. A search expression may be formed for locating a data object, and nodes selected as a function of the Bloom-filters and the incentive-based criteria. The search expression may be propagated to the selected nodes, and the result of the search expression output from nodes that satisfy the search expression.

Abstract: A service search network system includes a plurality of file search nodes. Each file search node has a file repository that stores files searchable by a file search request. A first and a second service search node is provided, each having a service repository for storing services that can be searched. When the first service search node receives a service search request for a particular service stored in the second service search node, the first service search node formats the service search request into a format recognized by the file search nodes such that the service request can be propagated to the second service search node via some of the file search nodes. The structure of each service search node is also described. A method of searching a specific service in a search network having file search nodes and service search nodes is also described.

Abstract: Peers (p) monitor responses received from other peers (s, q) to requests for information and rate the responding peers on their ability to provide information of interest. When a responding peer (s) is discovered to frequently provide good results, the requesting peer (p) attempts to move closer to the responding peer (s) by creating a direct connection (p-s) with that peer and thereby promote the “good” peer to an “immediate” peer. If such a promotion would result in too many direct connections, the least important immediate peer is demoted to an “indirect” peer.