模拟广域复制

EW 7 Pub Date : 1996-09-09 DOI:10.1145/504450.504496

S. Mullender, M. V. D. Valk

{"title":"模拟广域复制","authors":"S. Mullender, M. V. D. Valk","doi":"10.1145/504450.504496","DOIUrl":null,"url":null,"abstract":"We describe our experiences with simulating replication algorithms for use in far flung distributed systems. The algorithms under scrutiny mimic epidemics. Epidemic algorithms seem to scale and adapt to change (such as varying replica sets) well. The loose consistency guarantees they make seem more useful in applications where availability strongly outweighs correctness; e.g., distributed name service.","PeriodicalId":137590,"journal":{"name":"EW 7","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Simulating wide-area replication\",\"authors\":\"S. Mullender, M. V. D. Valk\",\"doi\":\"10.1145/504450.504496\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We describe our experiences with simulating replication algorithms for use in far flung distributed systems. The algorithms under scrutiny mimic epidemics. Epidemic algorithms seem to scale and adapt to change (such as varying replica sets) well. The loose consistency guarantees they make seem more useful in applications where availability strongly outweighs correctness; e.g., distributed name service.\",\"PeriodicalId\":137590,\"journal\":{\"name\":\"EW 7\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-09-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"EW 7\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/504450.504496\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"EW 7","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/504450.504496","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

我们描述了在远程分布式系统中模拟复制算法的经验。被审查的算法模拟了流行病。流行病算法似乎可以很好地扩展和适应变化(例如不同的副本集)。松散的一致性保证了它们在可用性远远超过正确性的应用程序中显得更有用;例如，分布式名称服务。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Simulating wide-area replication

We describe our experiences with simulating replication algorithms for use in far flung distributed systems. The algorithms under scrutiny mimic epidemics. Epidemic algorithms seem to scale and adapt to change (such as varying replica sets) well. The loose consistency guarantees they make seem more useful in applications where availability strongly outweighs correctness; e.g., distributed name service.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

EW 7

自引率

0.00%

发文量