无尺度网络下具有免疫特征的僵尸网络传播模型*

结合无尺度的特性,考虑僵尸网络传播过程中部分主机的免疫特性,提出一种无尺度网络下具有免疫特征的僵尸网络传播模型。该模型基于Internet的实际情况,重点考虑了无尺度网络的拓扑结构,并结合了僵尸网络中部分脆弱主机由于提前从易感染的网络中被移除而具有免疫特征的情况。通过MATLAB进行仿真,仿真结果表明,这种传播模型更符合真实网络中僵尸网络的传播规律。     

具有免疫特征的僵尸网络传播模型

僵尸网络是一种从传统恶意代码进化而来的新型攻击方式,已成为Internet安全的一个重大威胁。僵尸网络传播模型是研究僵尸程序传播特性最常用的一种方法,当前僵尸网络的主流传播模型并没有考虑到部分主机的免疫特性,因而目前的这些主流传播模型对僵尸程序在Internet上的传播特性反应得不够准确。提出了一种新的具有免疫特征的僵尸网络传播模型。该模型基于Internet的实际情况,重点考虑了Internet中部分脆弱主机由于提前从易感染的网络中移除而具有免疫特征。仿真结果表明,基于免疫特征的僵尸网络传播模型更符合真实Interne网络中僵尸程序的传播规律和感染特性。     

无尺度网络下的僵尸网络传播模型研究

僵尸网络是一种从传统恶意代码进化而来的新型攻击方式,已成为Internet安全的一个重大威胁。建立僵尸网络的传播模型已成为研究僵尸程序传播特性最有效的一种方法。当前建立的僵尸网络传播模型均是基于随机网络理论的,而实际的Internet是一个具有无尺度特性的复杂网络,因此,这些主流传播模型并不能完全准确反映僵尸程序在Internet的传播特性。提出了一种基于无尺度网络结构的僵尸网络传播模型,根据Internet的实际情况,结合网络流量阻塞这一Internet中的常态现象,重点考虑了真实Internet中节点的增长性和择优连接性。仿真结果表明,该模型不仅符合真实Internet网络中僵尸程序的传播规律和感染特性,而且能够反映出网络中出现拥塞时僵尸程序的感染特性。     

僵尸网络传播模型分析

为了让僵尸网络传播模型是更符合Internet中的僵尸网络的传播特性,基于简单病毒传播模型深入分析僵尸程序的传播特性,考虑了僵尸程序在传播过程中存在的网络流量阻塞、提前免疫主机和感染后免疫主机等因素,提出了一个新的僵尸网络传播模型,并进行了仿真实验。实验结果表明,该模型更符合僵尸程序在复杂网络中的传播特性,有利于僵尸网络的传播行为的分析和传播趋势的预测。     

基于无尺度网络的僵尸网络传播模型

主流传播模型不能准确反映僵尸程序在Internet中的传播特性。针对该问题,提出一种基于无尺度网络结构的僵尸网络传播模型。该模型考虑了Internet网络的增长特性和择优连接特性,能够反映实际网络中的无尺度特性,更符合真实Internet网络中僵尸程序的传播规律和感染特性。     

基于KSC算法的无尺度僵尸网络传播模型研究

对于僵尸网络传播特性的研究已有一定进展,无尺度网络传播模型更加符合实际网络特征,基于KSC算法对僵尸程序在无尺度网络中的传播特性进行研究,研究发现,模型基本能够体现僵尸程序在无尺度网络的传播特性和感染特征。     

具有变化感染率的僵尸网络传播模型

僵尸网络对网络安全的威胁已经引起了众多安全研究专家的高度重视。数学建模是研究僵尸网络传播特性 的一种有效方法。现有的僵尸网络传播模型假设感染率是常量。事实上,大量僵尸病毒爆发时会引起网络拥塞,从而 导致感染变慢。针对这一特点,提出一个具有变化感染率的僵尸网络传播模型。根据Intetne、的实际情况,在模型中 加入了预先免疫特征项。最后通过matlab模拟对比了提出的模型与已有模型在反映僵尸网络感染时的差异。实验 结果表明,具有变化感染率的僵尸网络传播模型能更准确地反映实际网络中僵尸程序的传播规律。     

无尺度半分布式P2P僵尸网络的构建

鉴于僵尸网络具有无尺度网络的增长性和择优连接性,提出一种无尺度半分布式P2P僵尸网络的构建方法。僵尸程序在初始时只感染少数几台主机,之后每台受感染主机根据节点度数选择要连接的节点,度数越大,节点被感染的概率越高。理论分析和仿真结果表明,利用该方法构建的僵尸网络具有无尺度网络的2个重要特性。     

结构化对等网络中P2P 僵尸网络传播模型

依赖结构化对等网传播的P2P僵尸是未来互联网面临的重要威胁.详细分析了两种典型的结构化P2P协议Chord和Kademlia的工作原理,在此基础上,使用数学建模的方法建立了结构化P2P僵尸网络的传播模型.该模型将Kademlia,Chord协议与双因子免疫机制、主机在线率等因素相结合,较为全面地研究了两种典型的结构化P2P网络中僵尸的传播机理,并使用软件仿真的方法模拟了节点超过百万时,结构化P2P网络中僵尸的传播行为,通过软件仿真得出的数据与理论数据进行对比,验证了模型的正确性.从实验结果可以看出:对于Kademlia和Chord两种结构化P2P网络,僵尸传播无论是双因子免疫模型还是结合双因子与主机在线率的模型,理论模型与仿真结果都非常吻合,体现了模型的准确性,为僵尸的检测与防御提供了理论依据.     

一种回归的SIR僵尸网络传播模型研究

僵尸网络对当前互联网产生巨大危害,基于漏洞扫描的蠕虫是僵尸的主要传播方式和载体.针对蠕虫的传播,现有模型大多以SIR模型为基础,假设主机在免疫之后就不会再被感染.由于僵尸中可能存在多个蠕虫,因此使得免疫主机还可能回归到易感染状态.考虑到此因素,本文在SIR模型的基础上,提出一种回归的RSIR僵尸网络传播模型.给出了模型的描述和数学公式,并对模型进行了分析.实际数据仿真结果显示,模型是有效的.     

Clustering botnet communication traffic based on n-gram feature selection

Recognized as one the most serious security threats on current Internet infrastructure, botnets can not only be implemented by existing well known applications, e.g. IRC, HTTP, or Peer-to-Peer, but also can be constructed by unknown or creative applications, which makes the botnet detection a challenging problem. Previous attempts for detecting botnets are mostly to examine traffic content for bot command on selected network links or by setting up honeypots. Traffic content, however, can be encrypted with the evolution of botnet, and as a result leading to a fail of content based detection approaches. In this paper, we address this issue and propose a new approach for detecting and clustering botnet traffic on large-scale network application communities, in which we first classify the network traffic into different applications by using traffic payload signatures, and then a novel decision tree model is used to classify those traffic to be unknown by the payload content (e.g. encrypted traffic) into known application communities where network traffic is clustered based on n-gram features selected and extracted from the content of network flows in order to differentiate the malicious botnet traffic created by bots from normal traffic generated by human beings on each specific application. We evaluate our approach with seven different traffic trace collected on three different network links and results show the proposed approach successfully detects two IRC botnet traffic traces with a high detection rate and an acceptable low false alarm rate.     

Urban traffic congestion propagation and bottleneck identification

Bottlenecks in urban traffic network are sticking points in restricting network collectivity traffic efficiency. To identify network bottlenecks effectively is a foundational work for improving network traffic condition and preventing traffic congestion. In this paper, a congestion propagation model of urban network traffic is proposed based on the cell transmission model （CTM）. The proposed model includes a link model, which describes flow propagation on links, and a node model, which represents link-to-link flow propagation. A new method of estimating average journey velocity （AJV） of both link and network is developed to identify network congestion bottlenecks. A numerical example is studied in Sioux Falls urban traffic network. The proposed model is employed in simulating network traffic propagation and congestion bottleneck identification under different traffic demands. The simulation results show that continual increase of traffic demand is an immediate factor in network congestion bottleneck emergence and increase as well as reducing network collectivity capability. Whether a particular link will become a bottleneck is mainly determined by its position in network, its traffic flow （attributed to different OD pairs） component, and network traffic demand.     

A mathematical exploitation of simulated uniform scanning botnet propagation dynamics for early stage detection and management

The contribution of this paper is two-fold. Firstly, we propose a botnet detection approach that is sufficiently timely to enable a containment of the botnet outbreak in a supervised network. Secondly, we show that mathematical models of botnet propagation dynamics are a viable means of achieving that level of defense from bot infections in a supervised network. Our approach is built on the idea of processing network traffic such as to localize a weakly connected subgraph within a graph that models network communications between hosts, and thus consider that subgraph as representative of a suspected botnet. We devise applied statistics to infer the propagation dynamics that would characterize the suspected botnet if this latter were indeed a botnet. The inferred dynamics are materialized into a model graph. A subgraph isomorphism search determines whether or not there is an approximate match between the model graph and any subgraph of the weakly connected subgraph. An approximate match between the two leads to a timely identification of infected hosts. We have implemented this research in the Matlab and Perl programming languages, and have validated it in practice in the Emulab network testbed. In the paper, we describe our approach in detail, and discuss experiments along with experimental data that are indicative of the effectiveness of our approach.