A Novel Data Consistence Model Based on Virtual Peers in Peer-to-Peer Systems

2020 ◽  
Vol 16 (3) ◽  
pp. 1-16
Author(s):  
Hong He
Keyword(s):  
Data Retrieval ◽  
Peer To Peer ◽  
Data Consistency ◽  
P2p Systems ◽  
Efficient Storage ◽  
Peer To Peer Systems ◽  
Consistency Problem ◽  
Unstructured P2p ◽  
Effectiveness And Efficiency ◽  
P2p System

In recent years, peer-to-peer (P2P) systems have become a promising paradigm to provide efficient storage service in distributed environments. Although its effectiveness has been proven in many areas, the data consistency problem in P2P systems are still an opening issue. This article proposes a novel data consistence model, virtual peers-based data consistency (VPDC), which introduces a set of virtual peers to provide guaranteed data consistency in decentralized and unstructured P2P systems. The VPDC model can be easily implemented in any P2P system without introducing any interference to data retrieval. Theoretical analysis on VPDC is presented to analyze its effectiveness and efficiency, and massive experiments are conducted to evaluate the performance of a VPDC model in a real-world P2P system. The results indicate that it can significantly improve the data consistence of P2P systems and outperform many similar approaches in various experimental settings.

Taxonomy of reputation assessment in peer-to-peer systems and analysis of their data retrieval

2014 ◽  
Vol 29 (4) ◽  
pp. 463-483 ◽  
Author(s):  
Farag Azzedin
Keyword(s):  
Ad Hoc ◽  
Data Retrieval ◽  
Peer To Peer ◽  
Assessment Process ◽  
Reputation Systems ◽  
P2p Systems ◽  
Peer To Peer Systems ◽  
Overall Performance ◽  
Two Phases ◽  
Systems Simulation

AbstractThe need for reputation assessment is particularly strong in peer-to-peer (P2P) systems because the peers’ personal site autonomy is amplified by the inherent technological decentralization of the environment. However, the decentralization notion makes the problem of designing a P2P-based reputation assessment substantially harder in P2P networks than in centralized settings. Existing reputation systems tackle the reputation assessment process in an ad hoc manner. There is no systematic and coherent way to derive measures and analyze the current reputation systems. In this paper, we propose a reputation assessment process and use it to classify the existing reputation systems. Simulation experiments are conducted and focused on the different methods in selecting the recommendation sources and collecting the recommendations. These two phases can contribute significantly to the overall performance owing to precision, recall, and communication cost.

A Multi-Dimensional Query Scheme in Structured Overlays

2010 ◽  
Vol 439-440 ◽  
pp. 870-874 ◽  
Author(s):  
Ming Zhang ◽  
Jin Qiu Yang
Keyword(s):  
Overlay Networks ◽  
Peer To Peer ◽  
Data Indexing ◽  
P2p Systems ◽  
Peer To Peer Systems ◽  
Simulation Results ◽  
Index Service ◽  
P2p System ◽  
Access To Data ◽  
Structured Overlays

Structured peer-to-peer (P2P) systems are creating a large proportion of network traffic in today’s Internet. Peer-to-peer systems enable access to data spread over an extremely large number of machines. A P2P system typically involves thousands or millions of live peers in the network. Multi-dimensional data indexing has received much attention in a centralized database. In this paper, we propose and evaluate a multi-dimensional searching scheme in structured P2P networks. We present the design and implementation of a peer-to-peer index service for high dimensional data that is capable of handling complex queries. We design a VibIndex scheme in structured P2P overlay networks. We analyze this scheme’s performance and present simulation results. Our simulation results demonstrated the benefits of the proposed system and show that the approach is able to search efficiently.

Anonymous Peer-to-Peer Systems

2011 ◽  
pp. 23-29 ◽  
Author(s):  
Wenbing Zhao
Keyword(s):  
Distributed System ◽  
Peer To Peer ◽  
P2p Systems ◽  
Network Bandwidth ◽  
Design Goal ◽  
Processing Power ◽  
Peer To Peer Systems ◽  
P2p System

A peer-to-peer (P2P) system refers to a distributed system in which the role played by each member is roughly equivalent, that is, a member both consumes and provides services to other members. Therefore, a member in such a system is often referred to as a peer. The primary design goal of P2P systems is to facilitate sharing of resources, including files, processing power, and network bandwidth.

Peer-to-Peer Usage Analysis

2009 ◽  
pp. 1136-1141
Author(s):  
Florent Masseglia ◽  
Pascal Poncelet ◽  
Maguelonne Teisseire
Keyword(s):  
Data Mining ◽  
Distributed Database ◽  
Peer To Peer ◽  
Communication Model ◽  
P2p Systems ◽  
P2p File Sharing ◽  
Limited Edition ◽  
Usage Analysis ◽  
High Dynamics ◽  
P2p System

With the huge number of information sources available on the Internet and the high dynamics of their data, peer-to-peer (P2P) systems propose a communication model in which each party has the same capabilities and can initiate a communication session. These networks allow a group of computer users with the same networking program to connect with each other and directly access resources from one another. P2P architectures also provide a good infrastructure for data and computer intensive operations such as data mining. In this article we consider a new data mining approach for improving resource searching in a dynamic and distributed database such as an unstructured P2P system, that is, in Masseglia, Poncelet, and Teisseire (2006) we call this problem P2P usage analysis. More precisely we aim at discovering frequent behaviors among users of such a system. We will focus on the sequential order between actions performed on each node (requests or downloads) and show how this order has to be taken into account for extracting useful knowledge. For instance, it may be discovered, in a P2P file sharing network that for 77% of nodes from which a request is sent for “Mandriva Linux,” the file “Mandriva Linux 2005 CD1 i585-Limited- Edition-Mini.iso” is chosen and downloaded; then a new request is performed with the possible name of the remaining iso images (i.e., “Mandriva Linux 2005 Limited Edition”), and in the large number of returned results the image corresponding to “Mandriva Linux 2005 CD2 i585-Limited-Edition-Mini.iso” is chosen and downloaded. Such knowledge is very useful for proposing the user with often downloaded or requested files according to a majority of behaviors. It could also be useful in order to avoid extra bandwidth consumption, which is the main cost of P2P queries (Ng, Chu, Rao, Sripanidkulchai, & Zhang, 2003).

Towards Semantic-Based P2P Reputation Systems

2011 ◽  
pp. 101-119
Author(s):  
Ernesto Damiani ◽  
Marco Viviani
Keyword(s):  
Overlay Networks ◽  
Research Effort ◽  
Peer To Peer ◽  
Reputation Systems ◽  
Shared Resources ◽  
Trust Value ◽  
P2p Systems ◽  
Data Objects ◽  
P2p System ◽  
Simple Features

Peer-to-peer (P2P) systems represent nowadays a large portion of Internet traffic, and are fundamental data sources. In a pure P2P system, since no peer has the power or responsibility to monitor and restrain others behaviours, there is no method to verify the trustworthiness of shared resources, and malicious peers can spread untrustworthy data objects to the system. Furthermore, data descriptions are often simple features directly connected to data or annotations based on heterogeneous schemas, a fact that makes difficult to obtain a single coherent trust value on a resource. This chapter describes techniques where the combination of Semantic Web and peer-to-peer technologies is used for expressing the knowledge shared by peers in a well-defined and formal way. Finally, dealing with Semantic-based P2P networks, the chapter suggests a research effort in this direction, where the association between cluster-based overlay networks and reputation systems based on numerical approaches seems to be promising.

Applications and Challenges of Mobile P2P Systems in Ad Hoc Network

2010 ◽  
Vol 171-172 ◽  
pp. 575-579 ◽  
Author(s):  
Hai Tao Wang ◽  
Li Hua Song
Keyword(s):  
Ad Hoc Network ◽  
Ad Hoc ◽  
Peer To Peer ◽  
Application System ◽  
P2p Systems ◽  
Mobile P2p ◽  
Basic Concepts ◽  
Technical Challenges ◽  
P2p System

Mobile peer to peer system in Ad hoc network is a brand novel application system. In this paper backgrounds and basic concepts of mobile peer to peer (p2p) systems are introduced firstly. Then possible applications of mobile p2p systems are expounded. Afterwards, technical challenges which mobile p2p system must face are analyzed in detail. In the end, the developments and implementation of mobile p2p system are explored and some conclusions are given.

HIERARCHICAL PEER-TO-PEER SYSTEMS

2003 ◽  
Vol 13 (04) ◽  
pp. 643-657 ◽  
Author(s):  
L. GARCÉS-ERICE ◽  
E. W. BIERSACK ◽  
K. W. ROSS ◽  
P. A. FELBER ◽  
G. URVOY-KELLER
Keyword(s):  
Hash Table ◽  
Overlay Network ◽  
Peer To Peer ◽  
Distributed Hash Table ◽  
Hierarchical Design ◽  
P2p Systems ◽  
Lookup Services ◽  
Peer To Peer Systems ◽  
Responsible Group ◽  
Overlay Management

Structured peer-to-peer (P2P) lookup services organize peers into a flat overlay network and offer distributed hash table (DHT) functionality. Data is associated with keys and each peer is responsible for a subset of the keys. In hierarchical DHTs, peers are organized into groups, and each group has its autonomous intra-group overlay network and lookup service. Groups are organized in a top-level overlay network. To find a peer that is responsible for a key, the top-level overlay first determines the group responsible for the key; the responsible group then uses its intra-group overlay to determine the specific peer that is responsible for the key. We provide a general framework for hierarchical DHTs with scalable overlay management. We specifically study a two-tier hierarchy that uses Chord for the top level. Our analysis shows that by using the most reliable peers in the top level, the hierarchical design significantly reduces the expected number of hops. We also present a method to construct hierarchical DHTs that map well to the Internet topology and achieve short intra-group communication delay. The results demonstrate the feasibility of locality-based peer groups, which allow P2P systems to take full advantage of the hierarchical design.

A Replication Algorithm Considering the Node Traffic for P2P Networks

2013 ◽  
Vol 339 ◽  
pp. 285-291
Author(s):  
Yong Qiong Zhu ◽  
Rui Min Hu
Keyword(s):  
Success Rate ◽  
Peer To Peer ◽  
P2p Network ◽  
Search Efficiency ◽  
P2p Networks ◽  
P2p Systems ◽  
Replication Method ◽  
Hit Rate ◽  
Unstructured P2p Network ◽  
Unstructured P2p

In this paper we focus on replication method in unstructured Peer-to-Peer (P2P) networks. Most current replication approaches are designed for the structured P2P systems. The EAD is specific for the unstructured P2P network, but the replica utilization is low and has the bump problem. In order to acquire more replica utilization and search efficiency, we propose a decentralized replication methodsFTR. The proposed algorithm can calculate the real query flow of node according to the order of the node selected. Experiment on the simulation proves that our method can enhance search success rate and replica hit rate.

scholarly journals Privacy as Invisibility: Pervasive Surveillance and the Privatization of Peer-to-Peer Systems

2011 ◽  
Vol 9 (2) ◽  
pp. 126-140 ◽  
Author(s):  
Francesca Musiani
Keyword(s):  
Management Practices ◽  
Technology Development ◽  
Personal Information ◽  
Peer To Peer ◽  
P2p Systems ◽  
P2p File Sharing ◽  
Peer To Peer Systems ◽  
Definition Of ◽  
Restrictive Measures ◽  
P2p Technology

This article addresses the ongoing, increasing privatization of peer-to-peer (P2P) file sharing systems – the emergence of systems that users may only join by personal, friend-to-friend invitation. It argues that, within P2P systems, privacy is increasingly coinciding with “mere” invisibility vis-à-vis the rest of the Internet ecosystem because of a trend that has shaped the recent history of P2P technology: The alternation between forms of pervasive surveillance of such systems, and reactions by developers and users to such restrictive measures. Yet, it also suggests that the richness of today’s landscape of P2P technology development and use, mainly in the field of Internet-based services, opens up new dimensions to the conceptualization of privacy, and may give room to a more articulate definition of the concept as related to P2P technology; one that includes not only the need of protection from external attacks, and the temporary outcomes of the competition between surveillance and counter-surveillance measures, but also issues such as user empowerment through better control over personal information, reconfiguration of data management practices, and removal of intermediaries in sharing and communication activities.

Peer-to-Peer (P2P) Network Security

2008 ◽  
pp. 95-103
Author(s):  
Lu Yan
Keyword(s):  
Network Security ◽  
Object Oriented ◽  
Peer To Peer ◽  
P2p Network ◽  
P2p Systems ◽  
Action Systems ◽  
P2p System ◽  
Systems Framework

A lot of networks today are behind firewalls. In peer-to-peer (P2P) networking, firewall-protected peers may have to communicate with peers outside the firewall. This chapter shows how to design P2P systems to work with different kinds of firewalls within the object-oriented action systems framework by combining formal and informal methods. We present our approach via a case study of extending a Gnutella-like P2P system (Yan & Sere, 2003) to provide connectivity through firewalls.

Sign in / Sign up

Export Citation Format

Share Document