This Article 
 Bibliographic References 
 Add to: 
Toward Trustworthy Coordination of Web Services Business Activities
April-June 2013 (vol. 6 no. 2)
pp. 276-288
Hua Chai, Cleveland State University, Cleveland
Honglei Zhang, Cleveland State University, Cleveland
Wenbing Zhao, Cleveland State University, Cleveland
P. Michael Melliar-Smith, University of California at Santa Barbara, Santa Barbara
Louise 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 the coordination of web services business activities (WS-BA) more trustworthy. 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,Web services,Protocols,Registers,Context,Algorithm design and analysis,Fault tolerance,web services,Business activity,Byzantine fault tolerance,distributed transaction,service-oriented computing,trustworthy computing
Hua Chai, Honglei Zhang, Wenbing Zhao, P. Michael Melliar-Smith, Louise E. Moser, "Toward Trustworthy Coordination of Web Services Business Activities," IEEE Transactions on Services Computing, vol. 6, no. 2, pp. 276-288, April-June 2013, doi:10.1109/TSC.2011.57
Usage of this product signifies your acceptance of the Terms of Use.