QoS-Aware scheduling of web services

An Liu, Qing Li, Liusheng Huang, Mingjun Xiao, Hai Liu

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

7 Citations (Scopus)

Abstract

QoS-Aware web services composition has recently received much attention. While most work focused on service selection, we study QoS in another stage of the life cycle of composite services, namely, scheduling. An interesting problem is whether we can obtain better QoS via scheduling even when the component services have been fixed. In this paper, we propose an approach to find an optimal (near-optimal) schedule with the least cancellation cost, which can further improve the overall QoS of composite services. An approach to analyze the expected cancellation cost of a schedule of a composite service is proposed and QoS-Aware service scheduling is formalized as a Constraint Satisfaction Optimization Problem (CoSOP). Two algorithms - heuristic backtracking and genetic algorithm - are presented to find an optimal (near-optimal) schedule, and their performance is studied by simulations. Preliminary experimental results show that our approach is effective.

Original languageEnglish
Title of host publicationProceedings - The 9th International Conference on Web-Age Information Management, WAIM 2008
Pages171-177
Number of pages7
DOIs
Publication statusPublished - 24 Sep 2008
Externally publishedYes
Event9th International Conference on Web-Age Information Management, WAIM 2008 - Zhangjiajie, China
Duration: 20 Jul 200822 Jul 2008

Publication series

NameProceedings - The 9th International Conference on Web-Age Information Management, WAIM 2008

Conference

Conference9th International Conference on Web-Age Information Management, WAIM 2008
CountryChina
CityZhangjiajie
Period20/07/0822/07/08

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems and Management

Cite this