面向分层网络的社交蠕虫仿真建模研究

随着社交网络的普及,社交蠕虫已经成为了威胁社会的主要隐患之一.这类蠕虫基于拓扑信息和社会工程学在因特网中快速传播.先前的学者们对社交蠕虫的传播建模与分析主要存在两个问题：网络拓扑的不完整性和传播建模的片面性;因而导致对社交蠕虫感染规模的低估和人类行为的单一化建模.为了解决上述问题,本文提出了社交蠕虫传播仿真模型,该模型使用分层网络能更准确地抽象社交逻辑层与实际物理层之间的关系,以及利用人类移动的时间特性能更全面地刻画社交蠕虫的传播行为.实验结果表明,该仿真模型揭示了用户行为、网络拓扑参数以及不同的修复过程对社交蠕虫传播造成的影响.同时,文中对社交蠕虫的传播能力做出了定性分析,为网络防御提供了重要的理论支持.     

P2P触发式主动型蠕虫传播建模

对P2 P触发式主动型蠕虫的攻击机制进行了研究,发现该类蠕虫传播通常包括四个阶段：信息收集,攻击渗透、自我推进与干预激活。基于对P2 P触发式主动型蠕虫攻击机制的分析并运用流行病学理论提出了P2 P触发式主动型蠕虫传播数学模型并基于该模型推导了蠕虫传播进入无蠕虫平衡状态的充分条件。仿真实验验证了所提出传播模型的有效性。     

蠕虫传播模型中关键因素的研究

本文对目前蠕虫传播模型建立中的不足进行了分析,在此基础上提出了在传播模型中参数设置的两个原则,并提取了影响蠕虫传播的关键因素,通过对每个因素的合理性和获取方法进行的分析,证明该方式从一定程度上提高了传统数学模型描述的可操作性和实用性,并为建立通用的蠕虫传播模型提供了基础元素。     

基于随机进程代数的P2P网络蠕虫对抗传播特性分析

 研究P2P网络中良性蠕虫和恶意蠕虫在对抗传播过程中的特性,可为制定合理的蠕虫对抗策略提供科学依据.提出一种基于随机进程代数的P2P网络蠕虫对抗传播的建模与分析方法.首先,分析了传播过程中蠕虫之间的对抗交互行为以及网络节点的状态转换过程;然后,利用PEPA语法建立了恶意蠕虫初始传播阶段与蠕虫对抗阶段的随机进程代数模型;最后,采用随机进程代数的流近似方法,推导得到能够描述蠕虫传播特性的微分方程组,通过求解该方程组,分析得到P2P蠕虫的对抗传播特性.试验结果表明,良性蠕虫可以有效遏制P2P网络中的恶意蠕虫传播,但需要根据当前的网络条件制定科学的传播策略,以减少良性蠕虫自身的传播对网络性能的影响.     

P2P网络中激发型蠕虫传播动态建模

 鉴于激发型蠕虫的巨大危害性,本文在考虑网络动态变化的情况下对激发型蠕虫的传播进行了深入地研究,提出了激发型蠕虫动态传播数学模型和免疫模型,并基于动态传播数学模型推导出了激发型蠕虫不会泛滥的充分条件.大规模仿真实验验证了传播模型的有效性和蠕虫不会泛滥充分条件的正确性.基于传播模型的分析表明,下载率是影响蠕虫传播的关键因素,蠕虫基本繁殖率是衡量蠕虫传播能力的关键指标.基于实测P2P网络数据和传播模型,预测和估计了激发型蠕虫的传播能力、传播速度和危害性,指出尽早重视P2P激发型蠕虫特别是尽早找到检测和控制方法的重要性和迫切性.     

面向异构网络环境的蠕虫传播模型Enhanced-AAWP

合理地建立蠕虫传播模型将有助于更准确地分析蠕虫在网络中的传播过程。首先通过对分层的异构网络环境进行抽象,在感染时间将影响到蠕虫传播速度的前提下使用时间离散的确定性建模分析方法,推导出面向异构网络环境的蠕虫传播模型Enhanced-AAWP。进而基于Enhanced-AAWP模型分别对本地优先扫描蠕虫和随机扫描蠕虫进行深入分析。模拟结果表明,NAT子网的数量、脆弱性主机在NAT子网内的密度以及本地优先扫描概率等因素都将对蠕虫在异构网络环境中的传播过程产生重要的影响。     

P2P网络中被动型蠕虫传播与免疫建模

鉴于被动型蠕虫的危害性,对被动型蠕虫进行了深入分析,进而基于平均场法建立了被动型蠕虫的传播模型和免疫模型.基于传播模型和流行病传播学理论推导出进入无蠕虫平衡状态的充分条件,仿真实验证明了该充分条件的正确性.另外,仿真实验还表明,下载率和恢复率是控制蠕虫传播的两个可控的关键参数.在免疫软件被编制出来前,降低下载率和提高恢复率能有效控制被动型蠕虫的传播.     

基于云安全环境的蠕虫传播模型

云安全体系的出现标志着病毒检测和防御的重心从用户端向网络和后台服务器群转变,针对云安全体系环境,基于经典SIR模型提出了一种新的病毒传播模型(SIR_C)。SIR_C在考虑传统防御措施以及蠕虫造成的网络拥塞流量对自身传播遏制作用的基础上,重点分析了网络中云安全的部署程度和信息收集能力对蠕虫传播模型的影响。实验证明SIR_C模型是蠕虫传播研究在云安全环境下有意义的尝试。     

基于纯P2P原理的蠕虫传播模型的研究

提出一种潜在的蠕虫传播方式--基于纯P2P原理的蠕虫传播方式,利用分片传输机制达到自主、快速的传播能力.根据纯P2P传播方式的特点,提出使用SEI和SEIR模型来建立蠕虫自由传播和受控传播过程的传播动力学模型.介于无尺度网络被公认为最接近于实际的网络拓扑,对两个模型进行了基于无尺度网络拓扑结构的仿真,仿真实验结果有力地支持了提出的两个传播动力学模型.通过数值计算和仿真实验结果的分析,认为随着蠕虫体的增大,基于纯P2P原理的蠕虫将具备更强大的传播能力和良好的隐蔽性,更容易被攻击者采用,是未来蠕虫防御方法研究应重视的问题.     

基于CDC的良性蠕虫的离散传播模型

根据建立CDC的思想，分析了基于CDC的良性蠕虫的特征。更进一步，分别在有时间延迟条件下以及没有时间延迟条件下对于基于CDC的良性蠕虫对抗蠕虫的传播过程进行了建模分析。最后，通过仿真实验对于模型进行了验证，总结了影响基于CDC的良性蠕虫对抗蠕虫传播的2个主要因素。     

物联网恶意代码传播模型研究

Nowadays, the main communication object of Internet is human-human. But it is foreseeable that in the near future any object will have a unique identification and can be addressed and connected. The Internet will expand to the Internet of Things. IPv6 is the cornerstone of the Internet of Things. In this paper, we investigate a fast active worm, referred to as topological worm, which can propagate twice to more than three times faster than a traditional scan-based worm. Topological worm spreads over AS-level network topology, making traditional epidemic models invalid for modeling the propagation of it. For this reason, we study topological worm propagation relying on simulations. First, we propose a new complex weighted network model, which represents the real IPv6 AS-level network topology. And then, a new worm propagation model based on the weighted network model is constructed, which describes the topological worm propagation over AS-level network topology. The simulation results verify the topological worm model and demonstrate the effect of parameters on the propagation.     

Modeling and analysis of anti-worm in P2P networks

Anti-worm is an effective way to fight against malicious worm and has been followed closely by malicious worm researchers recently.However,active and passive confronting technologies in peer-to-peer (P...     

3D NOC for many-core processors

With an increasing number of processors forming many-core chip multiprocessors (CMP), there exists a need for easily scalable, high-performance and low-power intra-chip communication infrastructure for emerging systems. In CMPs with hundreds of processing elements, 3D integration can be utilized to shorten long wires forming communication links. In this paper, we propose a Clos network-on-chip (CNOC) in conjunction with 3D integration as a viable network topology for many core CMPs. The primary benefit of 3D CNOC is scalability and a clear upper bound on power dissipation. We present the architectural and physical design of 3D CNOC and compare its performance with several other topologies. Comparisons are made among several topologies (fat tree, flattened butterfly, mesh and Clos) showing the power consumption of a 3D CNOC increases only minimally as the network size is scaled from 64 to 512 nodes relative to the other topologies. Furthermore, in a 512-node system, 3D CNOC consumes about 15% less average power than any other topology. We also compare 3D partitioning strategies for these topologies and discuss their effect on wire delay and the number of through-silicon vias.     

A new worm exploiting IPv6 and IPv4-IPv6 dual-stack networks: experiment, modeling, simulation, and defense

It is commonly believed that the IPv6 protocol can provide good protection against network worms that try to find victims through random address scanning due to its huge address space. However, we discover that there is serious vulnerability in terms of worm propagation in IPv6 and IPv4-IPv6 dual-stack networks. It is shown in this article that a new worm can collect the IPv6 addresses of all running hosts in a local subnet very quickly, leading to accelerated worm propagation. Similar to modeling the self-replicating behaviors of biological viruses, a Species-Patch model and a discrete-time simulator are developed to study how the dual-stack worm spreads in networks with various topologies. It is shown that the worm could propagate in the IPv6 and IPv4-IPv6 dual-stack networks much faster than in the current IPv4 Internet. Several effective defense strategies focusing on network deployment are proposed.     

Energy‐Connectivity Tradeoff through Topology Control in Wireless Ad Hoc Networks

In this study, we investigate topology control as a means of obtaining the best possible compromise between the conflicting requirements of reducing energy consumption and improving network connectivity. A topology design algorithm capable of producing network topologies that minimize energy consumption under a minimum‐connectivity constraint is presented. To this end, we define a new topology metric, called connectivity efficiency, which is a function of both algebraic connectivity and the transmit power level. Based on this metric, links that require a high transmit power but only contribute to a small fraction of the network connectivity are chosen to be removed. A connectivity‐efficiency‐based topology control (CETC) algorithm then assigns a transmit power level to each node. The network topology derived by the proposed CETC heuristic algorithm is shown to attain a better tradeoff between energy consumption and network connectivity than existing algorithms. Simulation results demonstrate the efficiency of the CECT algorithm.     

Effect of Selfish Node Behavior on Efficient Topology Design

The problem of topology control is to assign per-node transmission power such that the resulting topology is energy-efficient and satisfies certain global properties such as connectivity. The conventional approach to achieve these objectives is based on the fundamental assumption that nodes are socially responsible. We examine the following question: if nodes behave in a selfish manner, how does it impact the overall connectivity and energy consumption in the resulting topologies? We pose the above problem as a non-cooperative game and use game-theoretic analysis to address it. We study Nash equilibrium properties of the topology control game and evaluate the efficiency of the induced topology when nodes employ a greedy best response algorithm. We show that even when the nodes have complete information about the network, the steady state topologies are suboptimal. We propose a modified algorithm based on a better response dynamic and show that this algorithm is guaranteed to converge to energy-efficient and connected topologies. Moreover, the node transmit power levels are more evenly distributed and the network performance is comparable to that obtained from centralized algorithms.     

Power-efficient topology control for static wireless networks with switched beam directional antennas

Topology control problems are associated with assignment of power levels to nodes of a wireless network so that the resulting graph topology satisfies certain properties. In this paper we consider the problem of power-efficient topology control with switched beam directional antennas taking into account their non-uniform radiation pattern within the beamwidth. Previous work in the area have all assumed a uniform gain model with these antennas which renders antenna orientation insignificant as a parameter in topology control algorithms. We present algorithms that take into account a model of non-uniform gain with the objectives of minimizing the total power and maximum power to keep the network connected. We consider two cases: one where the antenna orientation is assumed given and another where the antenna orientation needs to be derived as well. For the first case, we present optimal and approximation algorithms for constructing power-efficient topologies. For the second case, we prove the problem to be NP-complete and present heuristic solutions along with approximation bounds. Through comparison of the two cases by simulation, significant reductions are shown in the maximum as well as total power required to keep the network connected for the second case, thus demonstrating the benefits of using antenna orientation as parameter in topology construction.     

基于马尔可夫链的网络蠕虫传播模型

提出了网络蠕虫的随机传播模型。首先,基于马尔可夫链对于网络蠕虫进行了建模,并且讨论了模型的极限分布以及平稳分布的存在性。然后,讨论了网络蠕虫在传播初期灭绝的充要条件以及在传播后期灭绝的必要条件。最后,讨论了网络蠕虫的传播规模。仿真实验对于模型进行了验证,讨论了模型中传播参数,时间参数以及漏洞主机数等相关参数对于网络蠕虫传播的影响,并且与G-W模型进行了数据对比,说明了本模型的优势。     

一种改进的二极管箝位型多电平变换器拓扑

多电平电路在高压大功率领域的拓展受到其复杂电路拓扑的制约,因此近年来不断有新型多电平电路结构被提出。本文在传统多电平逆变器拓扑结构的基础上,提出了一种新型单相七电平电压源逆变器拓扑。新型电路拓扑是在传统的单相全桥五电平箝位二极管电路基础上,增加了两个开关器件,利用10个开关器件以及4个箝位二极管产生了7种不同的电平输出。详细分析了该逆变器的拓扑结构,给出了PWM控制策略。最后通过仿真实验验证了这种拓扑的可行性。该逆变器对传统箝位二极管逆变器在结构上做出了优化。