2.50
Hdl Handle:
http://hdl.handle.net/2436/34715
Title:
Constant-Time Complexity Interest Management for Online Games
Authors:
Gallego, Francisco; Kumar, Pawan; Mehdi, Qasim; Bernab, Abel; Llorens, Faraon
Other Titles:
Proceedings of CGAMES’2007
Abstract:
Data Distribution Management (DDM) services are very important to online services in general and, in particular, to online Computer Games. Many previous works have addressed the problemof minimizing bandwidth usage by avoiding sending unnecessary data to clients, which is often referred to as InterestManagement. Many good algorithms have been developed to calculate clients’ interests, having O(n2) complexity in worst case, but none of them have paid attention to the time dependencies of the data. In this paper we present a novel algorithm for Interest Management which reaches a O(1) complexity by profiting from time dependencies of data related to clients’ interests. Our results show that this approach improves previously existing ones in time performance, and it is specially suitable for its use in online computer game servers.
Citation:
In: Mehdi, Q. and Elmaghraby, A. (Eds.), Proceedings of CGAMES’2007. 10th International Conference on Computer Games: AI, Animation, Mobile, Educational and Serious Games, 25-28 July 2007, Louisville, Kentucky, USA
Publisher:
The University of Wolverhampton, School of Computing and Information Technology
Issue Date:
2007
URI:
http://hdl.handle.net/2436/34715
Additional Links:
http://www.cgames.org/; http://www.wlv.ac.uk/Default.aspx?page=14750
Type:
Meetings & Proceedings
Language:
en
ISBN:
978-0-9549016-39
Appears in Collections:
Game Simulation and Artificial Intelligence Centre (GSAI)

Full metadata record

DC FieldValue Language
dc.contributor.authorGallego, Francisco-
dc.contributor.authorKumar, Pawan-
dc.contributor.authorMehdi, Qasim-
dc.contributor.authorBernab, Abel-
dc.contributor.authorLlorens, Faraon-
dc.date.accessioned2008-08-07T12:51:49Z-
dc.date.available2008-08-07T12:51:49Z-
dc.date.issued2007-
dc.identifier.citationIn: Mehdi, Q. and Elmaghraby, A. (Eds.), Proceedings of CGAMES’2007. 10th International Conference on Computer Games: AI, Animation, Mobile, Educational and Serious Games, 25-28 July 2007, Louisville, Kentucky, USAen
dc.identifier.isbn978-0-9549016-39-
dc.identifier.urihttp://hdl.handle.net/2436/34715-
dc.description.abstractData Distribution Management (DDM) services are very important to online services in general and, in particular, to online Computer Games. Many previous works have addressed the problemof minimizing bandwidth usage by avoiding sending unnecessary data to clients, which is often referred to as InterestManagement. Many good algorithms have been developed to calculate clients’ interests, having O(n2) complexity in worst case, but none of them have paid attention to the time dependencies of the data. In this paper we present a novel algorithm for Interest Management which reaches a O(1) complexity by profiting from time dependencies of data related to clients’ interests. Our results show that this approach improves previously existing ones in time performance, and it is specially suitable for its use in online computer game servers.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.subjectInterest managementen
dc.subjectComputer gamesen
dc.subjectGames-
dc.titleConstant-Time Complexity Interest Management for Online Gamesen
dc.title.alternativeProceedings of CGAMES’2007en
dc.typeMeetings & Proceedingsen
All Items in WIRE are protected by copyright, with all rights reserved, unless otherwise indicated.