By Topic

High volume web service resource consumption

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Aspen Olmsted ; Center for Information Assurance Engineering, Department of Computer Science and Engineering, University of South Carolina, Columbia, 29208, USA ; Csilla Farkas

In this paper we investigate the problem of providing consistency, availability and durability for Web Service transactions that consume anonymous and attribute based resources. We show that the availability of the popular lazy replica update propagation method can be achieved while increasing it's durability and consistency. Our approach is based on an extension to the Buddy System, requiring that updates are preserved synchronously in two replicas, called buddies. Our system provides a new consistency constraint, Capacity Constraint, which allows the system to guarantee that resources are not over consumed and also allows for higher distribution of the consumption. Our method provides 1.) higher availability through the distribution of element master's by utilizing all available clusters, 2.) consistency by performing the complete transaction on a single set of clusters, and 3.) a guaranteed durability by updating two clusters synchronously with the transaction.

Published in:

Internet Technology And Secured Transactions, 2012 International Conference for

Date of Conference:

10-12 Dec. 2012