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.

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.

Super-proximity routing in structured peer-to-peer overlay networks

Peer to Peer systems are emerging as one of the most popular Internet applications. Structured Peer to Peer overlay networks use identifier based routing algorithms to allow robustness, load balancing, and distributed lookup needed in this environment. However, identifier based routing that is independent of Internet topology tends to be of low efficiency. Aimed at improving the routing efficiency, the super proximity routing algorithms presented in this paper combine Internet topology and overlay routing table in choosing the next hop. Experimental results showed that the algorithms greatly improve the efficiency of Peer to Peer routing.

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.

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.

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.

Performance of Fixed Channel Assignment for Uplink Transmission and Direct Peer-to-Peer Communications in Multihop Cellular Networks

In this paper, we propose a clustered multihop cellular network （cMCN） architecture and study its performance using fixed channel assignment （FCA） scheme for uplink transmission. The proposed cMCN using FCA can be applied with some reuse factors. An analytical model based on Markov chain is developed to analyze its performance and validated through computer simulation. And then, we implement direct peer-to-peer communication （DC） in cMCN by considering more reasonable conditions in practice. DC means that two calls communicate directly instead of going through base stations. The results show that cMCN with FCA can reduce the call blocking probability significantly as compared with the traditional single-hop cellular networks with FCA and can be further reduced by using DC.

一种基于Peer-to-Peer技术的Web缓存共享系统研究

提出了一种基于 peer to peer技术的分布式Web缓存共享系统:BuddyWeb.该系统的核心理念是让企业网络中的所有PC能够相互共享浏览器中的本地缓存,从而形成一个高效的、大规模的分布式缓存共享系统,并使系统具备易管理、易实现、低成本等优点;接着详细阐述了 BuddyWeb的工作原理和算法策略;然后,针对 Buddy Web系统的特性提出了仿真实验模型和评估方法.实验结果证明了BuddyWeb在命中率、网络通信流量负荷、系统响应延迟等诸方面均能取得令人满意的效果.

Peer-to-Peer环境下的信任模型研究

开放、共享、匿名的peer-to-peer网络已经取得了越来越多的应用,无中心时等的特性也吸引了越来越多的用户,但同时也成为了网络攻击者传播恶意内容或病毒的温床。由于其网络中的节点不受约束,节点间存在着自愿的交易行为,因此节点之间的信任很难通过传统网络的机制来制约和建立。本文旨在通过借鉴人类社会网络中的信任关系来建立一种信任模型,通过定义一系列信任的因子,用以制约用户行为,同时为用户寻求服务前提供参考。最后通过和其他信任模型的对比,我们的模型能够有效地激励用户提供反馈,遏制节点的不诚实行为。

分布式Peer-to-Peer网络Gnutella模型研究

计算机对等联网(peer-to-peernetwork,P2P)技术是目前新一代网络技术研究的活跃领域,而P2P网络模型研究是P2P网络技术研究的重要环节。该文着重介绍了Gnutella网络模型的体系结构及工作原理,分析了其优缺点。并对其未来发展改进前景进行了展望。

Peer-to-Peer文件共享系统的测量研究

Peer-to-Peer(P2P)技术的发展引发了Internet应用模式的变革.为了寻求网络运营商、内容提供商和Internet用户三方共赢的解决方案,必须从他们各自的角度出发对P2P应用进行系统的测量与分析.首先概述了P2P测量的研究内容,并将现有的P2P测量研究划分为P2P拓扑特征的测量、P2P流量特征的测量、P2P可用性的测量3类.在对P2P测量方法进行对比分析之后,详细综述了P2P测量的研究现状,对现有的各种测量方案以及研究成果进行了深入的分析,指出了其中存在的问题和缺陷.最后讨论了P2P测量未来的研究方向.

Peer-to-Peer网络模型研究

计算机对等联网(peer-to-peernetwork,P2P)技术是目前新一代网络技术研究的活跃领域,而P2P网络模型研究是P2P网络技术研究的重要环节。该文分析了目前两种流行P2P网络模型的不足,通过在P2P网络中引入集中和分级目录概念,根据资源内容建立不同的层次结构,提出了一种新型P2P网络模型。

Peer-to-Peer网络中安全对等组的实现

计算机对等联网(peer-to-peernetwork,P2P)技术是目前流行于国际网络技术研究领域的一个热点,而安全问题则是P2P网络通信研究中的重要课题。通过应用JXTA技术,文章着重阐述了在P2P网络中实现安全对等组的方法及其工作机制,并在JavaTM2平台上予以实现。

基于贝叶斯网络的Peer-to-Peer识别方法

网络业务分类与识别是网络管理、网络规划和安全的必要途径,而Peer-to-Peer(P2P)流量由于采用伪装端口、动态端口以及应用层加密,已成为业务分类与识别的主要难点.该文提出了P2P业务的精确识别方法,通过对流统计特性的分析,提取相关特征属性,应用遗传算法选取最优特征属性子集,并采用贝叶斯网络机器学习方法识别P2P流量.实验表明K2,TAN和BAN能有效快速地识别P2P业务,分类精度高达95%以上,很大程度上优于朴素贝叶斯分类和BP神经网络方法.同时该系统具有可扩展性,能够识别未知的P2P流量,并适用于实时分类识别环境.

基于Peer-to-Peer网络的JXTA技术研究

计算机对等联网(peer-to-peernetwork,P2P)技术是一项新型网络应用技术,而JXTA技术是由Sun微系统公司推出的一项致力于为P2P应用提供所需基础服务的新技术。该文着重介绍了JXTA技术的体系结构和核心协议,分析了其可行性,并对其未来发展前景进行了展望。

Internet中Peer-to-Peer应用流量测量与分析

Peer to Peer网络(简称p2p)作为一种新型的覆盖网络引起了越来越多研究者的兴趣。本文介绍了在我国进行的骨干互联网上p2p网络流量测量。与现有国外研究不同,本文的数据来源于核心路由器,因此克服了它们的缺陷。其研究集中在汇聚流中的3个周期性尖峰群、不同主机发送或接收流量的重尾分布、p2p流量的长相关特性以及提出了ADTE的估计方法来区分信令和数据流量。本文的研究也显示出Napster在p2p流中占大部分,这暗示着超级节点和阶层式拓扑较纯p2p结构潜在的优势。同时,观察到在我国p2p的流量仅占Internet总流量的1%弱,这个值跟国外的数据有很大区别。我们分析了其中的原因并希望该结论为我国p2p软件的发展提供参考。

Peer-to-Peer体系结构及一种新型对等实体模型

对等网络结构也许会在Internet的变革中具有划时代的意义,这预示着它将为各种形式的网络运用提供了一个坚实基础。但是,基于对等网络结构的应用同时也将给开发者以巨大挑战,甚至让一些人认为这种结构是不可实现的。本文探讨了一个可实现的、健壮的对等网络结构所需要素,并给出一种新型对等实体模型的构想。

一种有效的Peer-to-Peer自适应拓扑进化协议

现有的无结构Peer-to-Peer(P2P)系统缺乏对拓扑公平性的考虑,并且不能对某些节点的恶意行为进行有效的抑制.其主要原因在于构造的拓扑对节点可信度的不敏感性,忽略了节点在不同领域中可信度的区别.据此,首先给出了基于领域的P2P信任模型的定义,然后在此基础上提出了一种针对无结构化P2P网络的自适应拓扑进化协议.该协议可以针对具体的领域进行拓扑进化,使得领域内的高可信节点占据相应领域拓扑的有利位置,低可信节点处于不利位置,从而体现拓扑的公平性.该协议同时能够对节点的恶意行为进行有效的抑制,并具有激励性质,鼓励节点提供更好的服务,以获得更高的回报率.分析和仿真结果表明,该协议较之现有协议,在拓扑的有效性和安全性等方面有较大的提高.

基于Region的多层结构Peer-to-Peer网络模型与搜索算法研究

以小世界模型为理论基础,以 Region 为基本逻辑管理单位,按用户需求和共享目的组织 Region。提出了基于 Region 的多层结构 Peer-to-Peer 网络模型和构造规则,给出了 Region 的划分策略和数学模型,证明了模型的正确和合理性;对模型中的层和域、中心节点、普通节点和汇聚点进行了明确的定义,给出了节点加入、离开、中心节点选取策略和算法描述;使定位某种服务的工作量和查询范围从网络中的所有结点数降低到 Region 的节点数,有效地防止了恶意请求引发的洪,网络系统开销为常数。模拟分析表明,该模型可有效解决可扩展性、性能与效率不高问题,且网络规模越大,其综合性能的优越性越明显,因此,模型是合理有效的。

基于Gnutella协议的分布式Peer-to-Peer网络连接管理策略及改进研究

在分析Gnutella网络协议、消息传播和连接管理机制的基础上,提出了基于F-Measure算法的网络连接管理策略,在算法中引入了一个重要的指标F-Measure参数f:丢弃连接后消息的到达率,当网络过载时,选f值最大的连接断开;通过对Gnutella网络中的消息分类和设定优先级,建立缓冲时间机制保存丢弃连接上的重要信息,以最小的代价维护网络的鲁棒性;在应用层上采用Zig-Zag算法进行数据流控制,辅助F-Measure算法进行连接管理,有效地控制了Gnutella网络产生的请求Flood,使网络的连接管理具体数据化。最后,对F-Measure算法进行了性能分析和模拟。