Entity

Time filter

Source Type


Wang Y.,Stake Key Laboratory of Mathematical Engineering and Advanced Computing | Wang Z.-X.,Stake Key Laboratory of Mathematical Engineering and Advanced Computing | Miao F.,Stake Key Laboratory of Mathematical Engineering and Advanced Computing | Liu H.-S.,Stake Key Laboratory of Mathematical Engineering and Advanced Computing | Zhang L.-C.,Stake Key Laboratory of Mathematical Engineering and Advanced Computing
Yingyong Kexue Xuebao/Journal of Applied Sciences | Year: 2013

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. Source

Discover hidden collaborations