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.

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.

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.

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.

Load Balancing in Peer-to-Peer Systems

2010 ◽  
pp. 163-190
Author(s):  
Haiying Shen
Keyword(s):  
Load Balancing ◽  
High Performance ◽  
Large Scale ◽  
Overlay Networks ◽  
Rapid Development ◽  
Peer To Peer ◽  
P2p Systems ◽  
Emerging Trends ◽  
Peer To Peer Systems ◽  
P2p Overlay

Structured peer-to-peer (P2P) overlay networks like Distributed Hash Tables (DHTs) map data items to the network based on a consistent hashing function. Such mapping for data distribution has an inherent load balance problem. Thus, a load balancing mechanism is an indispensable part of a structured P2P overlay network for high performance. The rapid development of P2P systems has posed challenges in load balancing due to their features characterized by large scale, heterogeneity, dynamism, and proximity. An efficient load balancing method should flexible and resilient enough to deal with these characteristics. This chapter will first introduce the P2P systems and the load balancing in P2P systems. It then introduces the current technologies for load balancing in P2P systems, and provides a case study of a dynamism-resilient and proximity-aware load balancing mechanism. Finally, it indicates the future and emerging trends of load balancing, and concludes the chapter.

scholarly journals Resource-Aware Cooperative Caching on Mobile Ad-hoc Peer to Peer Networks

2021 ◽  
Author(s):  
Hoda R.K. Nejad
Keyword(s):  
Ad Hoc Networks ◽  
Overlay Networks ◽  
Ad Hoc ◽  
Data Access ◽  
Peer To Peer ◽  
Data Availability ◽  
Cooperative Caching ◽  
P2p Systems ◽  
Hoc Networks ◽  
Resource Aware

With the emergence of wireless devices, service delivery for ad-hoc networks has started to attract a lot of attention recently. Ad-hoc networks provide an attractive solution for networking in the situations where network infrastructure or service subscription is not available. We believe that overlay networks, particularly peer-to-peer (P2P) systems, is a good abstraction for application design and deployment over ad-hoc networks. The principal benefit of this approach is that application states are only maintained by the nodes involved in the application execution and all other nodes only perform networking related functions. On the other hand, data access applications in Ad-hoc networks suffer from restricted resources. In this thesis, we explore how to use Cooperative Caching to improve data access efficiency in Ad-hoc network. We propose a Resource-Aware Cooperative Caching P2P system (RACC) for data access applications in Ad-hoc networks. The objective is to improve data availability by considering energy of each node, demand and supply of network. We evaluated and compared the performance of RACC with Simple Cache, CachePath and CacheData schemes. Our simulation results show that RACC improves the lay of query as well as energy usage of the network as compared to Simple Cache, CachePath and CacheData.

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).

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.

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.

scholarly journals Resource-Aware Topology Adaptation in P2P Overlay Adhoc Network

2021 ◽  
Author(s):  
Gabriel Lau
Keyword(s):  
Overlay Networks ◽  
Ad Hoc ◽  
Wireless Devices ◽  
P2p Systems ◽  
Adhoc Network ◽  
Hoc Networks ◽  
P2p System ◽  
Resource Aware ◽  
Topology Adaptation ◽  
Application Execution

With the emergence of wireless devices, service delivery for mobile as hoc networks (MANET) has started to attract a lot of attention recently. We believe that overlay networks, particularly peer-to-peer (P2P) systems, is a good abstraction for application design and deployment over ad hoc networks. The principal benefit of this approach is that application states are only maintained by the nodes involved in the application execution and all other nodes only perform networking related functions. We propose a P2P system for MANET, RAON, which performs query forwarding and overlay topology adaptation based on link instability and power constraints. We evaluated and compared the performance of RAON with an existing P2P system, Gia. Our simulation results show that RAON improves the success rate and delay of query search as compared to Gia. It, however, achieves this at the expense of higher energy consumption.

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.

Sign in / Sign up

Export Citation Format

Share Document