Reducing the Availability Management Overheads of Federated Content Sharing Systems

Christopher Peery, Thu D. Nguyen, Francisco Matias Cuenca-Acuna
{"title":"Reducing the Availability Management Overheads of Federated Content Sharing Systems","authors":"Christopher Peery, Thu D. Nguyen, Francisco Matias Cuenca-Acuna","doi":"10.1109/SRDS.2006.39","DOIUrl":null,"url":null,"abstract":"We consider the problem of ensuring high data availability in federated content sharing systems. Ideally, such a system would provide high data availability in a device transparent manner so that users are not faced with the time-consuming and error-prone task of managing data replicas across the constituent devices of the system. We propose a novel unified availability model and a decentralized replication algorithm to approximate this ideal. Our availability model addresses three different concerns: availability during connected operation (online), availability during disconnected operation (offline), and availability after permanent disconnection from the federated system (ownership). Our replication algorithm centers around the intuition that devices should selfishly use their local storage to ensure offline and ownership availability for their individual owners. Excess storage, however, is used communally to ensure high online availability for all shared content. Evaluation of an implementation shows that our algorithm rapidly reaches stable and communally desirable configurations when there is sufficient space. Consistent with the fact that devices in a federated system are owned by different users, however, as space becomes highly constrained, the system approaches a non-cooperative configuration where devices only hoard content to serve their individual owners' needs","PeriodicalId":164765,"journal":{"name":"2006 25th IEEE Symposium on Reliable Distributed Systems (SRDS'06)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 25th IEEE Symposium on Reliable Distributed Systems (SRDS'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SRDS.2006.39","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

We consider the problem of ensuring high data availability in federated content sharing systems. Ideally, such a system would provide high data availability in a device transparent manner so that users are not faced with the time-consuming and error-prone task of managing data replicas across the constituent devices of the system. We propose a novel unified availability model and a decentralized replication algorithm to approximate this ideal. Our availability model addresses three different concerns: availability during connected operation (online), availability during disconnected operation (offline), and availability after permanent disconnection from the federated system (ownership). Our replication algorithm centers around the intuition that devices should selfishly use their local storage to ensure offline and ownership availability for their individual owners. Excess storage, however, is used communally to ensure high online availability for all shared content. Evaluation of an implementation shows that our algorithm rapidly reaches stable and communally desirable configurations when there is sufficient space. Consistent with the fact that devices in a federated system are owned by different users, however, as space becomes highly constrained, the system approaches a non-cooperative configuration where devices only hoard content to serve their individual owners' needs
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
减少联邦内容共享系统的可用性管理开销
我们考虑在联邦内容共享系统中确保高数据可用性的问题。理想情况下,这样的系统将以设备透明的方式提供高数据可用性,这样用户就不会面临跨系统组成设备管理数据副本的耗时且容易出错的任务。我们提出了一个新的统一的可用性模型和一个分散的复制算法来接近这个理想。我们的可用性模型解决了三个不同的问题:连接操作期间的可用性(在线)、断开连接操作期间的可用性(离线)以及与联邦系统永久断开连接后的可用性(所有权)。我们的复制算法围绕着这样一种直觉,即设备应该自私地使用其本地存储,以确保其个人所有者的离线和所有权可用性。但是,多余的存储空间通常用于确保所有共享内容的高在线可用性。一个实现的评估表明,当有足够的空间时,我们的算法可以快速达到稳定和共同期望的配置。然而,与联邦系统中的设备由不同用户拥有这一事实相一致的是,随着空间变得高度受限,系统将接近一种非合作配置,在这种配置中,设备仅存储内容以满足其个人所有者的需求
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Performance evaluation of a fair fault-tolerant mutual exclusion algorithm Fault-tolerant and scalable TCP splice and web server architecture Improvements and Reconsideration of Distributed Snapshot Protocols Improving DBMS Performance through Diverse Redundancy AVCast : New Approaches For Implementing Availability-Dependent Reliability for Multicast Receivers
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1