Call for Paper - September 2022 Edition
IJCA solicits original research papers for the September 2022 Edition. Last date of manuscript submission is August 22, 2022. Read More

Optimal Call Based Checkpointing for Orchestrated Web Services

Print
PDF
International Journal of Computer Applications
© 2011 by IJCA Journal
Volume 36 - Number 8
Year of Publication: 2011
Authors:
A. Vani Vathsala
10.5120/4515-6390

Vani A Vathsala. Article: Optimal Call Based Checkpointing for Orchestrated Web Services. International Journal of Computer Applications 36(8):44-50, December 2011. Full text available. BibTeX

@article{key:article,
	author = {A. Vani Vathsala},
	title = {Article: Optimal Call Based Checkpointing for Orchestrated Web Services},
	journal = {International Journal of Computer Applications},
	year = {2011},
	volume = {36},
	number = {8},
	pages = {44-50},
	month = {December},
	note = {Full text available}
}

Abstract

Web Services are built on service-oriented architecture which is based on the notion of building applications by discovering and orchestrating services available on the web. Complex business processes can be realized by discovering and orchestrating already available services on the web. In order to make these orchestrated web services resilient to faults, we proposed a simple and elegant checkpointing policy called "Call based Global Checkpointing of Orchestrated web services" which specifies that when a web service calls another web service the calling web service has to save its state. But performance of the web services implementing this policy reduces due to checkpointing overhead. In an effort to improvise this policy, we propose in this paper, a checkpointing policy which uses Predicted Execution Time and Mean Time Between Failures of the called web services to make checkpointing decisions. This policy aims at reducing the required number of Call based Checkpoints but at the same time maintains the resilience of web services to faults.

References

  • Tao Hu, Minyi Guo, Song Guo, Hirokazu Ozaki, Long Zheng, Kaori Ota, Mianxiong Dong.MTTF of Composite Web Services.International Symposium on Parallel and Distributed Processing with Applications, 978-0-7695-4190-7/10.
  • Zoltan Balogh, Emil Gatial, Michal Laclavik,Martin Maliska, and Ladislav Hluchy. Knowledge-Based Runtime Prediction of Stateful Web Services for Optimal Workflow Construction. LNCS 3911, pp. 599U607, 2006. Springer-Verlag Berlin Heidelberg 2006.
  • Nuno Laranjeiro, Marco Vieira, and Henrique Madeira.Predicting Tim-ing Failures in Web Services.ISBN: 978-3-642-04204-1. Springer-Verlag Berlin, Heidelberg l’2009.
  • Zhengdong Gao, Gengfeng Wu.Combining QoS-based Service Selection with Performance Prediction. Proceedings of the 2005 IEEE International Conference on e-Business Engineering (ICEBEŠ05) 0-7695-2430-3/05 l’ 2005 IEEE.
  • A.Vani Vathsala.Global Checkpointing of Orchestrated Web Services. Submitted to RAIT 2012, ISM Dhanbad. Paper Accepted for publication in IEEE Xplore.
  • Soumaya Marzouk, Afef Jmal MaLalej, and Mohamed Jmaiel. Aspect-Oriented Checkpointing Approach of Composed Web Services. F. Daniel and F.M. Facca (Eds.): ICWE 2010 Workshops, LNCS 6385, pp.301U312, 2010. Springer-Verlag Berlin Heidelberg 2010.
  • Susan D. Urban, Le Gao, Rajiv Shrestha, and Andrew Courter. Achieving Recovery in Service Composition with Assurance Points and Integration ? Rules: OTM 2010, Part I, LNCS 6426, pp. 428U437, 2010. l’ Springer-Verlag Berlin Heidelberg 2010.
  • Sagnika Sen, Haluk Demirkan and Michael Goul.Towards a Verifiable Checkpointing Scheme for Agent-based Interorganizational Workflow System Docking Station Standards.
  • Jens Happe.Predicting Mean Service Execution Times of Software Com-ponents Based on Markov Models. p 53-70, Proceedings of Lecture Notes in Computer Science 3712 Springer 2005, ISBN 3-540-29033-8.