K2: Reading Quickly from Storage Across Many Datacenters
K2: Reading Quickly from Storage Across Many Datacenters
复制标题
DOI：
10.1109/dsn48987.2021.00034
复制
发表时间：
2021-06
期刊：
影响因子：
--
通讯作者：
Khiem Ngo;Haonan Lu;Wyatt Lloyd
中科院分区：
文献类型：
--
作者：
Khiem Ngo;Haonan Lu;Wyatt Lloyd
大规模和中等规模Web服务的基础设施现在跨越数十个地理上分散的网络中心。跨许多数据中心部署有可能通过为距离其位置更近的用户提供服务来显着减少最终用户延迟。但是，跨多个数据中心部署需要部分复制后端存储系统。反过来，这可能会牺牲许多数据中心的低延迟优势，特别是当存储系统保证将观察哪些操作时。我们提出的K2存储系统，提供了较低的延迟，大规模和中等规模的Web服务，使用部分复制的数据在许多数据中心具有强有力的保证：因果一致性，只读事务，和只写事务。K2为部分复制提供了最好的可能的最坏情况延迟，到远程数据中心的单次往返，并且通常使用新颖的复制方法、只写事务算法和只读事务算法来避免向遥远的数据中心发送任何请求。
The infrastructure available to large-scale and medium-scale web services now spans dozens of geographically dispersed datacenters. Deploying across many datacenters has the potential to significantly reduce end-user latency by serving users nearer their location. However, deploying across many datacenters requires the backend storage system be partially replicated. In turn, this can sacrifice the low latency benefits of many datacenters, especially when a storage system provides guarantees on what operations will observe. We present the K2 storage system that provides lower latency for large-scale and medium-scale web services using partial replication of data over many datacenters with strong guarantees: causal consistency, read-only transactions, and write-only transactions. K2 provides the best possible worst-case latency for partial replication, a single round trip to remote datacenters, and often avoids sending any requests to far away datacenters using a novel replication approach, write-only transaction algorithm, and read-only transaction algorithm.