一种支持大型多人在线游戏的覆盖网组播生成树算法

The Design and Implementation of an Intelligent Game Engine Based on OGRE

提出了一种基于AOI(Area of Interest)域的可调覆盖组播生成树算法AOMST(Adjustable Overlay Multicast Spanning Tree),该算法可用于支持大型多人在线游戏MMOG(Massively Multi-player Online Games)。它的基本思想是先将MMOG按照兴趣域划分分区,在每个分区内以结点带宽及时延为可调影响因子构建组播生成树,然后再通过3种不同的结点变换操作来进一步减少组播生成树中的时延。仿真实验表明,AOMST算法是有效的。

This paper presents an Adjustable Overlay Multicast Spanning Tree （AOMST） algorithm which is based on Area of Interest （AOI）.The algorithm can be used to support Massively Multi-player Online Games （MMOG）.Its fundamental idea is to divide the MMOG world into different areas of interest,then construct multicast spanning tree based on bandwidth and latency,whose affection factors are adjustable,within each AOI.Next,the latency of the multicast spanning tree can still be reduced via three different node swap operations.The experimental results indicate that AOMST is really effective.