Response time behavior of distributed voting algorithms for managing replicated data

Voting is a simple and yet effective way of managing replicated data in dis tributed systems. In this paper we analyze its response time behavior. We i nvestigate a technique for obtaining the access time distribution for reque sts that access replicated data maintained by the distributed system. The t echnique is based on Petri net modeling and can be used to estimate the rel iability of real-time applications which must access replicated data with a deadline requirement. (C) 2000 Elsevier Science B.V. All rights reserved.