QoS Browsing for Web Service Selection

  • Authors:
  • Chen Ding;Preethy Sambamoorthy;Yue Tan

  • Affiliations:
  • Department of Computer Science, Ryerson University, Canada;Department of Computer Science, Ryerson University, Canada;School of Software, Tsinghua University, China

  • Venue:
  • ICSOC-ServiceWave '09 Proceedings of the 7th International Joint Conference on Service-Oriented Computing
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In most of current research works on Quality of Service (QoS) based web service selection, searching is usually the dominant way to find the desired services. However, sometimes, requestors may not have the knowledge of the available QoS attributes and their value ranges in the registry, or they may only have vague QoS requirements. Under this situation, we believe that browsing is a more appropriate way to help the QoS-based service selection process. In this paper, we propose an interactive QoS browsing mechanism to first show an overview of the QoS value distribution to requestors and then gradually present more and more detailed views on some requestor interested value ranges. We find that interval data (or more generally symbolic data) is a more proper type to represent the QoS value, compared with the single valued numerical data. So we use interval clustering algorithms to implement our browsing system. The experiment compares the performance of using different distance measures and shows the effectiveness of the interval clustering algorithm we use. We also use a sample data set to illustrate the interactive QoS browsing process.