A Predictive Interest Management Based on N-Tree

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.