Dynamic behaviour of the distributed tree quorum algorithm

Author

Kafri, Nedal ; Janecek, Jan

Author_Institution

Dept. of Comput. Sci. & Eng., Czech Tech. Univ., Prague, Czech Republic

fYear

2002

fDate

2002

Firstpage

517

Lastpage

524

Abstract

Mechanisms that ensure mutual access, replication and resilience to failures in large distributed systems can be based on quorum consensus. Effectiveness and scalability of the method selected are crucial. The aim of this paper is to present a message/time cost analysis of a distributed algorithm based on the tree quorum, which needs no global information, and has message complexity independent of the load. Results obtained for the different identifications of the requests (a requester´s identification, timestamp, and group priority) illustrate the flexibility of the method The algorithm supports priority, the feature important for current middleware technologies.

Keywords

client-server systems; communication complexity; distributed algorithms; software fault tolerance; synchronisation; tree data structures; distributed algorithm; dynamic behaviour; failure resilience; group priority; large distributed systems; message complexity; message time cost analysis; middleware; mutual access; quorum consensus; replication; requester identification; scalability; synchronization delay; timestamp; tree quorum; Algorithm design and analysis; Availability; Computer science; Costs; Delay; Distributed algorithms; Information analysis; Middleware; Resilience; Scalability;

fLanguage

English

Publisher

ieee

Conference_Titel

Distributed Computing Systems, 2002. Proceedings. 22nd International Conference on

ISSN

1063-6927

Print_ISBN

0-7695-1585-1

Type

conf

DOI

10.1109/ICDCS.2002.1022301

Filename

1022301