作者: Alfonso Iacovazzi , Andrea Baiocchi
DOI: 10.1007/978-3-642-28534-9_9
关键词: Computer science 、 Fragmentation (computing) 、 Optimization problem 、 Application protocol 、 IP fragmentation 、 Real-time computing 、 Masking (Electronic Health Record) 、 Algorithm 、 Network packet 、 Padding 、 Efficient algorithm
摘要: We aim at understanding if and how complex it is to obfuscate traffic features exploited by statistical flow classification tools. address packet length masking define perfect as an optimization problem, aiming minimizing overhead. An explicit efficient algorithm given compute the optimum sequence. Numerical results are provided, based on measured traces. find that fragmenting requires about same overhead padding does.