Show simple item record

dc.contributor.authorKumar, Pawan
dc.contributor.authorMehdi, Qasim
dc.date.accessioned2008-08-07T10:10:15Z
dc.date.available2008-08-07T10:10:15Z
dc.date.issued2006
dc.identifier.citationIn: Mehdi, Q. and Elmaghraby, A. (Eds.), Proceedings of CGAMES’2006. 8th International Conference on Computer Games: Artificial Intelligence and Mobile Systems, 24-27 July 2006, Louisville, Kentucky, USA
dc.identifier.isbn0-9549016-1-4
dc.identifier.urihttp://hdl.handle.net/2436/34678
dc.description.abstractPerformance 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.
dc.language.isoen
dc.publisherThe University of Wolverhampton, School of Computing and Information Technology
dc.subjectMulti-player online games
dc.subjectInterest management
dc.subjectHLA
dc.subjectData distribution management
dc.subjectMulti-dimensional routing spaces
dc.titleRecursive Interest Management For Online Games
dc.title.alternativeProceedings of CGAMES’2006
dc.typeConference contribution
refterms.dateFOA2018-08-21T11:40:44Z
html.description.abstractPerformance 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.


Files in this item

Thumbnail
Name:
CGAMES_06(a)_cover.pdf
Size:
226.3Kb
Format:
PDF
Thumbnail
Name:
CGAMES_06(a)_Kumar and Mehdi.pdf
Size:
433.3Kb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record