Peer-to-Peer Networking来自Artisoft的四颗新星

随着您的网络增长,您需要工具来提供远程访问、存储管理、调制解调器共享和网络总体管理。但是用一堆分离的软件工具来执行这些工作很可能超出$1000——相当高的价格,特别是对小的对等通信的LANs。 Artisoft LANtastic

A Hybrid Approach for Predicting Probability of Default in Peer-to-Peer (P2P) Lending Platforms Using Mixture-of-Experts Neural Network

Peer-to-peer (P2P) lending offers an alternative way to access credit. Unlike established lending institutions with proven credit risk management practices, P2P platforms rely on numerous independent variables to evaluate loan applicants’ creditworthiness. This study aims to estimate default probabilities using a mixture-of-experts neural network in P2P lending. The approach involves coupling unsupervised clustering to capture essential data properties with a classification algorithm based on the mixture-of-experts structure. This classic design enhances model capacity without significant computational overhead. The model was tested using P2P data from Lending Club, comparing it to other methods like Logistic Regression, AdaBoost, Gradient Boosting, Decision Tree, Support Vector Machine, and Random Forest. The hybrid model demonstrated superior performance, with a Mean Squared Error reduction of at least 25%.

Accelerated transmission in peer-to-peer network

The design and evaluation of accelerated transmission （AT） systems in peer-to-peer networks for data transmission are introduced. Based on transfer control protocol （TCP） and peer-to-peer （P2P） substrate networks, AT can select peers of high performance quality, monitor the transfer status of each peer, dynamically adjust the transmission velocity and react to connection degradation with high accuracy and low overhead. The system performance is evaluated by simulations, and the interrelationship between network flow, bandwidth utilities and network throughput is analyzed. Owing to the collaborative operation of neighboring peers, AT accelerates the process of data transmission and the collective network performance is much more satisfactory.

Modeling and Defending Passive Worms over Unstructured Peer-to-Peer Networks

Passive worms can passively propagate through embedding themselves into some sharing files, which can result in significant damage to unstructured P2P networks. To study the passive worm behaviors, this paper firstly analyzes and obtains the average delay for all peers in the whole transmitting process due to the limitation of network throughput, and then proposes a mathematical model for the propagation of passive worms over the unstructured P2P networks. The model mainly takes the effect of the network throughput into account, and applies a new healthy files dissemination-based defense strategy according to the file popularity which follows the Zipf distribution. The simulation results show that the propagation of passive worms is mainly governed by the number of hops, initially infected files and uninfected files. The larger the number of hops, the more rapidly the passive worms propagate. If the number of the initially infected files is increased by the attackers, the propagation speed of passive worms increases obviously. A larger size of the uninfected file results in a better attack performance. However, the number of files generated by passive worms is not an important factor governing the propagation of passive worms. The effectiveness of healthy files dissemination strategy is verified. This model can provide a guideline in the control of unstructured P2P networks as well as passive worm defense.

A Hierarchical Trust Model for Peer-to-Peer Networks

Trust has become an increasingly important issue given society’s growing reliance on electronic transactions.Peer-to-peer(P2P)networks are among the main electronic transaction environments affected by trust issues due to the freedom and anonymity of peers(users)and the inherent openness of these networks.A malicious peer can easily join a P2P network and abuse its peers and resources,resulting in a large-scale failure that might shut down the entire network.Therefore,a plethora of researchers have proposed trust management systems to mitigate the impact of the problem.However,due to the problem’s scale and complexity,more research is necessary.The algorithm proposed here,HierarchTrust,attempts to create a more reliable environment in which the selection of a peer provider of a file or other resource is based on several trust values represented in hierarchical form.The values at the top of the hierarchical form are more trusted than those at the lower end of the hierarchy.Trust,in HierarchTrust,is generally calculated based on the standard deviation.Evaluation via simulation showed that HierarchTrust produced a better success rate than the well-established EigenTrust algorithm.

Insights into microbiota community dynamics and flavor development mechanism during golden pomfret(Trachinotus ovatus)fermentation based on single-molecule real-time sequencing and molecular networking analysis

Popular fermented golden pomfret(Trachinotus ovatus)is prepared via spontaneous fermentation;however,the mechanisms underlying the regulation of its flavor development remain unclear.This study shows the roles of the complex microbiota and the dynamic changes in microbial community and flavor compounds during fish fermentation.Single-molecule real-time sequencing and molecular networking analysis revealed the correlations among different microbial genera and the relationships between microbial taxa and volatile compounds.Mechanisms underlying flavor development were also elucidated via KEGG based functional annotations.Clostridium,Shewanella,and Staphylococcus were the dominant microbial genera.Forty-nine volatile compounds were detected in the fermented fish samples,with thirteen identified as characteristic volatile compounds(ROAV>1).Volatile profiles resulted from the interactions among the microorganisms and derived enzymes,with the main metabolic pathways being amino acid biosynthesis/metabolism,carbon metabolism,and glycolysis/gluconeogenesis.This study demonstrated the approaches for distinguishing key microbiota associated with volatile compounds and monitoring the industrial production of high-quality fermented fish products.

Peer-to-Peer Networks 2

The development of network resources changes the network computing models. P2P networks, a new type of network adopting peer-to-peer strategy for computing, have attracted worldwide attention. The P2P architecture is a type of distributed network in which all participants share their hardware resources and the shared resources can be directly accessed by peer nodes without going through any dedicated servers. The participants in a P2P network are both resource providers and resource consumers. This article on P2P networks is divided into two issues. In the previous issue, P2P architecture, network models and core search algorithms were introduced. The second part in this issue is analyzing the current P2P research and application situations, as well as the impacts of P2P on telecom operators and equipment vendors.

Offloading Mobile Data from Cellular Networks Through Peer-to-Peer WiFi Communication:A Subscribe-and-Send Architecture

Currently cellular networks do not have sufficient capacity to accommodate the exponential growth of mobile data requirements.Data can be delivered between mobile terminals through peer-to-peer WiFi communications(e.g.WiFi direct),but contacts between mobile terminals are frequently disrupted because of the user mobility.In this paper,we propose a Subscribe-and-Send architecture and an opportunistic forwarding protocol for it called HPRO.Under Subscribe-and-Send,a user subscribes contents on the Content Service Provider(CSP) but does not download the subscribed contents.Some users who have these contents deliver them to the subscribers through WiFi opportunistic peer-to-peer communications.Numerical simulations provide a robust evaluation of the forwarding performance and the traffic offloading performance of Subscribe-and-Send and HPRO.

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.

Always-optimally-coordinated candidate selection algorithm for peer-to-peer files sharing system in mobile self-organized networks

In order to improve the performance of peer-to-peer files sharing system under mobile distributed en- vironments, a novel always-optimally-coordinated （AOC） criterion and corresponding candidate selection algorithm are proposed in this paper. Compared with the traditional min-hops criterion, the new approach introduces a fuzzy knowledge combination theory to investigate several important factors that influence files transfer success rate and efficiency. Whereas the min-hops based protocols only ask the nearest candidate peer for desired files, the selection algorithm based on AOC comprehensively considers users＇ preferences and network requirements with flexible balancing rules. Furthermore, its advantage also expresses in the independence of specified resource discovering protocols, allowing for scalability. The simulation results show that when using the AOC based peer selection algorithm, system performance is much better than the rain-hops scheme, with files successful transfer rate improved more than 50% and transfer time re- duced at least 20%.

Threshold-Based Software-Defined Networking(SDN)Solution for Healthcare Systems against Intrusion Attacks

The healthcare sector holds valuable and sensitive data.The amount of this data and the need to handle,exchange,and protect it,has been increasing at a fast pace.Due to their nature,software-defined networks(SDNs)are widely used in healthcare systems,as they ensure effective resource utilization,safety,great network management,and monitoring.In this sector,due to the value of thedata,SDNs faceamajor challengeposed byawide range of attacks,such as distributed denial of service(DDoS)and probe attacks.These attacks reduce network performance,causing the degradation of different key performance indicators(KPIs)or,in the worst cases,a network failure which can threaten human lives.This can be significant,especially with the current expansion of portable healthcare that supports mobile and wireless devices for what is called mobile health,or m-health.In this study,we examine the effectiveness of using SDNs for defense against DDoS,as well as their effects on different network KPIs under various scenarios.We propose a threshold-based DDoS classifier(TBDC)technique to classify DDoS attacks in healthcare SDNs,aiming to block traffic considered a hazard in the form of a DDoS attack.We then evaluate the accuracy and performance of the proposed TBDC approach.Our technique shows outstanding performance,increasing the mean throughput by 190.3%,reducing the mean delay by 95%,and reducing packet loss by 99.7%relative to normal,with DDoS attack traffic.

Study on semantic-oriented hybrid indexing strategy of resource metadata in peer-to-peer network

Applying ontology to describe resource metadata richly in the peer-to-peer environment has become current research trend. In this semantic peer-to-peer environment, indexing semantic element of resource description to support efficient resource location is a difficult and challenging problem. This paper provided a hybrid indexing architecture, which combines local indexing and global indexing. It uses community strategy and semantic routing strategy to organize key layer metadata element and uses DHT (distributed hash table) to index extensional layer metadata element. Compared with related system, this approach is more efficient in resource location and more scalable.

A ＂cluster＂ based search scheme in peer-to-peer network

This paper presents a "cluster" based search scheme in peer-to-peer network. The idea is based on the fact that data distribution in an information society has structured feature. We designed an algorithm to cluster peers that have similar interests. When receiving a query request, a peer will preferentially forward it to another peer which belongs to the same cluster and shares more similar interests. By this way search efficiency will be remarkably improved and at the same time good resilience against peer failure (the ability to withstand peer failure) is reserved.

A Credit-Based Approach for Overcoming Free-Riding Behaviour in Peer-to-Peer Networks

The underlying premise of peer-to-peer(P2P)systems is the trading of digital resources among individual peers to facilitate file sharing,distributed computing,storage,collaborative applications and multimedia streaming.So-called free-riders challenge the foundations of this system by consuming resources from other peers without offering any resources in return,hindering resource exchange among peers.Therefore,immense effort has been invested in discouraging free-riding and overcoming the ill effects of such unfair use of the system.However,previous efforts have all fallen short of effectively addressing free-riding behaviour in P2P networks.This paper proposes a novel approach based on utilising a credit incentive for P2P networks,wherein a grace period is introduced during which free-riders must reimburse resources.In contrast to previous approaches,the proposed system takes into consideration the upload rate of peers and a grace period.The system has been thoroughly tested in a simulated environment,and the results show that the proposed approach effectively mitigates free-riding behaviour.Compared to previous systems,the number of downloads from free-riders decreased while downloads by contributing peers increased.The results also show that under longer grace periods,the number of downloads by fast peers(those reimbursing the system within the grace period)was greater than the number of downloads by slow peers.

SFES: A scalable, fault-tolerant, efficient search scheme in a peer-to-peer network

This paper presents SFES: a scalable, fault-tolerant, efficient search scheme in a peer-to-peer network. The idea is based on the fact that data distribution in an information society has structured features. We designed an algorithm to cluster peers that have similar interests. When receiving a query request, a peer will preferentially forward it to another peer which belongs to the same cluster and shares more similar interests. By this method, search efficiency will be remarkably improved and at the same time good resistance against peer failure (the ability to withstand peer failure) is reserved. Keyword partial-match is supported, too.

Dynamic Networking Method of Vehicles in VANET

Vehicular Ad-hoc Networks(VANETs)make it easy to transfer information between vehicles,and this feature is utilized to enable collaborative decision-making between vehicles to enhance the safety,economy,and entertainment of vehicle operation.The high mobility of vehicles leads to a time-varying topology between vehicles,which makes inter-vehicle information transfer challenging in terms of delay control and ensuring the stability of collaborative decision-making among vehicles.The clustering algorithm is a method aimed at improving the efficiency of VANET communication.Currently,most of the research based on this method focuses on maintaining the stability of vehicle clustering,and few methods focus on the information interaction and collaborative decisionmaking of vehicles in the region.In this context,this paper proposes a networking method for intra-regional vehicle information interaction,through an efficient information transmission mechanism,vehicles can quickly obtain the required information and make more accurate decisions.Firstly,this networking method utilizes DBSCAN and the proposed vehicle scoring model to form clusters,ensuring the stability and adaptability of clusters;secondly,in the process of interacting with the information,the cosine similarity is utilized to check the similarity of the information to eliminate the highly similar information,effectively reducing redundant information;and lastly,in the case of a consensus reached by the cluster,the frequency of broadcasting of information between vehicles is reduced as a way to minimize the waste of communication resources.The proposed method is simulated based on Python and Sumo platforms,and several metrics such as cluster clustering situation,information volume,and state change rate are analyzed.The results show that the method maintains better cluster stability with a 60%and 92%reduction in information overhead compared to the FVC and HCAR algorithms,respectively.

A Neural Network-Based Trust Management System for Edge Devices in Peer-to-Peer Networks

Edge devices in Internet of Things(IoT)applications can form peers to communicate in peer-to-peer(P2P)networks over P2P protocols.Using P2P networks ensures scalability and removes the need for centralized management.However,due to the open nature of P2P networks,they often suffer from the existence of malicious peers,especially malicious peers that unite in groups to raise each other’s ratings.This compromises users’safety and makes them lose their confidence about the files or services they are receiving.To address these challenges,we propose a neural networkbased algorithm,which uses the advantages of a machine learning algorithm to identify whether or not a peer is malicious.In this paper,a neural network(NN)was chosen as the machine learning algorithm due to its efficiency in classification.The experiments showed that the NNTrust algorithm is more effective and has a higher potential of reducing the number of invalid files and increasing success rates than other well-known trust management systems.

The Caching and Pricing Strategy for Information-Centric Networking with Advertisers’Participation

As users’access to the network has evolved into the acquisition of mass contents instead of IP addresses,the IP network architecture based on end-to-end communication cannot meet users’needs.Therefore,the Information-Centric Networking(ICN)came into being.From a technical point of view,ICN is a promising future network architecture.Researching and customizing a reasonable pricing mechanism plays a positive role in promoting the deployment of ICN.The current research on ICN pricing mechanism is focused on paid content.Therefore,we study an ICN pricing model for free content,which uses game theory based on Nash equilibrium to analysis.In this work,advertisers are considered,and an advertiser model is established to describe the economic interaction between advertisers and ICN entities.This solution can formulate the best pricing strategy for all ICN entities and maximize the benefits of each entity.Our extensive analysis and numerical results show that the proposed pricing framework is significantly better than existing solutions when it comes to free content.

KRBKSS: a keyword relationship based keyword-set search system for peer-to-peer networks

may incur significant bandwidth for executing more com- plicated search queries such as multiple-attribute queries. In order to reduce query overhead, KSS (keyword-set search) by Gnawali partitions the index by a set of keywords. However, a KSS index is considerably larger than a standard inverted index, since there are more word sets than there are individual words. And the insert overhead and storage overhead are obviously un- acceptable for full-text search on a collection of documents even if KSS uses the distance window technology. In this paper, we extract the relationship information between query keywords from websites’ queries logs to improve performance of KSS system. Experiments results clearly demonstrated that the improved keyword-set search system based on keywords relationship (KRBKSS) is more efficient than KSS index in insert overhead and storage overhead, and a standard inverted index in terms of communication costs for query.

Research on Traffic Identification Technologies for Peer-to-Peer Networks

The Peer-to-Peer(P2P)network traffic identification technology includes Transport Layer Identification(TLI)and Deep Packet Inspection(DPI)methods.By analyzing packets of the transport layer and the traffic characteristic in the P2P system,TLI can identify whether or not the network data flow belongs to the P2P system.The DPI method adopts protocol analysis technology and reverting technology.It picks up data from the P2P application layer and analyzes the characteristics of the payload to judge if the network traffic belongs to P2P applications.Due to its accuracy,robustness and classifying ability,DPI is the main method used to identify P2P traffic.Adopting the advantages of TLI and DPI,a precise and efficient technology for P2P network traffic identification can be designed.