You can view the full text of this article for free using the link below.

Title: Byzantine fault tolerance for session-oriented multi-tiered applications

Authors: Hua Chai; Wenbing Zhao

Addresses: Department of Electrical and Computer Engineering, Cleveland State University, Cleveland, OH 44115, USA ' Department of Electrical and Computer Engineering, Cleveland State University, Cleveland, OH 44115, USA

Abstract: This article presents a lightweight Byzantine fault tolerance (BFT) framework for session-oriented multi-tiered applications. We conclude that it is sufficient to use a lightweight BFT algorithm instead of a traditional BFT algorithm, based on a comprehensive study of the threat model to, and the state model of, the session-oriented multi-tiered applications. The lightweight BFT algorithm uses source ordering, rather than total ordering, of incoming requests to achieve Byzantine fault tolerant state-machine replication of such type of applications. The performance of the lightweight BFT framework is evaluated using a shopping cart application prototype built on the web services platform. The same shopping cart application is used as a running example to illustrate the problem we address and our proposed solution. Performance evaluation results obtained from the prototype implementation show that indeed our lightweight BFT algorithm incurs very insignificant overhead.

Keywords: Byzantine fault tolerance; lightweight BFT; multi-tiered applications; web services; service-oriented computing; trustworthy computing; shopping cart application; trust.

DOI: 10.1504/IJWS.2013.056578

International Journal of Web Science, 2013 Vol.2 No.1/2, pp.113 - 125

Available online: 25 Sep 2013 *

Full-text access for editors Access for subscribers Free access Comment on this article