一种基于N-Tree的可预测兴趣管理机制

A Predictive Interest Management Based on N-Tree

给出了利用N-Tree划分游戏世界的方法,并在此划分的基础上提出了可预测的兴趣管理机制.该机制根据玩家对游戏世界中信息的兴趣将消息分类,利用不同类型消息传输频率不同的特性来减少网络带宽的占用.实验结果表明,该方案与其它同类的兴趣管理机制相比在很大程度上减少了对网络带宽和计算资源的占用,更符合P2PMMOG伸缩性的要求.

This paper proposes a predictive Interest Management algorithm on the basis of N-Tree, The algorithm groups players according to their interests, and reduce bandwidth waste efficiently. The simulation results show that the algorithm reduce on resources of computer and bandwidth greatly, and is more satisfying scalable requirements of P2P MMOG.