.png){kind=icon}
返回
Replicated server placement with QoS constraints
.png){kind=icon}
PRE
AI
DOI：10.1109/TPDS.2006.145.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The network planning problem of placing replicated servers with QoS constraints is considered. Each server site may consist of multiple server types with varying capacities and each site can be placed in any location among those belonging to a given set. Each client can be served by more than one location as long as the round-trip delay of data requests satisfies predetermined upper bounds. Our main focus is to minimize the cost of using the servers and utilizing the link bandwidth, while serving requests according to their delay constraint. This is an NP-hard problem. A pseudopolynomial and a polynomial algorithm that provide guaranteed approximation factors with respect to the optimal for the problem at hand are presented.
Keyword:
algorithm design and analysis
constrained optimization
applications
distributed file systems
client/server
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
暂无机构信息
引用论文
Operating-Condition-Based Voltage Control Algorithm of Distributed Energy Storage Systems in Variable Energy Resource Integrated Distribution System.png)
Electronics
OAAI
ElectronicsIF0
OAAI分享收藏
查看更多内容