一种社会感知的分散拓扑构造协议

Stefanos Antaris, Despina Stasi, Mikael Högqvist, G. Pallis, M. Dikaiakos
{"title":"一种社会感知的分散拓扑构造协议","authors":"Stefanos Antaris, Despina Stasi, Mikael Högqvist, G. Pallis, M. Dikaiakos","doi":"10.1109/HotWeb.2015.13","DOIUrl":null,"url":null,"abstract":"Decentralized Online Social Networks (DOSNs) offer an alternative to the usual centralized solutions, that promises to preserve more control of a user's data to the user herself. An important aspect in the design of DOSNs is the selection of the Peer-to-Peer overlay network. We propose the use of an augmented Pastry-based overlay network design, so as to produce a topology that incorporates the social network. Our augmentation aims to reduce the number of overlay hops required for the communication between two users in the social network. We experimentally show that our approach reduces the number of overlay hops and the total latency between two socially connected users versus the standard Pastry overlay. Additionally, we compare our approach with Sprout, a Chord alternative, and show that in many cases we achieve similarly low latency, while maintaining a bounded number of links.","PeriodicalId":252318,"journal":{"name":"2015 Third IEEE Workshop on Hot Topics in Web Systems and Technologies (HotWeb)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Socio-Aware Decentralized Topology Construction Protocol\",\"authors\":\"Stefanos Antaris, Despina Stasi, Mikael Högqvist, G. Pallis, M. Dikaiakos\",\"doi\":\"10.1109/HotWeb.2015.13\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Decentralized Online Social Networks (DOSNs) offer an alternative to the usual centralized solutions, that promises to preserve more control of a user's data to the user herself. An important aspect in the design of DOSNs is the selection of the Peer-to-Peer overlay network. We propose the use of an augmented Pastry-based overlay network design, so as to produce a topology that incorporates the social network. Our augmentation aims to reduce the number of overlay hops required for the communication between two users in the social network. We experimentally show that our approach reduces the number of overlay hops and the total latency between two socially connected users versus the standard Pastry overlay. Additionally, we compare our approach with Sprout, a Chord alternative, and show that in many cases we achieve similarly low latency, while maintaining a bounded number of links.\",\"PeriodicalId\":252318,\"journal\":{\"name\":\"2015 Third IEEE Workshop on Hot Topics in Web Systems and Technologies (HotWeb)\",\"volume\":\"55 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-11-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 Third IEEE Workshop on Hot Topics in Web Systems and Technologies (HotWeb)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HotWeb.2015.13\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 Third IEEE Workshop on Hot Topics in Web Systems and Technologies (HotWeb)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HotWeb.2015.13","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

分散式在线社交网络(dosn)提供了一种替代通常的集中式解决方案的方法,它承诺将用户数据的更多控制权保留给用户自己。dosn设计的一个重要方面是点对点覆盖网络的选择。我们建议使用增强的基于糕点的覆盖网络设计,从而产生一个包含社交网络的拓扑结构。我们的增强旨在减少社交网络中两个用户之间通信所需的覆盖跳数。实验表明,与标准的糕点覆盖相比,我们的方法减少了覆盖跳数和两个社交连接用户之间的总延迟。此外,我们将我们的方法与Chord的替代方案Sprout进行了比较,并表明在许多情况下,我们在保持有限数量的链接的同时实现了类似的低延迟。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Socio-Aware Decentralized Topology Construction Protocol
Decentralized Online Social Networks (DOSNs) offer an alternative to the usual centralized solutions, that promises to preserve more control of a user's data to the user herself. An important aspect in the design of DOSNs is the selection of the Peer-to-Peer overlay network. We propose the use of an augmented Pastry-based overlay network design, so as to produce a topology that incorporates the social network. Our augmentation aims to reduce the number of overlay hops required for the communication between two users in the social network. We experimentally show that our approach reduces the number of overlay hops and the total latency between two socially connected users versus the standard Pastry overlay. Additionally, we compare our approach with Sprout, a Chord alternative, and show that in many cases we achieve similarly low latency, while maintaining a bounded number of links.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Performance Comparison of Web Servers with Different Architectures: A Case Study Using High Concurrency Workload Re-Examining the Complexity of Popular Websites A Priority-Based Dynamic Web Requests Scheduling for Web Servers over Content-Centric Networking Fog Computing Based Ultraviolet Radiation Measurement via Smartphones Programming Support for an Integrated Multi-Party Computation and MapReduce Infrastructure
×
引用
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