利用推荐服务提高复制效率

Anna Kobusińska, Michał Boroń, Aleksandra Kerebinska, Dionisis Margaris
{"title":"利用推荐服务提高复制效率","authors":"Anna Kobusińska, Michał Boroń, Aleksandra Kerebinska, Dionisis Margaris","doi":"10.1109/SOCA.2019.00017","DOIUrl":null,"url":null,"abstract":"Modern, distributed systems are expected nowadays to provide high data availability, increased fault-tolerance, low bandwidth consumption, and improved scalability. To cope with the aforementioned problems, the replication mechanisms are often used. However, with the constantly growing scale of modern systems, providing the efficient replication becomes increasingly difficult. One of the ways to increase the replication efficiency is associated with the use of knowledge from social networks. This paper proposes a recommender service that exploits social relationships to provide a list of nodes that will hold replicated data. Such nodes are selected based on the value of the proposed matching degree metric. Our focus is also on evaluating the proposed solution.","PeriodicalId":113517,"journal":{"name":"2019 IEEE 12th Conference on Service-Oriented Computing and Applications (SOCA)","volume":"339 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Exploiting Recommender Service to Enhance Efficiency of Replication\",\"authors\":\"Anna Kobusińska, Michał Boroń, Aleksandra Kerebinska, Dionisis Margaris\",\"doi\":\"10.1109/SOCA.2019.00017\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Modern, distributed systems are expected nowadays to provide high data availability, increased fault-tolerance, low bandwidth consumption, and improved scalability. To cope with the aforementioned problems, the replication mechanisms are often used. However, with the constantly growing scale of modern systems, providing the efficient replication becomes increasingly difficult. One of the ways to increase the replication efficiency is associated with the use of knowledge from social networks. This paper proposes a recommender service that exploits social relationships to provide a list of nodes that will hold replicated data. Such nodes are selected based on the value of the proposed matching degree metric. Our focus is also on evaluating the proposed solution.\",\"PeriodicalId\":113517,\"journal\":{\"name\":\"2019 IEEE 12th Conference on Service-Oriented Computing and Applications (SOCA)\",\"volume\":\"339 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE 12th Conference on Service-Oriented Computing and Applications (SOCA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SOCA.2019.00017\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 12th Conference on Service-Oriented Computing and Applications (SOCA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SOCA.2019.00017","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

如今,人们期望现代分布式系统提供高数据可用性、更高的容错性、更低的带宽消耗和更好的可伸缩性。为了解决上述问题,通常使用复制机制。然而,随着现代系统规模的不断扩大,提供高效的复制变得越来越困难。提高复制效率的方法之一是利用来自社交网络的知识。本文提出了一个推荐服务,它利用社会关系来提供一个节点列表,该列表将保存复制的数据。这些节点是根据提出的匹配度度量的值来选择的。我们的重点还在于评估提议的解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Exploiting Recommender Service to Enhance Efficiency of Replication
Modern, distributed systems are expected nowadays to provide high data availability, increased fault-tolerance, low bandwidth consumption, and improved scalability. To cope with the aforementioned problems, the replication mechanisms are often used. However, with the constantly growing scale of modern systems, providing the efficient replication becomes increasingly difficult. One of the ways to increase the replication efficiency is associated with the use of knowledge from social networks. This paper proposes a recommender service that exploits social relationships to provide a list of nodes that will hold replicated data. Such nodes are selected based on the value of the proposed matching degree metric. Our focus is also on evaluating the proposed solution.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信