Location, location, location!: modeling data proximity in the cloud

Hotnets-IX Pub Date : 2010-10-20 DOI:10.1145/1868447.1868462
B. Tiwana, M. Balakrishnan, M. Aguilera, Hitesh Ballani, Z. Morley Mao
{"title":"Location, location, location!: modeling data proximity in the cloud","authors":"B. Tiwana, M. Balakrishnan, M. Aguilera, Hitesh Ballani, Z. Morley Mao","doi":"10.1145/1868447.1868462","DOIUrl":null,"url":null,"abstract":"Cloud applications have increasingly come to rely on distributed storage systems that hide the complexity of handling network and node failures behind simple, data-centric interfaces (such as PUTs and GETs on key-value pairs). While these interfaces are very easy to use, the application is completely oblivious to the location of its data in the network; as a result, it has no way to optimize the placement of data or computation. In this paper, we propose exposing the network location of data to applications. The primary challenge is that data does not usually exist at a single point in the network; it can be striped, replicated, cached and coded across different locations, in arbitrary ways that vary across storage systems. For example, an item that is synchronously mirrored in both Seattle and London will appear equally far from both locations for writes, but equally close to both locations for reads. Accordingly, we describe Contour, a system that allows applications to query and manipulate the location of data without requiring them to be aware of the physical machines storing the data, the replication protocols used or the underlying network topology.","PeriodicalId":408335,"journal":{"name":"Hotnets-IX","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"26","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Hotnets-IX","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1868447.1868462","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 26

Abstract

Cloud applications have increasingly come to rely on distributed storage systems that hide the complexity of handling network and node failures behind simple, data-centric interfaces (such as PUTs and GETs on key-value pairs). While these interfaces are very easy to use, the application is completely oblivious to the location of its data in the network; as a result, it has no way to optimize the placement of data or computation. In this paper, we propose exposing the network location of data to applications. The primary challenge is that data does not usually exist at a single point in the network; it can be striped, replicated, cached and coded across different locations, in arbitrary ways that vary across storage systems. For example, an item that is synchronously mirrored in both Seattle and London will appear equally far from both locations for writes, but equally close to both locations for reads. Accordingly, we describe Contour, a system that allows applications to query and manipulate the location of data without requiring them to be aware of the physical machines storing the data, the replication protocols used or the underlying network topology.
位置,位置,位置!:对云中的数据接近性进行建模
云应用程序越来越依赖于分布式存储系统,这些系统将处理网络和节点故障的复杂性隐藏在简单的、以数据为中心的接口(例如键值对上的put和get)后面。虽然这些接口非常容易使用,但应用程序完全不知道其数据在网络中的位置;因此,它无法优化数据或计算的位置。在本文中,我们建议向应用程序公开数据的网络位置。主要的挑战是数据通常不存在于网络中的单个点;它可以在不同的位置以任意的方式进行条带化、复制、缓存和编码,这在不同的存储系统中是不同的。例如,在西雅图和伦敦同步镜像的项在写时离这两个位置的距离相等,但在读时离这两个位置的距离相等。因此,我们描述了Contour,一个允许应用程序查询和操作数据位置的系统,而不需要它们知道存储数据的物理机器、使用的复制协议或底层网络拓扑结构。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信