Order and balance in continuously-fault-tolerant distributions of objects

  • Authors:

  • George Coucopoulos;Nishith Goel;Amiya Nayak;Nicola Santoro

  • Affiliations:

  • School of Computer Science, Carleton University, Ottawa, ON, Canada;Cistel Technology Inc., Ottawa, ON, Canada;School of Information Technology and Engineering, University of Ottawa, Ottawa, ON, Canada;School of Computer Science, Carleton University, Ottawa, ON, Canada

  • Venue:
  • PDCN'06 Proceedings of the 24th IASTED international conference on Parallel and distributed computing and networks
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

A distributed object systems is said to be K-tolerant if every object is available after the simultaneous failure of up to K nodes. The problem is that a K-tolerant system, after failures, is no longer K -- tolerant; that is, subsequent failures may compromise the availability of the objects. A continuously K-tolerant system is one which starting from a K-tolerant configuration, after the failure of up to K nodes, reconfigures itself so to remain K-tolerant. The existing protocols for maintaining continuous K-tolerance do so without regard to the resulting structure of the available data. For example, if the distributed set of objects was sorted, this ordering would be most likely lost after restructuring. Analogously, a balanced distribution of the objects among the nodes might also be not achieved in the new distribution after reorganization. In this paper, we present a mechanism for maintaining continuous K-tolerance while keeping the load balanced and the objects sorted. The proposed solution uses minimum amount of replication and has a cost comparable to the one of the known unstructured solutions.