摘要
STP协议攻击者放置问题考虑的是,在一个给定物理拓扑结构的网络中,如何选择合适的交换设备来布置STP攻击者,以控制各交换设备的非终端端口的通断状态,从而动态改变逻辑网络拓扑结构.针对该问题先进行了有向图抽象,给出了受控边覆盖的判定定理,在此基础上提出了受控顶点选择算法,并结合具体实例对算法进行了讨论与分析.
The STP attacker allocation problem concerns itself with the selection of suitable switches for STP attacker placement so as to control the on-off states of non-endpoint ports of switches in a given physical topology network and thus changes the logical network topology dynamically. A directed-graph abstraction of the problem was presented and then the controlled-edge covering theorem was obtained, on the basis of which the controlled vertices selection algorithm was proposed and further discussion and analysis of the algorithm were given.
基金
国家自然科学基金(60872009
60602016)
中国高技术研究发展(863)计划(2007AA01Z428
2009AA01Z148)
安徽高校省级自然科学研究计划重大项目(ZD2008005-5
ZD200904
JK2009A013
JK2009A025)资助
