发布求助
文献互助 智能选刊 最新文献

IEEE P2P 2013 Proceedings最新文献

筛选
英文 中文
Can Peer-to-Peer live streaming systems coexist with free riders? 点对点直播系统能否与搭便车者共存?
IEEE P2P 2013 Proceedings Pub Date : 2013-12-19 DOI: 10.1109/P2P.2013.6688712
J. F. A. E. Oliveira, Ítalo F. S. Cunha, E. Miguel, M. Rocha, A. Vieira, S. Campos
{"title":"Can Peer-to-Peer live streaming systems coexist with free riders?","authors":"J. F. A. E. Oliveira, Ítalo F. S. Cunha, E. Miguel, M. Rocha, A. Vieira, S. Campos","doi":"10.1109/P2P.2013.6688712","DOIUrl":"https://doi.org/10.1109/P2P.2013.6688712","url":null,"abstract":"Peer-to-Peer live streaming systems help content providers and distributors drastically reduce bandwidth costs by sharing costs among peers. Researchers have dedicated significant effort developing techniques to discourage or exclude uncooperative peers from peer-to-peer systems. However, users are often unable to cooperate, e.g., users using a mobile device with limited, costly bandwidth. We study the impact of uncooperative peers on video discontinuity and latency using PlanetLab. We find that simple mechanisms, like forwarding video data requests to cooperative peers instead of wasting effort sending requests to uncooperative peers, allows peer-to-peer live streaming to serve 50% of uncooperative peers without performance degradation. We argue that denying service to uncooperative peers may not be the best long-term approach; our findings suggest that peer-to-peer live streaming can support uncooperative peers.","PeriodicalId":116854,"journal":{"name":"IEEE P2P 2013 Proceedings","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128641808","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 26
Privacy-by-design cloud computing through decentralization and real life trust 通过去中心化和现实生活中的信任来设计隐私的云计算
IEEE P2P 2013 Proceedings Pub Date : 2013-12-19 DOI: 10.1109/P2P.2013.6688726
Leucio Antonio Cutillo, A. Lioy
{"title":"Privacy-by-design cloud computing through decentralization and real life trust","authors":"Leucio Antonio Cutillo, A. Lioy","doi":"10.1109/P2P.2013.6688726","DOIUrl":"https://doi.org/10.1109/P2P.2013.6688726","url":null,"abstract":"Existing Cloud services suffer from several weaknesses regarding privacy and security [1]. A preliminary analysis shows that they are subject to a number of vulnerabilities ranging from insecure interfaces to insecure Hypervisors [2]. Starting from these vulnerabilities as the first step of a broader research activity, we came up with a new approach that is very promising in re-visiting security and privacy problems in Cloud based systems.","PeriodicalId":116854,"journal":{"name":"IEEE P2P 2013 Proceedings","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129421461","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Trending topics in a peer-to-peer micro-blogging social network 点对点微博社交网络中的热门话题
IEEE P2P 2013 Proceedings Pub Date : 2013-12-19 DOI: 10.1109/P2P.2013.6688719
H. Asthana, I. Cox
{"title":"Trending topics in a peer-to-peer micro-blogging social network","authors":"H. Asthana, I. Cox","doi":"10.1109/P2P.2013.6688719","DOIUrl":"https://doi.org/10.1109/P2P.2013.6688719","url":null,"abstract":"We investigate the problem of identifying trending information in a peer-to-peer micro-blogging social network. Trending topics are valuable since they often reflect a news-worthy event and invite users to search on the topic to see what others are posting about the event. Whilst identifying trending topics in a centralized system is relatively straightforward, in a peer-to-peer environment the participating nodes do not have access to global statistics such as the micro-blog post creation rate and the frequencies of the keywords.","PeriodicalId":116854,"journal":{"name":"IEEE P2P 2013 Proceedings","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126897755","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Information propagation in the Bitcoin network 比特币网络中的信息传播
IEEE P2P 2013 Proceedings Pub Date : 2013-12-19 DOI: 10.1109/P2P.2013.6688704
Christian Decker, Roger Wattenhofer
{"title":"Information propagation in the Bitcoin network","authors":"Christian Decker, Roger Wattenhofer","doi":"10.1109/P2P.2013.6688704","DOIUrl":"https://doi.org/10.1109/P2P.2013.6688704","url":null,"abstract":"Bitcoin is a digital currency that unlike traditional currencies does not rely on a centralized authority. Instead Bitcoin relies on a network of volunteers that collectively implement a replicated ledger and verify transactions. In this paper we analyze how Bitcoin uses a multi-hop broadcast to propagate transactions and blocks through the network to update the ledger replicas. We then use the gathered information to verify the conjecture that the propagation delay in the network is the primary cause for blockchain forks. Blockchain forks should be avoided as they are symptomatic for inconsistencies among the replicas in the network. We then show what can be achieved by pushing the current protocol to its limit with unilateral changes to the client's behavior.","PeriodicalId":116854,"journal":{"name":"IEEE P2P 2013 Proceedings","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116273298","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1080
The hidden locality in swarms 蜂群中隐蔽的位置
IEEE P2P 2013 Proceedings Pub Date : 2013-12-19 DOI: 10.1109/P2P.2013.6688713
J. Otto, F. Bustamante
{"title":"The hidden locality in swarms","authors":"J. Otto, F. Bustamante","doi":"10.1109/P2P.2013.6688713","DOIUrl":"https://doi.org/10.1109/P2P.2013.6688713","url":null,"abstract":"People use P2P systems such as BitTorrent to share an unprecedented variety and amount of content with others around the world. The random connection pattern used by BitTorrent has been shown to result in reduced performance for users and costly cross-ISP traffic. Although several client-side systems have been proposed to improve the locality of BitTorrent traffic, their effectiveness is limited by the availability of local peers. We show that sufficient locality is present in swarms - if one looks at the right time. We find that 50% of ISPs have at least five local peers online during the ISP's peak hour, typically in the evening, compared to only 20% of ISPs during the median hour. To better discover these local peers, we show how to increase the overall peer discovery rate by over two orders of magnitude using client-side techniques: leveraging additional trackers, requesting more peers per sample, and sampling more frequently. We propose an approach to predict future availability of local peers based on observed diurnal patterns. This approach enables peers to selectively apply these techniques to minimize undue load on trackers.","PeriodicalId":116854,"journal":{"name":"IEEE P2P 2013 Proceedings","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131063893","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Monitoring anonymous P2P file-sharing systems 监控匿名P2P文件共享系统
IEEE P2P 2013 Proceedings Pub Date : 2013-12-19 DOI: 10.1109/P2P.2013.6688725
Juan Pablo Timpanaro, Isabelle Chrisment, O. Festor
{"title":"Monitoring anonymous P2P file-sharing systems","authors":"Juan Pablo Timpanaro, Isabelle Chrisment, O. Festor","doi":"10.1109/P2P.2013.6688725","DOIUrl":"https://doi.org/10.1109/P2P.2013.6688725","url":null,"abstract":"Anonymous communications have been exponentially growing, where more and more users are shifting to a privacy-preserving Internet and anonymising their peer-to-peer communications. Anonymous systems allow users to access different services while preserving their anonymity. We aim to characterise these anonymous systems, with a special focus in the I2P network. Current statistics service for the I2P network do not provide values about the type of applications deployed in the network nor the geographical localisation of users. Our objective is to determine the number of users in the network, the number of anonymous applications, and the type of those applications. We also explore the possibility of inferring which group of users is responsible for the activity of an anonymous application. Thus, we improve the current I2P statistics and get better insights of the network.","PeriodicalId":116854,"journal":{"name":"IEEE P2P 2013 Proceedings","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131323898","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Kaleidoscope: Adding colors to Kademlia 万花筒:为卡德米娅添加颜色
IEEE P2P 2013 Proceedings Pub Date : 2013-12-19 DOI: 10.1109/P2P.2013.6688703
Gil Einziger, R. Friedman, Eyal Kibbar
{"title":"Kaleidoscope: Adding colors to Kademlia","authors":"Gil Einziger, R. Friedman, Eyal Kibbar","doi":"10.1109/P2P.2013.6688703","DOIUrl":"https://doi.org/10.1109/P2P.2013.6688703","url":null,"abstract":"Kademlia is considered to be one of the most effective key based routing protocols. It is nowadays implemented in many file sharing peer-to-peer networks such as BitTorrent, KAD, and Gnutella. This paper introduces Kaleidoscope, a novel routing/caching scheme designed to significantly reduce the cost of lookup operations in Kademlia by using a color-based distributed cache. Moreover, Kaleidoscope greatly improves load balancing among the nodes and reduces the well documented hot spots problem. The paper also includes an extensive performance study demonstrating the benefits of Kaleidoscope.","PeriodicalId":116854,"journal":{"name":"IEEE P2P 2013 Proceedings","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133730327","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
Cloud-assisted dissemination in social overlays 社会覆盖中的云辅助传播
IEEE P2P 2013 Proceedings Pub Date : 2013-12-19 DOI: 10.1109/P2P.2013.6688718
Giuliano Mega, A. Montresor, G. Picco
{"title":"Cloud-assisted dissemination in social overlays","authors":"Giuliano Mega, A. Montresor, G. Picco","doi":"10.1109/P2P.2013.6688718","DOIUrl":"https://doi.org/10.1109/P2P.2013.6688718","url":null,"abstract":"Decentralized social networks are an emerging solution to the privacy issues plaguing mainstream centralized architectures. Social overlays-overlay networks mirroring the social relationships among node owners-are particularly intriguing, as they limit communication within one's friend circle. Previous work investigated efficient protocols for P2P dissemination in social overlays, but also showed that the churn induced by users, combined with the topology constraints posed by these overlays, may yield unacceptable latency. In this paper, we combine P2P dissemination on the social overlay with occasional access to the cloud. When updates from a friend are not received for a long time, the cloud serves as an external channel to verify their presence. The outcome is disseminated in a P2P fashion, quenching cloud access from other nodes and speeding dissemination of existing updates. We show that our protocol performs close to centralized architectures and incurs only modest monetary costs.","PeriodicalId":116854,"journal":{"name":"IEEE P2P 2013 Proceedings","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122248389","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Box2Box - A P2P-based file-sharing and synchronization application Box2Box -基于p2p的文件共享和同步应用程序
IEEE P2P 2013 Proceedings Pub Date : 2013-12-19 DOI: 10.1109/P2P.2013.6688736
Andri Lareida, T. Bocek, Sebastian Golaszewski, Christian Luthold, Marc Weber
{"title":"Box2Box - A P2P-based file-sharing and synchronization application","authors":"Andri Lareida, T. Bocek, Sebastian Golaszewski, Christian Luthold, Marc Weber","doi":"10.1109/P2P.2013.6688736","DOIUrl":"https://doi.org/10.1109/P2P.2013.6688736","url":null,"abstract":"Due to an increasing number of devices connected to the Internet, data synchronization becomes more important. Centrally managed storage services, such as Dropbox, are popular for synchronizing data between several devices. P2P-based approaches that run fully decentralized, such as BitTorrent-Sync, are starting to emerge. This paper presents Box2Box, a new P2P file synchronization application which supports novel features not present in BitTorrent-Sync. Box2Box is demonstrated in several use cases each targeted at another feature.","PeriodicalId":116854,"journal":{"name":"IEEE P2P 2013 Proceedings","volume":"214 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121295106","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
RECODE: Reconfigurable, consistent and decentralized data services RECODE:可重构的、一致的、分散的数据服务
IEEE P2P 2013 Proceedings Pub Date : 2013-12-19 DOI: 10.1109/P2P.2013.6688705
Mikael Högqvist, A. Reinefeld
{"title":"RECODE: Reconfigurable, consistent and decentralized data services","authors":"Mikael Högqvist, A. Reinefeld","doi":"10.1109/P2P.2013.6688705","DOIUrl":"https://doi.org/10.1109/P2P.2013.6688705","url":null,"abstract":"Key-based routing schemes, where a message is forwarded towards a server responsible for a partition in a large name space, does not provide strong delivery guarantees when the network is reconfigured with servers joining and leaving. This best-effort behavior is sufficient for eventually consistent data services such as key-value stores, content distribution networks or publish/subscribe systems. However, such schemes are not able to provide stronger consistency guarantees as required by, for example, metadata services and databases. We present RECODE, a framework for reconfigurable, consistent and decentralized data services. RECODE simplifies the implementation of strongly consistent data services, and continues to provide strong guarantees even during reconfiguration. More specifically, we introduce the routecast primitive which delivers messages for a key in the same total order, independent of the servers responsible for the key.We demonstrate the expressiveness and practical usability of RECODE by presenting three applications: a map of atomic registers, a set of distributed counters, and a lease management system. We evaluate the performance and elasticity of RECODE executing in a cluster.","PeriodicalId":116854,"journal":{"name":"IEEE P2P 2013 Proceedings","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133889935","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信