golding@cello.hpl.hp.com (Richard Golding) (08/25/90)
The following technical report is available by anonymous FTP from midgard.ucsc.edu (128.114.134.15). A paper copy may be obatined by writing: Technical Report Librarian Baskin Center for Computer Engineering & Information Sciences University of California Santa Cruz, CA 95064 The cost is $4.00 (US). Accessing Replicated Data in an Internetwork Richard Golding* Darrell D.E. Long Computer and Information Sciences University of California Santa Cruz, CA 95064 Technical Report UCSC-CRL-90-34 Abstract 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. ------ *Richard Golding was supported by Hewlett-Packard Laboratories, Concurrent Systems Project.