首页> 外文期刊>Emerging Topics in Computing, IEEE Transactions on >Distributed Client-Server Assignment for Online Social Network Applications
【24h】

Distributed Client-Server Assignment for Online Social Network Applications

机译:在线社交网络应用程序的分布式客户端-服务器分配

获取原文
获取原文并翻译 | 示例

摘要

We study the problem of assigning users to servers with an emphasis on the distributed algorithmic solutions. Typical online social network applications, such as Facebook and Twitter, are built on top of an infrastructure of servers that provides the services on behalf of the users. For a given communication pattern among users, the loads of the servers depend critically on how the users are assigned to the servers. A good assignment will reduce the overall load of the system while balancing the loads among the servers. Unfortunately, this optimal assignment problem is NP-hard. Therefore, we investigate three heuristic algorithms for solving the user server assignment problem: 1) the centralized simulated annealing (CSA) algorithm; 2) the distributed simulated annealing (DSA) algorithm; and 3) the distributed perturbed greedy search (DPGS). The CSA algorithm produces good solution in the fastest time, however it relies on timely accurate global system information, and is practical only for small and static systems. In contrast, the two distributed algorithms, DSA and DPGS, exploit local information at each server during their search for the optimal assignment, and thus can scale well with the number of users and servers as well as adapting to the system dynamics. Simulation results show that the performance of the distributed algorithms, specifically the DPGS algorithm, is very competitive with that of the centralized algorithm while providing the advantage of naturally adapting to time-varying communication patterns of users.
机译:我们研究了将用户分配给服务器的问题,重点是分布式算法解决方案。典型的在线社交网络应用程序(例如Facebook和Twitter)建立在代表用户提供服务的服务器基础结构之上。对于用户之间的给定通信模式,服务器的负载主要取决于如何将用户分配给服务器。良好的分配将减少系统的总体负载,同时平衡服务器之间的负载。不幸的是,这个最佳分配问题是NP难的。因此,我们研究了三种启发式算法来解决用户服务器分配问题:1)集中式模拟退火(CSA)算法; 2)分布式模拟退火(DSA)算法; 3)分布式扰动贪婪搜索(DPGS)。 CSA算法在最快的时间内产生了很好的解决方案,但是它依赖于及时准确的全局系统信息,并且仅适用于小型和静态系统。相比之下,DSA和DPGS这两种分布式算法在搜索最佳分配时会利用每台服务器上的本地信息,因此可以随着用户和服务器数量的增加而扩展,并能适应系统动态。仿真结果表明,分布式算法(特别是DPGS算法)的性能与集中式算法的竞争非常激烈,同时具有自然适应用户时变通信模式的优势。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号