STP协议攻击者放置问题研究  

Research into the STP attacker placement problem

作　　者：周颢[1,2] 赵保华[1,2] 陈伟琳[1,2] 

机构地区：[1]中国科学技术大学计算机科学与技术系,安徽合肥230027 [2]安徽省计算与通讯软件重点实验室,安徽合肥230027

出　　处：《中国科学技术大学学报》2009年第11期1212-1217,共6页JUSTC

基　　金：国家自然科学基金(60872009;60602016);中国高技术研究发展(863)计划(2007AA01Z428;2009AA01Z148);安徽高校省级自然科学研究计划重大项目(ZD2008005-5;ZD200904;JK2009A013;JK2009A025)资助

摘　　要：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.

关 键 词：生成树协议 STP攻击者 拓扑结构网络 

分 类 号：TP311.5[自动化与计算机技术—计算机软件与理论]