| 成对需求的局内k-服务器问题及其工作函数策略 |
| |
| 引用本文： | 马卫民,陈国青. 成对需求的局内k-服务器问题及其工作函数策略[J]. 系统工程理论与实践, 2005, 25(7): 98-104. DOI: 10.12011/1000-6788(2005)7-98 |
| |
| 作者姓名： | 马卫民 陈国青 |
| |
| 作者单位： | (1)清华大学经济管理学院;(2)西安工业学院经济管理学院 |
| |
| 基金项目： | 国家自然科学基金(70401006，70231010)，中国博士后科学基金(2003034014) |
| |
| 摘 要： | 提出了多需求的k 服务器问题,建立了数学模型.研究了问题空间为k+2时的一个特例:即在任一时刻点都同时有两个服务需求提出.给出了此特例的工作函数策略,进行了相应的策略分析并给出了竞争比的证明.关于成对及多需求k 服务器问题的一般情形的策略设计及理论证明仍然是公开问题.
|
| 关 键 词： | 局内问题 成对需求 工作函数 竞争比 |
| 文章编号： | 1000-6788(2005)07-0098-07 |
| 修稿时间： | 2004-06-22 |
On-line k-Server Problem with Twin-request and Its Work Function Algorithm |
| |
| MA Wei-min,CHEN Guo-qing. On-line k-Server Problem with Twin-request and Its Work Function Algorithm[J]. Systems Engineering —Theory & Practice, 2005, 25(7): 98-104. DOI: 10.12011/1000-6788(2005)7-98 |
| |
| Authors: | MA Wei-min CHEN Guo-qing |
| |
| Affiliation: | (1)School of Economics and Management,Tsinghua University(2)School of Economics and Management,Xi'an Institute of Technology |
| |
| Abstract: | In contrast to the conventional k-sever problem with the assumption of only one request occurring at each step, we propose to investigate the k-server problem with multi-request for an on-line selection scheme. Firstly, we introduce and explore the nature model of k-server problem with multi-request. Ouranalysis further focuses on the case of twin-request, namely, at each step, two requests occur and the on-line player must choose two servers at the same time to satisfy the requests. We employ the Work Function Algorithm to solve it and give the relevant analysis and competitive ratio proof. The general cases oftwin-request and multi-request are still open. |
| |
| Keywords: | on-line problem twin-request work function competitive ratio |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《系统工程理论与实践》浏览原始摘要信息 |
|
点击此处可从《系统工程理论与实践》下载全文 |
