P2P Game Research Articles

P2P transaction method for distributed energy prosumers based on reputation value

Adding a reputation incentive system to peer-to-peer (P2P) energy transactions can encourage prosumers to regulate their trading behavior, which is important for ensuring the efficiency and reliability of P2P transactions. This study proposed a P2P transaction mechanism and game optimization model for prosumers involved in distributed energy sources considering reputation-value incentives. First, the deviation of P2P transactions and the non-consumption rate of distributed renewable energy in P2P transactions were established as indicators to quantify the influencing factors of the reputation value, and a reputation incentive model of P2P transactions for prosumers was constructed. Then, the penalty coefficient was applied to the cost function of the prosumers, and a non-cooperative game model of P2P transactions based on the complete information of multi-prosumers was established. Furthermore, the Nash equilibrium problem was transformed into a nonlinear optimization problem by constructing the modified optimal reaction function, and the Nash equilibrium solution of the game was obtained via a relaxation algorithm. Finally, the modified IEEE 33-node test system based on electricity market P2P and an IEEE 123-node test system were used to analyze and verify the cost and P2P participation of prosumers considering the reputation value. The results show that the addition of the reputation incentive system can encourage prosumers to standardize their interactive transaction behavior and actively participate in P2P transactions. It can also improve the operation efficiency of the power grid and promote the perfection of the P2P transaction mechanism.

Facilitating Serverless Match-based Online Games with Novel Blockchain Technologies

Applying peer-to-peer (P2P) architecture to online video games has already attracted both academic and industrial interests, since it removes the need for expensive server maintenance. However, there are two major issues preventing the use of a P2P architecture, namely how to provide an effective distributed data storage solution, and how to tackle potential cheating behaviors. Inspired by emerging blockchain techniques, we propose a novel consensus model called Proof-of-Play (PoP) to provide a decentralized data storage system that incorporates an anti-cheating mechanism for P2P games, by rewarding players that interact with the game as intended, along with consideration of security measures to address the Nothing-at-stake Problem and the Long-range Attack. To validate our design, we utilize a game-theory model to show that under certain assumptions, the integrity of the PoP system would not be undermined due to the best interests of any user. Then, as a proof-of-concept, we developed a P2P game ( Infinity Battle ) to demonstrate how a game can be integrated with PoP in practice. Finally, experiments were conducted to study PoP in comparison with Proof-of-Work (PoW) to show its advantages in various aspects.

A traffic identification based on PSO-RBF neural network in peer-to-peer network

To identify and control the peer-to-peer P2P traffic accurately, this paper proposes a novel classification method of peer-to-peer network traffic identification based on machine learning. The method is based on the conventional machine learning to identify the network traffic, in the data specimen collection stage, adding the particle swarm optimisation algorithm to collect the data. In the classification tool building stage, a radial basis function neural network is used, which is very suitable for specify the data category. In the experiment, collecting three kinds of typical traffic P2P traffic, HTTP traffic, and game traffic on the current internet, identification and classification, results show that the method has a higher precision rate and recall rate two evaluation indexes of three kinds of flow rate with more than 90%. The use of particle swarm optimisation feature selection algorithm reduces the training time. On the whole, the method has good classification effect.

A traffic identification based on PSO-RBF neural network in peer-to-peer network

To identify and control the peer-to-peer (P2P) traffic accurately, this paper proposes a novel classification method of peer-to-peer network traffic identification based on machine learning. The method is based on the conventional machine learning to identify the network traffic, in the data specimen collection stage, adding the particle swarm optimisation algorithm to collect the data. In the classification tool building stage, a radial basis function neural network is used, which is very suitable for specify the data category. In the experiment, collecting three kinds of typical traffic (P2P traffic, HTTP traffic, and game traffic) on the current internet, identification and classification, results show that the method has a higher precision rate and recall rate (two evaluation indexes of three kinds of flow rate with more than 90%). The use of particle swarm optimisation feature selection algorithm reduces the training time. On the whole, the method has good classification effect.

기본 사본을 갖는 P2P 멀티플레이어 게임 구조의 수준별 일관성 제어 기법

A Multiplayer Online Game(MOG) is a game capable of supporting hundreds or thousands of players and is mostly played using the Internet. P2P(peer-to-peer) architectures for MOGs can potentially achieve high scalability, low cost, and good performance. The basic idea of many P2P-based games is to distribute the game state among peers and along with it processing, network, and storage tasks. In a primary-copy based replication scheme where any update to the object has to be first performed on the primary copy, this means distributing primary copies of objects among peers. Most multiplayer games use a primary-copy model in order to provide strong consistency control over an object. Games consist of various types of actions that have different levels of sensitivity and can be categorized according to their consistency requirements. With the appropriate consistency level of each action type within a game, this paper allows developers to choose the right trade-off between performance and consistency. The performance for P2P game architecture with the primary-copy model is evaluated through simulation experiments and analysis.

Peer-to-peer as an infrastructure service

Peer-to-Peer (P2P) communication has attracted significant interest from both academia and industry, and has become a successful communication paradigm for diverse Internet applications, including file sharing, live streaming, and video on demand. Today P2P applications account for over 70 % of the Internet traffic, and the percentage is still growing. P2P has also been used to facilitate the development of such new generation of applications as social networking and cloud computing. Many of these systems use P2P as an underlying engine to boost their performance and to reduce the deployment costs. Examples include the Amazon EC2 cloud platform that opens a dedicated interface for BitTorrent, and LeafWeb P2P gaming platform that allows users to invite others from their Facebook profiles to play online games. Yet there remain a number of challenges for P2P to be a fundamental infrastructure service for pervasive Internet applications: It is necessary to deal with peer churns to provide stable and robust quality-of-service; the inventiveness of individual users and that of Internet Service Providers (ISPs) have to be carefully addressed for incorporating a P2P engine; and security issues have been brought to the front end as substantial P2P based attacks, viruses and botnets appear. These problems can be even more severe with the emerging new applications. The objective of this special issue is to summarize the recent research and development toward making P2P a better infrastructure service. After a thorough review process, ten papers were accepted after revision and a second round of review (some with a third round of review). The first set of papers discuss the traffic management and content sharing in peer-to-peer systems. Paper “On the Collaboration of Different Peer-to-Peer Traffic Management Schemas” by Xin Liu, Haiyang Wang, and Lei Zhangaims to solve the pressure on the ISPs from P2P traffic. Different with the existing schemes that only use caching or redirection, they combines the two methods together with a coherent framework, Tod-Cache (Traffic Orientated Distributed Caching). Paper “The Performance and Locality Tradeoff in BitTorrent-like File Sharing Systems” by Wei Huang, Chuan Wu, Zongpeng Li, and Francis C.M. Lau characterizes the performance and locality tradeoff in P2P as a multi-objective b-matching optimization problem and designs fully distributed peer selection algorithms. Paper “BufferBank: A Distributed Cache Infrastructure For Peer-to-peer Application” by Huang Bin, Sun Zhigang, Chen Hongyi, Mao Jianbiao, Zhang Ziwen proposes a distributed P2P caching infrastructure named BufferBank in the edge of network. This infrastructure uses the memory of users at the edge network as the cache space and the authors also provide a number of application interfaces for P2P applications to use the cache space. Paper “A Scalable P2P Overlay Based on Arrangement Graph with Minimized Overhead” by Ssu-Hsuan Lu, KuanChing Li, Kuan-Chou Lai, and Yeh-Ching Chung examines J. Liu (*) Simon Fraser University, Burnaby, Canada e-mail: jcliu@sfu.ca

A Peer-to-Peer Game Model using Punishment Strategies

Recent years, with the rapid development of P2P networks, the security problem of these networks has become increasingly obvious. According to the behavior of selfishness and betrayal for nodes in P2P networks, this paper analyzes and contrasts the benefits of these nodes, and presents the P2P game model with the penalty factor. The reasonable analysis and simulation by gambit prove that, addition of the penalty factor has certain constraints on the betray nodes and promotes the active cooperation of these nodes, thus improves the security status of P2P networks.

A look at native IPv6 multicast

IP multicast offers a bandwidth-efficient means for transmitting packets to multiple hosts for applications that require multiparty communications. Coupled with IPv6's larger address space, its inherent multicast support enables current and future Internet-ready devices to support multiparty applications such as videoconferencing, P2P gaming, and data feeds. IP multicast is applicable to IPv4 and IPv6, but we focus on the IPv6 implementation, looking at the protocols and how they stack up against the IPv4 implementation. In particular, we describe how IPv6 multicast can be supported in an interdomain environment.