{"title":"简要公告:MUSIC:地理分布式服务的多站点输入一致性","authors":"Bharath Balasubramanian, R. Schlichting, P. Zave","doi":"10.1145/3212734.3212782","DOIUrl":null,"url":null,"abstract":"Geo-distributed services that are executed across multiple sites at a global scale are increasingly prevalent, and are at the core of the control plane tasked with managing the Virtual Network Functions (VNFs) of next-generation network infrastructure. A key building block of any replicated service of this type is logically shared state, an abstraction that is often implemented by having multiple copies of each data element and using one of any number of distributed protocols to enforce consistency with guarantees ranging from eventual to causal to sequential consistency. These solutions fail to meet the real needs of geo-distributed services found in a VNF control plane (and elsewhere), which are to provide guarantees strong enough to be useful, yet still efficiently implementable in a global network with larger latencies and a wider range of failure modes. Here, we propose a new solution to state consistency based on extending entry consistency, a paradigm originally developed for failure-free multi-processor systems, for use in geo-distributed services with failures. We outline the challenges associated with state consistency in such services, and describe a data-store called MUSIC (MUlti-SIte entry Consistency) that combines an eventually consistent key-value store with locking primitives to implement entry-consistent semantics.","PeriodicalId":198284,"journal":{"name":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Brief Announcement: MUSIC: Multi-Site Entry Consistencyfor Geo-Distributed Services\",\"authors\":\"Bharath Balasubramanian, R. Schlichting, P. Zave\",\"doi\":\"10.1145/3212734.3212782\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Geo-distributed services that are executed across multiple sites at a global scale are increasingly prevalent, and are at the core of the control plane tasked with managing the Virtual Network Functions (VNFs) of next-generation network infrastructure. A key building block of any replicated service of this type is logically shared state, an abstraction that is often implemented by having multiple copies of each data element and using one of any number of distributed protocols to enforce consistency with guarantees ranging from eventual to causal to sequential consistency. These solutions fail to meet the real needs of geo-distributed services found in a VNF control plane (and elsewhere), which are to provide guarantees strong enough to be useful, yet still efficiently implementable in a global network with larger latencies and a wider range of failure modes. Here, we propose a new solution to state consistency based on extending entry consistency, a paradigm originally developed for failure-free multi-processor systems, for use in geo-distributed services with failures. We outline the challenges associated with state consistency in such services, and describe a data-store called MUSIC (MUlti-SIte entry Consistency) that combines an eventually consistent key-value store with locking primitives to implement entry-consistent semantics.\",\"PeriodicalId\":198284,\"journal\":{\"name\":\"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-07-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3212734.3212782\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3212734.3212782","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Geo-distributed services that are executed across multiple sites at a global scale are increasingly prevalent, and are at the core of the control plane tasked with managing the Virtual Network Functions (VNFs) of next-generation network infrastructure. A key building block of any replicated service of this type is logically shared state, an abstraction that is often implemented by having multiple copies of each data element and using one of any number of distributed protocols to enforce consistency with guarantees ranging from eventual to causal to sequential consistency. These solutions fail to meet the real needs of geo-distributed services found in a VNF control plane (and elsewhere), which are to provide guarantees strong enough to be useful, yet still efficiently implementable in a global network with larger latencies and a wider range of failure modes. Here, we propose a new solution to state consistency based on extending entry consistency, a paradigm originally developed for failure-free multi-processor systems, for use in geo-distributed services with failures. We outline the challenges associated with state consistency in such services, and describe a data-store called MUSIC (MUlti-SIte entry Consistency) that combines an eventually consistent key-value store with locking primitives to implement entry-consistent semantics.