![](https://d3ilqtpdwi981i.cloudfront.net/vouWGmGtVKhzvT8w-uqBGxYyJP0=/425x550/smart/https://bepress-attached-resources.s3.amazonaws.com/uploads/ad/8a/b8/ad8ab87c-fa78-4896-8d49-d921453f9007/thumbnail_90b4620e-e75a-45e7-ae03-fd6aa65c4f00.jpg)
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.
Available at: http://works.bepress.com/wenbingzhao/44/