Characterizing Unstructured Overlay Topologies in Modern P2P File-Sharing Systems

In recent years, peer-to-peer (P2P) file-sharing systems have evolved to accommodate growing numbers of participating peers. In particular, new features have changed the properties of the unstructured overlay topologies formed by these peers. Little is known about the characteristics of these topologies and their dynamics in modern file-sharing applications, despite their importance. This paper presents a detailed characterization of P2P overlay topologies and their dynamics, focusing on the modern Gnutella network. We present Cruiser, a fast and accurate P2P crawler, which can capture a complete snapshot of the Gnutella network of more than one million peers in just a few minutes, and show how inaccuracy in snapshots can lead to erroneous conclusions-such as a power-law degree distribution. Leveraging recent overlay snapshots captured with Cruiser, we characterize the graph-related properties of individual overlay snapshots and overlay dynamics across slices of back-to-back snapshots. Our results reveal that while the Gnutella network has dramatically grown and changed in many ways, it still exhibits the clustering and short path lengths of a small world network. Furthermore, its overlay topology is highly resilient to random peer departure and even systematic attacks. More interestingly, overlay dynamics lead to an ldquoonion-likerdquo biased connectivity among peers where each peer is more likely connected to peers with higher uptime. Therefore, long-lived peers form a stable core that ensures reachability among peers despite overlay dynamics.     

一款大规模P2P网络电视系统的污染攻击研究

With the rapid development of Peer-to-Peer (P2P) technology, IPTV applications based on that have received more and more attention from both industry and academia. Several applications using the data-driven mesh-pull architectures raised and gained great success commercially. At present, PPLive system is one of the most popular instances of IPTV applications which attract a large number of users from across the globe. At the same time, however, the dramatic rise in popularity makes it more likely to become a vulnerable target. In this paper, we propose an effective measurement architecture, which is based on the peer’s nature not only receiving polluted video chunks but also forwarding those to other peers, to measure the video streaming pollution attack and then use a dedicated crawler of PPLive developed by us to evaluate the impact of pollution in P2P live streaming. Specifically, the results show that a single polluter is capable of compromising all the system and its destructiveness is severe.     

GPM: A generic and scalable P2P model that optimizes tree depth for multicast communications

Group communications (real‐time and non‐real‐time) refer to one‐to‐many or many‐to‐many communications. On the one hand, multicast is considered as an appropriate solution for supporting group communication‐oriented applications (we distinguish IP network multicast from application layer multicast). On the other hand, peer‐to‐peer model tends to be a good candidate for supporting today Internet applications (e.g. P2P IPTV, P2P VoIP, etc.). In this context, P2P has attracted significant interest in the recent years. This is mainly due to its properties that also make P2P well adapted to today social networks. In this paper, we propose GPM (Generic P2P Multicast): a novel generic and scalable approach, that optimizes multicast tree depth in P2P networks (structured and unstructured), and contributes to control the network overlay latency. For multicast tree construction, the approach we propose is based on a distributed algorithm using a specific data structures (adjacency and forwarding matrixes). GPM model inherits from P2P attributes such as scalability, flexibility and fault tolerance, while taking into consideration the respective characteristics of one‐to‐many and many‐to‐many type of applications. We also give a performance evaluation for validation and comparison purposes while considering some main existing application layer multicast protocols. Copyright © 2011 John Wiley & Sons, Ltd.     

A survey and comparison on overlay‐underlay mapping techniques in peer‐to‐peer overlay networks

Peer‐to‐peer (P2P) overlay networks were developed initially for file sharing such as Napster and Gnutella; but later, they have become popular for content sharing, media streaming, telephony applications, etc. Underlay‐unawareness in P2P systems can result in suboptimal peer selection for overlay routing and hence poor performance. In this paper, we present a comprehensive survey of the research work carried out to solve the overlay‐underlay mapping problems up till now. The majority of underlay‐aware proposals for peer selection focus on finding the shortest overlay routes by selecting nearest nodes according to proximity information. Another class of approaches is based on passive or active probing for provision of underlay information to P2P applications. Some other optimizations propose use of P2P middleware to extract, process, and refine underlay information and provide it to P2P overlay applications. Another class of approaches strive to use ISPs or third parties to provide underlay information to P2P overlay applications according to their requirements. We have made a state‐of‐the‐art review and comparison for addressing the overlay‐underlay mismatch in terms of their operation, merits, limitations, and future directions.     

CDNPatch: a cost‐effective failover mechanism for hybrid CDN‐P2P live streaming systems

Among the most well‐established live media distribution technologies is content delivery network (CDN), which improves user‐perceived quality of service by delivering content from proxy servers deployed at the Internet's edge. In recent years, CDN providers started to tap into their subscribers' peer‐to‐peer (P2P) capacity to alleviate their server costs. Under the inherent peer dynamics, a major challenge of these hybrid CDN‐P2P systems is to provide efficient failure recovery with good quality of service guarantees at a reduced server cost. In this work we propose a cost‐effective failover solution named CDNPatch to address the aforementioned problem. CDNPatch enables peers to periodically precompute a few backup content suppliers by efficient information exchange and maintenance algorithms, and leverages auxiliary CDN servers and an economic server provisioning algorithm to reduce the chance of playback interruption occurring to peers. Our simulation results show that CDNPatch can mask the impact of peer dynamics of 3 real P2P systems, namely, SOPCast, PPStream, and PPTV, with 100 % failure recovery success rate and a failure recovery time less than 1 second at a cost of small P2P communication overhead of less than 1 kilobits per second, while using only 10%, 21%, and 51%, respectively, of the pure CDN scheme's server consumption.     

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.     

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.     

Modeling and analysis of access transparency and scalability in P2P distributed systems

Peer‐to‐peer (P2P) systems have been developed with the goal of providing support for transparent and efficient sharing of scalable distributed resources wherein size scalability is limited by the costs of all types of transparencies, especially data access transparency, which are due to the need for frequent data exchanges between peers and other related communication overheads. We present a model that formulates the relationship between scalability and data access transparency in P2P distributed systems to figure out how large these systems can be scaled up, given the overheads of establishing data access transparency. To validate our model and show how our model can be deployed in real life, we consider a real P2P distributed system as a case study and evaluate how CPU utilization, bandwidth, and data request frequency parameters of our model relate to the amount of effort required by the system management to establish data access transparency. We then calculate the strength of the coefficient of correlation of scalability and data access transparency in the system. The degree of strength of this coefficient allows the system designer to decide at design time whether to allow the use of the model in the management of system at runtime or not. Copyright © 2012 John Wiley & Sons, Ltd.     

基于信誉度的P2P反污染机制

文件污染是当前P2P文件共享系统普遍存在的问题,极大地影响了系统的可用性。文中提出一种基于资源和节点的信誉度的反污染机制——R＆amp;Ptrust,其中资源和节点的信誉度是全局计算的。R＆amp;Ptrust还包括隔离主动污染者的惩罚机制和激励被动污染者删除污染文件的激励机制。仿真结果表明,R＆amp;Ptrust能有效的隔离污染者并遏制污染文件的传播,具有良好的反污染性能。     

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.     

P2P对FTTH的影响

文章对点对点( Peer-to-Peer,P2P)技术和光纤到户(FTTH)的概念进行了简单描述.重点对P2P的应用、P2P应用的带宽需求、P2P在IP网络电视(IPTV)中的应用特点进行了分析.最后得出了这样一个结论,P2P的应用不可阻挡,FTTH的普及也是不可阻挡的.     

P2broadcast: a hierarchical clustering live video streaming system for P2P networks

This work describes a novel live video streaming system for P2P networks, referred to as P2broadcast. The video streaming service has bandwidth requirements to guarantee presentation quality. Therefore, a scalable strategy to quickly find a path from a media server to a client with abundant bandwidth is very important. A common approach in the literature is the bandwidth first (BF) scheme, which allows a newcomer to adopt a BF tree traversal scheme to find its parent peer on the P2P overlay tree to retrieve the media content. The BF scheme is likely to build a deep overlay tree, resulting in long start‐up latency as the number of peers on the overlay tree grows. P2broadcast reduces start‐up latency by organizing peers into hierarchical clusters and making the overlay tree become a ‘short‐and‐wide’ tree. The hierarchical clustering structure enables a newcomer to find its parent peer among the set of peers that are more likely to provide large available bandwidth only. Limiting the set of potential parent peers not only reduces start‐up latency but also improves the system availability. Additionally, unlike the BF scheme that only concerns available bandwidth, P2broadcast utilizes a cost function to evaluate the appropriateness of a potential parent peer. The cost function considers the depth of the newcomer on the overlay tree, making the overlay tree become a short‐and‐wide tree. In addition to start‐up latency reduction, the short‐and‐wide tree feature also alleviates the service interruption probability due to the leaving or failure of a peer. Our simulation results show that P2broadcast greatly outperforms the BF scheme in terms of system availability, and achieves around 66% savings in start‐up latency and 10% decrement in service interruption probability. Copyright © 2005 John Wiley & Sons, Ltd.     

HPSIN: a new hybrid P2P spatial indexing network

Geographic information system(GIS)is increasingly managing very large sets of data,hence a centralized data index may not always provide the most scalable solution.Recently,the peer to peer(P2P)networks have become very popular for sharing information in a totally decentralized manner.In this paper,a new hybrid P2P spatial indexing network(HPSIN)is proposed,which combines distributed quad-tree with distributed Hash table(DHT)based Chord network to maintain both query efficiency and system load balance.In addition,a simple theoretical model based on opened queueing network for HPSIN is established.Assuming each peer as M/M/1 queueing processor in the model,fundamental characteristics of the system is captured,and expression of average query delay is obtained in close form.The theoretical analysis and numerical computing results show that there exists an optimum point of tradeoff between efficiency and load balance.By setting a proper value of start index level ls for different network scale and query rate,HPSIN will achieve the minimum overall query delay,therefore,can adapt to different P2P application environments.     

Structural‐based tunneling: preserving mutual anonymity for circular P2P networks

Many methods are suggested to preserve anonymity of users for peer‐to‐peer (P2P) networks. Most of these methods, by relying on established anonymous solutions on client/server applications, are presented for unstructured P2P networks. However, structured overlays, by using distributed hash tables for their routing, do not resemble traditional paradigms. Therefore, current anonymous methods cannot be implemented for them easily. In this paper, we introduce structural‐based tunneling (SBT) to provide mutual anonymity for circular P2P structures. In this method, we get help from inherited features of network infrastructure to establish a standard way for making tunnels. SBT introduces a flexible design that is able to manage different parts of the tunnels on current infrastructures. For this purpose, we incorporate SBT with Chord to show how such design can be managed for real‐world applications. The results of applied method with simulations show that by managing critical features of SBT, a trade‐off can be made between stronger security and performance of the network. Copyright © 2015 John Wiley & Sons, Ltd.     

Performance analysis of a P2P‐enabled TDD‐CDMA network with intra‐cell spatial resource reuse

In this paper a scheme of intra‐cell spatial resource reuse is proposed for a peer‐to‐peer (P2P) enabled TDD‐CDMA system to increase the system capacity via only software update. On account of the new interference scenario in our scheme, a more accurate model of signal to interference and noise ratio (SINR) is deduced and analyzed instead of using the conventional equation. As demonstrated by our system‐level simulations, the capacity is significantly improved by reusing the same radio resource among different P2P transmitters within a single cellular cell in the spatial domain. Furthermore, we employ critical values of SINR target observed from simulation results to indicate whether the P2P‐enabled system is resource‐restricted or interference‐restricted for a certain application scenario. By means of a hexagon‐padding plan, the relation between co‐channel reuse distance and single‐hop distance is also pointed out to help to apply our scheme to a real implementation. Copyright © 2008 John Wiley & Sons, Ltd.     

机顶盒参与P2P分发的IPTV点播业务可行性研究

为了有效降低上海电信IPTV的运营和部署成本,由机顶盒参与P2P分发的IPTV点播方案是一个可能的有效方案。为了研究这个方案的可行性,首先提出了机顶盒参与P2P分发的IPTV系统主要性能指标及主要影响参数,分析上海电信IPTV系统的实际用户行为数据和实际网络拓扑,并构建大规模IPTV计算机仿真系统RVSPS,然后用真实的用户行为和拓扑激励仿真系统,分析各类参数对主要系统性能指标的影响,从技术角度详细研究机顶盒参与P2P分发的上海电信IPTV点播业务的可行性。     

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

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

Adaptive traffic sampling for P2P botnet detection

Peer‐to‐peer (P2P) botnets have become one of the major threats to network security. Most existing botnet detection systems detect bots by examining network traffic. Unfortunately, the traffic volumes typical of current high‐speed Internet Service Provider and enterprise networks are challenging for these network‐based systems, which perform computationally complex analyses. In this paper, we propose an adaptive traffic sampling system that aims to effectively reduce the volume of traffic that P2P botnet detectors need to process while not degrading their detection accuracy. Our system first identifies a small number of potential P2P bots in high‐speed networks as soon as possible, and then samples as many botnet‐related packets as possible with a predefined target sampling rate. The sampled traffic then can be delivered to fine‐grained detectors for further in‐depth analysis. We evaluate our system using traffic datasets of real‐world and popular P2P botnets. The experiments demonstrate that our system can identify potential P2P bots quickly and accurately with few false positives and greatly increase the proportion of botnet‐related packets in the sampled packets while maintain the high detection accuracy of the fine‐grained detectors.     

P2P技术在IPTV中的应用

IPTV是基于宽带高速IP网的流媒体服务，提出基于对等网络模式的IPTV系统，从而克服了现在IPTV系统的“瓶颈”问题，对P2P技术存在的问题进行分析并提出对策。     

具有位置感知和语义特征的P2P网络模型

 非结构化P2P网络中常用的泛洪搜索方法造成了严重的通信消耗.提出一种基于位置感知和语义的P2P网络模型,在覆盖网络的构建过程中考虑底层的物理网络拓扑,同时兼顾拓扑结构与共享资源之间的相关性.该网格模型基础上,给出了语义搜索算法.实验结果表明,提出的网络模型能够减少覆盖网络与底层物理网络拓扑不匹配带来的网络开销,并且在查找性能和网络开销之间取得了良好的平衡.