• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >The Client Assignment Problem for Continuous Distributed Interactive Applications: Analysis, Algorithms, and Evaluation
【24h】

The Client Assignment Problem for Continuous Distributed Interactive Applications: Analysis, Algorithms, and Evaluation

机译：连续分布式交互式应用程序的客户分配问题：分析，算法和评估

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Interactivity is a primary performance measure for distributed interactive applications (DIAs) that enable participants at different locations to interact with each other in real time. Wide geographical spreads of participants in large-scale DIAs necessitate distributed deployment of servers to improve interactivity. In a distributed server architecture, the interactivity performance depends on not only client-to-server network latencies but also interserver network latencies, as well as synchronization delays to meet the consistency and fairness requirements of DIAs. All of these factors are directly affected by how the clients are assigned to the servers. In this paper, we investigate the problem of effectively assigning clients to servers for maximizing the interactivity of DIAs. We focus on continuous DIAs that changes their states not only in response to user operations but also due to the passing of time. We analyze the minimum achievable interaction time for DIAs to preserve consistency and provide fairness among clients, and formulate the client assignment problem as a combinatorial optimization problem. We prove that this problem is NP-complete. Three heuristic assignment algorithms are proposed and their approximation ratios are theoretically analyzed. The performance of the algorithms is also experimentally evaluated using real Internet latency data. The experimental results show that our proposed Greedy Assignment and Distributed-Modify Assignment algorithms generally produce near optimal interactivity and significantly reduce the interaction time between clients compared to the intuitive algorithm that assigns each client to its nearest server.
机译：交互性是分布式交互应用程序（DIA）的主要性能指标，它使位于不同位置的参与者能够实时彼此交互。大型DIA中参与者的广泛地域分布，需要分布式部署服务器以提高交互性。在分布式服务器体系结构中，交互性能不仅取决于客户端到服务器的网络等待时间，还取决于服务器之间的网络等待时间以及同步延迟以满足DIA的一致性和公平性要求。所有这些因素都直接受客户端如何分配给服务器的影响。在本文中，我们研究了将客户端有效分配给服务器以最大化DIA交互性的问题。我们关注于连续的DIA，这些DIA不仅根据用户的操作而且随着时间的流逝而改变其状态。我们分析了DIA可以实现的最小交互时间，以保持一致性并提供客户之间的公平性，并将客户分配问题表述为组合优化问题。我们证明这个问题是NP完全的。提出了三种启发式分配算法，并对它们的近似率进行了理论分析。还使用真实的Internet延迟数据通过实验评估了算法的性能。实验结果表明，与将每个客户端分配给最近的服务器的直观算法相比，我们提出的贪婪分配和分布式-修改分配算法通常会产生接近最佳的交互性，并显着减少客户端之间的交互时间。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号