• Publication
  • PrePrints
  • Abstract - Toward Trustworthy Coordination of Web Services Business Activities
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Toward Trustworthy Coordination of Web Services Business Activities
PrePrint
ISSN: 1939-1374
ASCII Text
x 
 
Hua Chai, Honglei Zhang, Wenbing Zhao, P.M. Melliar-Smith, L.E. Moser, "Toward Trustworthy Coordination of Web Services Business Activities," IEEE Transactions on Services Computing, vol. 99, no. 1, pp. , , 5555.
 
 
BibTex
x
 
@article{ 10.1109/TSC.2011.57,
author = {Hua Chai and Honglei Zhang and Wenbing Zhao and P.M. Melliar-Smith and L.E. Moser},
title = {Toward Trustworthy Coordination of Web Services Business Activities},
journal ={IEEE Transactions on Services Computing},
volume = {99},
number = {1},
issn = {1939-1374},
year = {5555},
doi = {http://doi.ieeecomputersociety.org/10.1109/TSC.2011.57},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Services Computing
TI - Toward Trustworthy Coordination of Web Services Business Activities
IS - 1
SN - 1939-1374
SP
EP
EPD -
A1 - Hua Chai,
A1 - Honglei Zhang,
A1 - Wenbing Zhao,
A1 - P.M. Melliar-Smith,
A1 - L.E. Moser,
PY - 5555
KW - Business Activity
KW - Byzantine fault tolerance
KW - service oriented computing
KW - trustworthy computing
KW - Web Services
KW - distributed transaction
VL - 99
JA - IEEE Transactions on Services Computing
ER -
 
Hua Chai, Cleveland State University, Cleveland
Honglei Zhang, Cleveland State University, Cleveland
Wenbing Zhao, Cleveland State University, Cleveland
P.M. Melliar-Smith, University of California at Santa Barbara, Santa Barbara
L.E. Moser, University of California at Santa Barbara, Santa Barbara
We present a lightweight Byzantine fault tolerance (BFT) algorithm, which can be used to render more trustworthy the coordination of Web Services Business Activities (WS-BA). The lightweight design of the BFT algorithm is the result of a comprehensive study of the threats to the WS-BA Coordination services and a careful analysis of the state model of WS-BA. The lightweight BFT algorithm uses source ordering, rather than total ordering, of incoming requests to achieve Byzantine fault tolerant, state-machine replication of the WS-BA Coordination services. We have implemented the lightweight BFT algorithm, and incorporated it into the open-source Kandula framework which implements the WS-BA specification with the WS-BA-I extension. Performance evaluation results obtained from the prototype implementation confirm the efficiency and effectiveness of our lightweight BFT algorithm, compared to traditional BFT techniques.
Index Terms:
Business Activity, Byzantine fault tolerance, service oriented computing, trustworthy computing, Web Services, distributed transaction
Citation:
Hua Chai, Honglei Zhang, Wenbing Zhao, P.M. Melliar-Smith, L.E. Moser, "Toward Trustworthy Coordination of Web Services Business Activities," IEEE Transactions on Services Computing, 11 Nov. 2011. IEEE computer Society Digital Library. IEEE Computer Society, <http://doi.ieeecomputersociety.org/10.1109/TSC.2011.57>
Usage of this product signifies your acceptance of the Terms of Use.