Dynamically traveling web service clustering based on spatial and temporal aspects

  • Authors:

  • Yang Hao;Chen Junliang;Meng Xiangwu;Qiu Bingyu

  • Affiliations:

  • State Key laboratory of Networking and Switching Technology, Beijing University of Posts & Telecommunications, Beijing, China;State Key laboratory of Networking and Switching Technology, Beijing University of Posts & Telecommunications, Beijing, China;State Key laboratory of Networking and Switching Technology, Beijing University of Posts & Telecommunications, Beijing, China;State Key laboratory of Networking and Switching Technology, Beijing University of Posts & Telecommunications, Beijing, China

  • Venue:
  • ER'07 Proceedings of the 2007 conference on Advances in conceptual modeling: foundations and applications
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Traditional web service orchestration is always implemented by business process work flow or I/O matching, just takingWhat services provide and How to provide. But this method will invoke some problems including too many composite results, inefficiency, and useless service composition without taking account of When and Where services are provided. Based on divide-and-conquer rule, this paper provides a clustering algorithm based on spatial & temporal aspects which are used to describe spatial and temporal attributes of services, so When and Where are provided for service composition. After composite services cluster by cluster, the whole complex service is created and is sure to satisfy the time and space constraints. Testing cases illustrate that complex traveling services can be created and is optimized to meet users' requests.