On Neighbor Consistency for Voronoi-Diagram-Based P2P Networked Virtual Environments

• Main Authors: Jiun-Shiang Chiou, 邱俊翔
• Other Authors: Jehn-Ruey Jiang
• Format: Others
• Language: en_US
• Published: 2006
• Online Access: http://ndltd.ncl.edu.tw/handle/65cxw8

碩士 === 國立中央大學 === 資訊工程研究所 === 94 === Networked Virtual Environments (NVEs) such as Massive Multiplayer Online Games (MMOGs) are getting more and more popular in recent years. NVEs are implemented by client/server architecture traditionally but do not scale well due to the limitation of server resources. To increase the scalability, another solution, peer-to-peer (P2P) architecture, is recently proposed. P2P NVE can potentially achieve better scalability with an extremely large number of users (e.g. over one million) by distributing the server load to all participants. Although P2P NVE can potentially solve the scalability issues, other important issues such as consistency remain unexplored. In this thesis, we focus on neighbor consistency, which is the ratio between the number of known nodes and the number of actual nodes within a node's area of interest (AOI). We assume the underlying overlay is Voronoi-based Overlay Network (VON), which can achieve good neighbor consistency. We address three factors that affect neighbor consistency for such a network, namely, packet loss, mobility and node failure. We propose the adaptive AOI buffer and the critical node detection mechanisms to reduce the negative impacts of those factors on neighbor consistency. We also perform simulation to demonstrate the effects of those factors before and after adopting the proposed mechanisms.