一种基于P2P MMOG的乐观同步算法

An optimistic synchronizatioo algorithm based on P2P for MMOG

根据P2P MMOG的特点引入周期时间桶算法对游戏状态进行同步,将基于因果关系的事件分布到不同时间桶内执行以维护游戏的一致视图,并针对该算法的缺陷定义最小时间桶来衡量事件执行的乐观度,使每一轮尽可能处理足够多的事件。在此基础上给出全局虚拟时间GVT的计算,以保证及时进行内存的回收。实验结果表明改进的算法可以有效减少回滚次数,降低网络带宽的占用,并能在一定程度上提高系统资源的利用率。

An optimistic synchronization strategy called Breathing Time Bucket algorithm, which can efficiently distribute causally dependent events into different time buckets to keep a proper game view, is introduced to maintain game state consistency based on the characteristics of P2P MMOG. A least time bucket is proposed to guarantee sufficient events to be executed to satisfy game interactive needs by measuring optimist degree. A calculation of Global Virtual Time is also presented to keep timely and effective garbage collection. The simulation results show that the improved algorithm can reduce rollback time and network bandwidth usage efficiently, and can raise system resource utilization rate to some extent also.