排序方式: 共有22条查询结果,搜索用时 671 毫秒
11.
Internet traffic classification plays an important role in network management. Many approaches have been proposed to classify different categories of Internet traffic. However, these approaches have specific usage contexts that restrict their ability when they are applied in the current network environment. For example, the port based approach cannot identify network applications with dynamic ports; the deep packet inspection approach is invalid for encrypted network applications; and the statistical based approach is time-consuming. In this paper, a novel technique is proposed to classify different categories of network applications. The port based, deep packet inspection based and statistical based approaches are integrated as a multistage classifier. The experimental results demonstrate that this approach has high recognition rate which is up to 98% and good performance of real-time for traffic identification. 相似文献
12.
13.
基于免疫粒子群的P2P协议识别方法 总被引:1,自引:1,他引:0
为了解决基于统计特征的P2P协议识别中,因特征选择不当而引起的识别准确率低的问题,采用免疫粒子群算法(Immune-PSO)选取最优特征子集,选择出最能区分P2P协议的特征子集。实验结果表明,该算法较标准粒子群算法具有更高的全局搜索能力,能更准确地找出最优特征子集,该方法能有效地提高协议的识别率,对常见的P2P协议如BitTorrent、eMule等有高达90%的识别率。 相似文献
14.
15.
针对颗粒流全尺度模拟时的干碰撞问题,在内嵌边界多重直接力全尺度算法中加入软球碰撞模型.通过空气中小球碰撞壁面和小球在粗糙表面上滚动2个典型算例,验证了软球模型在全尺度模拟中对干碰撞作用求解的适用性和准确性.对软球模型各主要参数的敏感度分析表明:时间步长越小,碰撞计算越精确;弹簧刚度系数越小,软球模型的接触特征时间越长,全尺度计算受到的资源限制越小;网格尺度、速度恢复系数对软球模型在全尺度模拟中的求解精度影响不大.实验室尺度气固鼓泡床的全尺度模拟结果表明,耦合方法可用于计算复杂的多颗粒流动体系. 相似文献
16.
17.
18.
自然梯度算法是处理盲源分离问题的一个重要方法。基于信号分离度的概念以及BP算法中的动量因子,在自适应步长的基础上加入了基于分离度自适应变化的动量因子,提出了一种改进算法来更好处理速度和分离之间的矛盾;通过仿真验证了改进算法的优越性。 相似文献
19.
Peer-to-Peer technology is one of the most popular techniques nowadays, and it brings some security issues, so the recognition and management of P2P applications on the internet is becoming much more important. The selection of protocol features is significant to the problem of P2P traffic identification. To overcome the shortcomings of current methods, a new P2P traffic identification algorithm is proposed in this paper. First of all, a detailed statistics of traffic flows on internet is calculated. Secondly, the best feature subset is chosen by binary particle swarm optimization. Finally, every feature in the subset is given a proper weight. In this paper, TCP flows and UDP flows each have a respective feature space, for this is advantageous to traffic identification. The experimental results show that this algorithm could choose the best feature subset effectively, and the identification accuracy is improved by the method of feature weighting. 相似文献