Mirroring is a popular technique for enhancing file availability.The authors incorporate this technique into the LH* algorithms forscalable distributed linear hash files. Several schemes for mirroringLH* files are presented in this paper. The schemes increase theavailability of LH* files in the presence of node failures. Every recordremains accessible in the presence of a single node failure, and usuallyin the presence of multiple-node failures. The price is, as usual, twiceas much storage for data, and an increase in the number of messages. Thedifferent schemes are characterized by different trade-offs, and theyaccommodate diverse application requirements. The additional messagingcost per insert is about the same for all the schemes, and is roughlyonly one message. The cost of a bucket recovery may in contrast varygreatly, from one message for one type of scheme, to a few for another,and many for yet another
展开▼
