File allocation in distributed multimedia information networks
File allocation in distributed multimedia information networks
复制标题
分布式多媒体信息网络中的文件分配
DOI：
10.1109/glocom.1998.776835
复制
发表时间：
1998
期刊：
影响因子：
--
通讯作者：
H. Okada
中科院分区：
文献类型：
--
作者：
A. Nakaniwa;M. Ohnishi;H. Ebara;H. Okada
研究了分布式网络系统中多媒体文件的分配问题。在这些系统中，文件由连接到不同服务器的用户通过高速通信网络共享。分布式系统中最重要的问题之一是如何在考虑成本和延迟的情况下将文件分配给服务器。在这些系统中，很明显，成本和延迟之间存在一种权衡关系。我们的目标是找到最优的文件分配，使总成本在总延迟的情况下最小化。为了评估这种优化，我们提出了一个系统模型，该模型可以涵盖广泛的多媒体网络应用，如VoD（视频点播）、企业信息网络等。对最优化问题引入了一个0-1整数规划公式。通过求解这些公式，我们找到了最优的文件分配，并量化了分布式系统的总体趋势。此外，我们还比较了穷举搜索和我们用于优化的近似方法。
We study allocation problems of multimedia files in distributed network systems. In these systems, the files are shared by users connected with different servers through high-speed communication networks. One of the most important problems in distributed systems is how to assign the files to servers in view of costs and delays. In these systems, it is obvious that there is a trading-off relationship between costs and delays. Our objective is to find the optimal file allocation such that the total cost is minimized subject to the total delay. In order to evaluate the optimization, we present a system model that can cover a wide range of multimedia network applications such as VoD (video on demand), corporation information networks, and so on. We introduce a 0-1 integer programming formulation for the optimization problem. We find the optimal file allocation by solving these formulae, and quantify the general tendency in distributed systems. Moreover, we make a comparison between the exhaustive search and the approximate method that we use for optimization.