分布式自选举动态阵列蜜罐系统的设计与实现

Design and Implementation of Distributed Self-Election Dynamic Array Honeypot System

Traditional honeypot is in fact a “passive proactive” defense mechanism because it may lose the value entirely once the adversary has detected the existence of the static trap and bypassed it. Our work focuses on a Self Election dynamic honeypot framework which aims to bewilder attackers by coordinating and switching roles periodically to form a huge dynamic puzzle. In this paper, we discuss the UDP Spokesman synchronization scheme and the Self Election coordination method, perform the framework simulation of the dynamic array honeypot with NS2, carry out the prototype implementation by Java, and then validate the effectiveness and feasibility on the simulation and prototype system. The promising results of applying this framework to mitigate the effects of attacks are shown and analyzed. Our work demonstrates that the Self Election dynamic array honeypot system is feasible and effective for proactive network confrontation.