Structured P2P Networks Research Articles

Max-min fuzzy bi-level programming: resource sharing system with application

This study delves into the application of min-max fuzzy relation systems, specifically focusing on equality and inequality, in the examination of educational institution networks and their resource-sharing dynamics, akin to a P2P network structure. Expanding upon this framework, this article intricately explores a mathematical system featuring three or more terminals within an education resource system, each comprising distinct sharing capabilities. The terminals exchange information on various educational facets, encompassing variations and expenditures per share data, within the framework of a programming-type fuzzy objective function, constrained by the parameters of an educational information system. In these scenarios, the transfer of resources from one terminal to another is interlinked, introducing complexities that warrant a comprehensive examination. Notably, the consideration of greater downloading resources in specific cases is proposed for enhanced practicality. The primary objective of this article is to minimize network congestion within different educational networks, given fixed priority grades assigned to the terminals. To achieve this, the concept of a Lexicographic minimum solution is introduced to address max-min fuzzy relation inequalities, aligning with the defined objectives. The article presents a detailed and effective scenario for implementing the Lexicographic minimal solution. For validation purposes, the proposed scenario is supported by illustrative examples, offering tangible insights into its applicability and efficacy.

Performance analysis of a queueing system based on working vacation with repairable fault in the P2P network

In recent years, peer-to-peer (P2P) as a means of content distribution and sharing service are receiving extensive attention. In this paper, the hybrid P2P network structure model is combined with the knowledge of queueing theory. In order to address the problem generated by unnecessary online behavior of nodes, the working sleep mechanism for the serving nodes is introduced, and the synchronous multiple working vacation strategy is also adopted to decrease the system energy consumption. Then a queueing model with working vacation and repairable fault is built, which used to simulate the resource transmission process of P2P network and to study the performance of P2P sharing system. The steady-state probability vector is derived by employing quasi-birth-and-death process and matrix-geometric solution method. And the expressions for system performance indicators, such as the average delay, are obtained by employing Gauss–Seidel iteration method. Through numerical experiments, the performance indicators of the P2P resource sharing system are studied, which provides a theoretical basis to decrease online energy consumption of nodes in the hybrid P2P network. And through employing Nash equilibrium and social optimal strategy, the value of the social maximum benefit under the social optimization is obtained.

Resource-Cardinality Based Scheme to Reduce Resource Lookup Cost in Structured P2P Networks

Resource-Cardinality Based Scheme to Reduce Resource Lookup Cost in Structured P2P Networks

Improving Bitcoin Transaction Propagation Efficiency through Local Clique Network

AbstractBitcoin is a popular decentralized cryptocurrency, and the Bitcoin network is essentially an unstructured peer-to-peer (P2P) network that can synchronize distributed database of replicated ledgers through message broadcasting. In the Bitcoin network, the average clustering coefficient of nodes is very high, resulting in low message propagation efficiency. In addition, average node degree in the Bitcoin network is also considerably large, causing high message redundancy when nodes use the gossip protocol to broadcast messages. These may affect message propagation speed, hindering Bitcoin from being applied to scenarios of high transactional throughputs. To illustrate, we have collected single-hop propagation data of transactions of 366 blocks from Bitcoin Core. The analysis results show that transaction verification and network delay are two major causes of low transaction propagation efficiency. In this paper, we propose a novel P2P network structure, called local clique network (LCN), for message broadcasting in the Bitcoin network. Specifically, to reduce transaction validation latency and message redundancy, in LCN local nodes (logically) form cliques, and only a few nodes in a clique broadcast messages to the other cliques, instead of each node sending messages to its neighboring nodes. We have conducted extensive experiments, and the results show that message redundancy is low in LCN, and message propagation speed increases significantly. Meanwhile, LCN exhibits excellent robustness when average node degree remains high in the Bitcoin network.

Peer-to-peer multi-risk insurance and mutual aid

Peer-to-peer (P2P) insurance is a decentralized network in which participants pool their resources together to compensate those who suffer losses. The rise of P2P insurance in Western countries, such as Friendsurance and Lemonade, has been viewed as a disruption to the traditional insurance industry in the same way Uber is to the taxi industry. A similar business model of mutual aid, such as the model developed by Xianghubao, has become popular in the East. It is a model designed to provide financial support to those in need and to distribute the cost among all participants.Despite the fast-changing landscape in this field, there has been scarce literature on the theoretical underpinning of P2P insurance and mutual aid. This paper presents the first effort to build a unified framework to quantify and assess the exchange of risks in a network of participants from different risk classes. Under this framework, the paper aims to address several essential research questions, including the fair exchange of heterogeneous risks and the optimality of algorithmic designs under various criteria. The modeling of multi-risk exchange is done with a P2P network structure. We show that these network structures not only can be used to explain the current practice in the industry, but also provide new tools to develop better designs. The paper concludes with a comparison of traditional insurance and P2P risk sharing from the standpoint of stability and cost reduction.

Efficient Communication Protocols for Non DHT-based Pyramid Tree P2P Architecture

In this paper, we have considered a recently reported 2-layer non-DHT-based structured P2P network. Residue Class based on modular arithmetic has been used to realize the overlay topology. At the heart of the architecture (layer-1), there exists a tree like structure, known as pyramid tree. It is not a conventional tree. A node i in this tree represents the cluster-head of a cluster of peers which are interested in a particular resource of type Ri (i.e. peers with a common interest). The cluster-head is the first among these peers to join the system. Root of the tree is assumed to be at level 1. Such a tree is a complete one if at each level j, there are j number of nodes. It is an incomplete one if only at its leaf level, say k, there are less than k number of nodes. Layer 2 consists of the different clusters. The network has some unique structural properties, e.g. each cluster has a diameter of only 1 overlay hop and the diameter of the network is just (2+2d); d being the number of levels of the layer-1 pyramid tree and d depends only on the number of distinct resources. Therefore, the diameter of the network is independent of the number of peers in the whole network. In the present work, we have used some such properties to design low latency intra and inter cluster data lookup protocols. Our choice of considering non-DHT and interest-based overlay networks is justified by the following facts: 1) intra-cluster data lookup protocol has constant complexity and complexity of inter-cluster data lookup is O(d) if tree traversal is used and 2) search latency is independent of the total number of peers present in the overlay network unlike any structured DHT-based network (as a matter fact unlike any existing P2P network, structured or unstructured). Experimental results as well show superiority of the proposed protocols to some noted structured networks from the viewpoints of search latency and complexity involved in it. In addition, we have presented in detail the process of handling churns and proposed a simple yet very effective technique related to cluster partitioning, which, in turn, helps in reducing the number of messages required to be exchanged to handle churns.

Hierarchical and scalable peer-to-peer architecture for online social network

In recent years, online social networks (OSNs) have become increasingly popular (The number of users is growing exponentially), which make them an integral part of human society. Most OSNs rely on a centralized architecture, raising several issues concerning data privacy and anonymity of users. The need to retain some control of their data on the Internet is becoming a serious problem. These issues imposed by the centralized nature of OSNs motivated the research community to develop alternative OSN architectures; decentralized architectures that have been proposed recently for online social networks (DOSNs). In this paper, we propose an architecture for DOSN based on a peer-to-peer infrastructure, it is designed to improve the performance in terms of lookup cost, maintenance cost, and data availability compared to other DOSNs architectures (flat architectures). By using a hierarchical architecture based on structured P2P network with (2) two levels, our architecture is able to handle a large number of users in an effective manner. The performance evaluation of our proposed architecture in term of lookup cost, routing efficiency (lookup success ratio), data structures size, and maintenance cost of data migration is highly satisfactory.

TruSD: Trust framework for service discovery among IoT devices

IoT provides an environment which enables access to a plethora of different services. In order to reach these services, devices need to decide if the providers are trustable or not. The decision to trust a node with whom one has not communicated earlier becomes more critical when the system has unrecoverable damages with inaccurate services. In this paper, we propose a framework which enables trusted communication among devices during service discovery. It focuses not only on the communication between the known devices but also the stranger communications which have not contacted earlier. Our framework works in a decentralized manner on top of a structured P2P network based on a Distributed Hash Table (DHT). In our system, for each device there are several nodes which are responsible for holding a trust value for this device. These responsible nodes are called Reference Holders for this device. By utilizing DHT, we propose a novel way of choosing Reference Holders that prevents the malicious nodes to control these nodes. Our protocols provide trust aggregation, service provision and feedback aggregation. In our threat model, attacker provides on-off, bad mouthing, ballot stuffing and selective attacks. We present closed form of probabilistic analysis and provide simulations that manage to give network-wide probabilistic security guarantees. Our results suggest that until 60% of the devices are captured, the results are perfect. Also, just three reference holders are enough to get accurate services through the network. Additionally, we analyze the framework in terms of memory, computational cost and communication overhead since we propose the framework for IoT devices. Due to these analysis, our framework is affordable for IoT devices.

Finger Forwarding Scheme to Reduce Lookup Cost in Structured P2P Networks

Peer-to-peer (P2P) networks are distributed systems where each user shares his resources and cooperates with other users. These networks are designed over IP-based infrastructure. The resources of each user in these networks are shared in a distributed way on a trust based mechanism. P2P networks have some unique characteristics like scalability and cost efficiency, which separate these networks from other distributed networks. These networks are mainly used for resource sharing. However, resource searching in this type of networks is not centrally controlled in nature. Further poor search scalability is another limitation of these networks. Chord like or chord-based protocols used in the search operations in P2P networks utilize a finger table to shorten the query search length. We exploit the finger forwarding mechanism in our proposed scheme which further reduces the resource’s search path length. We propose a last finger search table in addition to finger table to enhance the file lookup performance in the structured P2P networks. The proposed scheme reduces the lookup path and increases search efficiency as compared to the existing chord and binary search routing equivalent schemes.

Local P2P group (LPG) communication in structured mobile P2P networks

With the onset of the digital era and the availability of the internet, the need for digital data in a huge manner can be fulfilled by peer-to-peer (P2P) network instead of a traditional client server-based solution. Generally, mobile communication is based on cellular networks or multi-hop wireless networks. Cellular networks have adequate fixed infrastructure whereas multi-hop wireless networks have limited infrastructure and hence there are many limitations. The P2P systems are mainly designed for wired networks and the routing is based on IP infrastructure. Chord based protocols are widely deployed in the structured P2P networks but it can not perform well when implemented for mobile P2P networks due to the mobility of the users. Mobility pattern of mobile users plays an important role in locating users and delivering data packets seamlessly. Today, many of the mobile users follow a fixed mobility pattern in urban cities and mobility pattern of the mobile users can be utilized to reduce table update cost and increase Lookup Success Rate (LSR). We have proposed Local P2P Group (LPG) based communication scheme for structured mobile P2P networks. We are focussed on the mobility pattern of the mobile users in urban cities. We have analytically evaluated the proposed scheme using fluid-flow and RWP (Random Waypoint) mobility models and found that the proposed scheme performs better than the existing schemes like MR-Chord and MobiStore. Our proposed scheme has up to 40% higher Lookup Success Rate and 81% less table update cost than existing schemes, MR-Chord and MobiStore.

MedChain: Efficient Healthcare Data Sharing via Blockchain

Healthcare information exchange is an important research topic, which can benefit both healthcare providers and patients. In healthcare data sharing, many cloud-based solutions have been proposed, but the trustworthiness of a third-party cloud service is questionable. Recently, blockchain has been introduced in healthcare record sharing, which does not rely on trusting a third party. However, existing approaches only focus on the records collected from medical examination. They are not efficient in sharing data streams continuously generated from sensors and other monitoring devices. Today, IoT devices have been widely deployed and sensors and mobile applications can monitor patients’ body conditions. The collected data are shared to laboratories and institutions for diagnosis and further study. Moreover, existing approaches are too rigid to efficiently support metadata change. In this paper, an efficient data-sharing scheme is proposed, called MedChain, which combines blockchain, digest chain, and structured P2P network techniques to overcome the above efficiency issues in the existing approaches for sharing both types of healthcare data. Based on MedChain, a session-based healthcare data-sharing scheme is devised, which brings flexibility in data sharing. The evaluation results show that MedChain can achieve higher efficiency and satisfy the security requirements in data sharing.

A priority-based queuing system for P2P-SIP call communications control

Regarding the shortcoming of fundamental existing solutions for VoIP communications (e.g., SIP) based on centralisation, both academia and industry have initiated research projects that focus on the integration of peer-to-peer (P2P) paradigms into session initiation protocol (SIP) communication systems (e.g., P2P-SIP). P2P-SIP builds an overlay network to provide efficient, interoperable and flexible SIP-based services. In this paper, we propose a new model for critical calls, that takes into consideration the priority aspect of some specific requests (e.g., emergency calls). The proposed model is generic regarding the P2P underlying and physical architectures. For illustration purposes, we consider Gnutella, as a representative of unstructured P2P networks, and Chord, as a representative of structured P2P networks. In order to validate the proposed solution, a M/M/1 queuing model is considered. Performance evaluations show that the preliminary results are globally satisfactory and that our proposed model under certain conditions is relevant.

CONGESTION CONTROL ALGORITHM FOR MESSAGE ROUTING IN STRUCTURED PEER-TO-PEER NETWORKS

Many complex applications have been built on the basis of structured peer-to-peer (P2P) networks such as information retrieval systems, file sharing systems, and so on. These applications often have to process a large number of queries quickly and efficiently. When the number of queries to a node exceeds its capacity, a local bottleneck occurs and reduces the information processing of the other nodes in the network. This paper proposes a congestion control algorithm for message routing in structured P2P networks by changing the routing table of nodes in the network to route the packet to the destination without going through the congested node. The performance of proposed method has been evaluated and compared with the conventional Chord protocol. The result shows that our proposed method improves the query success rate significantly while minimizing the number of packets generated during congestion control process

An information discovery scheme for IoS of agricultural services using improved chord-ONS model

To solve the problems in EPC early network discovery service mode, we have analysed many aspects, such as load balance, robustness, and content privacy. We explain the architecture and workflow of structured P2P based ONS resolution system, and analyse advantages and disadvantages of current P2P-ONS system. Then the improved scheme is put forward which adopts hierarchical P2P network architecture to form ONS resolution system. It proposes a two-level chord-ONS architecture including routing performance analysis, storage and query of system information, nodes joining in or out, and selection of super nodes. The routing strategy based on node performance for super nodes and common nodes is also put forward. By the analysis of simulation results we find that the improved routing mechanism is better than the structured chord routing mechanism in query hopping, query delay and stability. It is more suitable for internet of things with huge dynamic and huge amount of information and it also shows comprehensive performance compared to traditional structured P2P network.

SHAM: Scalable Homogeneous Addressing Mechanism for structured P2P networks

In designing structured P2P networks, scalability, resilience, and load balancing are features that are needed to be handled meticulously. The P2P overlay has to handle large scale of nodes while maintaining minimized path lengths in performing lookups. It has also to be resilient to nodes’ failure and be able to distribute the load uniformly over its participant. In this paper, we introduce SHAM: a Scalable, Homogenous, Addressing Mechanism for structured P2P networks. SHAM is a multi-dimensional overlay that places nodes in the network based on geometric addressing and maps keys onto values using consistent hashing.Our simulation results show that SHAM locates keys in the network efficiently, is highly resilient to major nodes’ failure, and has an effective load balancing property. Furthermore, unlike other DHTs and due to its distinguished naming scheme, SHAM deploys homogenous addressing which drastically reduces latency in the underlying network.

An Efficient p2p Content Retrieval in Guided Distributed Environment using Dynamic Search Algorithm

Background/Objectives: The Peer-to-Peer (P2P) network connection can build loosely coupled application that covers effective resource sharing. The main aim of this propounded approach is to develop the search and recoveryoperation in the unstructured p2p networks. Methods/Statistical Analysis: The network can be classified either as structured or unstructured. Since, the p2p networks which are mainly unstructured can be built efficaciously and with more precision, even in severe conditions over the network topology;so as a result, these networks are far more suitable to the network environment. The random search techniques adopted by these types of networks commonly perform less effective in large size network. The search and retrieve performance can be improved in unstructured p2p networks by utilizing users common Preference pattern, which will be captured inside a probability-theoretic structure is called User Preference Model (UPM). It is developed with the support of Dynamic Query Retrieval Protocol. Findings: In our propounded approach, whenever the same file is searched for over three times, the details, present in the routing table will be automatically moving to the User Preference Model Table, hence rendering our propounded searching methodology much faster and efficacious in nature. Improvements/Applications: The application of the research is to be used in the small world unstructured peer to peer networks. The search performance and retrieval performance can be improved in this research. Novelty: In this specific paper, we have propounded a search protocol as well as a routing table updating protocol so as to develop or improve the searching process through self-managing the p2p network structure into a small business world application. Keywords: Dynamic Query Retrieval Protocol, Unstructured Peer to Peer Network, User Preference Model

A Survey over Mechanisms for Reducing Free Riding Behaviour in Structured P2P Networks

P2P (peer-to-peer) overlays have attracted many researchers due to increase in Internet based P2P applications. A P2P overlay is a distributed system in which the independent nodes participate at their will to share resources in distributed manner. P2P overlays are designed for wired based communication systems but today P2P applications are becoming popular in wireless networks even in multi-hop wireless networks. Routing mechanism in P2P overlays is based on IP infrastructure and many protocols are deployed successfully for efficient and fair P2P applications. However, there are many challenges in designing and deployment of efficient and fair protocols for the P2P overlays. These overlays suffer from many challenges such as dynamic overlay management, lack of robust trust model, counterfeit content distribution, free riding, poor resource search scalability, security, etc. The churn rate of nodes (join and leave of nodes) in the P2P overlay makes overlay management and resource searching more challenging. The free riding nature of the nodes in a P2P overlay is undesirable and it creates unfairness in the P2P overlay. There are several mechanisms proposed such as Eigen Trust model, tit-for-tat policy, point-based incentive policy, Page Rank policy, layered taxation, advertisement of incentive, etc. for encouraging fairness in the P2P overlays. I have presented in-depth survey over free riding behaviour, its effect, and existing mechanisms to reduce free riding in structured P2P overlays.

SureTrust: a super peer-aware trust model for 2-level P2P networks

With the growth of P2P applications, more and more trust models have been proposed for curbing malicious behavior, most of which are suitable for pure P2P networks, including the structured P2P networks and the unstructured P2P networks. This paper presents a super peer-aware trust model, sureTrust, for 2-level P2P networks. The super peer of a subnet is responsible for calculating the peers’ trust in its subnet, and the super peer’s trust is correlated with the trust of the peers in its subnet. To discourage peers from behaving maliciously, we allow a peer to establish transactions only with the peers whose trust is similar to that of the peer. Also, a super peer could separate the connections of a peer in its subnet to the outside subnets as the punishment on the peer’s behavior. The simulation results show that the sureTrust model could improve normal peers’ successful download rate and resist different types of attacks.

An Efficient DHT Routing Protocol with Small-world Features for Structured P2P Network

An Efficient DHT Routing Protocol with Small-world Features for Structured P2P Network

Binary search routing equivalent (BSRE): a circular design for structured P2P networks

AbstractPeer‐to‐peer (P2P) solutions are powerful distributed networks that are used in different kinds of applications. An important challenge for these networks is how search queries take place among users. A prominent solution for efficient search queries with a reasonable time is to use distributed hash tables in a structured design. Current methodologies of structured networks either provide a network with O(logN) routing time or exclusively reach O(1) without the possibility of routing. Based on different situations, each of these infrastructures has its applicability. In this paper, we propose binary search routing equivalent, a circular design for structured P2P networks. Our main goal is to make a flexible network infrastructure for routing. By considering trade‐offs between the size of distributed hash tables, overheads over churn and routing time, binary search routing equivalent can find objects without routing or route for at worst case O(logN). For this purpose, we emulate the methodology of binary search for P2P networks. Copyright © 2015 John Wiley & Sons, Ltd.