Show simple item record

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, USA
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.
dc.language.isoen
dc.publisherThe University of Wolverhampton, School of Computing and Information Technology
dc.subjectGames
dc.subjectInterest management
dc.subjectComputer games
dc.titleConstant-Time Complexity Interest Management for Online Games
dc.title.alternativeProceedings of CGAMES’2007
dc.typeConference contribution
refterms.dateFOA2018-08-20T16:03:51Z
html.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.


Files in this item

Thumbnail
Name:
CGames 2007(a) cover.pdf
Size:
234.3Kb
Format:
PDF
Thumbnail
Name:
CGames 2007(a)_Gallego et al.pdf
Size:
499.0Kb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record