基于拥塞控制的非结构化P2P网络的路由负载均衡策略

非结构化P2P(unstructured peer-to-peer network)对等网络中的节点资源定位的路由查询是对等网络研究中的一个主要难题,特别是当网络中客户端节点由于其频繁加入、离开导致网络结构动态变化所带来的资源查询难题.提出了一种新的基于拥塞控制的路由查询方法来实现动态网络下的资源查询.该方法分两部分实现:首先是网络资源的分组与节点重连策略.该策略使得具有同等资源的节点相互连接,并周期性地调整节点上的节点连接数量以减少同组资源节点上的负载.通过以上策略,使得网络的拓扑结构自动地从随机网络结构进化到以资源组为单位的聚类网络,从而使得网络中形成网络资源组间的查询负载均衡.另一方面,组内的节点之间的路由负载均衡是通过节点间协同学习实现的.采用协同Q-学习方法,所研究的方法不仅从节点上学习其处理能力、连接数和资源的个数等参数,还将节点的拥塞状态作为协同Q-学习的重要参数,并建立模型.通过这种技术,同一组节点上的资源查询被有目的地引导,以避开那些组内拥塞的节点,从而最终实现资源组内节点之间的查询均衡.仿真实验结果表明,相比常用的random walk资源查找方法,该研究所实现的资源定位方法能够更迅速地实现网络的资源查询.仿真结果还表明,相比random walk方法,所提出的方法在网络高强度查询和网络节点动态加入和退出的情况下进行查询具有更高的鲁棒性和适应性.     

基于IPv6、簇和超节点的P2P路由模型研究

针对当前P2P网络模型存在逻辑拓扑与物理拓扑失配和没有充分考虑节点异构性的缺点,利用IPv6特有的层次化地理布局,实现逻辑拓扑与物理拓扑的有效结合,应用簇减少节点频繁加入和退出所带来的网络抖动问题,充分考虑节点之间的性能差异,让性能好的节点承担更多的任务,利用节点成功的资源访问记录进一步提高路由效率。通过模拟实验和对相关数据的分析,证明该项研究能使路由延迟减少,网络更稳定,更易于管理和维护。     

MobiStore: A system for efficient mobile P2P data sharing

MobiStore is a P2P data store for decentralized mobile computing, designed to achieve high availability and load balance. As P2P platforms, mobile devices connected to the Internet through WiFi or cellular networks are different from wired devices in two main aspects: (1) higher churn due to mobility, weak wireless signals, or battery constraints, and (2) significant variability in bandwidth and latency based on the point of attachment. These problems affect the stored content availability and skew the content serving load over the peers. MobiStore structures the mobile P2P network into clusters of redundant peers. The topology uses both algorithmically-defined and random edges among the peers of different clusters. The routing information is updated using a gossip-based protocol. Thus, MobiStore achieves, with high probability, O(1) lookup operations despite high churn and link variability. Inside the clusters, all peers replicate the content, which improves the content availability. Furthermore, based on the current load, MobiStore dynamically changes the number of peers inside the clusters and routes content request to randomly selected peers. These two dynamic techniques along with using consistent hashing to map content to peers balance the load over the peers. While some of these techniques are well known, the main contribution is on the novel ways of applying them to design and implement an efficient mobile P2P data store. Simulation results show MobiStore achieves an availability, i.e., lookup success rate, between 12–48 % higher than two baseline systems built over the MR-Chord and Chord P2P protocols; and it reduces the latency up to 9 times compared to these protocols. Finally, the results show MobiStore adapts to churn and workload to evenly distribute the requests across clusters and peers better than both baseline solutions.     

Shortest-path routing in randomized DHT-based Peer-to-Peer systems

Randomized DHT-based Peer-to-Peer (P2P) systems grant nodes certain flexibility in selecting their overlay neighbors, leading to irregular overlay structures but to better overall performance in terms of path latency, static resilience and local convergence. However, routing in the presence of overlay irregularity is challenging. In this paper, we propose a novel routing protocol, RASTER, that approximates shortest overlay routes between nodes in randomized DHTs. Unlike previously proposed routing protocols, RASTER encodes and aggregates routing information. Its simple bitmap-encoding scheme together with the proposed RASTER routing algorithm enable a performance edge over current overlay routing protocols. RASTER provides a forwarding overhead of merely a small constant number of bitwise operations, a routing performance close to optimal, and a better resilience to churn. RASTER also provides nodes with the flexibility to adjust the size of the maintained routing information based on their storage/processing capabilities. The cost of storing and exchanging encoded routing information is manageable and grows logarithmically with the number of nodes in the system.     

P2P超级点网络可靠性及动态自恢复机制的研究

基于DHT的P2P算法能够提供更有效的路由性能，因此具有良好的应用前景。但是P2P网络较强的波动性及引起的DHT迁移，造成维护路由信息需要很大的网络开销。本文提出了一种可靠节点选择和一种动态自恢复机制增强网络的稳定，抑制迁移现象，减少了网络流量，保证了DHT算法的有效性。     

Laurel:一种混合式数据分发覆盖网

覆盖网是各种数据分发应用的基础架构.在节点波动的网络环境中实现快速而准确的数据分发,对覆盖网提出了两个要求:高效的数据路由;较强的系统鲁棒性.已有的覆盖网构建方法多侧重于某个方面的优化,因而未能充分权衡数据路由效率与系统鲁棒性.提出了一种混合式数据分发覆盖网--Laurel.Laurel通过簇间多重结构化拓扑与簇内非结...     

PROSE: Proactive, Selective CDN Participation for P2P Streaming

Many production peer-to-peer (P2P) streaming systems use content delivery networks (CDN) to protect the user’s quality of experiences. Thus, how to efficiently utilize the capacity of CDN (e.g., which peers receive services from the CDN nodes) is a problem of practical significance. Existing solutions adopt a passive, on-demand approach, which is inefficient in utilizing CDN resources. In this paper, we propose PROSE, a simple, novel scheme to achieve proactive, selective CDN participation for P2P streaming. PROSE introduces novel concepts such as choke point expansion nodes/super nodes and leads to efficient, light-weighted, and distributed algorithms to identify and serve these nodes using CDN. Our experimental results show that PROSE achieves at least 10%～25% performance improvement and 2～4 times overhead reduction compared with existing general CDN-P2P-hybrid schemes.     

基于结构化对等网的分布式资源发现方法

为了解决大型分布式系统由集中管理导致的扩展性和鲁棒性差的问题,利用改进的结构化对等网组织分布式计算资源,将逻辑空间中的节点分为主机节点和资源节点,分别采取相容性Hash和位置保留Hash与对等网逻辑空间匹配,以满足资源信息的范围查询。     

Dynamic quorums for DHT-based enterprise infrastructures

Peer-to-peer systems (P2P) have become a popular technique to design large-scale distributed applications in unmanaged inter-domain settings, such as file sharing or chat systems, thanks to their capabilities to self-organize and evenly split the load among peers. Recently, enterprises owning a large IT hardware and software infrastructure started looking at these P2P technologies as a means both to reduce costs and to help their technical divisions to manage huge number of devices characterized by a high level of cooperation and a relatively low churn. Gaining a quick exclusive access to the system for maintenance or auditing purposes in these enterprise infrastructures is a fundamental operation to be implemented. Conversely, this kind of operation is usually not an issue in the previously mentioned inter-domain setting, where peers are inherently independent and cannot be managed.     

A novel replication technique to attenuate churn effects

Dealing with the churn problem is an important requirement in distributed systems in general and more precisely in structured peer-to-peer overlay networks due to their dynamicity. This problem refers to the change in the set of participating nodes due to the frequent joins, leaves or failures. Such variations induce at worst the loss of objects and at least performance degradation. This is due to the reorganization of the set of replicas of the affected objects. Till now, this problem has been mostly addressed at the p2p routing level to ensure the reach ability of peers by maintaining the consistency of the logical neighbors. However, the main challenge for structured p2p systems is to protect the ability of the system to locate any present object. At the storage level, avoiding data losses is still an issue when a reconfiguration of the participant peers occurs. In this paper and after presenting first the existing replication techniques, we propose the zone replication technique used in both Chord and Kademlia protocols in order to attenuate churn effects. Finally, we point out some ways that can lead to better and maybe robust replication protocols.     

一种P2P电子商务平台的设计

将P2P应用于电子商务，面临的首要挑战就是如何表达和存储电子商务数据，及如何高效的搜索到所需数据．针对该问题提出了一种Peer—to—Peer模式的电子商务平台DEP模型，借鉴了DNSES及JXTA思想，利用多级分布式索引对peers进行半结构化管理．实验结果显示DEP具有很好的可扩展性，同时与传统模型相比可以很大程度地降低数据检索时的查询路由次数及系统的通讯量．     

混合内容分发网络及其性能分析模型

在大规模数字内容网络分发方面,占主导地位的CDN(Content Delivery Network)和P2P(Peer-to-Peer)网络具有显著互补优势.CDN网络可降低数据传输延迟,提高用户体验;P2P网络的部署成本低,可扩展性强.文章提出一种基于CDN和PZP技术的混合内容分发网络(Hybrid Content Distribution Network,HCDN),在骨干网部署CDN系统,在接入网构建P2P区域化网络,终端用户可同时通过CDN和P2P网络获取数据;阐述了HCDN网络模型及其内容分发处理流程,包括内容路由、副本放置和数据下载;给出了基于流模型的混合网络性能模型,并从节点数量变化、下载时间、服务能力和传输开销等方面进行综合性能评价.实验结果表明,HCDN能提高下载速率、降低服务器负载以及减小骨干网传输流量,既可克服CDN网络部署成本高的缺点,也可避免P2P网络在节点数量稀缺时的低性能.     

CDN验证系统在P2P网络中的应用①

提出了一种基于CDN网络的P2P验证方法,有效解决了P2P网络的用户验证问题。具体的实现方法是：首先分析了P2P网络的系统架构,接着探讨了基于CDN网络的P2P验证原理,最后提炼出基于CDN网络的P2P验证流程。研究结果表明：提出的基于CDN网络的P2P验证方法不但解决了P2P网络的用户验证问题,而且提高了用户验证的效率和准确性。     

PSON: A scalable P2P file sharing system with efficient complex query support

A desired P2P file sharing system is expected to achieve the following design goals: scalability, routing efficiency and complex query support. In this paper, we propose a powerful P2P file sharing system, PSON, which can satisfy all the three desired properties. PSON is essentially a semantic overlay network of logical nodes. Each logical node represents a cluster of peers that are close to each other. A powerful peer is selected in each cluster to support query routing on the overlay network while the less powerful peers are responsible for the maintenance of shared contents. To facilitate query routing, super peers are organized in form of a balanced binary search tree. By exploiting the concept of semantics, PSON can support complex queries in a scalable and efficient way. In this paper, we present the basic system design such as the semantic overlay construction, query routing and system dynamics. A load balancing scheme is proposed to further enhance the system performance. By simulation experiments, we show that PSON is scalable, efficient and is able to support complex queries.     

P2P环境中基于信任度的服务路由系统的研究*

随着网络的飞速发展,基于P2P结构的分布式应用越来越多。P2P系统节点之间的资源高度共享,节点之间的信息搜索和交换往往需要第三方节点进行信息中转,这为信息窃取和信息窜改类型的网络攻击带来了便利。为了提高P2P应用的可用性,提出了在P2P环境下一种新的以可信度为标准的服务路由系统的模型,阐述了模型的设计思想,并详细介绍了其实现机制。对仿真系统进行了性能测试,并对测试结果进行了分析。该模型对于信息窜改、信息窃听及路由功能失效等类型的恶意攻击有较好的抑制作用。     

Design, optimization and performance evaluation of a content distribution overlay for streaming

As an evolution of peer-to-peer (p2p) file-sharing applications, overlay-based networks are also adopted to efficiently distribute content with real-time constraints to a wide user population. In addition, they can be utilized to exploit application level strategies to overcome limitations imposed by the underlying network infrastructure, e.g., the lack of multicast support.In this perspective, the paper introduces an overlay Content Distribution Network (CDN) able to sustain the real-time delivery of data streams. To better use resources, and to face the churn affecting users, the control and optimization of the CDN are performed through a model predictive control scheme. Simulations of two use cases are provided to show the effectiveness of the proposed solution. In particular, the stream of multimedia and interactive grid data are considered.     

Improving the resilience of content distribution networks to large scale distributed denial of service attacks

Distributed Denial of Service (DDoS) attacks remain a daunting challenge for Internet service providers. Previous work on countering these attacks has focused primarily on attacks at a single server location and the associated network infrastructure. Increasingly, however, high-volume sites are served via content distribution networks (CDNs). In this paper, we propose two mechanisms to withstand and deter DDoS attacks on CDN-hosted Web sites and the CDN infrastructure. First, we present a novel CDN request routing algorithm which allows CDN proxies to effectively distinguish attacks from the requests from actual users. The proposed scheme, based on the keyed hash function, can significantly improve the resilience of CDNs to DDoS attacks. In particular, the resilience of a CDN, consisting of n proxies, becomes O(n²) with the proposed approach, when compared to a site hosted by a single server. We present performance numbers from a controlled test environment to show that the proposed approach is effective. Second, we introduce novel site allocation algorithms based on the well-established theory on binary codes. The proposed allocation algorithm guarantees an upper bound on the level of service outage of a CDN-hosted site even when a DoS attack on another site on the same CDN has been successful. Together, our schemes significantly improve the resilience of the Web sites hosted by CDNs, and complement other work on countering DoS.     

Formal concept analysis based user model for distributed systems

User profile has contributed to customize user access and adjusts applications to its needs. In this respect, automatically building of user profiles issue is an important research area. Nevertheless, standardizing these profiles in terms of representation and acquisition schemes, more especially in large scale systems like Peer-to-Peer systems (P2P), is a complex task. In this paper, we introduce a distributed user profile modelling approach based on user search topics history without the need of any external knowledge resource (e.g., ontology). This model learns from past interests to guess correlations between user requests, associated topics, relevant documents and nodes (i.e., peers) to enhance any information retrieval process. The solution is based on an extension of Formal Concept Analysis (FCA) theory. We also study, the integration of our model in query routing (i.e., content discovery) and results aggregation processes for P2P systems. Carried out experiments, performed under a P2P simulator environment, showed that our model outperforms its competitors in terms of effectiveness and efficiency.     

An optimal inherently stabilizing routing algorithm for star P2P overlay networks

Star graphs possess many desirable properties such as scalable node degrees and diameters, which are essential to facilitate reduced routing table sizes and low maximum path length for routing in large P2P networks. In addition, because a large number of disjoint paths are available and each data/replica in an n‐star can be placed in an (n − 1)‐star, load balancing and alleviation of network bottlenecks can be implemented in star P2P overlay networks. Therefore, star networks have been proposed as viable alternatives to existing overlay topologies for large P2P networks. In this paper, we propose an optimal stabilizing and inherently stabilizing algorithm for routing messages over all disjoint paths between two peers in a star P2P overlay network. The algorithm is optimal in terms of its time complexity in rounds and the length of the longest path traversed by the messages, and fault tolerant due to being stabilizing and inherently stabilizing, allowing the system to withstand transient faults. The algorithm can be used to increase network reliability and survivability in P2P networks. In addition, the usage of all disjoint paths to route messages between two peers leads to increased network bandwidth while distributing the communication overhead across the network and eliminating network bottlenecks in P2P networks. Copyright © 2016 John Wiley & Sons, Ltd.     

Peer-to-peer indirect reciprocity via personal currency

Motivating peers to contribute services is critical to the success of peer-to-peer (P2P) systems. Incentive protocols use reciprocity to enforce contributions. Indirect reciprocity schemes are more efficient than direct reciprocity schemes for large-scale P2P systems under high churn rate. In this paper, we propose an indirect reciprocity scheme, called FairTrade, in which peers issue personal currencies to trade services in a P2P system. Personal currency enables indirect reciprocity without relying on any central banks or authorities. It wins extra robustness over global currency as well as much improved trading flexibility and efficiency over direct reciprocity schemes. The acceptance degree of a personal currency depends on the issuer’s service capability and reliance. Peer credit limit is introduced to represent the amount of personal currency that will be accepted by other peers. Every peer as a creditor applies a Bayesian network model to setting peer credit limit for a trading partner peer as a creditee. The Bayesian network model learns the creditee’s capability and reliability and anticipates the associated profits and risks for credit setting. Using simulations on a file-sharing P2P system, we demonstrate that FairTrade achieves 100%$100\%$ success rate of download requests without malicious peers, and maintains over 90%$90\%$ success rate even with 50%$50\%$ malicious nodes. The system warms up quickly and does not assume any altruistic service or other kind of help. On average, the system traffic stabilizes before peers issue their second download requests. All these good performances are achieved with extremely low trading overhead, which takes up less than 1%$1\%$ of the total traffic.