基于非精确网络状态信息的多服务器选择  

Multi-Server Selection with Imprecise State Information

作　　者：常恒[1] 张凌[1] 董守斌[1] 汤立群[1] 贾维嘉[2] 

机构地区：[1]华南理工大学信息网络工程研究中心,广州510640 [2]香港城市大学电脑工程和资讯科技系

出　　处：《小型微型计算机系统》2005年第8期1286-1291,共6页Journal of Chinese Computer Systems

基　　金：国家"八六三"计划项目(2001AA121012)资助;广东省计算机网络重点实验室项目(粤教科[2001]27号)资助.

摘　　要：服务器复制经常被用来作为改进处理大量客户请求的服务能力的方法.在采用服务器复制时,一个关键的问题是客户如何确定哪一个服务器是最好的.通过一个简易的服务器模型,研究了在延时非精确的网络情形下,通过采用智能的票据探测技术,同时搜索延时较小的网络路径并探测目的服务器性能来进行多服务器选择的算法.仿真结果显示,与其它几种多服务器选择算法比较,由于综合考虑了服务器延时和网络延时的最优,我们的算法可以取得最好的性能.Server replication is an approach often used to improve ability of a service to handle a large number of clients. When replication is used, the primary concern is how a client may discover which server is the best to use. This paper adopts a simple server model and investigates an efficient kind of algorithms for multi-server selection under the condition of imprecise network delay, using approach of ticket-based probing to search the path with short delay and probe the server capability at the same time. Compared with several other multi-server selection algorithms, the simulation results demonstrate that since our algorithms try to optimal the server and the path delay at the same time, they can achieve the best performances.

关 键 词：多服务器选择 不精确网络状态 选播 票据探测 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]