Search and replication in unstructured peer-to-peer networks

Lv, Qing; Cao, Ping; Cohen, Edith; Li, Kai; Shenker, Scott

doi:10.1145/514203.514206

Cited by 305 publications

(462 citation statements)

References 0 publications

Supporting

Mentioning

452

Contrasting

Unclassified

Order By: Relevance

“…In those systems, peers are interconnected in an ad-hoc pattern, and queries are flooded in P2P overlays. To make Gnutella-like networks scalable, a random walk based search algorithm [12] is introduced. GIA [6] modifies the k-walker algorithms and includes flow control, dynamic topology adaptation, and one-hop replication to handle the problem of nodes' heterogeneity.…”

Section: Related Workmentioning

confidence: 99%

“…For any node, suppose current time is t, the popularity value for item i that the node has held is p i (t 0 ) with a timestamp t 0 , where t 0 < t, it adjusts p i (t 0 ) into p i (t) by using Eq. (12). If p i (t) exceeds the threshold T f , the query will be flooded.…”

Section: Search Selectionmentioning

confidence: 99%

“…P2Ps used to be classified as centralized, decentralized structured, and decentralized unstructured [12] models. Centralized model, such as Napster, has a constantlyupdated directory hosted at central locations.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Popularity adaptive search in hybrid P2P systems

Shi

Han

2009

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Search Selectionmentioning

confidence: 99%

See 1 more Smart Citation

Popularity adaptive search in hybrid P2P systems

Shi

Han

2009

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

show abstract

“…Next, an intra-cluster flood mechanism is used to further propagate the query within the cluster. Although, we implement only the intra-cluster flood mechanism, the TMO system can also use other search mechanisms, such as Random Walks [11] or Gossip [12], to propagate queries within a cluster.…”

Section: Select the Directly Probed Clustersmentioning

confidence: 99%

Topology-Aware Multi-cluster Architecture Based on Efficient Index Techniques

Zhao

Zhang

et al. 2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In this paper, we focus on how to construct an efficient unstructured P2P system. The main contributions of our proposal are two-fold. First, aiming at alleviating the topology mismatch problem between the P2P logical overlay network and the physical underlying network, we proposed a Topology-aware Multi-cluster Overlay (TMO) architecture where peers self-organize into clusters based on network locality. Second, in order to further improve the search efficiency of the TMO architecture, we present two novel index techniques, namely, cluster-index technique and topic-index technique. The two different techniques are highly effective in different application domains in which the TMO architecture is deployed. The simulation results indicate that our proposed schemes are efficient in both resource usage and data retrieval.

show abstract

“…Peers in p2p networks are connected among themselves by some logical links forming an overlay above the physical network [3]. It has been found that these overlay networks, consisting of a large amount of peers, are analogous to complex real world networks and can be modelled using various types of random graphs [4].…”

Section: Introductionmentioning

confidence: 99%

Stability analysis of peer-to-peer networks against churn

et al. 2008

View full text Add to dashboard Cite

Abstract. Users of the peer-to-peer system join and leave the network randomly, which makes the overlay network dynamic and unstable in nature. In this paper, we propose an analytical framework to assess the robustness of p2p networks in the face of user churn. We model the peer churn through degree-independent as well as degree-dependent node failure. Lately, superpeer networks are becoming the most widely used topology among the p2p networks. Therefore, we perform the stability analysis of superpeer networks as a case study. We validate the analytically derived results with the help of simulation.

show abstract

Search and replication in unstructured peer-to-peer networks

Cited by 305 publications

References 0 publications

Popularity adaptive search in hybrid P2P systems

Popularity adaptive search in hybrid P2P systems

Topology-Aware Multi-cluster Architecture Based on Efficient Index Techniques

Stability analysis of peer-to-peer networks against churn

Contact Info

Product

Resources

About