Copia digital. Madrid : Ministerio de Educación, Cultura y Deporte. Subdirección General de Coordinación Bibliotecaria, 201

Chai, Hua

Melliar-Smith, P. M.

Moser, L. E.

Zhang, Hongle

Zhao, Wenbing

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

EngagedScholarship @ Cleveland State University

English

Towards Trustworthy Coordination for Web Services Business Activities

Biblioteca Virtual de Prensa Histórica (Virtual Library of Historical Newspapers)

La Abeja montañesa : Periódico de intereses locales: Año X Número 2335 - 1866 julio 9

Cleveland-Marshall College of Law

https://engagedscholarship.csuohio.edu/cgi/viewcontent.cgi?article=1273&amp;context=enece_facpub

La Abeja montañesa : Periódico de intereses locales: Año X Número 2335 - 1866 julio 9

Abstract

Similar works

Full text

Available Versions

EngagedScholarship @ Cleveland State University

Biblioteca Virtual de Prensa Histórica (Virtual Library of Historical Newspapers)

Cleveland-Marshall College of Law