A mechanism for solving the sequential inconsistent event in a peer-to-peer network virtual environment

  • Authors:
  • Jui-Fa Chen;Wei-Chuan Lin;Kun-Hsiao Tsai;Yu-Yu Cho;Cheng-Yu Yu

  • Affiliations:
  • Department of Information Engineering, TamKang University;Department of Information Technology, Tak-Ming University of Science and Technology;Department of Information Engineering, TamKang University;Department of Information Engineering, TamKang University;Department of Information Engineering, TamKang University

  • Venue:
  • GPC'10 Proceedings of the 5th international conference on Advances in Grid and Pervasive Computing
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

As the prevailing of the Peer-to-Peer (P2P) computation recently, there are many applications had been proposed for P2P Networked Virtual Environment (NVE) However, there are still many problems in the P2P NVE such as event consistency, responsiveness, security, scalability, and reliability ...etc The event consistency can be divided into two problems such as causal and sequential consistency In sequential consistency, when many avatars are competing for a resource and sending the allocating message to the server, who can get the resource? It is very important for these avatars to receive the consistent information This paper proposes an information exchange mechanism to make sure that avatars can receive the event consistent information When avatars are competing for a resource in a P2P NVE, the problem of sequential consistency can be solved by using the ACK packet and priority mechanism.