共查询到20条相似文献,搜索用时 46 毫秒
1.
2.
3.
4.
5.
P2P下蠕虫的传播将是未来蠕虫发展的方向,分析P2P系统中蠕虫传播的现状,给出其扫描策略,并通过分析蠕虫的扫描算法,定义了两个蠕虫传播模型,并在此基础给出综合的防治策略。 相似文献
6.
对等网络蠕虫利用对等网络的固有特征(如本地路由表、应用层路由等),不仅复制快,而且提供了更好的隐蔽性和传播性,因而其危害大,防御困难。从分析互联网蠕虫及其传播机制入手,对对等网络上的蠕虫(即P2P蠕虫)及其特殊性进行了综合分析。在此基础之上,提出了基于良性益虫的被动激活主动传播防御策略(PAIFDP),并对该策略的技术原理和响应防御系统的功能模块等进行了详细设计。以Peersim仿真平台为基础,对各种不同网络参数下的防御效果和资源消耗情况进行了实验分析。结果表明,基于良性益虫的P2P蠕虫防御技术具有收敛时间快、网络资源消耗少、适应性强等特点。 相似文献
7.
主动P2P蠕虫的传播会对P2P网络以及互联网的安全造成严重威胁。通过研究主动P2P蠕虫传播时节点行为,提出一种基于节点行为的主动P2P蠕虫检测方法PBD(Peer Behavior based Detection)。在此基础上设计和实现了一个主动P2P蠕虫检测系统PPWDS(Proactive P2P Worm Detection System),该系统采用CUSUM算法对P2P节点出站短连接进行实时监控。实验表明,PBD是检测主动P2P蠕虫的一种有效方法。 相似文献
8.
9.
10.
数以百万计的网络用户使用P2P网络来共享文件。但在P2P网络中,蠕虫则感染了大量的漏洞主机,并对信息设施和终端系统带来巨大的破坏。该文分析了P2P体系结构内在的风险,阐明了P2P蠕虫所带来的威胁,并且列举了威胁P2P网络的3种非扫描类型的螭虫:被动式蠕虫,反应式蠕虫和主动式蠕虫。鉴于这种情况,该文提出了一种能够减轻P2P蠕虫威胁的对策。 相似文献
11.
P2P应用极大地满足了用户的需求,而P2P蠕虫是目前P2P应用面临的最严重的威胁之一。内容包括P2P蠕虫的特点、分类、传播模型、流量模型及其防御机制,并分析了各种模型的优缺点,对以后的研究方向进行了初步探讨。 相似文献
12.
13.
14.
15.
针对大规模网络环境下的蠕虫问题,本文提出一种面向蠕虫防御的层次化P2P重叠网模型(Hierachical Peer-to-Peer Overlay Network for Worm Prevention,简称HPOWP)。HPOWP通过层次式的P2P构架进一步提高了传统P2P系统的可缩放性,有效地与现有网络基础设施的拓扑结构相适应。在HPOWP模型中构造基于DHT的聚合树,提高蠕虫的识别效率。该模型为大规模复杂网络环境中的蠕虫防御提供了很好的解决方案。 相似文献
16.
17.
18.
基于AOI方法的未知蠕虫特征自动发现算法研究 总被引:3,自引:0,他引:3
近年来频繁爆发的大规模网络蠕虫对Internet的整体安全构成了巨大的威胁,新的变种仍在不断出现。由于无法事先得到未知蠕虫的特征,传统的基于特征的入侵检测机制已经失效。目前蠕虫监测的一般做法是在侦测到网络异常后由人工捕获并进行特征的分析,再将特征加入高速检测引擎进行监测。本文提出了一种新的基于面向属性归纳(AOI)方法的未知蠕虫特征自动提取方法。该算法在可疑蠕虫源定位的基础上进行频繁特征的自动提取,能够在爆发的早期检测到蠕虫的特征,进而通过控制台特征关联监测未知蠕虫的发展趋势。实验证明该方法是可行而且有效的。 相似文献
19.
20.
Despite many improvements on original unstructured P2P networks, these systems still suffer from several problems, the most
important of which are, (a) lack of guarantees on the integrity of the network topology in the face of churns, (b) excessive
traffic cost and (c) poor quality of search results. This paper introduces an end-to-end scalable unstructured P2P networking
solution called SUPNET to address many of these issues. SUPNET is based on our pragmatic, design oriented approach to engineering
complex networks. Rather than modeling dynamical behavior in already-existing networks, we actively design and implement local
stochastic dynamics so that an engineered global system, with predictable structures emerges. The resulting protocol, SUPNET,
consists of two sub-protocols for network management and content search. The network management sub-protocol is scalable and
highly robust and is capable of utilizing the heterogeneous distribution of network resources. Its high stability is the result
of implementation of a novel distributed feedback mechanism. The search sub-protocol is capable of locating every item, even
if a single copy of that item exists in the network, while producing a traffic that scales provably sub-linear with the network
size. It also contains mechanisms for very efficient location of popular items as well as distributed parameter tuning algorithms.
These, along with inherently self-organized and de-centralized operation, relative ease of implementation and solid analytical
foundation, make SUPNET a compelling solution for unstructured P2P networking.
Nima Sarshar received his B.Sc. from Sharif University of Technology, Iran, his Masters from University of California, Los Angeles, USA and his Ph.D. from McMaster University, Canada, all in electrical engineering. Currently, he is an Assistant Professor in Faculty of Engineering, University of Regina, SK, Canada. His research interests include large scale distributed processing, P2P computing and multimedia networking. He has won the best paper award at IEEE P2P ’04 for his paper, “Percolation Search Algorithm in Power-Law Networks: Making Unstructured P2P Networks Scalable” and at VCIP ’08 for his paper “Rate-Distortion Optimized Multimedia Communication in Networks”. Vwani P. Roychowdhury received the Ph.D. degree in Electrical Engineering from Stanford University. He is a professor of Electrical Engineering at the University of California, Los Angeles. His research focuses on computation models, including parallel and distributed processing systems, quantum computation and information processing, and circuits and computing paradigms for nanoelectronics and molecular electronics. 相似文献
Vwani P. RoychowdhuryEmail: |
Nima Sarshar received his B.Sc. from Sharif University of Technology, Iran, his Masters from University of California, Los Angeles, USA and his Ph.D. from McMaster University, Canada, all in electrical engineering. Currently, he is an Assistant Professor in Faculty of Engineering, University of Regina, SK, Canada. His research interests include large scale distributed processing, P2P computing and multimedia networking. He has won the best paper award at IEEE P2P ’04 for his paper, “Percolation Search Algorithm in Power-Law Networks: Making Unstructured P2P Networks Scalable” and at VCIP ’08 for his paper “Rate-Distortion Optimized Multimedia Communication in Networks”. Vwani P. Roychowdhury received the Ph.D. degree in Electrical Engineering from Stanford University. He is a professor of Electrical Engineering at the University of California, Los Angeles. His research focuses on computation models, including parallel and distributed processing systems, quantum computation and information processing, and circuits and computing paradigms for nanoelectronics and molecular electronics. 相似文献