| STP协议攻击者放置问题研究 |
| |
| 引用本文： | 周颢,赵保华,陈伟琳.STP协议攻击者放置问题研究[J].中国科学技术大学学报,2009,39(11). |
| |
| 作者姓名： | 周颢 赵保华 陈伟琳 |
| |
| 作者单位： | 中国科学技术大学计算机科学与技术系,安徽,合肥,230027;安徽省汁算与通讯软件重点实验室,安徽,合肥,230027 |
| |
| 基金项目： | 国家自然科学基金，巾国高技术研究发展(863)计划，安徽高校省级自然科学研究计划重大项目 |
| |
| 摘 要： | STP协议攻击者放置问题考虑的是,在一个给定物理拓扑结构的网络中,如何选择合适的交换设备来布置STP攻击者,以控制各交换设备的非终端端口的通断状态,从而动态改变逻辑网络拓扑结构.针对该问题先进行了有向图抽象,给出了受控边覆盖的判定定理,在此基础上提出了受控顶点选择算法,并结合具体实例对算法进行了讨论与分析.
|
| 关 键 词： | 生成树协议 STP攻击者 拓扑结构网络 |
Research into the STP attacker placement problem |
| |
| ZHOU Hao,ZHAO Bao-hua,CHEN Wei-Lin.Research into the STP attacker placement problem[J].Journal of University of Science and Technology of China,2009,39(11). |
| |
| Authors: | ZHOU Hao ZHAO Bao-hua CHEN Wei-Lin |
| |
| Abstract: | The STP attacker allocation problem concerns itself with the selection of suitable switches forSTP 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. |
| |
| Keywords: | spanning tree protocol STP attacker topology network |
| 本文献已被 万方数据 等数据库收录！ |
|
