Invention Grant
- Patent Title: Method and system for a low-complexity spanning tree algorithm in communication networks
- Patent Title (中): 通信网络中低复杂度生成树算法的方法和系统
-
Application No.: US11675374Application Date: 2007-02-15
-
Publication No.: US08902793B2Publication Date: 2014-12-02
- Inventor: Shr-Jie Tzeng
- Applicant: Shr-Jie Tzeng
- Applicant Address: US CA Irvine
- Assignee: Broadcom Corporation
- Current Assignee: Broadcom Corporation
- Current Assignee Address: US CA Irvine
- Agency: Oblon, Spivak, McClelland, Maier & Neustadt, L.L.P.
- Main IPC: H04L12/28
- IPC: H04L12/28 ; H04L12/705 ; H04L12/701 ; H04L12/46 ; H04L12/753

Abstract:
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.
Public/Granted literature
- US20080198769A1 METHOD AND SYSTEM FOR A LOW-COMPLEXITY SPANNING TREE ALGORITHM IN COMMUNICATION NETWORKS Public/Granted day:2008-08-21
Information query