2009 First International Conference on Advances in P2P Systems最新文献

筛选
英文 中文
Peer Selection for Multi-source Streaming Approach on P2P File Sharing Application P2P文件共享应用中多源流方法的对等选择
2009 First International Conference on Advances in P2P Systems Pub Date : 2009-10-11 DOI: 10.1109/AP2PS.2009.8
A. T. Samsudin, N. Suryana
{"title":"Peer Selection for Multi-source Streaming Approach on P2P File Sharing Application","authors":"A. T. Samsudin, N. Suryana","doi":"10.1109/AP2PS.2009.8","DOIUrl":"https://doi.org/10.1109/AP2PS.2009.8","url":null,"abstract":"Selecting the best peer(s) to serve a unicast streaming session is vital for providing efficient streaming without packet loss and incurring a single break-point. When an end-user selects a file to downstream, the peer selection module establishes two groups: an active sender and standby senders. The active sender is a peer who streams the media to a requesting peer, whereas standby peers is responsible for replacing any active sender who leaves. Active and standby senders change periodically until the media playback is finished. Peer selection of active and standby senders is based on their rank, upstream, and serving limitation. Peers are classified from bad to good. Our simulation shows that with dynamic active and standby sender peers in streaming sessions, the quality of media streaming can be preserved.","PeriodicalId":240673,"journal":{"name":"2009 First International Conference on Advances in P2P Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122594343","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}
引用次数: 6
Using Logical Identifiers of Nodes in Replica Maintenance 在副本维护中使用节点逻辑标识符
2009 First International Conference on Advances in P2P Systems Pub Date : 2009-10-11 DOI: 10.1109/AP2PS.2009.23
Q. Vu
{"title":"Using Logical Identifiers of Nodes in Replica Maintenance","authors":"Q. Vu","doi":"10.1109/AP2PS.2009.23","DOIUrl":"https://doi.org/10.1109/AP2PS.2009.23","url":null,"abstract":"Replication is often used in distributed hash tables (DHTs) to reduce the latency of query requests. For read-write objects, replicas are commonly kept up-to-date by having a master node maintain physical pointers to replica hosts. Since these links are based on IP addresses, they must be updated whenever a linked node fails. This can be costly in systems with high churn. In this paper, we introduce a replication protocol whose replica links employ both physical and logical node identifiers. The resulting logical links are based on the DHT identifier and can be used to correct the physical links if they are wrong; as a result, the correctness of the physical links can be relaxed. This protocol significantly reduces the cost of maintaining physical links. We also propose a novel cost model, which is used to determine when and where replicas should be created. Our cost model calculates the benefit of a replica by both the number of queries a node receives and the distance between the node and the query requester nodes.","PeriodicalId":240673,"journal":{"name":"2009 First International Conference on Advances in P2P Systems","volume":"6 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128291935","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
Comparative Study of Peer-to-Peer Architectures for Scalable Resource Discovery 面向可扩展资源发现的点对点架构的比较研究
2009 First International Conference on Advances in P2P Systems Pub Date : 2009-10-11 DOI: 10.1109/AP2PS.2009.12
J. Famaey, J. Donders, T. Wauters, Frédéric Iterbeke, N. Sluijs, Bart De Vleeschauwer, F. Turck, P. Demeester, Rudy Stoop
{"title":"Comparative Study of Peer-to-Peer Architectures for Scalable Resource Discovery","authors":"J. Famaey, J. Donders, T. Wauters, Frédéric Iterbeke, N. Sluijs, Bart De Vleeschauwer, F. Turck, P. Demeester, Rudy Stoop","doi":"10.1109/AP2PS.2009.12","DOIUrl":"https://doi.org/10.1109/AP2PS.2009.12","url":null,"abstract":"Resource discovery is an important aspect of many modern large-scale distributed systems. In the past, this problem has been solved using many different approaches, such as a central registry server, flooding-based protocols, and distributed hash tables. In this paper, these three widely used architectures are compared, using measurement results obtained from real implementations run on an Emulab emulation environment. This allows us to study the advantages and disadvantages of the architectures and determine their usefulness. The measurement study lead to several interesting conclusions. First, the centralised architecture incurs the least traffic overhead. However, it balances the load poorly, and introduces a single point-of-failure. Second, of the two decentralised architectures, the distributed hash table generates the least overhead. Finally, hierarchical architectures were shown to be most effective when the fraction of super-peers compared to regular peers is small.","PeriodicalId":240673,"journal":{"name":"2009 First International Conference on Advances in P2P Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126668118","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}
引用次数: 6
FLaCoSt: A Novel Peer to Peer Architecture for Video Streaming in a Next Generation Network FLaCoSt:一种用于下一代网络视频流的新型点对点架构
2009 First International Conference on Advances in P2P Systems Pub Date : 2009-10-11 DOI: 10.1109/AP2PS.2009.37
Jaime García-Reinoso, A. Bikfalvi, I. Vidal, F. Valera
{"title":"FLaCoSt: A Novel Peer to Peer Architecture for Video Streaming in a Next Generation Network","authors":"Jaime García-Reinoso, A. Bikfalvi, I. Vidal, F. Valera","doi":"10.1109/AP2PS.2009.37","DOIUrl":"https://doi.org/10.1109/AP2PS.2009.37","url":null,"abstract":"This paper proposes a peer-to-peer video streaming delivery system within the framework of Next Generation Networks using Application Level Multicast. Increased efficiency and reliability is achieved in two ways. First, the system uses path diversity by splitting the video traffic in several stripes and distributing each stripe via different multicast trees. Second, the proposed architecture lies within a Next Generation Network framework that enables network resource reservations with different classes of service. Therefore, the video stripes can receive different priorities making possible the usage of Layered Coding techniques such as Multi-Description Coding and Scalable Video Coding. The peer-to-peer protocol takes advantage of the multipath delivery and resources reservation by optimising the searches for a parent in the multicast tree, thus minimising the service access time and service interruptions. These ideas can be improved using always-on central devices like Residential Gateways as peer nodes.","PeriodicalId":240673,"journal":{"name":"2009 First International Conference on Advances in P2P Systems","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121506989","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
A Replica Relocation Method for Improving Search Efficiency in P2P Networks 一种提高P2P网络搜索效率的副本重定位方法
2009 First International Conference on Advances in P2P Systems Pub Date : 2009-10-11 DOI: 10.1109/AP2PS.2009.10
Toshiki Watanabe, Yong Zhao, A. Kanzaki, T. Hara, S. Nishio
{"title":"A Replica Relocation Method for Improving Search Efficiency in P2P Networks","authors":"Toshiki Watanabe, Yong Zhao, A. Kanzaki, T. Hara, S. Nishio","doi":"10.1109/AP2PS.2009.10","DOIUrl":"https://doi.org/10.1109/AP2PS.2009.10","url":null,"abstract":"In P2P networks, it is effective to allocate replicas of each data item to multiple peers for improving search efficiency and data availability. It has been mathematically proved that the square-root allocation, in which the ratios of numbers of replicas are proportional to the square-root of their access frequencies, is optimal in terms of search efficiency. In this paper, we propose a replica relocation method that not only nearly achieves the square-root allocation but also distributes replicas uniformly in the network as much as possible. Our method creates replicas at each peer on the path along which a query is successfully forwarded. Here, each peer on the path determines whether it creates the replica or not based on the access frequency of the data item. In addition, for creating a new replica when a cache memory space is full, our method preferentially deletes a replica of a data item which has been replicated at a large number of peers.","PeriodicalId":240673,"journal":{"name":"2009 First International Conference on Advances in P2P Systems","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124159056","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
Caching Strategy for Scalable Lookup of Personal Content 个人内容可伸缩查找的缓存策略
2009 First International Conference on Advances in P2P Systems Pub Date : 2009-10-11 DOI: 10.1109/AP2PS.2009.11
N. Sluijs, T. Wauters, Bart De Vleeschauwer, F. Turck, B. Dhoedt, P. Demeester
{"title":"Caching Strategy for Scalable Lookup of Personal Content","authors":"N. Sluijs, T. Wauters, Bart De Vleeschauwer, F. Turck, B. Dhoedt, P. Demeester","doi":"10.1109/AP2PS.2009.11","DOIUrl":"https://doi.org/10.1109/AP2PS.2009.11","url":null,"abstract":"Today’s trend is to create and share personal content, such as music files, digital photos and digital movies. The result is an explosive growth of a user’s personal content archive. Managing such an often distributed collection becomes a complex and time consuming task, which indicates the need for a personal content management system that provides storage space transparently, is quality-aware, and is available at any time and at any place to end-users. A solution that fulfills this need is a Personal Content Storage Service (PCSS). A key feature of a PCSS is the ability to search worldwide through the dataset of personal files. Due to the extremely large size of the dataset of personal content, a centralized approach is no longer feasible; therefore the PCSS uses a structured peer-to-peer network: the Distributed Hash Table (DHT). In order to further increase the lookup performance, a caching layer is used between the application layer and the DHT. In this article we present the caching layer and introduce the Request Times Distance (RTD) caching algorithm, which uses popularity and distance metrics to increase the lookup performance. By extending the RTD algorithm with a sliding window and cooperative caching, a more efficient solution than standard algorithms is obtained. The cooperative RTD caching algorithm is evaluated using the PlanetSim simulation framework and shows a performance increase of up to 16% compared to the Least Frequently Used (LFU) caching algorithm.","PeriodicalId":240673,"journal":{"name":"2009 First International Conference on Advances in P2P Systems","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125442693","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
Detection of Encrypted Traffic in eDonkey Network through Application Signatures 基于应用签名的eDonkey网络加密流量检测
2009 First International Conference on Advances in P2P Systems Pub Date : 2009-10-11 DOI: 10.1109/AP2PS.2009.35
M. Freire, David A. Carvalho, Manuela Pereira
{"title":"Detection of Encrypted Traffic in eDonkey Network through Application Signatures","authors":"M. Freire, David A. Carvalho, Manuela Pereira","doi":"10.1109/AP2PS.2009.35","DOIUrl":"https://doi.org/10.1109/AP2PS.2009.35","url":null,"abstract":"Peer-to-peer file sharing applications became very popular, being responsible for a large percentage of the network traffic. However, peer-to-peer traffic may compromise the performance of enterprise critical networked applications or network-based tasks or may overload the network infrastructure of Internet Service Providers, being desirable that this traffic be blocked in some situations. However, this task may be difficult to achieve, namely for networks operating at very high-speed bit rates and low latency and/or when the traffic is encrypted. This paper addresses the problem of detecting and blocking encrypted traffic generated by eMule, which is one of the most difficult to detect among popular peer-to-peer file sharing applications. The proposed method is based on eMule signatures, which are coded as SNORT rules, this system being used to detect and block eMule traffic. Experiments have been carried out to evaluate the proposed method. The contribution of the paper falls within peer-to-peer security or within legal and regulatory issues.","PeriodicalId":240673,"journal":{"name":"2009 First International Conference on Advances in P2P Systems","volume":"1 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131623105","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}
引用次数: 6
Mutable Peer-to-Peer File Systems: Analysis and Evaluation 可变点对点文件系统:分析与评价
2009 First International Conference on Advances in P2P Systems Pub Date : 2009-10-11 DOI: 10.1109/AP2PS.2009.21
C. Chelmis
{"title":"Mutable Peer-to-Peer File Systems: Analysis and Evaluation","authors":"C. Chelmis","doi":"10.1109/AP2PS.2009.21","DOIUrl":"https://doi.org/10.1109/AP2PS.2009.21","url":null,"abstract":"Peer-to-peer networks have become extremely popular over the last decades for one major reason. They make the exchange of files between users easy and fast. Peer-to-peer systems have been proved to be the basis for the creation of worldwide networks where users exchange read-only files freely and efficiently. However, users have started using applications that need more than what the exchange of immutable files can offer. Collaborative Wikis have emerged as a phenomenon of people's behavior to communicate and collaboratively create and maintain large collections of documents. Communities that do not want to rely on centralized servers and legacy applications would benefit from using peer-to-peer systems for their purposes. The immutability of files that peer-to-peer systems can support however, cannot possibly serve this purpose. This paper makes three contributions towards the advances in theoretical foundations of P2P. It analyzes existing peer-to-peer systems supporting mutable files and indicates their successes and failures in this direction. It describes the characteristics that a mutable peer-to-peer file system should have in order to be able to support applications with characteristics of collaborative Wikis. Finally, it proposes an architecture for the creation of a new peer-to-peer system with the desirable characteristics, based on already existing systems.","PeriodicalId":240673,"journal":{"name":"2009 First International Conference on Advances in P2P Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128706105","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}
引用次数: 2
A New Credit-Based Incentive Mechanism for P2P Scheduling with User Modeling 基于信用的P2P调度激励机制与用户建模
2009 First International Conference on Advances in P2P Systems Pub Date : 2009-10-11 DOI: 10.1109/AP2PS.2009.22
Josep Rius, F. Cores, Francesc Solsona
{"title":"A New Credit-Based Incentive Mechanism for P2P Scheduling with User Modeling","authors":"Josep Rius, F. Cores, Francesc Solsona","doi":"10.1109/AP2PS.2009.22","DOIUrl":"https://doi.org/10.1109/AP2PS.2009.22","url":null,"abstract":"Peer-to-Peer (P2P) computing offers new research challenges in the domain of distributed computing. Encouraging peers to collaborate in file-sharing has been widely investigated. Incentive policies in P2P distributed computing systems is a new research field that requires specific policies to deal with resources mutability and the modeling6 of peers behavior. Unlike file-sharing, which uses such immutable resources as files, the mutable ones, such as CPU and Memory are the principal resources involved in P2P computing. Furthermore, the dynamics of peer participation are an inherent property of P2P systems and critical for design and evaluation. This paper presents a global P2P credit-based scheduling model that reflects P2P user dynamics, penalizes free-riders efficiently and participation of peers is also encouraged. Simulation results show the good performance and functionality of our proposal.","PeriodicalId":240673,"journal":{"name":"2009 First International Conference on Advances in P2P Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127149982","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}
引用次数: 8
Scenario Analysis and System Dynamics in New Emerging Technology Research: Case Mobile Peer-to-Peer Content Distribution 新兴技术研究中的场景分析和系统动力学:以移动点对点内容分发为例
2009 First International Conference on Advances in P2P Systems Pub Date : 2009-10-11 DOI: 10.1109/AP2PS.2009.18
Juuso Karikoski, Mikko V. J. Heikkinen, H. Hämmäinen
{"title":"Scenario Analysis and System Dynamics in New Emerging Technology Research: Case Mobile Peer-to-Peer Content Distribution","authors":"Juuso Karikoski, Mikko V. J. Heikkinen, H. Hämmäinen","doi":"10.1109/AP2PS.2009.18","DOIUrl":"https://doi.org/10.1109/AP2PS.2009.18","url":null,"abstract":"This paper studies the use of scenario analysis and system dynamics in researching mobile peer-to-peer content distribution as a new emerging technology. Scenario analysis bounds the uncertainty related to the alternative futures of the technology by defining different scenarios. System dynamics is used to build a quantitative model based on the scenarios. During the research process four learning scenarios and a quantitative model depicting a dynamic mobile peer-to-peer file sharing ecosystem are constructed. As a result we conclude that the usage of scenario analysis is favorable in researching mobile peer-to-peer content distribution as a new emerging technology while the applicability of system dynamics can be questioned.","PeriodicalId":240673,"journal":{"name":"2009 First International Conference on Advances in P2P Systems","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126460585","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}
引用次数: 2
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学术官方微信
小红书