Unstructured P2P Systems Research Articles

PeerRank: A Strategy for Resource Discovery in Unstructured P2P Systems

One of the essential problems in P2P is the strategy for resource discovery. Related methods in unstructured P2P either depend on the flooding and its variations or utilize various indices, which results in too much overhead to forward messages or too expensive cost to maintain the indices. An adaptive, bandwidth-efficient and easily maintained search algorithm for unstructured P2P systems, PeerRank, is presented. The scheme utilizes the feedback from previous searches to probabilistically guide future ones. In addition, an effective caching and indexing mechanism is introduced, which remarkably enforces the search performance. The final simulation experiment shows that the strategy can remarkably improve the search efficiency with the small average path length, high success rates, very low bandwidth consumption, and the eminent adaptability to the change of hot resources.

Dynamic layer management in superpeer architectures

Superpeer unstructured P2P systems have been found to be very effective by dividing the peers into two layers, superlayer and leaf-layer, in which message flooding is only conducted among superlayer and all leaf-peers are represented by corresponding superpeers. However, current superpeer systems do not employ any effective layer management schemes, so the transient and low-capacity peers are allowed to act as superpeers. Moreover, the lack of an appropriate size ratio maintenance mechanism on superlayer to leaf-layer makes the system's search performance far from being optimal. We present one workload model aimed at reducing the weighted overhead of a network. Using our proposed workload model, a network can determine an optimal layer size ratio between leaf-layer and superlayer. We then propose a dynamic layer management algorithm, DLM, which can maintain an optimal layer size ratio and adaptively elect and adjust peers between superlayer and leaf-layer. DLM is completely distributed in the sense that each peer decides to be a superpeer or a leaf-peer independently without global knowledge. DLM could effectively help a superpeer P2P system maintain the optimal layer size ratio and designate peers with relatively long lifetime and large capacities as superpeers, and the peers with short lifetime and low capacities as leaf-peers under highly dynamic network situations. We demonstrate that the quality of a superpeer system is significantly improved under the DLM scheme by comprehensive simulations.

Modeling Load Balancing in Heterogeneous Unstructured P2P Systems

Load balancing is a generally concerned problem in peer-to-peer (P2P) systems. Many researches on load balancing in the structured P2P systems have been launched currently, such as Chord or other DHTs. Although the researches on load balancing in unstructured P2P systems are emerged nowadays, the simple mechanisms achieved can only perform effectively in uniform environment. In this study, the influence on load balancing of the heterogeneity existed universally in unstructured P2P systems are analyzed, the unstructured P2P systems and their load balancing and the heterogeneity are modeled. Based on the formal model, the load balancing is analyzed quantitatively under static and dynamic environment and the typical load balancing algorithms are also analyzed. Some important conclusions are drawn which can be used in new models of load balancing in unstructured P2P systems.

AN EFFICIENT CLUSTERED ARCHITECTURE FOR P2P NETWORKS

Peer-to-peer (P2P) computing offers many attractive features, such as self-organization, load-balancing, availability, fault tolerance, and anonymity. However, it also faces some serious challenges. In this paper, we propose an Efficient Clustered Super-Peer P2P architecture (ECSP) to overcome the scalability and efficiency problems of existing unstructured P2P system. With ECSP, peers are grouped into clusters according to their topological proximity, and super-peers are selected from regular peers to act as cluster leaders and service providers. These super-peers are also connected to each other, forming a backbone overlay network operating as a distinct, yet integrated, application. To maintain the dynamically adaptive overlay network and to manage the routing on it, we propose an application level broadcasting protocol: Efa. Applying only a small amount of information about the topology of a network, Efa is as simple as flooding, a conventional method used in unstructured P2P systems. By eliminating many duplicated messages, Efa is much more efficient and scalable than flooding, and furthermore, it is completely decentralized and self-organized. Our experimental results prove that ESCP architecture, combined with the super-peer backbone protocol, can generate impressive levels of performance and scalability.

P-Grid

article Share on P-Grid: a self-organizing structured P2P system Authors: Karl Aberer Distributed Information Systems Laboratory, École Polytechnique Fédérale de Lausanne (EPFL) Distributed Information Systems Laboratory, École Polytechnique Fédérale de Lausanne (EPFL)View Profile , Philippe Cudré-Mauroux Distributed Information Systems Laboratory, École Polytechnique Fédérale de Lausanne (EPFL) Distributed Information Systems Laboratory, École Polytechnique Fédérale de Lausanne (EPFL)View Profile , Anwitaman Datta Distributed Information Systems Laboratory, École Polytechnique Fédérale de Lausanne (EPFL) Distributed Information Systems Laboratory, École Polytechnique Fédérale de Lausanne (EPFL)View Profile , Zoran Despotovic Distributed Information Systems Laboratory, École Polytechnique Fédérale de Lausanne (EPFL) Distributed Information Systems Laboratory, École Polytechnique Fédérale de Lausanne (EPFL)View Profile , Manfred Hauswirth Distributed Information Systems Laboratory, École Polytechnique Fédérale de Lausanne (EPFL) Distributed Information Systems Laboratory, École Polytechnique Fédérale de Lausanne (EPFL)View Profile , Magdalena Punceva Distributed Information Systems Laboratory, École Polytechnique Fédérale de Lausanne (EPFL) Distributed Information Systems Laboratory, École Polytechnique Fédérale de Lausanne (EPFL)View Profile , Roman Schmidt Distributed Information Systems Laboratory, École Polytechnique Fédérale de Lausanne (EPFL) Distributed Information Systems Laboratory, École Polytechnique Fédérale de Lausanne (EPFL)View Profile Authors Info & Claims ACM SIGMOD RecordVolume 32Issue 3September 2003 pp 29–33https://doi.org/10.1145/945721.945729Published:01 September 2003Publication History 259citation2,729DownloadsMetricsTotal Citations259Total Downloads2,729Last 12 Months37Last 6 weeks3 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access