文章基本信息

标题：Client Assignment Problem For Continuous Distributive Interactive Applications
本地全文：下载
作者：Methuku Archana ; Dr. R.China Appala Naidu
期刊名称：International Journal of Computer Science & Technology
印刷版ISSN：2229-4333
电子版ISSN：0976-8491
出版年度：2016
卷号：7
期号：3
页码：47-50
语种：English
出版社：Ayushmaan Technologies
摘要：In general, interactivity is a primary performance in Distributed Interactive Applications (DIAs) that enable clients at different locations to interact with each other in a real time. The DIAs performance depends, not only client to server latencies but also inter server network latencies, as well as synchronization delays to get the consistency and fairness requirements in DIAs. In this paper, We find the approach effectively assigning clients to servers to maximize the interactivity in DIAs by using algorithms called Greedy Assignment and distributed –modify assignment algorithms. By evaluating the proposed Greedy Assignment and Distributed-Modify Assignment the experimental results showthat optimal interactivity is produced and the interaction time between clients is reduced compared to the intuitive algorithmwhich is assigned to each client to its nearest server.
关键词：Distributed Interactive Applications (DIAs);Client-Server Interaction