Current P2P Networks Research Articles

Analysis of threats and security issues evaluation in mobile P2P networks

Technically, mobile P2P network system architecture can consider as a distributed architecture system (like a community), where the nodes or users can share all or some of their own software and hardware resources such as (applications store, processing time, storage, network bandwidth) with the other nodes (users) through Internet, and these resources can be accessible directly by the nodes in that system without the need of a central coordination node. The main structure of our proposed network architecture is that all the nodes are symmetric in their functions. In this work, 
 the security issues of mobile P2P network system architecture such as (web threats, attacks and encryption) will be discussed deeply and then we propose different approaches and we analysis and evaluation of these mobile P2P network security issues and submit some proposal solutions to resolve the related problems with threats and other different attacks since these threats and attacks will be serious issue as networks are growing up especially with mobility attribute in current P2P networks.

VAStream: Virtual adaptive substream partition and scheduling in data-driven P2P live streaming

Substream-based P2P live streaming systems can achieve high performance according to multiple metrics, including distribution delay, system robustness and protocol overhead. However, the current division approach into substreams is not flexible and cannot be adaptive to dynamic network environments, which characterize the basic transport facilities for supporting P2P live streaming services. In this paper, we propose a virtual adaptive substream partition and scheduling protocol, namely VAStream, which can enforce substream partition or merge operation based on the current P2P network status. This protocol also presents properly crafted schemes to deal with the issues in complex network situation, and effectively makes use of peer resources. Comparing with other mechanisms, the simulation results show that VAStream can achieve low distribution delay, high chunk arrival ratio and good system robustness.

Improving fairness in peer-to-peer networks by separating the role of seeders in network infrastructures

Fairness is one of the most important challenges that should be considered as a priority when designing a P2P �le-sharing network. An unfair P2P network may attract free-riders, frustrate the majority of users, and consequently shorten the longevity ofles. When BitTorrent protocol wasrst introduced, by suggesting new algorithms like tit-for- tat or rarest-�rst and combining them with methods like choking and unchoking, it pushed fairness one step forward. However, BitTorrent did not bring a plenary solution and has its own shortcomings. For instance, neither this protocol nor other P2P protocols that we are aware of precisely indicate how seeders should be treated in their networks. Most of the time they dictate that seeders upload as much as possible. With this approach, seeders can easily be abused by free-riders. It gets even worse when we realize that for lack of a good infrastructure a lawful user may become a free-rider unknowingly. The purpose of this paper is to address this problem by suggesting a novel and universal method that can be implemented in current P2P networks. We show that by separating nodes into two groups of seeders and leechers and then implementing a simple pattern for seeders, we can improve fairness in P2P networks. Even though our algorithm is universal and not limited to a specic protocol, by implementing it on BitTorrent we show how it can be used in practice and how effective it is.

A Structured Global Index Identifier Definition for Constructing Manageable, Operable and Scalable P2P Networks

P2P technology is potentially one of the cornerstones of future networks. But the absence of standards makes it difficult to operate and control P2P-based networks. In the paper, we defined a structured global index as the basis for constructing future manageable, operable and scalable networks, and try to find a way to solve the inherent problems of current P2P networks, such as interaction in heterogeneous networks and multi-dimensional query issues. In the beginning of the paper, we give an introduction on current P2P networks and summarize the problems; and then we will describe the structured global index in detail; finally, we give a prospect on future operation network, and through two cases to illustrate how the problems are solved.

Research on Multicast Routing Algorithm for P2P Overlay Network

Multicast routing is a critical problem in the P2P network. The main task for multicast routing is to establish a multicast tree with good performance, to satisfy the various qualities of service requirements, such as improving the streaming media service quality, and the utilization rate of cyber source. Many efficient overlay multicast routing algorithms are proposed to face the new challenge in current P2P network. This paper attempts to survey the current problems, the solutions for overlay multicast routing algorithms, and points out the further research directions.

A Dependable Cluster Based Topology in P2P Networks

Unstructured peer-to-peer network is a prevalent model in current P2P networks. In general, unstructured P2P model divides the sharing file into many chunks. A peer must search the positions before downloads a chunk. Since a peer does not know the global topology of the overlay network and the distributions of the wanted chunks, what he can do is flooding chunk queries without a proper order when search and download chunks. Additionally, some peers may behavior selfish: leaves network after completed downloading, downloads but not (or limit) its upload. So, the heavy-tail (or long-tail) phenomenon always exists in the unstructured peer-to-peer networks. Some peers cannot complete their download tasks for the scarcity of certain chunks. By combining topology-control and priority-order, this paper proposes a cluster-based model solve the heavytail problem. It analyzes the distribution of file chunks and increases the replication speed of the rarest chunks transmitted among the group. Our simulation experiments show the proposed model provide a dependent network topology for a P2P system, and it helps to transmit the rarest chunk efficiently and improve the overall download completion rate.

Traceable P2P record exchange: a database-oriented approach

In recent years, peer-to-peer (P2P) technologies are used for flexible and scalable information exchange in the Internet, but there exist problems to be solved for reliable information exchange. It is important to trace how data circulates between peers and how data modifications are performed during the circulation before reaching the destination for enhancing the reliability of exchanged information. However, such lineage tracing is not easy in current P2P networks, since data replications and modifications are performed independently by autonomous peers—this creates a lack of reliability among the records exchanged. In this paper, we propose a framework for traceable record exchange in a P2P network. By managing historical information in distributed peers, we make the modification and exchange histories of records traceable. One of the features of our work is that the database technologies are utilized for realizing the framework. Histories are maintained in a relational database in each peer, and tracing queries are written in the datalog query language and executed in a P2P network by cooperating peers. This paper describes the concept of the framework and overviews the approach to query processing.

Distributed Suffix Tree Overlay for Peer-to-Peer Search

Establishing an appropriate semantic overlay on peer-to-peer (P2P) networks to obtain both semantic ability and scalability is a challenge. Current DHT-based P2P networks are limited in their ability to support a semantic search. This paper proposes the distributed suffix tree (DST) overlay as the intermediate layer between the DHT overlay and the semantic overlay to support the search of a keyword sequence. Its time cost is sublinear with the length of the keyword sequence. Analysis and experiments show that the DST-based search is fast, load-balanced, and useful in realizing an accurate content search on P2P networks.

Building low-diameter peer-to-peer networks

Peer-to-peer (P2P) computing has emerged as a significant paradigm for providing distributed services, in particular search and data sharing. Current P2P networks (e.g., Gnutella) are constructed by participants following their own uncoordinated (and often whimsical) protocols; they consequently suffer from frequent network overload and partitioning into disconnected pieces separated by choke points with inadequate bandwidth. We propose a protocol for participants to build P2P networks in a distributed fashion, and prove that it results in connected networks of constant degree and logarithmic diameter. These properties are crucial for efficient search and data exchange. An important feature of our protocol is that it operates without global knowledge of all the nodes in the network.

Efficient topology-aware overlay network

Peer-to-peer (P2P) networking has become a household word in the past few years, being marketed as a work-around for server scalability problems and "wonder drug" to achieve resilience. Current widely-used P2P networks rely on central directory servers or massive message flooding, clearly not scalable solutions. Distributed Hash Tables (DHT) are expected to eliminate flooding and central servers, but can require many long-haul message deliveries. We introduce Mithos, an content-addressable overlay network that only uses minimal routing information and is directly suitable as an underlay network for P2P systems, both using traditional and DHT addressing. Unlike other schemes, it also efficiently provides locality-aware connectivity, thereby ensuring that a message reaches its destination with minimal overhead. Mithos provides for highly efficient forwarding, making it suitable for use in high-throughput applications. Paired with its ability to have addresses directly mapped into a subspace of the IPv6 address space, it provides a potential candidate for native deployment. Additionally, Mithos can be used to support third-party triangulation to quickly select a close-by replica of data or services.