【摘要】 针对在对称度量空间上多服务需求的k—服务器占线问题,研究问题空间为k+2(度量空间上有k+2个顶点,但只有k个服务器)时的一个特例:即在任意时刻都同时有两个服务需求提出。建立了该问题的数学模型,给出了公平原则策略,该策略能使得任意两个服务器完成服务后花费费用之差不大于某个固定常数;进行了相应的策略分析和竞争比的证明,并同工作函数策略进行了比较。更多还原

【Abstract】 For the on-line-server problem with multi-request on symmetry metric space,this paper focuses on the case of twin-request ondimension space(possesses vertexes but onlyservers).The corresponding model is proposed and fair principle strategy,which can ensure the difference of the cost of every two servers is no larger than a fixed constant,is designed.We provide the competitive ratio of fair principle strategy,and compare it with the work function strategy.更多还原