首页 | 本学科首页   官方微博 | 高级检索  
     

一种多子网物理拓扑结构的发现算法
引用本文:王桃,李杰,陈宏亮.一种多子网物理拓扑结构的发现算法[J].小型微型计算机系统,2010,31(2).
作者姓名:王桃  李杰  陈宏亮
作者单位:中南大学,信息科学与工程学院,湖南长沙410075
摘    要:首先分析物理拓扑发现的主要算法及存在的问题,然后提出一个新的基于临界区理论的物理拓扑发现算法,成功的解决了多子网交换域的拓扑发现问题.算法先利用插入法建立起临界区内交换机的连接关系,再利用叶节点法将拓扑补充完整.该算法还克服了地址转发表完整性的限制,通过引入主机MAC地址,解决了共享网段的问题.

关 键 词:拓扑发现  网络管理  临界区  多子网交换域

Algorithm for Physical Topology Discovery in Multi-subnet Networks
WANG Tao,LI Jie,CHEN Hong-liang.Algorithm for Physical Topology Discovery in Multi-subnet Networks[J].Mini-micro Systems,2010,31(2).
Authors:WANG Tao  LI Jie  CHEN Hong-liang
Affiliation:WANG Tao,LI Jie,CHEN Hong-liang(Information Science , Engineering Institute,Central South University,Changsha 410075,China)
Abstract:Analyzed the main algorithms and existing problems of physical topology discovery,proposed a new algorithm based on the critical region theory,which successfully solves the problem of topology discovery in multi-subnet switched domain. The algorithm first establishes the connections between switchers in the critical regions by employing the insertion method,and uses the leaf node method to complete the topology later. The algorithm also overcomes the complete restriction of address forward table and solves ...
Keywords:topology discovery  network management  critical region  multi-subnet switched domain
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号