• Admin Login
    View Item 
    •   Home
    • Faculty of Science and Engineering
    • Faculty of Science and Engineering
    • View Item
    •   Home
    • Faculty of Science and Engineering
    • Faculty of Science and Engineering
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of WIRECommunitiesTitleAuthorsIssue DateSubmit DateSubjectsTypesJournalDepartmentPublisherThis CollectionTitleAuthorsIssue DateSubmit DateSubjectsTypesJournalDepartmentPublisher

    Administrators

    Admin Login

    Local Links

    AboutThe University LibraryOpen Access Publications PolicyDeposit LicenceCOREWIRE Copyright and Reuse Information

    Statistics

    Display statistics

    Constant-Time Complexity Interest Management for Online Games

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    CGames 2007(a) cover.pdf
    Size:
    234.3Kb
    Format:
    PDF
    Download
    Thumbnail
    Name:
    CGames 2007(a)_Gallego et al.pdf
    Size:
    499.0Kb
    Format:
    PDF
    Download
    Authors
    Gallego, Francisco
    Kumar, Pawan
    Mehdi, Qasim
    Bernab, Abel
    Llorens, Faraon
    Issue Date
    2007
    
    Metadata
    Show full item record
    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
    URI
    http://hdl.handle.net/2436/34715
    Type
    Conference contribution
    Language
    en
    ISBN
    978-0-9549016-39
    Collections
    Faculty of Science and Engineering

    entitlement

     
    DSpace software (copyright © 2002 - 2023)  DuraSpace
    Quick Guide | Contact Us
    Open Repository is a service operated by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.