论文部分内容阅读
提出了多需求的k 服务器问题,建立了数学模型.研究了问题空间为k+2时的一个特例:即在任一时刻点都同时有两个服务需求提出.给出了此特例的工作函数策略,进行了相应的策略分析并给出了竞争比的证明.关于成对及多需求k 服务器问题的一般情形的策略设计及理论证明仍然是公开问题.
A multi-demand k-server problem is proposed and a mathematical model is established.A special case of problem space k + 2 is studied: at the same time, there are two service requirements simultaneously.A working function strategy , A corresponding strategy analysis is given and a proof of the competition ratio is given.The strategy design and theoretical proofs of the general case of paired and multi-demand k-server problems are still open questions.