# US 2008/0109544 A1 · Computer system and method using a kautz-like digraph to interconnect computer nodes and having control back channel between nodes

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

- Number: US 2008/0109544 A1
- Document ID: US20080109544A1
- Status: Published application
- Kind: A1
- Application number: 11/594,423
- Filed: 2006-11-08
- Published: 2008-05-08
- Earliest claimed: 2006-11-08
- Assignees: SiCortex, Inc.
- Inventors: Judson S. Leonard; Matthew H. Reilly; Lawrence C. Stewart; Washington Taylor
- Web page: https://patentgrep.com/patent/US20080109544A1

## CPC

- H04L 41/12: Discovery or management of network topologies
- H04L 41/145: {involving simulating, designing, planning or modelling of a network}
- H04L 41/344: Out-of-band transfers
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Computer system and method using a Kautz-like digraph to interconnect computer nodes and having control back channel between nodes. A multinode computing system includes a large plurality of computing nodes interconnected via a Kautz topology having order O, diameter n, and degree k. The order equals (k+1)kn−1; The data interconnections from a node x to a node y in the topology satisfy the relationship y=(−x*k−j) mod O, where 1≦j≦k; and each x,y pair includes a unidirectional control link from node y to node x to convey flow control and error information from a receiving node y to a transmitting node x.

## Claims

### Claim 1

A multinode computing system, comprising:
a large plurality of computing nodes interconnected via a Kautz topology having order O, diameter n, and degree k;
wherein the order=(k+1)kn−1;
wherein data interconnections from a node x to a node y in the topology satisfies the relationship y=(−x*k−j) mod O, where 1≦j≦k; and
wherein each x,y pair includes a unidirectional control link from node y to node x to convey flow control and error information from a receiving node y to a transmitting node x.

### Claim 2 (depends on 1)

The system of claim 1 wherein a receiving node y transmits control packets on a control link to transmitting node x to identify the last correctly received data packet, and to identify whether an error has been detected in transmission.

### Claim 3 (depends on 2)

The system of claim 2 wherein a transmitting node x stores transmitted packets and keeps them available for replay in response to control messages on the control link.

### Claim 4 (depends on 1)

The system of claim 1 wherein a receiving node y transmits buffer status information to a transmitting node x to identify buffer availability of downstream computing nodes.

### Claim 5 (depends on 4)

The system of claim 4 wherein a transmitting node x includes logic to transmit a packet downstream only if all necessary buffers are available.
