Placement of Data Replicas for Optimal Data Availability in Ring Networks |
| |
Affiliation: | Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong |
| |
Abstract: | This paper discusses the problem of placing data replicas in a ring network to maximize data availability. For read-any/write-all protocol, we prove that the equally spacing placement is optimal for read-dominant systems, while the grouping placement is optimal for write-dominant systems. For majority-voting protocol, we give some necessary conditions for optimal placements. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|