IEEE Transactions on Services Computing

IEEE Transactions on Services Computing (TSC) is a journal that focuses on research on the algorithmic, mathematical, statistical and computational methods that are central in services computing; the emerging field of Service Oriented Architecture, Web Services, Business Process Integration, Solution Performance Management, Services Operations and Management. Read more about TSC

Expand your horizons with Colloquium, a monthly survey of abstracts from all CS transactions! Replaces OnlinePlus in January 2017.

From the November/December 2016 issue

Adaptive Service Selection According to the Service Density in Multiple Qos Aspects

By Jae-Hyun Cho, Han-Gyu Ko, and In-Young Ko

Featured article thumbnail imageIn task-oriented service computing, a user's computing goal is modeled and represented as a task, which is composed of activities that are performed by accessing service instances in a local environment. The abstract service requirements specified in an activity of a task are resolved and bound to service instances dynamically in runtime. When there are many candidate services that provide similar capabilities for a task, it is essential to consider quality of service (QoS) such as response time, latency, and availability to determine which service instances to use. Finding a service composition that meets the optimal level of quality is a well-known NP-hard problem—the time complexity for task-level (global) optimization increases exponentially as the number of services and the number of quality attributes increase. Although it is possible to use a heuristic approach that shows a reasonable response time with a certain level of service quality, this strategy often fails when there are hard QoS constraints that need to be considered in the task level. In this paper, to overcome this limitation, we propose an adaptive method of selecting services based on the hardness of QoS constraints. The basic idea is to sample services that represent a specific quality-value range. The quality-value range of candidate services is divided into smaller sub-ranges in which representative services are sampled and evaluated. At this time, the size of the QoS sub-ranges is determined adaptably based on the hardness of the QoS constraints. In a QoS sub-range, candidate services may have a similar QoS value for a quality attribute. We calculate the utility of candidate services in a QoS sub-range and sample the highest utility service. This process of sampling services and evaluating their utility value is repeated until it makes a composite service that has the highest level of global utility for a task. Our experiment results show that the proposed approach effectively improves the success rate of service composition while achieving a certain level of global optimality and maintaining a reasonable level of performance. Our approach shows up to 80 percent improvement in success rate in comparison to the existing heuristic approaches.

download PDF View the PDF of this article      csdl View this issue in the digital library

Editorials and Announcements



Guest Editorials

Call for Papers

Annual Index

Access Recently Published TSC Articles

RSS Subscribe to the RSS feed of latest TSC content added to the digital library.

Mail Sign up for the Transactions Connection Newsletter.