Towards Trustworthy Coordination for Web Services Business Activities

Hua Chai; Hongle Zhang; Wenbing Zhao; P. M. Melliar-Smith; L. E. Moser

doi:10.1109/TSC.2011.57

Towards Trustworthy Coordination for Web Services Business Activities

Hua Chai, Hongle Zhang, Wenbing Zhao, P. M. Melliar-Smith, L. E. Moser

Research output: Contribution to journal › Article › peer-review

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.

Original language	American English
Journal	IEEE Transactions on Services Computing
Volume	6
DOIs	https://doi.org/10.1109/TSC.2011.57
State	Published - Nov 15 2011

Disciplines

Electrical and Computer Engineering

Access to Document

10.1109/TSC.2011.57License: CC BY

Towards Trustworthy Coordination for Web Services Business ActiviFinal published version, 2.24 MBLicense: CC BY

Cite this

@article{9102721de08249d4ba7ae432e4c3d79d,

title = "Towards Trustworthy Coordination for Web Services Business Activities",

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.",

author = "Hua Chai and Hongle Zhang and Wenbing Zhao and Melliar-Smith, \{P. M.\} and Moser, \{L. E.\}",

year = "2011",

month = nov,

day = "15",

doi = "10.1109/TSC.2011.57",

language = "American English",

volume = "6",

journal = "IEEE Transactions on Services Computing",

}

TY - JOUR

T1 - Towards Trustworthy Coordination for Web Services Business Activities

AU - Chai, Hua

AU - Zhang, Hongle

AU - Zhao, Wenbing

AU - Melliar-Smith, P. M.

AU - Moser, L. E.

PY - 2011/11/15

Y1 - 2011/11/15

N2 - 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.

AB - 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.

UR - https://engagedscholarship.csuohio.edu/enece_facpub/265

U2 - 10.1109/TSC.2011.57

DO - 10.1109/TSC.2011.57

M3 - Article

VL - 6

JO - IEEE Transactions on Services Computing

JF - IEEE Transactions on Services Computing

ER -

Towards Trustworthy Coordination for Web Services Business Activities

Abstract

Disciplines

Access to Document

Other files and links

Cite this