Monte Carlo网络流量伪装  

Monte Carlo-Based Network Traffic Camouflage

作　　者：王禹 王振兴 苗甫 刘慧生 张连成 

机构地区：[1]数学工程与先进计算国家重点实验室,郑州450002

出　　处：《应用科学学报》2013年第4期361-367,共7页Journal of Applied Sciences

基　　金：国家"973"重点基础研究发展计划基金(No.2007CB307102);国家"863"高技术研究发展计划基金(No.2007AA01Z2A1)资助

摘　　要：针对流量伪装成本高、伪装相似度低等问题,提出一种基于蒙特卡罗的流量伪装方法.通过对所处网络环境的常规流量进行统计分析,获取多重动态特征并建立概率分布过程,利用随机数对已知概率分布抽样,产生动态特征序列并构造伪装流量.理论分析表明,该方法无需部署额外的重路由节点且伪装过程不产生分散数据,可在保证伪装生成效率的前提下降低伪装成本,提高网络性能.实验表明,该方法可降低流量检测的准确度及可信度,与现有包填充方法相比,伪装相似度也有较大改善.Heavy camouflage cost and low camouflage similarity are major problems in the traffic camouflage research. Network traffic camouflage based on the Monte Carlo method is proposed to deal with the problems. To acquire multiple dynamic characteristics and establish the probability distribution, the normal traffic is analyzed. The given probability distribution is then sampled with the generated random numbers to determine the dynamic characteristic sequences and construct the camouflage traffic flow. Theoretical analysis indicates that no extra rerouting nodes are deployed and no dispersion traffic generated. The network cost is reduced, the transport performance improved, and the efficiency guaranteed. Experiments show that the method can degrade the detection accuracy and reliability. Compared to the packet padding method, camouflage similarity is well improves.

关 键 词：网络安全 流量伪装 蒙特卡罗 伪装能力 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]