2.50
Hdl Handle:
http://hdl.handle.net/2436/34678
Title:
Recursive Interest Management For Online Games
Authors:
Kumar, Pawan; Mehdi, Qasim
Other Titles:
Proceedings of CGAMES’2006
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.
Citation:
In: 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
Publisher:
The University of Wolverhampton, School of Computing and Information Technology
Issue Date:
2006
URI:
http://hdl.handle.net/2436/34678
Additional Links:
http://www.cgames.org/; http://www.wlv.ac.uk/Default.aspx?page=14750
Type:
Meetings & Proceedings
Language:
en
ISBN:
0-9549016-1-4
Appears in Collections:
Game Simulation and Artificial Intelligence Centre (GSAI)

Full metadata record

DC FieldValue Language
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, USAen
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.en
dc.language.isoenen
dc.publisherThe University of Wolverhampton, School of Computing and Information Technologyen
dc.relation.urlhttp://www.cgames.org/en
dc.relation.urlhttp://www.wlv.ac.uk/Default.aspx?page=14750en
dc.subjectMulti-player online gamesen
dc.subjectInterest managementen
dc.subjectHLAen
dc.subjectData distribution managementen
dc.subjectMulti-dimensional routing spacesen
dc.titleRecursive Interest Management For Online Gamesen
dc.title.alternativeProceedings of CGAMES’2006en
dc.typeMeetings & Proceedingsen
All Items in WIRE are protected by copyright, with all rights reserved, unless otherwise indicated.