CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Optimal Call Based Checkpointing for Orchestrated Web Services

by A. Vani Vathsala
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 36 - Number 8
Year of Publication: 2011
Authors: A. Vani Vathsala
10.5120/4515-6390

A. Vani Vathsala . Optimal Call Based Checkpointing for Orchestrated Web Services. International Journal of Computer Applications. 36, 8 ( December 2011), 44-50. DOI=10.5120/4515-6390

@article{ 10.5120/4515-6390,
author = { A. Vani Vathsala },
title = { Optimal Call Based Checkpointing for Orchestrated Web Services },
journal = { International Journal of Computer Applications },
issue_date = { December 2011 },
volume = { 36 },
number = { 8 },
month = { December },
year = { 2011 },
issn = { 0975-8887 },
pages = { 44-50 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume36/number8/4515-6390/ },
doi = { 10.5120/4515-6390 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:22:41.138651+05:30
%A A. Vani Vathsala
%T Optimal Call Based Checkpointing for Orchestrated Web Services
%J International Journal of Computer Applications
%@ 0975-8887
%V 36
%N 8
%P 44-50
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
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
  1. 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.
  2. 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.
  3. 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.
  4. 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.
  5. A.Vani Vathsala.Global Checkpointing of Orchestrated Web Services. Submitted to RAIT 2012, ISM Dhanbad. Paper Accepted for publication in IEEE Xplore.
  6. 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.
  7. 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.
  8. Sagnika Sen, Haluk Demirkan and Michael Goul.Towards a Verifiable Checkpointing Scheme for Agent-based Interorganizational Workflow System Docking Station Standards.
  9. 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.
Index Terms

Computer Science
Information Sciences

Keywords

Checkpoints Web Services Mean Time Between Failures Orchestration

Powered by PhDFocusTM