A coordinator election algorithm for P2P MMOG

P2P technology offers great support for scalability of MMOG (Massively Multiplayer Online Game). However, topology mismatching and peer heterogeneity which existed in P2P overlay network have made coordinator election difficult. Therefore, coordinator election algorithm of P2P MMOG is proposed, the algorithm calculates an integrated utility value for each peer by analyzing the factors that affect peer utility, such as network topology information, capability, reliability, so that the coordinator can be elected according to the utility value. Simulations which are under different player quantity and calculation period show that the algorithm can reduce the distribution latency of game effectively, as well as improve response of Game System greatly.