{"title":"Using leases to support server-driven consistency in large-scale systems","authors":"Jian Yin, L. Alvisi, M. Dahlin, Calvin Lin","doi":"10.1109/ICDCS.1998.679726","DOIUrl":null,"url":null,"abstract":"The paper introduces volume leases as a mechanism for providing cache consistency for large scale, geographically distributed networks. Volume leases are a variation of leases, which were originally designed for distributed file systems. Using trace driven simulation, we compare two new algorithms against four existing cache consistency algorithms and show that our new algorithms provide strong consistency while maintaining scalability and fault tolerance. For a trace based workload of Web accesses, we find that volumes can reduce message traffic at servers by 40% compared to a standard lease algorithm, and that volumes can considerably reduce the peak load at servers when popular objects are modified.","PeriodicalId":289230,"journal":{"name":"Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"64","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCS.1998.679726","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 64
Abstract
The paper introduces volume leases as a mechanism for providing cache consistency for large scale, geographically distributed networks. Volume leases are a variation of leases, which were originally designed for distributed file systems. Using trace driven simulation, we compare two new algorithms against four existing cache consistency algorithms and show that our new algorithms provide strong consistency while maintaining scalability and fault tolerance. For a trace based workload of Web accesses, we find that volumes can reduce message traffic at servers by 40% compared to a standard lease algorithm, and that volumes can considerably reduce the peak load at servers when popular objects are modified.