The Community for Technology Leaders
Green Image
Issue No. 02 - April-June (2013 vol. 6)
ISSN: 1939-1374
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.
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

L. E. Moser, W. Zhao, P. Michael Melliar-Smith, H. Zhang and H. Chai, "Toward Trustworthy Coordination of Web Services Business Activities," in IEEE Transactions on Services Computing, vol. 6, no. , pp. 276-288, 2013.
172 ms
(Ver 3.3 (11022016))