Survey of Search and Replication Schemes in Unstructured P2p Networks

Thampi, Sabu M.

doi:10.5296/npa.v2i1.263

Cited by 39 publications

(16 citation statements)

References 60 publications

(74 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Among all the prior work on replication, the problem of replica distribution is often addressed. If we take the heterogeneity factors in item size and request rate into account and allocate a proper number of replicas (i.e., the storage space) for each item, the system performance, such as success rate and expected search size, is expected to be improved when the system storage capability is fixed [2][3][4]. The related work shows that the replica distribution has different effects on the system performance from many aspects and consequently the optimal replica distributions are different when we set different objectives to optimize.…”

Section: Related Workmentioning

confidence: 99%

The optimization of replica distribution in the unstructured overlays

Feng

et al. 2012

Sci. China Inf. Sci.

View full text Add to dashboard Cite

Replication is a widely used technique in unstructured overlays to improve content availability or system performance. A fundamental question often addressed by previous work focused on: how many replicas ought to be allocated for each data item given the fixed query rates and limited storage capability? In this paper, we have put forth two optimal replica distributions to achieve the highest success rate and the lowest message consumption. Especially, we have investigated the influence of item size on replica distribution. Our results show that Square-Root Replication, which is traditionally considered to be optimal, is not always the best choice. Our study offers a new deep understanding of resource managment in self-organized unstructured overlays.

show abstract

Section: Related Workmentioning

confidence: 99%

The optimization of replica distribution in the unstructured overlays

Feng

et al. 2012

Sci. China Inf. Sci.

View full text Add to dashboard Cite

show abstract

“…Nowadays, most applications of peer-to-peer systems focus on unstructured peer-to-peer networks and designing an efficient search method is the most important issue [2]. Search methods in unstructured peer-to-peer networks can be divided to two groups: Blind and Informed [3][4]. In blind search strategies, nodes keep no information about placement of the objects.…”

Section: Introductionmentioning

confidence: 99%

A novel self-adaptive search algorithm for unstructured peer-to-peer networks utilizing learning automata

Ghorbani

Meybodi

Saghiri

2013

2013 3rd Joint Conference of AI &Amp; Robotics and 5th RoboCup Iran Open International Symposium

View full text Add to dashboard Cite

Designing an efficient search algorithm is an important issue in unstructured peer-to-peer networks when there is no central control or information on the locations of objects. There are various search strategies with different effects on network performance. In k-random walks as a search strategy, having an adaptive value of k instead of a random value can affect performance of the network. Therefore in this paper, a distributed novel self-adaptive search algorithm has been developed by application of learning automata to overcome this challenge. This method does not aim to determine the value of k for k-random walks algorithm and each peer can issue walkers in a self adaptive manner. Simulation results show that the proposed search algorithm improves some features such as average number of walkers per query, average number of produced messages, number of hits per query and also success rate efficiently in comparison with the k-random walks algorithm.

show abstract

“…Since searching in unstructured P2P networks is blind, replicas of files distributed over networks contribute to quick and reliable file searching. In [11], several previous replication methods are reviewed from two aspects, which are selection of files for replication and selection of sites for hosting new replicas, and a new replication method is also proposed. The replication method proposed in [11], Qreplication, selects files for replication based on calculation of popularity of the files in each peer.…”

Section: Related Workmentioning

confidence: 99%

“…In [11], several previous replication methods are reviewed from two aspects, which are selection of files for replication and selection of sites for hosting new replicas, and a new replication method is also proposed. The replication method proposed in [11], Qreplication, selects files for replication based on calculation of popularity of the files in each peer. Also, it selects peers for hosting new replicas from among peers reachable from a peer of focus by random-walk with limited hop counts, in which the ability and availability of the candidate peers for hosting new replicas are considered to be selected.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Query-Trail-Mediated Cooperative Behaviors of Peers in Unstructured P2P File Sharing Networks

Ohnishi

Yamamoto

Uchida

et al. 2011

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYWe propose two types of autonomic and distributed cooperative behaviors of peers for peer-to-peer (P2P) file-sharing networks. Cooperative behaviors of peers are mediated by query trails, and allows the exploration of better trade-off points between file search and storage load balancing performance. Query trails represent previous successful search paths and indicate which peers contributed to previous file searches and were at the same time exposed to the storage load. The first type of cooperative behavior is to determine the locations of replicas of files through the medium of query trails. Placement of replicas of files on strong query trails contributes to improvement of search performance, but a heavy load is generated due to writing files in storage to peers on the strong query trails. Therefore, we attempt to achieve storage load balancing between peers, while avoiding significant degradation of the search performance by creating replicas of files in peers adjacent to peers on strong query trails. The second type of cooperative behavior is to determine whether peers provide requested files through the medium of query trails. Provision of files by peers holding requested files on strong query trails contributes to better search performance, but such provision of files generates a heavy load for reading files from storage to peers on the strong query trails. Therefore, we attempt to achieve storage load balancing while making only small sacrifices in search performance by having peers on strong query trails refuse to provide files. Simulation results show that the first type of cooperative behavior provides equal or improved ability to explore trade-off points between storage load balancing and search performance in a static and nearly homogeneous P2P environment, without the need for fine tuning parameter values, compared to replication methods that require fine tuning of their parameters values. In addition, the combination of the second type and the first type of cooperative behavior yields better storage load balancing performance with little degradation of search performance. Moreover, even in a dynamic and heterogeneous P2P environment, the two types of cooperative behaviors yield good ability to explore trade-off points between storage load balancing and search performance. key words: P2P file sharing, storage load balancing, file replication, cooperative behaviors, query-trail

show abstract

Survey of Search and Replication Schemes in Unstructured P2p Networks

Cited by 39 publications

References 60 publications

The optimization of replica distribution in the unstructured overlays

The optimization of replica distribution in the unstructured overlays

A novel self-adaptive search algorithm for unstructured peer-to-peer networks utilizing learning automata

Query-Trail-Mediated Cooperative Behaviors of Peers in Unstructured P2P File Sharing Networks

Contact Info

Product

Resources

About