arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1004.4420cs.DS
收藏

固定客户数网络上的最优数据放置

Optimal Data Placement on Networks With Constant Number of Clients

Eric Angel, Evripidis Bampis, Gerasimos G. Pollatos, Vassilis Zissimopoulos

摘要:

我们介绍了最佳算法的数据布局(DP)和页面布局(PP)在网络中的问题与一个恒定数量的客户端,每个客户端具有有限的存储可用性和问题的数据对象的请求。这两个问题的目标是有效地利用每个客户端的存储(决定在哪里放置对象的副本),使所有客户端的总访问和安装成本最小化。在PP问题中,必须满足对单个客户端服务的最大客户端数量的额外约束。我们的算法解决这两个问题时,所有的对象具有统一的长度最佳。当对象长度不一致时,我们也找到了最优解,尽管每个客户端的存储大小被$ε$ lmax渐进地严格违反,其中lmax是对象的最大长度和$ε$一些任意小的正常数。我们对网络的底层拓扑结构(度量,超度量等)没有任何假设,从而获得非度量数据布局问题的第一非平凡结果。

英文摘要:

We introduce optimal algorithms for the problems of data placement (DP) and page placement (PP) in networks with a constant number of clients each of which has limited storage availability and issues requests for data objects. The objective for both problems is to efficiently utilize each client's storage (deciding where to place replicas of objects) so that the total incurred access and installation cost over all clients is minimized. In the PP problem an extra constraint on the maximum number of clients served by a single client must be satisfied. Our algorithms solve both problems optimally when all objects have uniform lengths. When objects lengths are non-uniform we also find the optimal solution, albeit a small, asymptotically tight violation of each client's storage size by $ε$lmax where lmax is the maximum length of the objects and $ε$ some arbitrarily small positive constant. We make no assumption on the underlying topology of the network (metric, ultrametric etc.), thus obtaining the first non-trivial results for non-metric data placement problems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑