Efficient fair queueing using deficit round-robin
IEEE/ACM Transactions on Networking (TON)
Quality driven web services composition
WWW '03 Proceedings of the 12th international conference on World Wide Web
QoS-Aware Middleware for Web Services Composition
IEEE Transactions on Software Engineering
The Design of QoS Broker Algorithms for QoS-Capable Web Services
EEE '04 Proceedings of the 2004 IEEE International Conference on e-Technology, e-Commerce and e-Service (EEE'04)
SLA Management - Challenges in the Context of Web-Service-Based Infrastructures
ICWS '04 Proceedings of the IEEE International Conference on Web Services
QoS computation and policing in dynamic web service selection
Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
Service Selection Algorithms for Web Services with End-to-End QoS Constraints
CEC '04 Proceedings of the IEEE International Conference on E-Commerce Technology
Toward autonomic web services trust and selection
Proceedings of the 2nd international conference on Service oriented computing
Managing QoS through prioritization in web services
WISEW'03 Proceedings of the Fourth international conference on Web information systems engineering workshops
A concept for QoS integration in web services
WISEW'03 Proceedings of the Fourth international conference on Web information systems engineering workshops
Achieving Predictability and Service Differentiation in Web Services
ICSOC-ServiceWave '09 Proceedings of the 7th International Joint Conference on Service-Oriented Computing
Building web services middleware with predictable service execution
WISE'10 Proceedings of the 11th international conference on Web information systems engineering
Hi-index | 0.00 |
This paper presents a SOAP request scheduling algorithm for differentiated quality of service. The scheduling algorithm can be deployed on a Web services server or any server that processes SOAP requests. Due to the resource-intensive security processing of SOAP messages, this research implements the scheduling algorithm on a QoS security server. The security server schedules the requests forwarded from the Web services server for the security processing and then sends the valid requests back to the Web services server for executing the Web services. The design of the scheduling algorithm is derived from the traditional deficit round-robin scheduling. However, the scheduling algorithm schedules requests according to the probed CPU resource consumption of requests. In the evaluation, the scheduling algorithm reveals the service differentiation on the throughput and response time and the little scheduling overhead. The resource utilizations are measured to prove the security processing is much more resource-intensive than the Web services execution.