A K-Median Facility Location Agent for Low-Cost Service Selection in Digital Community Network  

作　　者：GAO Cong MA Jianfeng 

机构地区：[1]School of Computer Science and Technology, Xidian University, Xi'an 710071, Shaanxi Province, P. R. China

出　　处：《China Communications》2014年第11期174-186,共13页中国通信（英文版）

基　　金：This work is supported by Program for the Key Program of NSFC-Guangdong Union Foundation （U1135002）, Major national S＆T program （2011ZX03005-002）, National Natural Science Foundation of China （60872041, 61072066）, the Fundamental Research Funds for the Central Universities （JY10000903001, JY10000901034, K5051203010） and the GAD Pre-Research Foundation （9140A 15040210HK61 ）.

摘　　要：With the increasing number of web services, it becomes a difficult task for an ordinary user to select an appropriate service. Hence, it is conventional that users in a digital community network take part in a collaborative mechanism for the purpose of service selection. The participation usually brings unnecessary burdens for users, such as giving opinions, storing service information. Extra communication overhead hinders the performance of the network. Thus, the community administrators are facing a problem of how to obtain an overall service selection result for the whole community readily and effectively. To address this problem, we present a k-median facility location agent model. The model analyzes the procedure of service selection through five entities and six types of messages. Two algorithms are elaborated in pursuit of a global optimization concerning connection costs between users and facilities where services are deployed. To evaluate our model, we conduct extensive simulations and present a detailed analysis of the simulation results.With the increasing number of web services,it becomes a difficult task for an ordinary user to select an appropriate service.Hence,it is conventional that users in a digital community network take part in a collaborative mechanism for the purpose of service selection.The participation usually brings unnecessary burdens for users,such as giving opinions,storing service information.Extra communication overhead hinders the performance of the network.Thus,the community administrators are facing a problem of how to obtain an overall service selection result for the whole community readily and effectively.To address this problem,we present a A-median facility location agent model.The model analyzes the procedure of service selection through five entities and six types of messages.Two algorithms are elaborated in pursuit of a global optimization concerning connection costs between users and facilities where services are deployed.To evaluate our model,we conduct extensive simulations and present a detailed analysis of the simulation results.

关 键 词：web services service selection k-median low cost service providers 

分 类 号：TP393[自动化与计算机技术—计算机应用技术] TU984.12[自动化与计算机技术—计算机科学与技术]