Recursive Interest Management For Online Games

Abstract

Performance and scalability in multi-player online games and distributed simulators mainly depends on the effectiveness of the deployed interest management schemes. These schemes aim at providing messagefiltering mechanisms that reduces the communication overheads. However, in order to do so, they incur computational costs that are quite significant and are not suitable for scalable real time systems. In this paper, a recursive algorithm for interest management is presented that can be applied for systems that use multi-dimensional routing spaces for interest management. The algorithm’s simulation shows that it is more efficient and scalable than existing approaches.