Analytical Comparison of Resource Search Algorithms in Non-DHT Mobile Peer-to-Peer Networks

One of the key challenges in ad-hoc networks is the resource discovery problem.How efciently&quickly the queried resource/object can be resolved in such a highly dynamic self-evolving network is the underlying question?Broadcasting is a basic technique in the Mobile Ad-hoc Networks(MANETs),and it refers to sending a packet from one node to every other node within the transmission range.Flooding is a type of broadcast where the received packet is retransmitted once by every node.The naive ooding technique oods the network with query messages,while the random walk scheme operates by contacting subsets of each node’s neighbors at every step,thereby restricting the search space.Many earlier works have mainly focused on the simulation-based analysis of ooding technique,and its variants,in a wired network scenario.Although,there have been some empirical studies in peer-to-peer(P2P)networks,the analytical results are still lacking,especially in the context of mobile P2P networks.In this article,we mathematically model different widely used existing search techniques,and compare with the proposed improved random walk method,a simple lightweight approach suitable for the non-DHT architecture.We provide analytical expressions to measure the performance of the different ooding-based search techniques,and our proposed technique.We analytically derive 3 relevant key performance measures,i.e.,the avg.number of steps needed to nd a resource,the probability of locating a resource,and the avg.number of messages generated during the entire search process.

Mathematical Model Validation of Search Protocols in MP2P Networks

Broadcasting is a basic technique in Mobile ad-hoc network(MANET),and it refers to sending a packet from one node to every other node within the transmission range.Flooding is a type of broadcast where the received packet is retransmitted once by every node.The naive flooding technique,floods the network with query messages,while the random walk technique operates by contacting the subsets of every node’s neighbors at each step,thereby restricting the search space.One of the key challenges in an ad-hoc network is the resource or content discovery problem which is about locating the queried resource.Many earlier works have mainly focused on the simulation-based analysis of flooding,and its variants under a wired network.Although,there have been some empirical studies in peer-to-peer(P2P)networks,the analytical results are still lacking,especially in the context of P2P systems running over MANET.In this paper,we describe how P2P resource discovery protocols perform badly over MANETs.To address the limitations,we propose a new protocol named ABRW(Address Broadcast Random Walk),which is a lightweight search approach,designed considering the underlay topology aimed to better suit the unstructured architecture.We provide the mathematical model,measuring the performance of our proposed search scheme with different widely popular benchmarked search techniques.Further,we also derive three relevant search performance metrics,i.e.,mean no.of steps needed to find a resource,the probability of finding a resource,and the mean no.of message overhead.We validated the analytical expressions through simulations.The simulation results closely matched with our analyticalmodel,justifying our findings.Our proposed search algorithm under such highly dynamic self-evolving networks performed better,as it reduced the search latency,decreased the overall message overhead,and still equally had a good success rate.

Deadline-aware network coding for video on demand service over P2P networks

We are interested in providing Video-on-Demand (VoD) streaming service to a large population of clients using peer-to-peer (P2P) approach. Given the asynchronous demands from multiple clients, continuously changing of the buffered contents, and the continuous video display requirement, how to collaborate with potential partners to get expected data for future content delivery are very important and challenging. In this paper, we develop a novel scheduling algorithm based on deadline- aware network coding (DNC) to fully exploit the network resource for efficient VoD service. DNC generalizes the existing net- work coding (NC) paradigm, an elegant solution for ubiquitous data distribution. Yet, with deadline awareness, DNC improves the network throughput and meanwhile avoid missing the play deadline in high probability, which is a major deficiency of the con- ventional NC. Extensive simulation results demonstrated that DNC achieves high streaming continuity even in tight network conditions.

METrust: A Mutual Evaluation-based Trust Model for P2P Networks

It is necessary to construct an effective trust model to build trust relationship between peers in peer-to-peer （P2P） network and enhance the security and reliability of P2P systems. The current trust models only focus on the consumers＇ evaluation to a transaction, which may be abused by malicious peers to exaggerate or slander the provider deliberately. In this paper, we propose a novel trust model based on mutual evaluation, called METrust, to suppress the peers＇ malicious behavior, such as dishonest evaluation and strategic attack. METrust considers the factors including mutual evaluation, similarity risk, time window, incentive, and punishment mechanism. The trust value is composed of the direct trust value and the recommendation trust value. In order to inhibit dishonest evaluation, both participants should give evaluation information based on peers＇ own experiences about the transaction while computing the direct trust value. In view of this, the mutual evaluation consistency factor and its time decay function are proposed. Besides, to reduce the risk of computing the recommendation trust based on the recommendations of friend peers, the similarity risk is introduced to measure the uncertainty of the similarity computing, while similarity is used to measure credibility. The experimental results show that METrust is effective, and it has advantages in the inhibition of the various malicious behaviors.

INCENTIVE MECHANISMS FOR TRUSTWORTHY ROUTING BASED ON GAME MODEL OF THE STRATEGIES OF NODES IN P2P NETWORKS

The trustworthiness and security of routing in the existing Peer-to-Peer (P2P) networks can not be ensured because of the diversity of the strategies of P2P nodes. This paper firstly uses game theory to establish game model of the strategies and profits of various types of routing nodes. Then,two incentive mechanisms for the corresponding stages of P2P trustworthy routing are proposed,namely trust associated mechanism and trust compensated mechanism. Simulation results show that the incentive mechanisms proposed in this paper will encourage cooperation actions of good nodes and restrain malicious actions of bad nodes,which ensure the trustworthiness of routing consequently.

A PEER-TO-PEER INCENTIVE SCHEME FOR OVERCOMING FREE RIDING

Free riding has a great influence on the expandability,robustness and availability of Peer-to-Peer(P2P) network.Controlling free riding has become a hot research issue both in academic and industrial communities.An incentive scheme is proposed to overcoming free riding in P2P network in this paper.According to the behavior and function of nodes,the P2P network is abstracted to be a Distributed and Monitoring-based Hierarchical Structure Mechanism(DMHSM) model.A utility function based on several influencing factors is defined to determine the contribution of peers to the whole system.This paper also introduces reputation and permit mechanism into the scheme to guarantee the Quality of Service(QoS) and to reward or punish peers in the network.Finally,the simulation results verify the effectiveness and feasibility of this model.

Modeling active worm propagation on the P2P network

This paper analyzes the characteristics of the Peer-to-Peer （P2P） active worm and its attacking mechanism, and then proposes a mathematical model of propagation of the P2P active worm applying Epidemiology. Based on the analysis on the protocols of realistic P2P systems, a software which can be used to simulate the P2P network environment and the propagation of P2P active worm is imple- mented in this paper. A large number of simulation experiments are performed using the developed simulation software. The results from these simulation experiments validate the proposed model, which means that the model can be used to analyze the spreading behaviors of the P2P active worm and predict its trend.

DGTM： a dynamic grouping based trust model for mobile peer-to-peer networks

The special characteristics of the mobile environment, such as limited bandwidth, dynamic topology, heterogeneity of peers, and limited power, pose additional challenges on mobile peer-to-peer （MP2P） networks. Trust management becomes an essential component of MP2P networks to promote peer transactions. However, in an MP2P network, peers frequently join and leave the network, which dynamically changes the network topology. Thus, it is difficult to establish long-term and effective trust relationships among peers. In this paper, we propose a dynamic grouping based trust model （DGTM） to classify peers. A group is formed according to the peers＇ interests. Within a group, mobile peers share resources and tend to keep stable trust relationships. We propose three peer roles （super peers, relay peers, and ordinary peers） and two novel trust metrics （intragroup trust and intergroup trust）. The two metrics are used to accurately measure the trust between two peers from the same group or from different groups. Simulations illustrate that our proposed DGTM always achieves the highest successful transaction rate and the best communication overhead under different circumstances.

Evolved data scheduling scheme based on layered P2P streaming in mobile network

To relieve the negative effect brought by the intricate wireless network environment and unstable user behavior in layered mobile peer-to peer（P2P） streaming service, an evolved layered P2P （E-LP2P） data scheduling scheme in the process of service delivery is introduced in this paper. The data in base layer is scheduled according to its importance in streaming play to guarantee the basic play of streaming. The data in enhancement layer is scheduled according to the characters of streaming data, including its position and amount in server peer set in a multiple tied way towards the data in enhancement layer. To cope with the layer jitter caused by the fluctuation of bandwidth, jitter prevent mechanism is used to adjust the highest layer dynamically during the process of data scheduling. Simulation results show that the E-LP2P can provide good quality of service（QoS） performance in terms of throughput, layer delivery ratio, server load and useless packet ratio.

Proactive worm propagation modeling and analysis in unstructured peer-to-peer networks

It is universally acknowledged by network security experts that proactive peer-to-peer (P2P) worms may soon en-gender serious threats to the Internet infrastructures. These latent threats stimulate activities of modeling and analysis of the proactive P2P worm propagation. Based on the classical two-factor model,in this paper,we propose a novel proactive worm propagation model in unstructured P2P networks (called the four-factor model) by considering four factors:(1) network topology,(2) countermeasures taken by Internet service providers (ISPs) and users,(3) configuration diversity of nodes in the P2P network,and (4) attack and defense strategies. Simulations and experiments show that proactive P2P worms can be slowed down by two ways:improvement of the configuration diversity of the P2P network and using powerful rules to reinforce the most connected nodes from being compromised. The four-factor model provides a better description and prediction of the proactive P2P worm propagation.

BulkTree: an overlay network architecture for live media streaming

Peer-to-peer (P2P) systems are now very popular. Current P2P systems are broadly of two kinds, structured and unstructured. The tree structured P2P systems used technologies such as distributed hash tables (DHT) and hierarchical clustering can search the required target quickly, however, in a tree, the internal node has a higher load and its leave or crash often causes a large population of its offspring's problems, so that in the highly dynamic Internet environment the tree structure may still suffer frequent breaks. On the other hand, most widely used unstructured P2P networks rely on central directory servers or massive message flooding, clearly not scalable. So, we consider both of the above systems' advantages and disadvantages and realize that in the P2P systems one node may fail easily, but that when a number of nodes organized as a set, which we call "super node", the set is robust. Super nodes can be created and updated aware of topology-aware, and used with simple protocol such as flooding or "servers" to exchange information. Furthermore the entire robust super node can be organized into exquisite tree structure. By using this overlay network architecture, P2P systems are robust, efficient, scalable and secure. The simulation results demonstrated that our architecture greatly reduces the alteration time of the structure while decreasing the average delay time, compared to the common tree structure.

Hybrid Collaborative Management Ring on Mobile Multi-agent for Cloud-P2P

In order to fully utilize all potential available network resources and make the interoperability of systems possible, we propose to integrate cloud computing and peer-to-peer （P2P） computing environments together. We utilize the mobile multi-agent technology to construct an effective hierarchical integration model named Cloud-P2P. As the original management mechanisms for traditional cloud computing and P2P computing systems are no longer applicable to Cloud-P2P, we propose a novel hybrid collaborative management ring based on mobile multi-agent in order to ensure the efficiency and success rate of task implementation in the Cloud- P2P environment. This mechanism needs to divide the system into core ring, cloud inner rings and several peer rings. In each ring, every node is in collaboration with its neighbor nodes with multi-agent, or uses mobile agent moving from node to node with string or parallel methods to monitor the statuses and performances of all nodes, in order to avoid problems of performance bottleneck and single point failure. This paper analyses the node conditions of cloud computing and P2P computing environments in-depth, then elaborates on Cloud-P2P and the hybrid collaborative management ring based on mobile multi-agent （HCMRMMA）. After that, the construction method of the network ring topology for Cloud-P2P is introduced. Finally, experimental results and performance analysis of HCMRMMA are presented.

Strategies of Collaboration in Multi-Swarm Peer-to-Peer Content Distribution

In modern Peer-to-Peer （P2P） content distribution applications, multiple swarms typically exist, each corresponding to the dissemination of one content among interested peers. A common design in the existing P2P applications is to allow peers in one swarm to help each other, while different swarms are only coupled when sharing the upload bandwidth at the dedicated content servers/publishers. In recent years, a number of proposals have emerged which advocate inter-swarm collaboration and resource sharing, where peers in one swarm may contribute their storage and bandwidth resources to help peers in the swarm of another content. Such inter-swarm collaboration can improve content availability and optimize resource uti- lization in the entire system, at the cost of additional overhead for content preloading and inter-swarm coor- dination. This paper presents a survey of studies on effective inter-swarm collaboration mechanisms in the existing literature. This paper first discusses strategies of collaboration in P2P file sharing applications, and then presents multi-channel collaborative design for P2P live and Video-on-Demand （VoD） streaming. In particular, this paper elaborates our recent design of collaboration strategies among multiple streaming channels in a P2P VoD system, and shows that the server cost can be reduced by up to 25% while high streaming qualities are guaranteed in the entire system, even during extreme scenarios such as unexpected flash crowds. This paper also discusses representative approaches to implement inter-swarm collaborations in various P2P content distribution systems.

CPA-VoD： Cloud and Peer-Assisted Video on Demand System for Mobile Devices

With the rapid development of WiFi and 3G/4G, people tend to view videos on mobile devices. These devices are ubiquitous but have small memory to cache videos. As a result, in contrast to traditional computers, these devices aggravate the network pressure of content providers. Previous studies use CDN to solve this problem. But its static leasing mechanism in which the rental space cannot be dynamically adjusted makes the operational cost soar and incompatible with the dynamically video delivery. In our study, based on a thorough analysis of user behavior from Tencent Video, a popular Chinese on-line video share platform, we identify two key user behaviors. Firstly, lots of users in the same region tend to watch the same video. Secondly, the popularity distribution of videos conforms with the Pareto principle, i.e., the top 20% popular videos own 80% of all video traffic. To turn these observations into silver bullet, we propose and implement a novel cloud- and peer-assisted video on demand system （CPA-VoD）. In the system, we group users in the same region as a peer swarm, and in the same peer swarm, users can provide videos to other users by sharing their cached videos. Besides, we cache the 10% most popular videos in cloud servers to further alleviate the network pressure. We choose cloud servers to cache videos because the rental space can be dynamically adjusted. According to the evaluation on a real dataset from Tencent Video, CPA-VoD alleviates the network pressure and the operation cost excellently, while only 20.9% traffic is serviced by the content provider.

P2P energy trading via public power networks:Practical challenges,emerging solutions,and the way forward

Peer-to-peer(P2P)energy trading is an emerging energy supply paradigm where customers with distributed energy resources(DERs)are allowed to directly trade and share electricity with each other.P2P energy trading can facilitate local power and energy balance,thus being a potential way to manage the rapidly increasing number of DERs in net zero transition.It is of great importance to explore P2P energy trading via public power networks,to which most DERs are connected.Despite the extensive research on P2P energy trading,there has been little large-scale commercial deployment in practice across the world.In this paper,the practical challenges of conducting P2P energy trading via public power networks are identified and presented,based on the analysis of a practical Local Virtual Private Networks(LVPNs)case in North Wales,UK.The ongoing efforts and emerging solutions to tackling the challenges are then summarized and critically reviewed.Finally,the way forward for facilitating P2P energy trading via public power networks is proposed.

TEES:topology-aware execution environment service for fast and agile application deployment in HPC

High-performance computing(HPC)systems are about to reach a new height:exascale.Application deployment is becoming an increasingly prominent problem.Container technology solves the problems of encapsulation and migration of applications and their execution environment.However,the container image is too large,and deploying the image to a large number of compute nodes is time-consuming.Although the peer-to-peer(P2P)approach brings higher transmission efficiency,it introduces larger network load.All of these issues lead to high startup latency of the application.To solve these problems,we propose the topology-aware execution environment service(TEES)for fast and agile application deployment on HPC systems.TEES creates a more lightweight execution environment for users,and uses a more efficient topology-aware P2P approach to reduce deployment time.Combined with a split-step transport and launch-in-advance mechanism,TEES reduces application startup latency.In the Tianhe HPC system,TEES realizes the deployment and startup of a typical application on 17560 compute nodes within 3 s.Compared to container-based application deployment,the speed is increased by 12-fold,and the network load is reduced by 85%.