Entity

Time filter

Source Type


Zhuo Z.L.,University of Electronic Science and Technology of China | Zhong Z.J.,University of Electronic Science and Technology of China | Niu W.N.,University of Electronic Science and Technology of China | Zhang X.S.,University of Electronic Science and Technology of China | And 2 more authors.
Future Communication, Information and Computer Science - Proceedings of the International Conference on Future Communication, Information and Computer Science, FCICS 2014 | Year: 2015

Tor is one of the low-latency anonymous communication systems. Its low-latency property is simply achieved by probabilistically choosing nodes with higher bandwidth. However, as our paper shows, this path selection algorithm could put a high pressure on these routers, thus affecting the balanced performance of the whole network. In this paper, we investigate how Tor’s path selection algorithm could impact router’s traffic overhead. In addition, we propose an approach by updating available bandwidth instead of utilizing the same bandwidth all the time; simulations are conducted to show that our approach could help to reduce the chosen chances of high resources routers by an average of 60∼80%, so as to achieve a more balanced network. © 2015 Taylor & Francis Group, London. Source


Niu W.N.,University of Electronic Science and Technology of China | Zhuo Z.L.,University of Electronic Science and Technology of China | Yang G.W.,University of Electronic Science and Technology of China | Zhang X.S.,University of Electronic Science and Technology of China | And 2 more authors.
Future Communication, Information and Computer Science - Proceedings of the International Conference on Future Communication, Information and Computer Science, FCICS 2014 | Year: 2015

Concolic execution can alleviate imprecision in symbolic execution using concrete values. This technique is promising for test cases generation and vulnerabilities digging automatically in practice. Since the number of paths grows exponentially with the increase in scale and complexity of the tested programs, exploring all feasible paths is prohibitively expensive. Path explosion is the main challenge against the widespread application of concolic execution. This paper proposes a novel approach that interleaves path merging, heuristics search with constraints simplification to reduce execution time.We have conducted preliminary experiments on 10 programs which belong to GNU COREUTILS. Results show that our hybrid approach can outperform every technique by an order of magnitude in terms of execution time and increase coverage by average of 9.2%, 9.1%, and 8.6%. © 2015 Taylor & Francis Group, London. Source

Discover hidden collaborations