An Interest Management Mechanism Based on N-Tree

Authors:
Shi Xiang-bin;Wang Yue;Li Qiang;Du Ling;Liu Fang
Affiliations:
-;-;-;-;-
Venue:
SNPD '08 Proceedings of the 2008 Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing
Year:
2008

Citing 0
Cited 2

Design issues for Peer-to-Peer Massively Multiplayer Online Games

International Journal of Advanced Media and Communication
Interest management for distributed virtual environments: A survey

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a method for game space partitioning with N-Tree, and a predictive interest management algorithm based on the partition. This mechanism sets the player’s awareness area based on the awareness model, and sets different DR thresholds for entities on the basis of the players’ awareness level, and reduces bandwidth cost by employing transferring different messages with different frequencies. The simulation results show that the algorithm reduces computation resource and bandwidth usage greatly compared with other kinds of interest management mechanisms, and is more suitable for scalable requirements of P2P MMOG.