Interactive distributed apptirattans such as multiplayer games will become increasingly popular in wide ares distributed systems. To provide the response time desired by users despite high and unpredictsble mmmunieation latency in such systems, shared objects will be cached or replicated by clients that participate in the appliestions. Any updates to the shared objects will have to he disseminated to clients that aetuatty use the objects to maintain consistency. We address the problem of &Cent and scalable update dissemination in an environment where client interests can change dynamically and the number of multieast channels available for dissemination is Limited. We prevent a heuristic based algorithm that can group objects md ctient in B way that it handles limited bandwidth recmrces. We show that OYI algorithm can produce better results than several algorithms that have been developed in the past for update dissemination.
By: Tianying Chang,George Popescu Chris Codella
Published in: RC22237 in 2001
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .