Scalable interest management for multidimensional routing space

Interest management is essential for scalable collaborative virtual environments (CVEs) which sought to reduce band-width consumption on the network. Most of the interest management systems such as Data Distribution Management (DDM) service of the High Level Architecture (HLA) concentrate on providing precise message filtering mechanisms. However, in doing so a second problem is introduced: the CPU cycle overheads of filtering process. If the cost in terms of computational resources of interest management itself is too high, it would be unsuitable for real time applications such as multiplayer online games (MOGs) for which runtime performance is important. In this paper we present a scalable interest management algorithm which is suitable for HLA DDM. Our approach employs the collision detection method of I-COLLIDE for fast interest matching. Furthermore, the algorithm has been implemented in our commercialized MOG middleware - Lucid Platform. Experimental evidence demonstrates that it works well in practice.