论文标题
建模内容交付网络中镜像服务器的位置选择
Modeling the Location Selection of Mirror Servers in Content Delivery Networks
论文作者
论文摘要
对于内容交付网络（CDN）的提供商，镜像服务器的位置选择是一个复杂的优化问题。通常，目标是放置集中的节点，以便所有客户都根据其要求方便地访问该服务。这是K-Center问题的一个实例，被证明是NP-HARD。确定合理的服务器位置直接影响运行时间效果和未来的服务成本。我们对内容交付网络的属性进行建模，模拟和优化。具体而言，考虑到具有优先客户和加权连接的网络基础架构中的服务器位置。必须针对服务器的仿真模型根据目标客户请求分析缓存行为。我们分析问题并比较不同的优化策略。为了进行模拟，我们采用各种现实的场景并评估了几个绩效指标。我们的新优化方法显示出重大改进。提出的结果通常适用于具有K-中心问题的其他领域，例如，军事基地的放置，设施位置的计划和安置或数据挖掘。
For a provider of a Content Delivery Network (CDN), the location selection of mirror servers is a complex optimization problem. Generally, the objective is to place the nodes centralized such that all customers have convenient access to the service according to their demands. It is an instance of the k-center problem, which is proven to be NP-hard. Determining reasonable server locations directly influences run time effects and future service costs. We model, simulate, and optimize the properties of a content delivery network. Specifically, considering the server locations in a network infrastructure with prioritized customers and weighted connections. A simulation model for the servers is necessary to analyze the caching behavior in accordance to the targeted customer requests. We analyze the problem and compare different optimization strategies. For our simulation, we employ various realistic scenarios and evaluate several performance indicators. Our new optimization approach shows a significant improvement. The presented results are generally applicable to other domains with k-center problems, e.g., the placement of military bases, the planning and placement of facility locations, or data mining.
