Document Type
Article
Publication Date
11-15-2011
Publication Title
IEEE Transactions on Services Computing
Abstract
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.
Repository Citation
Chai, Hua; Zhang, Hongle; Zhao, Wenbing; Melliar-Smith, P. M.; and Moser, L. E., "Towards Trustworthy Coordination for Web Services Business Activities" (2011). Electrical and Computer Engineering Faculty Publications. 265.
https://engagedscholarship.csuohio.edu/enece_facpub/265
DOI
10.1109/TSC.2011.57
Version
Postprint
Publisher's Statement
© 2011 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Volume
6
Issue
2
