This paper presents a new replication control protocol tailored to environments where network partitions can only occur at a few well-defined partition points and are always the results of a gateway failure. The protocol implements the same 'write all read-one' rule as the available copy (AC) protocol. Unlike the AC protocol, this protocol divides servers holding copies into local servers that can communicate directly with each other and non-local servers that communicate with other servers through one or more gateways. While replicas stored on local servers are assumed to remain up to date as long as their server remains operational, replicas stored on non-local servers are required to maintain one or more volatile witnesses on the same LAN segment as the local servers and need to interrogate one of these witnesses before answering any user request.<>
{"title":"Using volatile witnesses to extend the applicability of available copy protocols","authors":"Jehan-Francois Pâris","doi":"10.1109/MRD.1992.242623","DOIUrl":"https://doi.org/10.1109/MRD.1992.242623","url":null,"abstract":"This paper presents a new replication control protocol tailored to environments where network partitions can only occur at a few well-defined partition points and are always the results of a gateway failure. The protocol implements the same 'write all read-one' rule as the available copy (AC) protocol. Unlike the AC protocol, this protocol divides servers holding copies into local servers that can communicate directly with each other and non-local servers that communicate with other servers through one or more gateways. While replicas stored on local servers are assumed to remain up to date as long as their server remains operational, replicas stored on non-local servers are required to maintain one or more volatile witnesses on the same LAN segment as the local servers and need to interrogate one of these witnesses before answering any user request.<<ETX>>","PeriodicalId":314844,"journal":{"name":"[1992 Proceedings] Second Workshop on the Management of Replicated Data","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127762325","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Ficus is a flexible replication facility with optimistic concurrency control designed to span a wide range of scales and network environments. Support for partitioned operation is fundamental to the Ficus design but was not widely exercised in early Ficus use. This paper reports recent experiences using Ficus in settings where some replicas are only occasionally connected to a network, and hence partitioned operation is the rule rather than the exception. The authors conclude that with some tuning, Ficus adapted quite well to primarily disconnected operation.<>
{"title":"Primarily disconnected operation: experiences with Ficus","authors":"J. Heidemann, T. Page, Richard G. Guy, G. Popek","doi":"10.1109/MRD.1992.242630","DOIUrl":"https://doi.org/10.1109/MRD.1992.242630","url":null,"abstract":"Ficus is a flexible replication facility with optimistic concurrency control designed to span a wide range of scales and network environments. Support for partitioned operation is fundamental to the Ficus design but was not widely exercised in early Ficus use. This paper reports recent experiences using Ficus in settings where some replicas are only occasionally connected to a network, and hence partitioned operation is the rule rather than the exception. The authors conclude that with some tuning, Ficus adapted quite well to primarily disconnected operation.<<ETX>>","PeriodicalId":314844,"journal":{"name":"[1992 Proceedings] Second Workshop on the Management of Replicated Data","volume":"50 26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127090605","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Discusses the group membership problem in distributed systems. The paper describes a set of group membership protocols that are developed as part of a toolkit for building distributed parallel applications on a cluster of workstations. The group membership service is the lowest layer in the toolkit, and it is the glue which unifies all the other layers. The group membership layer supports three protocols: weak, strong, and hybrid membership. These protocols differ significantly in the level of consistency and the number of messages exchanged in reaching agreement. This paper briefly describes each protocol with a focus on what is new about them and where they might be used.<>
{"title":"Strong, weak and hybrid group membership","authors":"F. Jahanian, W. Moran","doi":"10.1109/MRD.1992.242622","DOIUrl":"https://doi.org/10.1109/MRD.1992.242622","url":null,"abstract":"Discusses the group membership problem in distributed systems. The paper describes a set of group membership protocols that are developed as part of a toolkit for building distributed parallel applications on a cluster of workstations. The group membership service is the lowest layer in the toolkit, and it is the glue which unifies all the other layers. The group membership layer supports three protocols: weak, strong, and hybrid membership. These protocols differ significantly in the level of consistency and the number of messages exchanged in reaching agreement. This paper briefly describes each protocol with a focus on what is new about them and where they might be used.<<ETX>>","PeriodicalId":314844,"journal":{"name":"[1992 Proceedings] Second Workshop on the Management of Replicated Data","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124672926","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Modeling the reliability of distributed systems requires a good understanding of the reliability of the components. Careful modeling allows highly fault-tolerant distributed applications to be constructed at the least cost. Realistic estimates can be found by measuring the performance of actual systems. An enormous amount of information about system performance can be acquired with no special privileges via the Internet. A distributed monitoring tool called a tattler is described. The system is composed of a group of tattler processes that monitor a set of selected hosts. The tattlers cooperate to provide a fault-tolerant distributed data base of information about the hosts they monitor. They use weak-consistency replication techniques to ensure their own fault-tolerance and the eventual consistency of the data base that they maintain.<>
{"title":"A replicated monitoring tool","authors":"D. Long","doi":"10.1109/MRD.1992.242608","DOIUrl":"https://doi.org/10.1109/MRD.1992.242608","url":null,"abstract":"Modeling the reliability of distributed systems requires a good understanding of the reliability of the components. Careful modeling allows highly fault-tolerant distributed applications to be constructed at the least cost. Realistic estimates can be found by measuring the performance of actual systems. An enormous amount of information about system performance can be acquired with no special privileges via the Internet. A distributed monitoring tool called a tattler is described. The system is composed of a group of tattler processes that monitor a set of selected hosts. The tattlers cooperate to provide a fault-tolerant distributed data base of information about the hosts they monitor. They use weak-consistency replication techniques to ensure their own fault-tolerance and the eventual consistency of the data base that they maintain.<<ETX>>","PeriodicalId":314844,"journal":{"name":"[1992 Proceedings] Second Workshop on the Management of Replicated Data","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129295803","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
One important bottleneck in research on replication management is the time needed for implementing algorithms in order to validate them. The author's approach, based on the fragmented object model, encourages re-usability of distributed abstractions for many replication management algorithms. He presents high-level building blocks for various replication protocols, ensuring different policies of consistency, replicated data management and failure handling.<>
{"title":"An object-oriented approach for replication management","authors":"Y. Gourhant","doi":"10.1109/MRD.1992.242613","DOIUrl":"https://doi.org/10.1109/MRD.1992.242613","url":null,"abstract":"One important bottleneck in research on replication management is the time needed for implementing algorithms in order to validate them. The author's approach, based on the fragmented object model, encourages re-usability of distributed abstractions for many replication management algorithms. He presents high-level building blocks for various replication protocols, ensuring different policies of consistency, replicated data management and failure handling.<<ETX>>","PeriodicalId":314844,"journal":{"name":"[1992 Proceedings] Second Workshop on the Management of Replicated Data","volume":"51 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120818175","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：