IP Library Granted Patent US 7,403,484
Granted Patent B2
US 7,403,484 · App. 10/751,930 · Granted Jul 22, 2008

Switching fabrics and control protocols for them

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 7,403,484
App. No.
10/751,930
Granted
Jul 22, 2008
Kind
B2
Abstract

A network unit for use in a switching fabric stores for each network unit in the switching fabric a respective change identification number. In each unit this number is incremented on each change of state. The unit broadcasts protocol packets which indicates incremented change identification numbers; receives corresponding packets from the other units; and determines when the last change identification numbers in the table are the same for all the units. This allows a control based on whether all the units know that all the other units have been updated in response to all the changes of state in the fabric. The network unit can also participate in a routing algorithm, and particularly a shortest path algorithm, within a fabric that constitutes a single network entity.

Claims (18)

1. A network unit for use in a switching fabric comprising a plurality of network units each having ports for the reception and forwarding of data packets, each unit having at least one fabric port connected to a partner port on another one of the network units by at least one of a multiplicity of links which interconnect the network units; wherein said network unit is organized:

(a) to store a table which for each network unit in the switching fabric indicates a respective change identification number;

(b) on the detection of a change in operational status relating to the unit to increment the unit's change identification number;

(c) to broadcast protocol packets which indicate the incremented change identification number;

(d) to receive corresponding packets from the other units;

(e) to updates said table in accordance with incremented values;

(f) to determine when the last change identification numbers in said are the same for all the units; and

wherein said network unit maintains an indication of a fabric state for all the units, the fabric states including a first ‘stable’ state denoting normal operation and a second ‘unstable’ state indicating lack of match of change identification numbers.

2. A network unit as in claim 1 Wherein each of the protocol packets broadcast by the network unit contains the last change identification numbers notified to said unit for all the units in the fabric.

3. A network unit as in claim 1 wherein on detection of a change in the table the network unit blocks the ports to the passage of said data packets.

4. A network unit as in claim 1 wherein the fabric states include a third state indicating a match of the change identification numbers and a fourth state when all the units exhibit a ready state.

5. A network unit as in claim 4 wherein the network unit performs a routing computation within the switching fabric when the network unit is in the said third state and on completion of said computation enters said first, stable state.

6. A network unit as in claim 5 wherein the network unit unblocks said ports for the passage of said data packets.

7. A network unit as in claim 1 wherein the network unit is operable to perform, employing path cost data in said table, a routing algorithm within said switching fabric.

8. A work unit as in claim 7 wherein said switching fabric has a predetermined structure specified as one of a list of finite structures and said unit selects a structure from data in said table.

9. A network unit as in claim 7 wherein said network unit selects routes on the basis of known path costs between the network unit and other units to which it is directly connected and progressively on the basis of path costs between those other units and further units to which they are directly connected and so on.

10. A network unit as in claim 9 wherein the network unit computes for each other unit a cumulative path cost of a provisionally selected route and changes said route on determination of a different route of lower cost.

11. A network unit as in claim 9 wherein said network unit applies a load balancing algorithm to select between a plurality of routes of the same path cost.

Assignments (7)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 22, 2021
From: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP; HEWLETT PACKARD ENTERPRISE COMPANY
To: VALTRUS INNOVATIONS LIMITED
Reel/Frame 055360/0424 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 9, 2015
From: HEWLETT-PACKARD DEVELOPMENT COMPANY, L.P.
To: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP
Reel/Frame 037079/0001 →
CORRECTIVE ASSIGNMENT PREVIUOSLY RECORDED ON REEL 027329 FRAME 0001 AND 0044. Recorded May 1, 2012
From: HEWLETT-PACKARD COMPANY
To: HEWLETT-PACKARD DEVELOPMENT COMPANY, L.P.
Reel/Frame 028911/0846 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 6, 2011
From: HEWLETT-PACKARD COMPANY
To: HEWLETT-PACKARD DEVELOPMENT COMPANY, L.P.
Reel/Frame 027329/0044 →
CORRECTIVE ASSIGNMENT TO CORRECT THE SEE ATTACHED Recorded Jul 15, 2010
From: 3COM CORPORATION
To: HEWLETT-PACKARD COMPANY
Reel/Frame 025039/0844 →
MERGER Recorded Jul 6, 2010
From: 3COM CORPORATION
To: HEWLETT-PACKARD COMPANY
Reel/Frame 024630/0820 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 7, 2004
From: GOODFELLOW, MAURICE A.; MORAN, PAUL J.; STUBLEY, JOHN P.; AINSWORTH, ALAN E.
To: 3COM CORPORATION
Reel/Frame 014868/0091 →