IP Library Granted Patent US 8,000,336
Granted Patent B2
US 8,000,336 · App. 12/426,970 · Granted Aug 16, 2011

Spanning tree root selection in a hierarchical network

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 8,000,336
App. No.
12/426,970
Granted
Aug 16, 2011
Kind
B2
Abstract

Communication apparatus includes a hierarchical network of switches, which includes at least a first plurality of spine switches, interconnected by a control channel, and a second plurality of edge switches having internal ports coupled to communicate via respective links with the spine switches and external ports for connecting to client devices. The spine switches are configured to detect, via the control channel, a partitioning of the hierarchical network into first and second partitions, including respective first and second numbers of the spine switches, wherein the first number is greater than the second number, and to assign respective priorities to the spine switches responsively to the first and second numbers so as to cause the larger of the partitions to be elected as a spanning tree root.

Claims (17)

1. A communication system, comprising a hierarchical network of switches, which comprises at least:

a first plurality of spine switches, interconnected by a control channel; and

a second plurality of edge switches having internal ports coupled to communicate via respective links with the spine switches and external ports for connecting to client devices,

wherein the spine switches are configured to detect, via the control channel, a partitioning of the hierarchical network into first and second partitions, comprising respective first and second numbers of the spine switches, wherein the first number is greater than the second number, and to assign respective priorities to the spine switches responsively to the first and second numbers so as to cause one of the spine switches in the partition having the greater number of the spine switches to be elected as a spanning tree root.

2. The system according to claim 1 , wherein the hierarchical network comprises a Clos network.

3. The system according to claim 1 , wherein the switches are configured to group the respective links from a given switch in the hierarchical network to the spine switches in the first and second partitions so as to define respective first and second link aggregation groups (LAGs).

4. The system according to claim 3 , wherein running a spanning tree protocol over the hierarchical network causes the second LAG to be blocked while the hierarchical network is partitioned.

5. The system according to claim 1 , wherein the respective priorities are inversely proportional to the first and second numbers.

6. The system according to claim 1 , wherein the spine switches are configured to elect respective master spine switches in the first and second partitions, and to assign the respective priorities to the master spine switches so that one of the master spine switches is elected as the spanning tree root.

7. A method for communication, comprising:

in a hierarchical network of switches, which comprises at least a first plurality of spine switches, interconnected by a control channel, and a second plurality of edge switches having internal ports coupled to communicate via respective links with the spine switches and external ports for connecting to client devices, automatically detecting, via the control channel, a partitioning of the hierarchical network into first and second partitions, comprising respective first and second numbers of the spine switches, wherein the first number is greater than the second number; and

automatically assigning respective priorities to the spine switches responsively to the first and second numbers so as to cause one of the spine switches in the partition having the greater number of the spine switches to be elected as a spanning tree root.

8. The method according to claim 7 , wherein the hierarchical network comprises a Clos network.

9. The method according to claim 7 , and comprising grouping the respective links from a given switch in the hierarchical network to the spine switches in the first and second partitions so as to define respective first and second link aggregation groups (LAGs).

10. The method according to claim 9 , wherein running a spanning tree protocol over the hierarchical network causes the second LAG to be blocked while the hierarchical network is partitioned.

11. The method according to claim 7 , wherein the respective priorities are inversely proportional to the first and second numbers.

12. The method according to claim 7 , and comprising electing respective master spine switches in the first and second partitions, wherein automatically assigning the respective priorities comprises assigning the respective priorities to the master spine switches so that one of the master spine switches is elected as the spanning tree root.

Assignments (4)
MERGER Recorded Dec 15, 2021
From: MELLANOX TECHNOLOGIES TLV LTD.
To: MELLANOX TECHNOLOGIES, LTD.
Reel/Frame 058517/0564 →
RELEASE OF SECURITY INTEREST IN PATENT COLLATERAL AT REEL/FRAME NO. 37898/0959 Recorded Jul 13, 2018
From: JPMORGAN CHASE BANK, N.A., AS ADMINISTRATIVE AGENT
To: MELLANOX TECHNOLOGIES TLV LTD.
Reel/Frame 046542/0699 →
PATENT SECURITY AGREEMENT Recorded Feb 23, 2016
From: MELLANOX TECHNOLOGIES TLV LTD.
To: JPMORGAN CHASE BANK, N.A., AS ADMINISTRATIVE AGENT
Reel/Frame 037898/0959 →
CHANGE OF NAME Recorded Apr 3, 2013
From: VOLTAIRE LTD.
To: MELLANOX TECHNOLOGIES TLV LTD.
Reel/Frame 030138/0546 →