Reliability Analysis of Structured P2P System

2013 ◽  
Vol 347-350 ◽  
pp. 2055-2060
Author(s):  
Tai Zhang ◽  
Sheng Wang ◽  
Dan Liao
Keyword(s):  
Loss Rate ◽  
Heterogeneous Systems ◽  
Traffic Load ◽  
P2p Systems ◽  
Space Partition ◽  
Minimal Loss ◽  
Partition Space ◽  
P2p System ◽  
Space Method ◽  
Failure Node

Reliability is most important for structured p2p systems and how to exactly evaluate the metric-loss rate which is tightly related to reliability is a hot topic and challenge. Many research works of the loss rate only consider the situation that the loss rate is caused by next hop node failure (NF). Indeed, the lost of queuing message (QF) on the failure node also contribute to the loss rate. This paper presents an analytical model of loss rate caused by NF and NQ. In order to achieve the optimal performance of system through minimizing the NQ, we propose two methods: process power enhancing (PPE) and Space Partition (SP). In the heterogeneous systems, we can obtain the minimal loss rate via improving each nodes process power; in the homogeneous structured p2p systems, the partition space method can evenly partition the ID space so as to ensure the traffic load is uniformly distributed over all nodes.

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

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.

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.

scholarly journals A Simulation-Based Analysis of the Loss Process of Broadcast Packets in WAVE Vehicular Networks

2018 ◽  
Vol 2018 ◽  
pp. 1-12 ◽  
Author(s):  
Salvador Gonzalez ◽  
Victor Ramos
Keyword(s):  
Analytical Model ◽  
Vehicular Networks ◽  
Loss Rate ◽  
Traffic Load ◽  
Analytical Models ◽  
Ieee 802.11P ◽  
Control Channel ◽  
Channel Switching ◽  
Loss Process ◽  
Hidden Terminal

The IEEE 802.11p standard operates with the WAVE (Wireless Access in Vehicular Environments) system in vehicular ad hoc networks (VANETs). The broadcast process is used to send messages for safety and non-safety applications. A previous work on broadcast packets over the control channel proposes an analytical model to study the loss process. Even if such work does not consider all of the phenomena affecting the operation of vehicular networks, we can obtain a very good approximation of the performance that VANETs may exhibit. Regardless of its importance, this subject has been barely studied. Moreover, there is in the literature only a couple of contributions on this subject, being both analytical models. Therefore, we present in this paper an analysis of the loss process of broadcast packets on the control channel of VANETs over different scenarios. First, we consider a typical two-way scenario and then we analyze a scenario with intersections, both for different vehicle densities. We conduct a campaign of extensive simulations with the NS-3 simulator to study the average loss rate of broadcast packets, and then we compare our results with an analytical model proposed by Campolo et al. We prove the relationship among the contention window, the packet size, and the number of vehicles with the loss rate, including losses caused by noise, collisions, hidden terminal, and channel switching. Thus, we analyze the loss process validating the results obtained by Campolo et al. We find that there are additional factors affecting the loss rate, which cannot be captured with the analytical model. One key finding in this work is that the loss rate due to channel switching differs between both approaches. Also, we find bounds on the use of the control channel, with the loss rate and the traffic load in the network as parameters.

scholarly journals Enhanced P2P Services Providing Multimedia Content

2007 ◽  
Vol 2007 ◽  
pp. 1-12 ◽  
Author(s):  
E. Ardizzone ◽  
L. Gatani ◽  
M. La Cascia ◽  
G. Lo Re ◽  
M. Ortolani
Keyword(s):  
Video Retrieval ◽  
Routing Algorithm ◽  
Traffic Load ◽  
Huge Amount ◽  
P2p Systems ◽  
Video Sharing ◽  
Query Process ◽  
Multimedia Resources ◽  
Compact Representations ◽  
Overlay Routing

The retrieval facilities of most Peer-to-Peer (P2P) systems are limited to queries based on unique identifiers or small sets of keywords. Unfortunately, this approach is very inadequate and inefficient when a huge amount of multimedia resources is shared. To address this major limitation, we propose an original image and video sharing system, in which a user is able to interactively search interesting resources by means of content-based image and video retrieval techniques. In order to limit the network traffic load, maximizing the usefulness of each peer contacted in the query process, we also propose the adoption of an adaptive overlay routing algorithm, exploiting compact representations of the multimedia resources shared by each peer. Experimental results confirm the validity of the proposed approach, that is capable of dynamically adapting the network topology to peer interests, on the basis of query interactions among users.

MapReduce based Big Data Framework for Content Searching of Surveillance System Videos

2015 ◽  
Vol 7 (3) ◽  
pp. 58-66 ◽  
Author(s):  
Zheng Xu ◽  
Zhiguo Yan ◽  
Huan Du
Keyword(s):  
Routing Protocols ◽  
Data Transmission ◽  
Loss Rate ◽  
Image Features ◽  
Reliable Data ◽  
Traffic Load ◽  
Interest Points ◽  
Query Image ◽  
Hadoop Mapreduce ◽  
Data Framework

CBIR systems go through sets of stages starting from acquiring the new images, representing these images by extracting the image features, describing the key features and eventually computing the similarity distances to get the most relevant results responding to the query image. In this paper, ICBIR an integrated CBIR Hadoop-MapReduce based framework which is split into both offline and online phases is introduced. Visual statements are built using the extracted interest points SIFTs. Later on, these visual statements are used to estimate the similarity distances which in turn are used to create the image dataset clusters. A huge vocabulary of SIFTs describing the interest points of the image is constructed. In this paper, the authors are interested in routing protocols based on clusters that aim to reduce congestion in order to have reliable data transmission and a reduced loss rate. This is achieved by balancing the traffic load, which results into a balanced energy consumption within the network.

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.

scholarly journals Analysis and Implementation of Gossip-Based P2P Streaming with Distributed Incentive Mechanisms for Peer Cooperation

2007 ◽  
Vol 2007 ◽  
pp. 1-12 ◽  
Author(s):  
Sachin Agarwal ◽  
Jatinder Pal Singh ◽  
Shruti Dube
Keyword(s):  
Asymptotic Properties ◽  
Live Streaming ◽  
Incentive Scheme ◽  
P2p Streaming ◽  
Incentive Mechanisms ◽  
P2p Systems ◽  
Streaming Applications ◽  
File Storage ◽  
P2p System

Peer-to-peer (P2P) systems are becoming a popular means of streaming audio and video content but they are prone to bandwidth starvation if selfish peers do not contribute bandwidth to other peers. We prove that an incentive mechanism can be created for a live streaming P2P protocol while preserving the asymptotic properties of randomized gossip-based streaming. In order to show the utility of our result, we adapt a distributed incentive scheme from P2P file storage literature to the live streaming scenario. We provide simulation results that confirm the ability to achieve a constant download rate (in time, per peer) that is needed for streaming applications on peers. The incentive scheme fairly differentiates peers' download rates according to the amount of useful bandwidth they contribute back to the P2P system, thus creating a powerful quality-of-service incentive for peers to contribute bandwidth to other peers. We propose a functional architecture and protocol format for a gossip-based streaming system with incentive mechanisms, and present evaluation data from a real implementation of a P2P streaming application.

Sign in / Sign up

Export Citation Format

Share Document