# US 2008/0303628 A1 · Scalable two-stage clos-networking switch and module-first matching

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2008/0303628 A1
- Document ID: US20080303628A1
- Status: Published application
- Kind: A1
- Application number: 12/134,824
- Filed: 2008-06-06
- Published: 2008-12-11
- Earliest claimed: 2007-06-08
- Inventors: Roberto Rojas-Cessa; Chuan-Bi Lin
- Web page: https://patentgrep.com/patent/US20080303628A1

## CPC

- H04L 49/101: using crossbar or matrix
- H04L 47/6255: {queue load conditions, e.g. longest queue first}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A configuration scheme for IQC switches that hierarchizes the matching process reduces configuration complexity by performing routing first and port matching afterwards in a three-stage Clos-network switch. This scheme applies the reduction concept of Clos networks to the matching process. This, in turn, results in a feasible size of schedulers for up to Exabit-capacity switches, an independent configuration of the middle stage modules from port matches, a reduction of the matching communication overhead between different stages, and a release of the switching function to the last-stage modules in a three-stage switch. The switching performance of the proposed approach using weight-based and weightless selection schemes is high under uniform and non-uniform traffic. The number of stages of a Clos-network switch can be reduced to two.

## Claims

### Claim 1

A method of module-first matching to configure Clos-Network switches, the method comprising:
matching first-stage modules and second-stage modules of a Clos-Network switch, wherein the first-stage modules include port arbiters and the second-stage modules include module arbiters; and
matching input and output ports of matched first-stage and second-stage modules of the Clos-network switch.

### Claim 2 (depends on 1)

The method of claim 1, wherein matching first-stage modules and second-stage modules comprises receiving a request at a destined output module arbiter, wherein the request includes a number of cells for an output module.

### Claim 3 (depends on 1)

The method of claim 1, further comprising selecting a relay based on longest queue-occupancy first.

### Claim 4 (depends on 1)

The method of claim 1, wherein matching first-stage modules and second-stage modules comprises storing a number of cells in the first-stage module going to the second-stage module.

### Claim 5 (depends on 4)

The method of claim 4, wherein after module matching, a virtual output queue matching is performed.

### Claim 6 (depends on 1)

The method of claim 1, further comprising communication through the switch via the matched input and output ports of the matched first-stage and second-stage modules.

### Claim 7 (depends on 1)

The method of claim 1, wherein the module matching precedes the port matching.

### Claim 8 (depends on 7)

The method of claim 7, wherein the module matching is done by module arbiters that upon matching modules send a grant to port arbiters to match ports.

### Claim 9 (depends on 8)

The method of claim 8, wherein the module arbiter performs matching over a pre-defined number of iterations.

### Claim 10

A two-stage switching system, the system comprising:
input modules having port schedulers that perform port matching operations, wherein the port schedulers send grants to input ports that match input ports after receiving grant; and
central modules having module schedulers that perform module matching operations, wherein the module schedulers receive requests and, in response to the requests, perform module matching, including sending grants to port schedulers;

### Claim 11 (depends on 10)

The system of claim 10, wherein one input module of the input modules matches with a single central module.

### Claim 12 (depends on 10)

The system of claim 10, wherein there is one port scheduler in each input module and one modular scheduler in each central module.

### Claim 13 (depends on 10)

The system of claim 10, wherein the module matching comprises weights in selecting matches.

### Claim 14 (depends on 13)

The system of claim 13, wherein the weights follow a longest queue-occupancy first policy.

### Claim 15 (depends on 10)

The system of claim 10, wherein the input ports comprise virtual output queues.

### Claim 16

A method for matching in an input-queued Clos network switch, the method comprising:
receiving a request from an input port at a module arbiter;
selecting at the module arbiter a module;
sending a module grant from the module arbiter to a port scheduler;
selecting at the port scheduler a port;
sending a port grant from the port schedule to the input port.

### Claim 17 (depends on 16)

The method of claim 16, wherein the port is selected only after receiving the module grant.

### Claim 18 (depends on 16)

The method of claim 16, wherein the module arbiter is part of a second-stage module and the port scheduler is part of a first-stage module.

### Claim 19 (depends on 18)

The method of claim 18, wherein the first-stage module and the second-stage module are the only modules in the Clos network switch.

### Claim 20 (depends on 16)

The method of claim 16, wherein selecting at the module arbiter a module comprises selecting the module based on longest queue—occupancy first.
