TY - JOUR
T1 - The Design of QoS Broker Algorithms for QoS-Capable Web Services
AU - yu, Tao
AU - Lin, Kwei Jay
PY - 2004/10
Y1 - 2004/10
N2 - 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.
AB - 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.
KW - HQ
KW - QoS broker
KW - QoS instability
KW - RQ
KW - Web services
KW - resource allocation algorithm
KW - server utilization
UR - https://www.scopus.com/pages/publications/85001697171
U2 - 10.4018/jwsr.2004100103
DO - 10.4018/jwsr.2004100103
M3 - 文章
AN - SCOPUS:85001697171
SN - 1545-7362
VL - 1
SP - 33
EP - 50
JO - International Journal of Web Services Research (IJWSR)
JF - International Journal of Web Services Research (IJWSR)
IS - 4
ER -