Global Optimal Web Service Selection Model for Multiple Service Requests

Kang Guosheng; Liu Jianxun; Tang Mingdong; Liu Xiaoqing

Journal of Computer Research and Development > 2013 > 50(7): 1524-1533.

Kang Guosheng, Liu Jianxun, Tang Mingdong, Liu Xiaoqing. Global Optimal Web Service Selection Model for Multiple Service Requests[J]. Journal of Computer Research and Development, 2013, 50(7): 1524-1533.

Citation:

PDF (2046 KB)

Global Optimal Web Service Selection Model for Multiple Service Requests

1(Key Laboratory of Knowledge Processing and Networked Manufacture, Hunan University of Science and Technology, Xiangtan, Hunan, 411201) 2(Department of Computer Science, Missouri University of Science & Technology, Rolla, Missouri, MO 65401) 3(School of Computer Science, Fudan University, Shanghai 201203)

More Information

Published Date: July 14, 2013

Graphical Abstract

Abstract

Abstract

Web service selection based on quality of service (QoS) has been one of research focuses in service computing field. Current methods of service selection usually focus on a single service request or multiple service requests for co-selecting a shared service at a time, not considering the competitiveness among multiple independent service requests for the same functional Web services. A global optimal service selection model for multiple service requests, according to the matching degree (between service requests and Web services) and 0-1 integral programming, is proposed to solve the conflicts among service requests. A universal and feasible optimal service selection algorithm, named global optimal service selection for multiple requests (GOSSMR), is proposed to solve the model. Under the condition of meeting QoS requirements of service requests, too many requests selecting the same Web service at the same time can be avoided, thereby optimizing the service resources, avoiding the overload, and improving the performance of the system. The feasibility and effectiveness of the model and algorithm are verified by simulations in our work.
- Web service selection,
- matching degree,
- Euclidean distance,
- 0-1 integral programming,
- Skyline

FullText(HTML)

References (0)

[1]	Wu Jianhui, Zhang Jing, Li Renfa, Liu Zhaohua. A Multi-Subpopulation PSO Immune Algorithm and Its Application on Function Optimization[J]. Journal of Computer Research and Development, 2012, 49(9): 1883-1898.
[2]	Wang Bin. A Discrete Particle Swarm Optimization-based Algorithm for Polygonal Approximation of Digital Curves[J]. Journal of Computer Research and Development, 2010, 47(11): 1886-1892.
[3]	Jie Jing, Zeng Jianchao, Han Chongzhao. Self-Organized Particle Swarm Optimization Based on Feedback Control of Diversity[J]. Journal of Computer Research and Development, 2008, 45(3): 464-471.
[4]	Hu Jianxiu and Zeng Jianchao. A Two-Order Particle Swarm Optimization Model[J]. Journal of Computer Research and Development, 2007, 44(11): 1825-1831.
[5]	Ma Ming, Zhou Chunguang, Zhang Libiao, Ma Jie. Fuzzy Neural Network Optimization by a Multi-Objective Particle Swarm Optimization Algorithm[J]. Journal of Computer Research and Development, 2006, 43(12): 2104-2109.
[6]	Cui Zhihua and Zeng Jianchao. Modified Particle Swarm Optimization Based on Differential Model[J]. Journal of Computer Research and Development, 2006, 43(4): 646-653.
[7]	Zeng Jianchao and Cui Zhihua. A New Unified Model of Particle Swarm Optimization and Its Theoretical Analysis[J]. Journal of Computer Research and Development, 2006, 43(1): 96-100.
[8]	Dou Quansheng, Zhou Chunguang, Xu Zhongyu, Pan Guanyu. Swarm-Core Evolutionary Particle Swarm Optimization in Dynamic Optimization Environments[J]. Journal of Computer Research and Development, 2006, 43(1): 89-95.
[9]	Liu Anfeng, Chen Zhigang, Long Guoping, and Zeng Zhiwen. A Resource Optimizing Scheduling Algorithm of Differentiated Service of Double Minimum Balance in Web Clusters[J]. Journal of Computer Research and Development, 2005, 42(11): 1969-1976.
[10]	Chen Hongzhou, Gu Guochang, and Kang Wangxing. A Sentient Particle Swarm Optimization[J]. Journal of Computer Research and Development, 2005, 42(8): 1299-1305.