2,678 research outputs found
An Improved Scheme for Interest Mining Based on a Reconfiguration of the Peer-to-Peer Overlay
Tan et al. proposed a scheme to improve the quality of a file search in unstructured Peer-to-Peer systems by focusing on the similarity of interest of the participating peers. Although it certainly improves the cost/performance ratio of a simple flooding-based scheme used in conventional systems, the Tan's method has a serious drawback such that a query cannot reach a target peer if a requesting peer is not connected with the target
peer through a path consisting of peers to have similar interest to the given query. In order to overcome such drawback of the Tan's method, we propose a scheme to reconfigure the underlying network in such a way that a requesting peer has a neighbor interested in the given query, before transmitting a query to its neighbors. The performance of the proposed scheme is evaluated by simulation. The result of simulation indicates that it certainly overcomes the drawback of the Tan's method
Searching in Unstructured Overlays Using Local Knowledge and Gossip
This paper analyzes a class of dissemination algorithms for the discovery of
distributed contents in Peer-to-Peer unstructured overlay networks. The
algorithms are a mix of protocols employing local knowledge of peers'
neighborhood and gossip. By tuning the gossip probability and the depth k of
the k-neighborhood of which nodes have information, we obtain different
dissemination protocols employed in literature over unstructured P2P overlays.
The provided analysis and simulation results confirm that, when properly
configured, these schemes represent a viable approach to build effective P2P
resource discovery in large-scale, dynamic distributed systems.Comment: A revised version of the paper appears in Proc. of the 5th
International Workshop on Complex Networks (CompleNet 2014) - Studies in
Computational Intelligence Series, Springer-Verlag, Bologna (Italy), March
201
A schema-based P2P network to enable publish-subscribe for multimedia content in open hypermedia systems
Open Hypermedia Systems (OHS) aim to provide efficient dissemination, adaptation and integration of hyperlinked multimedia resources. Content available in Peer-to-Peer (P2P) networks could add significant value to OHS provided that challenges for efficient discovery and prompt delivery of rich and up-to-date content are successfully addressed. This paper proposes an architecture that enables the operation of OHS over a P2P overlay network of OHS servers based on semantic annotation of (a) peer OHS servers and of (b) multimedia resources that can be obtained through the link services of the OHS. The architecture provides efficient resource discovery. Semantic query-based subscriptions over this P2P network can enable access to up-to-date content, while caching at certain peers enables prompt delivery of multimedia content. Advanced query resolution techniques are employed to match different parts of subscription queries (subqueries). These subscriptions can be shared among different interested peers, thus increasing the efficiency of multimedia content dissemination
- âŠ