P2P文件共享系统用户行为特性研究

利用含有用户请求和下载信息的P2P文件共享系统Maze的日志数据，对P2P文件共享系统中的用户行为进行了分析，论证了一些关于用户行为特性的已有观点，并从新的角度考察了一些行为特性，最后对行为的一些相关性进行了比较和研究。相关性分析的结果表明，用户的流量大小与其活跃时间具有很强的相关性，而带宽高低对流量及用户请求次数的影响并没有绝对的关系。     

P2P文件共享系统中的一种基于商品市场模型的访问控制机制

随着P2P文件共享系统日益成为流行的文件交换方式,其安全问题势必引起关注,而访问控制是P2P系统安全的关键技术之一.由于P2P系统具有分散性和动态性,传统的访问控制机制不能够直接应用于P2P文件共享系统中.而现有针对P2P文件共享系统的访问控制机制不能很好地解决大量并发文件下载请求或者爆发式的恶意文件下载对节点带来的侵害.针对上述问题,文中提出一种基于商品市场模型的访问控制机制(ACMCM),利用市场调节机制使得文件下载请求均衡地分布在多个文件提供者之间;下载文件的价格随着重复下载次数的增加而呈指数增长,有效遏制了恶意下载行为;通过在并发下载之间合理地分配下载带宽,使得并发文件下载占用的系统时间尽量缩短.ACMCM保留了P2P系统的分散性和动态性.最后给出了ACMCM的分布式协议的主要过程的流程.     

基于ACL控制校园网P2SP下载流量的研究与实现

P2P（Peer—to—Peer,点对点）下载技术是校园网带宽控制的技术热点,此技术的应用占用了校园网大量的出1：2带宽,80％的出口资源被20％的用户所占用,造成了校园网带宽的瓶颈。分析P2SP（Peer-to-Sever＆Peer）技术原理,结合校园网络的设计及使用的特点,提出了利用基于时间的ACL（Access Control Lists,访问控制列表）来控制用户访问P2SP资源索引服务器以控制下载流量的具体实现方法。校园网出口实际测试结果显示．本方法能准确控制P2SP流量。     

一种基于用户行为的P2P模型

为研究用户行为与P2P系统的相互作用,提出一种P2P文件共享系统的数学模型。将系统引导策略引入P2P用户行为建模,综合考虑用户下载文件前后的行为特征,分析引导策略对用户行为和系统性能的影响,比较3种引导策略的效果。仿真结果表明,系统引导能有效提高用户首次选择高质量文件下载的概率,减少重新下载的次数和下载总流量。     

集中式P2P文件共享系统的设计与实现

首先研究并讨论目前流行的P2P技术的特点,然后提出一种基于集中式P2P的文件共享系统的设计,系统中的索引服务器用于存储资源的目录和相关信息,而文件的上传和下载则在各个节点之间完成,最后给出基于Java语言的系统实现原型。该系统采用XML标准的消息机制,易于扩展新的功能,使用多线程等技术实现文件的上传、下载、搜索、权限管理等功能。该系统可应用于企业内部用户文件资源的共享,降低企业的存储成本。     

支持VCR操作的P2P视频点播服务器容量配置方法

在P2P视频点播系统中,用户交互式操作(VCR操作)行为的异步特征使得用户间的数据共享更加困难,从而对视频源服务器的带宽和处理能力都提出了很高的要求.本文研究如何提高P2P视频点播系统的VCR操作用户体验,提出在P2P视频点播系统中增设一台服务器专用于支持用户的交互性操作,并研究了该服务器的容量配置问题.利用泊松过程描述点播请求到达交互支持服务器的行为,通过排队理论建立了用户点播请求最长允许等待时间与交互支持服务器服务带宽之间的定量关系.数据实验结果表明,只需相对较小的服务器容量,即可满足较大规模的用户点播数据请求.     

基于Donet的P2P流媒体直播优化调度算法

为了提高P2P流媒体系统的整体性能,改善节点的播放质量,针对现有调度算法启动延迟大和节点带宽利用率不高问题,提出了一种可动态调节各节点中待请求紧急数据的流媒体直播优化调度算法(LOSA).该算法不仅考虑了流媒体直播的时间特性,同时还考虑了如何减少紧急数据请求的等待时间以及对Peer节点上传带宽的充分利用.实验结果表明,LOSA算法缩短了终端用户观看视频的延迟,提高了媒体流的连续性.     

P2P文件共享系统的设计

系统Qt P2P file-sharing System(QPS)是利用Qt开发的P2P文件共享系统。QPS采用P2P中的混合模式,此模式结合了集中目录式和纯分布式两者的优点,在实现上具有简易性,在共享度上具有很强的扩展性。QPS的最大特点是加入了策略。这种策略能限制一些用户只下载而不共享资源的行为。策略的引入是为了鼓励用户与其他人分享自己的资源,而不仅仅是索取。入策略的QPS不仅能比较有效的限制只下载不分享的行为,而且对系统的寿命也有相当程度的提高。     

基于关键词设置的P2P信息检索

在分析以往结构化P2P基于单关键词分割的信息检索基础上,结合利用用户频繁出现的请求关键词的特点,提出结构化P2P中的一个基于请求关键词设置的索引框架KS-PIR。采用通过关键词联合的新特征项设置来扩充索引特征,并删节与特征项相关的索引记录表至恒定长度的方法,在检索质量提高的同时,又保证了可接受的带宽消耗,系统具有很好的扩展性。     

一种基于节点可选度的P2P点播流媒体数据调度算法

当前的P2P(Peer-to-Peer)点播流媒体系统中数据调度算法未能充分利用每个用户节点自身的特性.在分析典型数据调度算法基础上提出一种基于节点可选度的数据调度算法(SSP算法).该算法一方面在调度下载数据块时综合考虑了邻居节点带宽能力及其所拥有的数据信息.另一方面对服务节点的请求处理过程进行了优化.SSP算法有利于提高用户节点播放视频的连续性,降低流媒体服务器的负载压力,从而改善P2P点播流媒体系统的整体服务质量.仿真结果和实际应用表明算法性能良好,适用于用户节点能力差异较大的P2P点播流媒体环境.     

基于流的P2P网络特性模型

利用从实际网络获得的数据,提出基于流的P2P网络特性模型。采用图形方法和概述统计识别样本所服从的分布族,使用可视化图形方法和假设检验方法对统计分布模型进行拟合优度检验。分析结果表明,流持续时间的分布模型可以用对数正态分布精确表示,混合对数正态分布可以有效拟合流长和流传输速率分布的分布模型,且P2P应用的流长和流持续时间没有高度相关的关系。     

一种双重度量的分布式P2P信任模型

现有的P2P信任模型通常面向节点行为计算其信誉值,不能处理高信誉节点非法上传的特殊情况。提出一种双重度量信任模型,引入聚类方法分派节点的推荐权重,通过迭代得到节点的全局信誉值,然后结合资源自身的信誉信息,给出节点选择下载源的方法。仿真分析表明,相比类似模型,该模型可以进一步缓解节点恶意行为带来的负面影响。     

Stochastic Optimization for Content Sharing in P2P Systems

Available resources in peer-to-peer (P2P) systems depend strongly on resource contributions made by individual peers. Empirical data shows that in the absence of incentives, a majority of the participating peers do not contribute resources. Modeling interactions between individual peers is often difficult as the number of peers in the system can be very large, and the relationships among them can be very complex. In this paper, we propose a new solution for P2P systems, where peers upload and download content to and from the contributing peers based on agreed-upon/determined sharing rates. We propose a P2P solution that deters free-riders by imposing constraints on participating peers; specifically, a peer is allowed access to new content only as long as its own content contribution exceeds an adaptively set threshold. The constraints are enforced either by a central authority (e.g., a tracker) or by a decentralized coalition of peers in a swarm, social network, etc. We derive optimal upload policies for the peers given their estimated future download requirements and their previous contribution (credit) to the other peers. Our results show considerable improvement in the cost-benefit tradeoff for peers that deploy such an optimal policy as compared to heuristic upload policies. We also propose mechanisms based on which the coalition of peers can provide incentives or penalties to participating peers to adjust their policies such that the availability of content and/or number of peers contributing content is maximized.     

基于P2P 的大规模考试平台实例

在大规模考试中,由于同时参与考试的人员众多,考生登录时的试卷分发和交卷时的试卷回收常常因为并发访问量过大而造成服务器崩溃。P2P以节点平等为核心,淡化中心服务器的角色,以高效的方式向需要资源的节点分发内容,能很好的解决大规模考试中因过分依赖于中心服务器而造成的一系列问题。     

User density sensitive P2P streaming in wireless mesh networks

Link rate allocation is very important for supporting high video playback rate in Peer-to-Peer video streaming. Although many studies can be found on resource allocation in P2P streaming in wired networks, very few studies have studied the problem in wireless networks, especially in Wireless multi-hop Mesh Networks (WMNs), which is still challenging. To maximize the users’ satisfaction of P2P streaming in WMNs, this paper focuses on link rate allocation problem and proposes a fully distributed algorithm to efficiently utilize the upload and download bandwidth of wireless mesh nodes. We first build an efficient P2P streaming system based on the experimental results from real deployment of our wireless mesh testbed. Then we design an efficient distributed algorithm based on the solution to a linear optimization model, which optimizes towards a user-density-related objective to decide the best streaming rates among peers. Our scheme is resilient to network dynamics that is characteristic in wireless multi-hop peer-to-peer networks. The simulation experiments demonstrate the significant performance enhancement by using the proposed rate allocation algorithm in WMNs.     

融合P2P技术的云平台快速内容分发方法

云存储服务在内容分发过程中的数据传递协议通常采用超文本传输协议（HTTP）,当大量客户端在短时间内向云存储服务器发出下载同一文件的请求时,会造成云服务端带宽压力过大以及客户端下载过慢的问题。为有效解决该问题,提出了一种融合Peer-to-Peer （P2P）技术的云平台快速内容分发方法,在内容分发过程中构建动态的HTTP和P2P协议转换机制,实现快速内容分发。选取用户类型、服务质量、时间收益、带宽收益等四种协议转换度量指标,并基于OpenStack云平台实现了所提出的动态协议转换方法。实验结果表明,与仅使用HTTP或P2P协议的内容分发方式相比,动态协议转换方法能够保证客户端用户总是获得较短的内容下载时间,同时,当P2P客户端数量较大时能够有效节约服务提供商的带宽资源。     

Stochastic analysis of file-swarming systems

File swarming (or file sharing) is one of the most important applications in P2P networks. In this paper, we propose a stochastic framework to analyze a file-swarming system under realistic setting: constraints in upload/download capacity, collaboration among peers and incentive for chunk exchange. We first extend the results in the coupon system [L. Massoulie, M. Vojnovic, Coupon replication systems, in: Proc. ACM SIGMETRICS, Banff, Alberta, Canada, 2005] by providing a tighter performance bound. Then we generalize the coupon system by considering peers with limited upload and download capacity. We illustrate the last-piece problem and show the effectiveness of using forward error-correction (FEC) code and/or multiple requests to improve the performance. Lastly, we propose a framework to analyze an incentive-based file-swarming system. The stochastic framework we propose can serve as a basis for other researchers to analyze and design more advanced features of file-swarming systems.     

Fair and distributed peer-to-peer allocation of a common, refillable resource

We consider the general problem of distributed and fair peer-to-peer (P2P) allocation of a common, refillable resource. This problem recurs in a number of scenarios, for example grid computing, content distribution, Internet Service Provider service sharing, and distributed file storage over asymmetric channels. We present several distributed schemes for this allocation problem and show that these schemes guarantee two key properties: (i) asymptotic fairness, in that (even maliciously colluding) users are proportionally assigned resources corresponding to what they contribute; (ii) natural incentive to join and cooperate fairly in the system. We demonstrate the practicability of our approaches on a prototype P2P file storage system designed for typical residential Internet connections, in which download capacities often significantly exceed upload capacities. Our implementation shares file data when communications are idle using random linear codes so that, when needed, an end-user can download a file from several sources at a higher data rate than his home computer’s upload capacity. We present experimental results that support our analytical guarantees.     

P2P网络中自适应节点选择策略

以Bittorrent应用为背景,对P2P网络中传统的节点选择策略进行了研究分析,指出了传统节点选择策略中存在的随机选择节点连接与交互以及交互过程中节点带宽利用率偏低的问题.对Tracker以外的节点来源如DHT、PEX节点来源的情况进行分析,以自身上传带宽利用率和网络中各节点的空闲带宽为参考,以减少带宽资源浪费、提高带宽利用率为目的.针对节点选择各阶段特点,设计并实现自适应节点选择机制,实验表明在对原系统的公平性影响很小的情况下,自适应机制能有效的减少网络中带宽资源浪费并将自身上传节点带宽利用率提高8.45％.小规模节点环境下(100节点)平均缩短节点下载完成时间6.7％,大规模下载环境下(500节点)平均缩短下载完成时间36.3％.有效的提高了系统中文件的获得和分发效力.     

Mastering selfishness and heterogeneity in mobile P2P content distribution networks with multiple source download in cellular networks

The performance of Peer-to-Peer (P2P) content distribution networks depends highly on the coordination of the peers. This is especially true for cellular networks with mobile and often selfish users, as the resource constraints on accessible bandwidth and battery power are even more limitating in this context. Thus, it is a major challenge to identify mobile network specific problems and to develop sophisticated cooperation strategies to overcome these difficulties. Cooperation strategies, which are able to cope these problems, are the foundation for efficient mobile file exchange. The detailed performance of the strategies are determined by the peer capabilities and the peer behavior, such as the number of parallel upload connections, the selfishness, or the altruistic re-distribution of data. The purpose of this work is to evaluate and investigate different cooperation strategies which are based on multiple source download and select the best one for mobile scenarios with even leeching peers, i.e. peers which depart as soon as they have finished their download. The question arises whether the cooperation strategy can smoothen the overall performance degradation caused by a selfish peer behavior. As performance indicators the efficiency, fairness, and robustness of the cooperation strategies are applied. The considered scenarios comprise best-case (altruistic peers) and worst-case scenarios (selfish peers). We further propose a new cooperation strategy to improve the file transfer even when mainly selfish peers are present, the CycPriM (cyclic priority masking) strategy. The strategy allows an efficient P2P based content distribution using ordered chunk delivery with only local information available at a peer.