基于改进的混合P2P的Chord算法

Chord是一种数值逐步逼近的P2P路由算法,它能够快速地定位资源。在Chord环上由于结点的随机性,资源定位时产生了逻辑路径和物理路径不一致及绕环问题,致使网络延迟增大。混合P2P具有很强的网络局部性,但查询效率低。提出了基于改进的混合P2P的Chord算法（Chord Algorithm Based on Enhanced Hybrid P2P,CBEH）,该算法利用增强的混合P2P中超级结点的网络信息,在路由过程中优先选取物理距离近的结点。实验表明CBEH能够有效地减少路由查找时延,提高路由性能。     

基于3G网络的P2P系统中基于模糊认知图的小区优先节点选择算法

移动通信环境的复杂性和3G蜂窝网络的结构特性为基于3G网络的P2P系统中的节点选择带来了挑战.针对基于3G网络的P2P系统中的节点选择算法进行了研究,提出了一种基于模糊认知图(fuzzy cognitive map,FCM)的小区优先节点选择算法,简称CF-FCM(cell first,FCM based)算法.仿真结果显示,CF-CFM算法能在取得优异的3G网络小区间负载均衡性的同时,保证良好的节点服务性能.     

P2P业务流量特性及其对Web业务的影响

近年来各种P2P应用不断出现及演进,P2P应用正逐渐成为下一代互联网的杀手级应用。但同时P2P消耗了Internet的大部分带宽,造成了网络技术服务商(ISP)接入网络的拥塞,从而使传统Internet应用性能受到严重影响。从P2P流数量、服务器负载、网络瓶颈点分布、往返时间(RTT)的异构特性等方面可以看出,P2P流量消耗了巨大的网络带宽,影响了传统Internet业务的性能,增加了运营成本。利用P2P流量和Web流量的集成模型,可以量化分析P2P流对Web流的影响,使网络运营商可以在网络瓶颈点对P2P连接数进行优化和调整,从而有效地控制P2P流量。NS2仿真结果较好地验证了该模型的有效性。     

P4P技术简介

与传统的两种思路,即P2P应用感知物理网络状况,或者运营商网络限制P2P流量不同,P4P将P2P应用和承载网联合设计,一方面使P2P应用利用网络的能力得到提升,另一方面减少了网络骨干线路上的负载,从而显著地提高ISP的网络效率。本文从P4P的背景、起源、架构、发展前景等方面对P4P进行了介绍。     

基于事件优先级的地理哈希表分发算法

无线传感器网络综合了传感器技术,分布式信息处理技术和无线通信技术,能够协作地实时监测、感知和采集各种信息并对其进行处理,进而传给目标用户,能量和效率是传感器网络最重要的考虑因素。GHT-DCS是一种能量高效且在查询时延和存取能效上取得较好平衡的一种数据分发方式。然而,该算法主要集中在降低能量消耗,很少综合考虑查询时延,网络负载均衡,能量消耗这三个方面。针对多优先级的事件查询,在改进GHT-DCS的条件下,该文提出了基于事件优先级的地理哈希表的分发算法GP-GHT,通过划分扇形区域存储,节省存储能耗;通过定义优先级,使得高优先级的事件离查询节点更近,能更快地被搜索到。该算法降低了能源消耗,缩短查询时延,可满足不同优先级事件时延的需求。     

P2P网络层次化信任模型

大规模文件共享P2P网络中节点之间发生重复交易的可能性较小而难以建立信任关系,从而导致P2P网络容易受到恶意节点攻击。针对该问题本文提出了基于群组的P2P网络层次化信任模型。该信任模型将信任关系划分为群组之间的信任关系,群组与节点之间的信任关系和节点之间的信任关系3个层次。节点利用本地信任信息或所属群组的推荐信任确定给定节点的信任值。仿真分析表明,该信任模型能够有效识别恶意节点,使P2P网络中合作节点具有较高的成功请求率。     

Exploring the accuracy of capturing snapshots in large‐scale P2P IPTV systems

With the growing maturity of peer‐to‐peer (P2P) technology, Internet protocol television (IPTV) applications based on that gained great success commercially and have attracted more and more attentions from both industry and academia. Currently, the active measurement method based on crawler technology is the most popular and effective one to study P2P IPTV systems. Existing measurement results revealed that accuracy of captured overlay snapshots depends on the crawling speed of crawler system. In order to capture more accurate overlay snapshots of P2P IPTV system, we developed a very fast and efficient distributed crawler system using the distributed architecture and peer degree‐rank mechanism. In this paper, we first introduce the architectures of PPTV channel‐list resource distribution and the whole system, which is the most popular and largest instance of P2P IPTV applications nowadays. Subsequently, this paper evaluates the crawling results of two dedicated crawlers capturing from peer‐list servers and ordinary peers, respectively. Finally, we propose a fast and accurate dedicated crawler system based on distributed architecture and peer degree rank for PPTV. The experiment results show that the performance of our distributed crawler system is much better than other existing crawler systems. Specifically, our distributed crawler can track a very popular channel with about 7200 online users in 30 s. It is also reasonable to believe that our distributed crawler system can capture complete overlay snapshots. To the best of our knowledge, our study work is the first to explore capturing accurate overlay snapshots of large‐scale P2P IPTV applications. Our crawler system can provide a good solution for capturing more accurate overlay snapshots of PPTV system and can also be used to help researchers to design crawler systems for other P2P IPTV systems. Copyright © 2015 John Wiley & Sons, Ltd.     

Query routing mismatch alleviation architecture for P2P file lookup in MANETs

A cross-layer optimized query routing mismatch alleviation(QRMA)architecture is proposed to mitigate the problem of query routing mismatch(QRM)phenomenon between the structured peer to peer(P2P)overlay and the routing layer in mobile Ad-hoc networks(MANETs),which is an important issue that results in the inefficiency of lookup process in the system.Explicated with the representative Chord protocol,the proposal exploits the information of topologic neighbors in the routing layer of MANETs to find if there is any optimized alternative next hop in P2P overlay during conventional lookup progress.Once an alternative next hop is detected,it will take the shortcut to accelerate the query procedure and therefore alleviate the QRM problem in scalable MANETs without any assistance of affiliation equipments such as GPS device.The probability of finding out such an alternative node is formulated and the factors that could increase the chance are discussed.The simulation results show that the proposed architecture can effectively alleviate the QRM problem and significantly improve the system performance compared with the conventional mechanism.     

Distributed key management scheme for peer‐to‐peer live streaming services

Live media streaming over peer‐to‐peer (P2P) network structures is commonplace nowadays. However, with the large number of users in a typical P2P system, it is impractical to use the central server to process the key information update requests of all the users Accordingly, the present study proposes a distributed key management scheme in which the server is only required to transmit the key update information to a limited number of users. To further reduce the load on the server, the update information is distributed using a hop‐by‐hop approach. An effective method is proposed for protecting the key update information as it is propagated through the network. In addition, a technique is presented for ensuring the security of the certificates used in the system It is shown that the distributed key management scheme and authentication procedure ensure an efficient and secure P2P live streaming performance even in the event of high churn rates. Copyright © 2012 John Wiley & Sons, Ltd.     

分层P2P实时流媒体系统中基于演进博弈的超级组对等节点选择算法

针对分层混合式P2P实时流媒体系统中的超级组对等节点选择问题,提出了以一种基于演进博弈论的分布式超级对等节点选择算法。首先使用演进博弈框架对P2P实时流媒体系统中的超级对等节点选择问题进行了建模,并对其演进稳定策略进行了求解分析。然后通过得到的混合策略设计了一种基于Q-Leaning的分布式SGP选择算法ESS-SGP,以达到激励对等组内的对等节点之间互相协作的目的。实验结果表明,与传统的随机选择超级对等节点方法相比,使用ESS-SGP算法所选择产生的超级组对等节点能够稳定地为系统提供更高的流媒体上传速率,使整个P2P流媒体系统的上传能力随着对等节点数目的增加而稳定增加,并为每个对等节点带来更好的收益。     

基于MP2P网络的内容分发机制研究

针对目前MP2P网络因节点频繁移动带来的扰动性,及节点有限的计算、存储能力等限制因素,提出分区管理的灵活策略,将节点按标准进行功能划分,每个子网由超级节点管理。采用部分网络编码技术处理数据,加快数据传输及更替效率。并提出跨子网查询算法加强子网间信息的交互及资源定位。实验结果表明,该策略可以有效地提高资源下载成功率与命中率,减少资源传输延时,改善了MP2P网络的内容分发效率,同时也增强了系统的顽健性。     

On the resilience of P2P botnet footprints in the presence of legitimate P2P traffic

Botnet is a distributed platform for illegal activities severely threaten the security of the Internet. Fortunately, although their complicated nature, bots leave some footprints during the C&C communication that have been utilized by security researchers to design detection mechanisms. Nevertheless, botnet designers are always trying to evade detection systems by leveraging the legitimate P2P protocol as C&C channel or even mimicking legitimate peer‐to‐peer (P2P) behavior. Consequently, detecting P2P botnet in the presence of normal P2P traffic is one of the most challenging issues in network security. However, the resilience of P2P botnet detection systems in the presence of normal P2P traffic is not investigated in most proposed schemes. In this paper, we focused on the footprint as the most essential part of a detection system and presented a taxonomy of footprints utilized in behavioral P2P botnet detection systems. Then, the resilience of mentioned footprints is analyzed using three evaluation scenarios. Our experimental and analytical investigations indicated that the most P2P botnet footprints are not resilient to the presence of legitimate P2P traffic and there is a pressing need to introduce more resilient footprints.     

A distributed utility‐based scheduling for peer‐to‐peer video streaming over wireless networks

Interactive multimedia applications such as peer‐to‐peer (P2P) video services over the Internet have gained increasing popularity during the past few years. However, the adopted Internet‐based P2P overlay network architecture hides the underlying network topology, assuming that channel quality is always in perfect condition. Because of the time‐varying nature of wireless channels, this hardly meets the user‐perceived video quality requirement when used in wireless environments. Considering the tightly coupled relationship between P2P overlay networks and the underlying networks, we propose a distributed utility‐based scheduling algorithm on the basis of a quality‐driven cross‐layer design framework to jointly optimize the parameters of different network layers to achieve highly improved video quality for P2P video streaming services in wireless networks. In this paper, the quality‐driven P2P scheduling algorithm is formulated into a distributed utility‐based distortion‐delay optimization problem, where the expected video distortion is minimized under the constraint of a given packet playback deadline to select the optimal combination of system parameters residing in different network layers. Specifically, encoding behaviors, network congestion, Automatic Repeat Request/Query (ARQ), and modulation and coding are jointly considered. Then, we provide the algorithmic solution to the formulated problem. The distributed optimization running on each peer node adopted in the proposed scheduling algorithm greatly reduces the computational intensity. Extensive experimental results also demonstrate 4–14 dB quality enhancement in terms of peak signal‐to‐noise ratio by using the proposed scheduling algorithm. Copyright © 2015 John Wiley & Sons, Ltd.     

一种面向结构化P2P网络的基于闲谈的资源发现方法

 结构化P2P网络下的多属性资源发现一直是一个公开问题.本文针对当前一种新颖的、优于传统方法的多属性资源发现方法－PIRD,深入分析了其在网络动态变化时可能出现的低查询效率问题,并提出一种解决方法:基于闲谈的PIRD(Gossip-based PIRD,G-PIRD).G-PIRD通过闲谈算法估计网络规模,动态调整资源索引的发布以保证高的查询效率.同时针对G-PIRD可能导致的负载不均衡问题,提出一种基于有界LSH(Bounded LSH,B-LSH )的负载均衡策略.试验证明:G-PIRD能动态适应网络变化,保证高效率的多属性资源发现;以及G-PIRD的负载均衡策略在保证高查询效率的同时,大大地降低了节点的索引负载.     

SeekStream: adapting to dynamic user behavior in P2P video‐on‐demand

In recent years, the users' perceived quality of experience (QoE) in streaming services has gained a lot of attention. Particularly, a number of research efforts have focused on providing live streaming and video‐on‐demand (VoD) services using peer‐to‐peer (P2P) architectures. However, in these proposed architectures, the heterogeneity of users and their dynamic behavior has not been sufficiently studied. In a real life scenario, where users have highly heterogeneous bandwidth resources (cable, DSL, 3G networks, etc) and can arbitrarily decide to perform a VCR function (stop, fast forward and seeking), ignoring this behavior can significantly deteriorate the system's efficiency and the perceived QoE. In this paper, we present SeekStream, a scalable P2P VoD architecture that ensures the stable delivery of the video stream to every participating user even in cases of high heterogeneity and frequent seeking operations. Specifically, SeekStream is a set of algorithms that optimize the P2P overlay dynamically and in a distributed fashion, making it adaptive to users dynamic behavior and bandwidth changes. The available bandwidth resources of the participating users are optimally exploited, keeping the contribution from the media server(s) to a minimal level. To illustrate the performance of the proposed algorithms, we are using a centralized overlay network manager that discovers the optimal network graph as a reference. We have developed an extensive P2P VoD simulator that shows the efficiency, scalability, and stability of our system under variant and dynamic conditions. The algorithms of our proposed system introduce less than 4% bandwidth overhead while we achieve high offloading of the media server(s). SeekStream guarantees a high block reception rate for the users, even under extreme seeking patterns. Copyright © 2016 John Wiley & Sons, Ltd.     

Improving Resilience against DDoS Attack in Unstructured P2P Networks

In unstructured peer-to-peer （P2P） systems such as Gnutella, a general routing search algorithm is used to blindly flood a query through network among peers. But unfortunately, malicious nodes could easily make use of the search approach launching distributed denial of service （DDoS） attack which aims at the whole network. In order to alleviate or minimize the bad effect due to behavior of malicious nodes using the flooding search mechanism, the paper proposes a Markov-based evaluation model which exerts the trust and reputation mechanism to computing the level of trustworthy of nodes having the information requested by evaluation of the nodes＇ history behavior. Moreover, it can differentiate malicious nodes as early as possible for isolating and controlling the ones＇ message transmitted. The simulation results of the algorithm proposed show that it could effectively isolate malicious nodes, and hold back the transmission of vicious messages so that it could enhance tolerance of DDoS based on flooding in Guutella-like P2P network.     

基于P2P技术的网格资源发现中覆盖网络的构建

文章针对网格环境下的集中式资源发现机制的不足,设计了基于P2P技术的资源发现模型,并在分析典型P2P系统Gnutella覆盖网络构建方式的基础上,提出了网格环境下进行覆盖网络构建的新方式--定序方式.按照定序方式构建的覆盖网络可以保证资源发现的服务质量,同时定序方式以节点间的网络延时作为覆盖网络构建的依据,请求消息按照小的网络延时路径在覆盖网络上传播,从而可以提高资源发现的效率.     

基于有向无环图的P2P流媒体播放系统

文中针对P2P流媒体播放中的网络拓扑构建问题,通过抽象和刻画播放节点之间的媒体同步关系,提出了基于有向无环图结构的网络拓扑构建技术。实验表明,该技术具有数据传输率高,播放延迟小等优点。基于该技术实现的P2P流媒体播放系统已经部署在Cernet2网络中。     

P2P文件传输中网络资源搜索策略改进

资源搜索和共享是P2P网络中重要的应用,进行高效资源的查询是提高系统效率、增强系统可扩展性的重要的技术问题.介绍了对等网络的基本特征和一些主要改进查询策略,同时分析了这些策略存在的问题,并在此基础上提出了一种基于资源路由表的缓存策略,最后对此方法进行模拟仿真,证明该策略可以有效地提高非结构化文件传输系统的效率及可扩展性.