Welcome to the InfoSci Platform
Reference Hub13
The Design of QoS Broker Algorithms for QoS-Capable Web Services

The Design of QoS Broker Algorithms for QoS-Capable Web Services

Tao Yu, Kwei-Jay Lin
Copyright: © 2004 |Volume: 1 |Issue: 4 |Pages: 18
ISSN: 1545-7362|EISSN: 1546-5004|ISSN: 1545-7362|EISBN13: 9781615204632|EISSN: 1546-5004|DOI: 10.4018/jwsr.2004100103
Cite Article Cite Article

MLA

Yu, Tao, and Kwei-Jay Lin. "The Design of QoS Broker Algorithms for QoS-Capable Web Services." IJWSR vol.1, no.4 2004: pp.33-50. http://doi.org/10.4018/jwsr.2004100103

APA

Yu, T. & Lin, K. (2004). The Design of QoS Broker Algorithms for QoS-Capable Web Services. International Journal of Web Services Research (IJWSR), 1(4), 33-50. http://doi.org/10.4018/jwsr.2004100103

Chicago

Yu, Tao, and Kwei-Jay Lin. "The Design of QoS Broker Algorithms for QoS-Capable Web Services," International Journal of Web Services Research (IJWSR) 1, no.4: 33-50. http://doi.org/10.4018/jwsr.2004100103

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

QoS (quality of service) support in Web services is an important issue since it ensures service usability and utility for each client and, in addition, improves server utilization. In this article, we present a QoS-capable Web service architecture, QCWS, by introducing a QoS broker module between service clients and providers (servers). The functions of the QoS broker module include tracking QoS information about servers, making selection decisions for clients, and negotiating with servers to get QoS agreements. We study two resource allocation algorithms (HQ and RQ) used by QoS brokers acting as the front-end of servers. The goals of the algorithms are to maximize the server resource usage while minimizing the QoS instability for each client. The first algorithm, HQ, assigns a homogeneous service level to all clients on the system and adjusts the service level according to the number of active clients. The second algorithm, RQ, assigns different service levels to clients according to their needs. Both algorithms try to minimize the resource reallocations for existing clients. The QoS performance and instability trade-offs are studied by simulation.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.