Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Schmietendorf, A., Dumke, R., Reitz, D.: SLA Management - Challenges in the Context of Web-Service-Based Infrastructures. In: Proceedings of the 2004 IEEE International Conference on Web Services, pp. 606–613 (2004)
Zeng, L., Benatallah, B., Dumas, M.: Quality Driven Web Services Composition. In: Proceedings of the 12th International Conference on World Wide Web, pp. 411–421 (2003)
Zeng, L., Benatallah, B., et al.: QoS-Aware Middleware for Web Services Composition. IEEE Transaction of Software Engineering 30(5), 311–327 (2004)
Liu, Y., Ngu, A.H.H., Zeng, L.: QoS Computation and Policing in Dynamic Web Service Selection. In: Proceedings of the 13th international World Wide Web Conference, pp. 66–73 (2004)
Yu, T., Lin, K.J.: Service Selection Algorithms for Web Services with End-to-End QoS Constraints. In: Proceedings of the 2004 IEEE International Conference on E-Commerce Technology, pp. 129–136 (2004)
Maximilien, E.M., Singh, M.P.: Toward Autonomic Web Services Trust and Selection. In: Proceedings of the 2nd International Conference on Service Oriented Computing, pp. 212–221 (2004)
Sharma, A., Adarkar, H., Sengupta, S.: Managing QoS through Prioritization in Web Services. In: Proceedings of the 4th International conference on Web Information Systems Engineering Workshops, pp. 140–148 (2003)
Levy, R., Nagarajarao, J., Pacifici, G., Spreitzer, M., Tantawi, A., Youssef, A.: Performance Management for Cluster Based Web Services. In: Proceedings of the 8th International Symposium on Integrated Network Management (2003)
Tian, M., Gramm, A., Naumowicz, T., Ritter, H., Schiller, J.: A Concept for QoS Integration in Web Services. In: Proceedings of the Fourth International Conference on Web Information Systems Engineering Workshops, pp. 149–155 (2003)
Yu, T., Lin, K.J.: The Design of QoS Broker Algorithms for QoS-Capable Web Services. In: Proceedings of the 2004 IEEE International Conference on e-Technology, e-Commerce and e-Service, pp. 17–24 (2004)
Shreedhar, M., Varghese, G.: Efficient Fair Queuing Using Deficit Round-Robin. IEEE/ACM Transaction on Networking 4(3), 375–385 (1996)
Apache XML Project, http://xml.apache.org/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tien, CM., Lee, CJ., Cheng, PW., Lin, YD. (2005). SOAP Request Scheduling for Differentiated Quality of Service. In: Dean, M., et al. Web Information Systems Engineering – WISE 2005 Workshops. WISE 2005. Lecture Notes in Computer Science, vol 3807. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11581116_7
Download citation
DOI: https://doi.org/10.1007/11581116_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30018-2
Online ISBN: 978-3-540-32287-0
eBook Packages: Computer ScienceComputer Science (R0)