Quantifying the Efficiency , Scalability , and Robustness of WinFS Replication
msra(2006)
摘要
The WinFS storage platform supports updateanywhere, peer-to-peer data replication. Due to the wide range of possible system configurations, we st udy the performance of the novel data replication proto c l using simulation. Of interest are how many network messages are sent, the convergence time needed for a modified data object to be propagated to all sites, and how messages and convergence time are affected by failures in the network. The results for configurat ions of various real and synthetic network topologies sh ow an efficient network utilization since each site re ceives each modification at most once despite the peer-topeer architecture. In addition, convergence time is show n to be scalable as the number of sites increases. Final ly, the protocol’s robustness to link and site failures is quantified and shown to provide good performance in the face of lost messages and transient site unavailability.
更多查看译文
关键词
: replicated data,weak consistency,scalability,robustness,peer-to-peer
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络