Abstract

Web service selection based on quality of service (QoS) has been a research focus in an environment where many similar web services exist. Current methods of service selection usually focus on a single service request at a time and the selection of a service with the best QoS at the user's own discretion. the selection does not consider multiple requests for the same functional web services. Usually, there are multiple service requests for the same functional web service in practice. in such situations, conflicts occur when too many requesters select the same best web service. This paper aims at solving these conflicts and developing a global optimal service selection method for multiple related service requesters, thereby optimizing service resources and improving performance of the system. It uses Euclidean distance with weights to measure degree of matching of services based on QoS. a 0-1 integral programming model for maximizing the sum of matching degree is created and consequently, a global optimal service selection algorithm is developed. the model, together with a universal and feasible optimal service selection algorithm, is implemented for global optimal service selection for multiple requesters (GOSSMR). Furthermore, to enhance its efficiency, Skyline GOSSMR is proposed. Time complexity of the algorithms is analyzed. We evaluate performance of the algorithms and the system through simulations. the simulation results demonstrate that they are more effective than existing ones. © 2011 IEEE.

Department(s)

Computer Science

Keywords and Phrases

0-1 integral programming; Euclidean distance; Matching degree; Skyline; Web service selection

International Standard Book Number (ISBN)

978-076954463-2

Document Type

Article - Conference proceedings

Document Version

Citation

File Type

text

Language(s)

English

Rights

© 2024 Institute of Electrical and Electronics Engineers, All rights reserved.

Publication Date

01 Jan 2011

Download

Full Text Link

Share

 
COinS