首页> 外国专利> Method and system for a low-complexity spanning tree algorithm in communication networks

Method and system for a low-complexity spanning tree algorithm in communication networks

机译:通信网络中低复杂度生成树算法的方法和系统

摘要

Aspects of a method and system for a low-complexity spanning tree algorithm in communication networks may comprise preventing loops in a communications network utilizing a distributed sequential algorithm in which there is a single token. Only a network node in possession of this single token may disable a network port. A spanning tree may be generated based on loop prevention. The network ports that may be disabled may be chosen from a port map, where the port map may be obtained by combining a port map identifying ports that are connected to loops with a port map indicating network ports that are to remain enabled. The loop prevention may be initiated by a root node and a token may be generated by the root node when completing the prevention. Network nodes may reduce ingress data rate during loop prevention.
机译:用于通信网络中的低复杂度生成树算法的方法和系统的各方面可以包括:利用其中存在单个令牌的分布式顺序算法来防止通信网络中的环路。只有拥有此单个令牌的网络节点才能禁用网络端口。可以基于环路预防来生成生成树。可以从端口映射表中选择可能被禁用的网络端口,其中可以通过将标识连接到环路的端口的端口映射表与指示将要保持启用的网络端口的端口映射表相组合来获得端口映射表。当完成预防时,可以由根节点发起环路预防,并且可以由根节点生成令牌。网络节点可能会在防止环路期间降低入口数据速率。

著录项

  • 公开/公告号US8902793B2

    专利类型

  • 公开/公告日2014-12-02

    原文格式PDF

  • 申请/专利权人 SHR-JIE TZENG;

    申请/专利号US20070675374

  • 发明设计人 SHR-JIE TZENG;

    申请日2007-02-15

  • 分类号H04L12/28;H04L12/705;H04L12/701;H04L12/46;H04L12/753;

  • 国家 US

  • 入库时间 2022-08-21 15:16:55

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号