Skip to main content
Log in

Constraints-Aware Scheduling for Transactional Services Composition

  • Regular Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

Composite Web services need transactional support to guarantee their consistent and reliable execution. Due to the long running and inter-organizational characteristics of Web services, current approaches for transactional Web services composition adopt compensation mechanism to maintain atomicity. A common assumption is that a compensation operation can be applied at any time with no cost. However, compensation operations are typically associated with temporal and cost constraints, which make compensation mechanism problematic in this new environment. To address this problem, we distinguish two types of scheduling for transactional Web services composition: time aware scheduling and cost aware scheduling. We devise several algorithms for scheduling, which can ensure the atomicity of composite services when compensation operations have temporal constraints, and assist composite services to maintain atomicity with minimum compensation cost when compensation operations have cost constraints. We benchmark our algorithms by simulations and the results show that our algorithm decreases the compensation cost and in turn improves the QoS of transactional services composition.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Little M. Models for Web services transactions. In Proc. the ACM SIGMOD International Conference on Management of Data, Paris, France, June 13–18, 2004, p.872.

  2. Freund T, Little M. Web services business activity (WS-BusinessActivity) Version 1.1. http://docs.oasis-open.org/ws-tx/wstx-wsba-1.1-spec-os/wstx-wsba-1.1-spec-os.html, accessed 10 November 2008.

  3. Li L, Liu C,Wang J. Deriving transactional properties of composite Web services. In Proc. the IEEE International Conference on Web Services, Salt Lake City, Utah, USA, July 9–13, 2007, pp.631–638.

  4. Alonso G, Casati F, Kuno H, Machiraju V. Web Services: Concepts, Architectures and Applications. Springer-Verlag, 2004.

  5. Benatallah B, Casati F, Toumani F. Web service conversation modeling: A cornerstone for E-business automation. IEEE Internet Computing, 2004, 8(1): 46–54.

    Article  Google Scholar 

  6. Pires P F, Benevides M R F, Mattoso M. Building reliable Web services composition. Lecture Notes in Computer Science, Vol. 2593, Springer, 2003, pp.59–72.

  7. Mikalsen T, Tai T, Rouvellou I. Transactional attitudes: Reliable composition of autonomous Web services. In Workshop on Dependable Middleware-Based Systems, Washington DC, USA, June, 2002.

  8. Vidyasankar K, Vossen G. A multi-level model for Web services composition. In Proc. the IEEE International Conference on Web Services, San Diego, California, USA, June 6–9, 2004, pp.462–469.

  9. Fauvet M C, Duarte H, Dumas M, Benatallah B. Handling transactional properties in Web service composition. In Proc. the International Conference on Web Information System Engineering, New York, USA, November 20–22, 2005, pp.273–289.

  10. Bhiri S, Perrin O, Godart C. Ensuring required failure atomicity of composite Web services. In Proc. the International Conference on World Wide Web, Chiba, Japan, May 10–14, 2005, pp.138–147.

  11. Montagut F, Molva R. Augmenting Web services composition with transactional requirements. In Proc. the IEEE International Conference on Web Services, Chicago, USA, September 18–22, 2006, pp.91–98.

  12. Jordan D, Evdemon J. Web services business process execution language version 2.0. http://docs.oasis-open.org/wsbpel/2.0/CS01/wsbpel-v2.0-CS01.html, accessed 10 Nov. 2008.

  13. Zeng L, Benatallah B, Ngu A H H, Dumas M, Kalagnanam J, Chang H. QoS-aware middleware for Web services composition. IEEE Transactions on Software Engineering, 2004, 30(5): 311–327.

    Article  Google Scholar 

  14. Garcia-Molina H, Salem K. Sagas. In Proc. the ACM SIGMOD International Conference on Management of Data, San Francisco, USA, May 27–29, 1987, pp.249–259.

  15. Greenfield P, Fekete A, Jang J, Kuo D. Compensation is not enough. In Proc. the International Enterprise Distributed Object Computing Conference, Brisbane, Australia, September 16–19, 2003, pp.232–239.

  16. Papazoglou M. Web Services: Principles and Technology. Prentice Hall, 2007.

  17. Maximilien E M, Singh M P. A framework and ontology for dynamic Web services selection. IEEE Internet Computing, 2004, 8(5): 84–93.

    Article  Google Scholar 

  18. Eder J, Panagos E, Rabinovich M. Time constraints in workflow systems. In Proc. the International Conference on Advanced Information System Engineering, Heidelberg, Germany, June 14–18, 1999, pp.286–300.

  19. Bettini C, Wang X S, Jajodia S. Temporal reasoning in workflow systems. Distributed and Parallel Databases, 2002, 11(3): 269–306.

    Article  MATH  Google Scholar 

  20. Kerzner H. Project Management: A System Approach to Planning, Scheduling, and Controlling. John Wiley & Sons, 2003.

  21. Tsang E. Foundations of Constraint Satisfaction. Academic Press, 1993.

  22. Liu A, Li Q, Huang L, Xiao M, Liu H. QoS-aware scheduling of Web services. In Proc. the International Conference on Web-Age Information Management, Zhangjiajie, China, July 20–22, 2008, pp.171–178.

  23. Davis L. Handbook of Genetic Algorithm. Van Nostrand Reinhold, 1991.

  24. Liu A, Li Q, Huang L, Xiao M. A declarative approach to enhancing the reliability of BPEL processes. In Proc. the IEEE International Conference on Web Services, Salt Lake City, Utah, USA, July 9–13, 2007, pp.272–279.

  25. Java genetic algorithms package (JGAP). http://jgap.sourceforge.net/, accessed 10 November 2008.

  26. Dalal S, Temel S, Little M, Potts M, Webber J. Coordinating business transactions on the Web. IEEE Internet Computing, 2003, 7(1): 30–39.

    Article  Google Scholar 

  27. Feingold M, Jeyaraman Ram. Web services coordination (WS-Coordination) version 1.1. http://docs.oasis-open.org/ws-tx/wstx-wscoor-1.1-spec-os/wstx-wscoor-1.1-specos.html, accessed 10 November 2008.

  28. Zhang A, Nodine M, Bhargava B, Bukhres O. Ensuring relaxed atomicity for flexible transactions in multidatabase systems. In Proc. the ACM SIGMOD International Conference on Management of Data, Minneapolis, USA, May 24–27, 1994, pp.67–78.

  29. Schuldt H, Alonso G, Beeri C, Schek H-J. Atomicity and isolation for transactional processes. ACM Transactions on Database Systems, 2002, 27(1): 63–116.

    Article  Google Scholar 

  30. Roberts J, Srinivasan K. Tentative hold protocol. http://www.w3.org/TR/tenthold-1/, accessed 10 November 2008.

  31. Rusinkiewicz M, Sheth A P. Specification and Execution of Transactional Workflows. Modern Database Systems: The Object Model, Interoperability, and Beyond, ACM Press and Addison-Wesley, 1995, pp.592–620.

  32. Liu A, Huang L, Li Q, Xiao M. Fault-tolerant orchestration of transactional Web services. In Proc. the International Conference on Web Information Systems Engineering, Wuhan, China, October 23–26, 2006, pp.90–101.

  33. Panagos E, Rabinovich M. Reducing escalation-related costs in WFMSs. NATO Advanced Study Institute on Workflow Management Systems and Interoperability, 1997.

  34. Canfora G, Penta M D, Esposito R, Villani M L. An approach for QoS-aware service composition based on genetic algorithms. In Proc. the International Conference on Genetic and Evolutionary Computation, Washington DC, USA, June 25–29, 2005, pp.1069–1075.

  35. Yu T, Zhang Y, Lin K-J. Efficient algorithms for Web services selection with end-to-end QoS constraints. ACM Transactions on Web, 2007, 1(1): 1–26.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to An Liu.

Additional information

Supported, in part, by the National Basic Research 973 Program of China under Grant No. 2003CB317006, and by a Strategic Research Grant from City University of Hong Kong under Grant No. 7002212.

This paper is an extended version of our previous conference paper [22].

Electronic Supplementary Material

Below is the link to the electronic supplementary material.

(PDF 64.1 kb)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liu, A., Liu, H., Li, Q. et al. Constraints-Aware Scheduling for Transactional Services Composition. J. Comput. Sci. Technol. 24, 638–651 (2009). https://doi.org/10.1007/s11390-009-9264-x

Download citation

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-009-9264-x

Keywords

Navigation