度量和分析BitTorrent

BitTorrent是一个用于内容分发的P2P协议,现在已经发展成为互联网的一项重要的应用.从性能的角度度量BitTorrent的行为,解释BitTorrent协议的关键元素,分析BitTorrent是否是高效的.1)提出一种有效度量BitTorrent式的P2P内容分发协议的仿真实验方法;2)确认BitTorrent协议的Neighbor Selection,Choking/Unchoking和Piece Selection机制存在诸多影响系统性能的缺陷;3)设计ShareStorm协议,作为参照对象,证明BitTorrent的缺陷在协议层可以避免.经仿真实验验证,在下载完成时间这个最主要的性能指标上,ShareStorm比BitTorrent至少减少50%.     

VideoTorrent:支持BitTorrent用户的P2P视频点播系统

P2P技术的本质就是利用用户的上传能力来完成数据分发,而增加这种上传能力利用率的途径之一就是增加数据分发时的协作人数.提出一种P2P视频点播系统VideoTorrent.对于所有实现了BitTorrent协议的文件共享系统中的用户,都能和Video Torrent中的用户对于同样的视频内容能进行数据上的交互.VideoTorrent对传统P2P视频点播系统进行了模块功能的扩展和数据交互机制的修改.同时,深入讨论了BitTorrent协议的策略对于系统性能影响.实验表明,支持BitTorrent用户之后,服务器的负载以及用户的体验都有了提高.     

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

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

基于GPU的RUB算法研究与实现

GPU通用计算已经在很多领域中得到应用,包括金融、石油、天文学、流体力学、信号处理、电磁仿真、模式识别、视频压缩等领域。将GPU通用计算应用到P2P协议中,通过使用全局存储器和共享存储器两种方法把BitTorrent协议中的随机邻居节点选择算法和随机文件块选择算法（RUB）映射到GPU上,用GPU加速了BitTorrent协议文件块的分发。     

BitTorrent系统中瞬间拥挤阶段建模与分析

BitTorrent是目前最流行的P2P内容分发系统之一.使用Kermack-Mckendrick模型对BitTorrent系统中瞬间拥挤(Flash-Crowd)阶段进行建模,研究了系统节点数及服务能力在瞬间拥挤阶段的发展演化过程.与原有模型相比,Kermack-Mckendrick模型能更好的吻合观测数据.最后结合BitTorrent系统的实际特点,给出提高BitTorrent系统处理瞬间拥挤能力的可行方案,如增加初始种子数量,减少文件段的大小,增加激励策略等.     

一种基于Netfilter的BitTorrent流量测量方法

BitTorrent是目前互联网上广泛使用的一种基于P2P的文件共享协议。它使用了动态端口，这给BitTorrent流量的准确测量带来了很大的困难。本文在分析BitTorrent协议基础上，给出了一种基于应用层特征匹配的BitTorrent流量测量方法。首先提取出BitTorrent流的应用层特征，利用Linux Netfilter／Iptables扩展架构实现数据包的应用层特征匹配。将TCP流分成了BitTorrent流和非BitTorrent流，对BitTorrent流进行统计。实验表明，该方法能实时准确地测量BitTorrent流量。     

一种面向BitTorrent的文件快速安全分发方案*

提出了一种能够很好利用BitTorrent快速传输特性的同时,也能增加文件下载安全控制的方案。BitTorrent是一种流行的快速传输分发文件的方式,但它存在一定的安全问题,如通过BitTorrent分发文件时,很容易被非法用户窃取获得明文文件。在面向BitTorrent协议基础上,结合使用对称加密技术和身份认证机制对其进行了改进：文件在提供下载前进行对称加密,然后通过BitTorrent进行传输分发;用户成功下载文件后需要进行身份认证,合法用户可以安全获得文件加密密钥,解密得到明文文件。实验结果表明该方     

BitTorrent下基于活跃度的传输节点选择算法

近年来,对等网络（peer to peer,P2P）因其高效的分片和分发等机制,已成为大数据高效分发的关键支撑技术。针对P2P文件分发系统BitTorrent中Tracker服务器端节点选择算法没有考虑节点活跃度的问题,提出了一种基于活跃度的Tracker服务器端节点选择算法。该算法选择出活跃度高的节点来建立一个更高效的分发网络,使之更能符合请求节点的需求,帮助请求节点更加高效地完成下载任务。实验结果表明,改进后的节点选择算法可以缩短文件的下载时间,提高网络的分发效率,提升系统的性能。     

一种基于Netfilter的BitTorrent流量控制方法

BitTorrent是目前互联网上广泛使用的一种基于P2P的文件共享协议。它使用了动态端口,这给BitTorrent流量控制带来了很大的困难。该文在分析BitTorrent协议基础上,给出了一种基于应用层特征匹配的BitTorrent流量控制方法。首先提取出BitTorrent流的应用层特征,利用Linux的Netfilter/Iptables扩展架构实现数据包的应用层特征匹配。并利用TC实现对它的流量控制。     

跨平台的BT开源项目——Source Forge最佳推荐

【项目描述】Azureus 是一个用 Java 写的优秀跨平台 BitTorrent,包括一个种子定位器和种子制作器,因此它能够提供运行 BitTorrent 所需的全套解决方案。BitTorrent 是一个使用点对点技术的文件分配协议,它能够减少在中央服务器上的直接负载。使用 BitTorrent协议,客户端不再是仅从一个单独超负荷的服务器上下载,而是可以同时从其他上百(甚至上千)个同等的客户端下载,进行高效高速的内容传输。在 new-from-the-ground-up 协议的执行上,Azureus 与其它 BitTorrent 客户端软件有所不同,它还更容易使用多下载的图形界面,并且支持更多的外挂设备。     

Performance analysis of BitTorrent-like systems with heterogeneous users

Among all peer-to-peer (P2P) systems, BitTorrent seems to be the most prevalent one. This success has drawn a great deal of research interest on the system. In particular, there have been many lines of research studying its scalability, performance, efficiency, and fairness. However, despite the large body of work, there has been no attempt mathematically to model, in a heterogeneous (and hence realistic) environment, what is perhaps the most important performance metric from an end user’s point of view: the average file download delay.

In this paper we propose a mathematical model that accurately predicts the average file download delay in a heterogeneous BitTorrent-like system. Our model is quite general, has been derived with minimal assumptions, and requires minimal system information. Then, we propose a flexible token-based scheme for BitTorrent-like systems that can be used to tradeoff between overall system performance and fairness to high bandwidth users, by properly setting its parameters. We extend our mathematical model to predict the average file download delays in the token- based system, and demonstrate how this model can be used to decide on the scheme’s parameters that achieve a target performance/fairness.     

Measurement,modeling and enhancement of BitTorrent-based VoD system

BitTorrent is one of the most popular Peer-to-Peer (P2P) applications for file sharing over the Internet. Video files take up a large proportion of space among the BitTorrent shared files. Recently, BitTorrent has attracted researchers’ interests, as an alternative method of providing video on demand (VoD) service. In this paper, we concentrate on enabling BitTorrent to support VoD service in existing swarms while maintaining the download efficiency of file-sharing users. We first examine the content properties of the BitTorrent system to explore the demands and challenges of VoD service in BitTorrent swarms. The efficiency of BitTorrent for various piece selection policies is then compared through measurement on PlanetLab. We also use an optimization mathematical model to analyze the hybrid BitTorrent system in which downloading peers and streaming peers coexist. Both measurement results and model analysis indicate the problem of system efficiency decline in the BitTorrent-based VoD systems, in comparison with the original BitTorrent file-sharing system. Our proposed approach, unlike existing strategies that are limited to changing the piece selection policy to allow BitTorrent to support streaming services, modifies both piece and peer selection policies to provide a “streaming while downloading” service in the BitTorrent system with downloading peers. For the peer selection policy, a CAP (Closest-Ahead Peers) method is applied to make better use of the peers’ upload bandwidths. For the piece selection policy, a sliding window-based hybrid method that combines the rarest-first policy with the sequential policy is proposed. To demonstrate the performance of our proposed approach, an evaluation is made using various metrics on PlanetLab. The results show that our proposed method has higher throughput and better streaming continuity than the sequential policy and BiToS.     

基于BitTorrent的P2P安全模型的设计

本文以基于BitTorrent的P2P安全模型设计为研究对象,从基于BitTorrent的P2P安全模型设计原则、设计结构框架这两个方面入手,对其做出了详细说明,在此基础之上侧重从基础安全服务层以及综合安全服务层这两点针对基于BitTorrent系统安全模型的设计作业进行了分析与研究,据此论证了BitTorrent在P2P网络安全建设与安全管理中深远的应用意义与价值。     

Enhancing tit-for-tat for incentive in BitTorrent networks

BitTorrent achives great success in its high performance for file distribution. It is commonly believed that this owes to Tit-for-Tat strategy adopted in choking algorithm for incentive in BitTorrent protocol. But there are still many issues in incentive mechanism in BitTorrent. In this paper, we study Tit-for-Tat strategy by constructing a game model in P2P environments and deducing the constraint under which the strict Tit-for-Tat is an equilibrium strategy. We then enhance and adapt the Tit-for-Tat strategy to the dynamic property in P2P networks, and deduce the constraint under which it is still an equilibrium strategy. We also study through simulations the performance improvement of the enhanced Tit-for-Tat, and give suggestion on how to choose proper system parameters under different network conditions. Finally, based on the enhanced Tit-for-Tat strategy, we propose a method to improve incentive in BitTorrent networks to cope with free-riding and fairness issues.     

基于Netfilter连接跟踪机制的BitTorrent协议监测

利用Linux2.4内核中防火墙平台中的连接跟踪机制,设计并实现了对BitTorrent协议的监测控制,从而有效的利用网络的带宽。     

基于BT协议的网络激励机制研究

由于p2p网络节点的匿名性和贡献资源的自愿性,绝大多数节点不愿共享自己的资源,从而导致大量搭便车现象的出现。在使用BitTorrent下载的过程中,为了能得到对方更快的下载速率,各个节点也能够为相应节点提供较快的下载速率,但在下载完成以后,大部分节点就不再为其他节点提供下载服务。在分析BitTorrent协议的基础上,该文提出了一种差异服务的激励机制,该激励机制能够激励节点持续不断地为其他节点提供下载服务,即使是在该节点下载完成以后也是如此。     

Locality-Awareness in BitTorrent-Like P2P Applications

This paper presents the measurement study of locality-aware P2P solutions over real-world Internet autonomous systems (AS) topology. By using the accesses of nodes of PlanetLab testbed, we create a detailed AS-level map including the end-to-end path of all nodes, as well as the relationship of all involved ASes. Based on this map, we evaluate the performance of a set of locality-aware P2P solutions, including an optimal solution guaranteeing the minimum AS hop count, as well as modified BitTorrent system with locality-awareness built into its neighbor selection, peer choking/unchoking, and piece selection processes. Our findings suggest that locality-awareness can help existing P2P solution to significantly decrease load on Internet, and achieve shorter downloading time. By comparing the performance of different kinds of locality-aware and traditional BitTorrent systems, we also point out the necessity to tradeoff between the goals of optimizing AS-related performance and achieving fairness among peers such as intra-AS traffic and peer burden fairness.      

一种适用于嵌入式系统的P2P下载模型*

提出了一种基于BitTorrent协议的嵌入式BT下载模型。该模型对BitTorrent思想进行了深化和应用,针对于快速BT网络,在嵌入式系统应用中进行了改进,有效提高了下载速度,甚至可以在嵌入式系统上快速下载多媒体视频文件进行播放。