08/01/1990 09:00 AM
Computer Science
When accessing a replicated data object across an internetwork, the time to access different replicas is non-uniform. Further, the probability that a particular replica is inaccessible is much higher in an internetwork than in a local-area network because of partitions and the many intermediate hosts and networks that can fail. We report three replica- accessing algorithms which can be tuned to minimize either the time spent on the access or the number of messages sent. We have obtained performance results for these algorithms by simulation. We find an inverse relationship between the time spent processing an access and the number of messages required to complete the access.
