By Topic

General design of grid-based data replication schemes using graphs and a few rules

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
$31 $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)
Theel, O. ; Dept. of Comput. Sci., California Univ., Riverside, CA, USA ; Pagnia-Koch, H.

Grid-based data replication protocols have been proven to be extremely efficient due to the high availability and the low cost of read and write operations they offer. However, although each grid protocol uses logical grids, the semantics and interpreting algorithms vary from scheme to scheme. This has the disadvantage that switching from one protocol to another, results in a re-implementation of the new protocol. By designing a general framework which separates the policy from the mechanism this drawback can be overcome. The purpose of this paper is to present such a general framework for grid-based protocols. We show how to model various popular grid protocols as instances of the framework, thereby demonstrating that grid-based protocols which look quite different at first glance share a common concept of construction. Additionally, we explain how new grid-based protocols with particular properties can be designed by using the framework in a graphical way

Published in:

Distributed Computing Systems, 1995., Proceedings of the 15th International Conference on

Date of Conference:

30 May-2 Jun 1995