Service selection algorithms for web services with end-to-end QoS constraints

Tao Yu*, Kwei Jay Lin

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

140 Scopus citations

Abstract

Web services are new forms of Internet software that can be universally deployed and invoked using standard protocol. Services from different providers can be integrated to provide composite services. In this paper, we study the end-to-end QoS issues of composite service by utilizing a QoS broker that is responsible for coordinating the individual service component to meet the quality constraint. We design the service selection algorithms used by QoS brokers to meet end-to-end QoS constraints. The objective of the algorithms is to maximize the user-defined utility while meeting the end-to-end delay constraint. We model the problem as the Multiple Choice Knapsack Problem (MCKP) and provide efficient solutions. The algorithms are tested for their performance.

Original languageEnglish
Title of host publicationProceedings - IEEE International Conference on E-Commerce Technology, CEC 2004
EditorsM. Bichler, J.-Y. Chung
Pages129-136
Number of pages8
StatePublished - 2004
Externally publishedYes
EventProceedings - IEEE International Conference on E-Commerce Technology, CEC 2004 - San Diego, CA, United States
Duration: 06 07 200409 07 2004

Publication series

NameProceedings - IEEE International Conference on E-Commerce Technology, CEC 2004

Conference

ConferenceProceedings - IEEE International Conference on E-Commerce Technology, CEC 2004
Country/TerritoryUnited States
CitySan Diego, CA
Period06/07/0409/07/04

Fingerprint

Dive into the research topics of 'Service selection algorithms for web services with end-to-end QoS constraints'. Together they form a unique fingerprint.

Cite this