# US 2001/0043564 A1 · Packet communication buffering with dynamic flow control

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

- Number: US 2001/0043564 A1
- Document ID: US20010043564A1
- Status: Published application
- Kind: A1
- Application number: 09/758,029
- Filed: 2001-01-10
- Published: 2001-11-22
- Earliest claimed: 2000-01-10
- Assignees: Mellanox Technologies, Ltd.
- Inventors: Noam Bloch; Freddy Gabbay; Michael Kagan; Alon Webman; Diego Crupnicoff
- Web page: https://patentgrep.com/patent/US20010043564A1

## CPC

- H04L 12/66: Arrangements for connecting between networks having differing types of switching systems, e.g. gateways
- H04L 12/4604: {LAN interconnection over a backbone network, e.g. Internet, Frame Relay}
- H04L 41/0213: Standardised network management protocols, e.g. simple network management protocol [SNMP]
- H04L 47/10: Flow control; Congestion control
- H04L 47/30: in combination with information about buffer occupancy at either end or at transit nodes
- H04L 47/39: {Credit based}
- H04L 41/06: Management of faults, events, alarms or notifications
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A method for link-level flow control includes establishing a plurality of logical links over a physical link between a transmitting entity and a receiving entity in a network. Respective maximum limits of transmission credits are assigned to the logical links, the credits corresponding to space available to the links in a dynamically allocable portion of a receive buffer at the receiving entity, such that a sum of the maximum limits for all of the logical links corresponds to an amount of space substantially larger than a total volume of the space in the dynamically allocable portion of the receive buffer. Responsive to traffic from the transmitting entity to the receiving entity on a given one of the logical links, one or more of the credits are allocated to the given logical link when it is determined that a total of the credits allocated to the given logical link is no greater than the respective maximum limit, and that a total of the credits allocated to all of the logical links together corresponds to an allocated volume that is no greater than the total volume of the space in the dynamically allocable portion of the receive buffer. Transmission of data over the given logical link is controlled responsive to the allocated credits.

## Claims

### Claim 1

A method for link-level flow control, comprising:
establishing a plurality of logical links over a physical link between a transmitting entity and a receiving entity in a network;
assigning to the logical links respective maximum limits of transmission credits, the credits corresponding to space available to the links in a dynamically allocable portion of a receive buffer at the receiving entity, such that a sum of the maximum limits for all of the logical links corresponds to an amount of space substantially larger than a total volume of the space in the dynamically allocable portion of the receive buffer;
responsive to traffic from the transmitting entity to the receiving entity on a given one of the logical links, allocating one or more of the credits to the given logical link when it is determined that a total of the credits allocated to the given logical link is no greater than the respective maximum limit, and that a total of the credits allocated to all of the logical links together corresponds to an allocated volume that is no greater than the total volume of the space in the dynamically allocable portion of the receive buffer; and
controlling transmission of data over the given logical link responsive to the allocated credits.

### Claim 2 (depends on 1)

A method according to claim 1, and comprising allocating to the logical links respective static portions of the receive buffer so as to hold, in each of the static portions, only the data received over the respective link, wherein the dynamically allocable portion of the receive buffer comprises the portion of the buffer remaining after allocation of the static portions.

### Claim 3 (depends on 2)

A method according to claim 2, wherein allocating the static portions comprises, when it is determined that a total of the credits allocated to the given logical link is greater than the respective maximum limit, or that a total of the credits allocated to all of the logical links together corresponds to an allocated volume that is greater than the total volume of the space in the dynamically allocable portion of the receive buffer, allocating the credits to the given logical link corresponding to the space available in the respective static portion of the receive buffer.

### Claim 4 (depends on 3)

A method according to claim 3, wherein controlling the transmission of data comprises withholding transmission if the credits allocated are not sufficient to cover an amount of the data that is to be transmitted.

### Claim 5 (depends on 3)

A method according to claim 3, and comprising:
receiving the data in the receive buffer responsive to the allocated credits;
passing the data from the receive buffer for onward transmission through the network; and
redistributing the allocated credits, after releasing the data, among the logical links having receive queues in the receive buffer that use both the static and dynamically allocable portions of the buffer.

### Claim 6 (depends on 1)

A method according to claim 1, wherein controlling the transmission of data comprises withholding transmission if the credits allocated are not sufficient to cover an amount of the data that is to be transmitted.

### Claim 7 (depends on 1)

A method according to claim 1, and comprising:
receiving the data in the receive buffer responsive to the allocated credits;
passing the data from the receive buffer for onward transmission through the network; and
releasing the allocated credits for use in subsequent transmission of data.

### Claim 8 (depends on 7)

A method according to claim 7, wherein releasing the allocated credits comprises redistributing the released credits among the plurality of logical links.

### Claim 9 (depends on 8)

A method according to claim 8, wherein redistributing the released credits comprises distributing the released credits in a round robin among at least some of the logical links.

### Claim 10 (depends on 7)

A method according to claim 7, wherein allocating the one or more of the credits comprises allocating the credits from a pool of credits available to the logical links, and wherein releasing the allocated credits comprises returning the credits to the pool.

### Claim 11 (depends on 1)

A method according to claim 1, wherein the network comprises a switching fabric, and wherein establishing the plurality of logical links comprises establishing virtual lanes in the switching fabric.

### Claim 12 (depends on 11)

A method according to claim 11, wherein the switching fabric operates in accordance with an InfiniBand specification.

### Claim 13 (depends on 1)

A method according to claim 1, wherein controlling the transmission of data comprises controlling the transmission of data packets by the transmitting entity.

### Claim 14 (depends on 13)

A method according to claim 13, wherein controlling the transmission of the data packets comprises sending a flow control packet from the receiving entity to the transmitting entity, informing the transmitting entity of the allocated credits.

### Claim 15

Network communication apparatus, comprising:
a transmitter, adapted to transmit data; and
a receiver, coupled to the transmitter by a physical link in the network and adapted to receive the data from the transmitter over a plurality of logical links established by the transmitter and the receiver over the physical link therebetween,
the receiver comprising a receive buffer with respect to which respective maximum limits of transmission credits are assigned to the logical links, the credits corresponding to space available to the links in a dynamically allocable portion of the receive buffer, such that a sum of the maximum limits for all of the logical links corresponds to an amount of space substantially larger than a total volume of the space in the dynamically allocable portion of the receive buffer,
the receiver being adapted, responsive to traffic from the transmitting entity to the receiving entity on a given one of the logical links, to allocate one or more of the credits to the given logical link when the receiver determines that a total of the credits allocated to the given logical link is no greater than the respective maximum limit, and that a total of the credits allocated to all of the logical links together corresponds to an allocated volume that is no greater than the total volume of the space in the dynamically allocable portion of the receive buffer, and
the transmitter being adapted to control transmission of the data over the given logical link responsive to the allocated credits.

### Claim 16 (depends on 15)

Apparatus according to claim 15, wherein respective static portions of the receive buffer are allocated to the logical links so as to hold, in each of the static portions, only the data received over the respective link, wherein the dynamically allocable portion of the receive buffer comprises the portion of the buffer remaining after allocation of the static portions.

### Claim 17 (depends on 16)

Apparatus according to claim 16, wherein the receiver is adapted to allocate the credits to the given logical link corresponding to the space available in the respective static portion of the receive buffer when the receiver determines that a total of the credits allocated to the given logical link is greater than the respective maximum limit, or that a total of the credits allocated to all of the logical links together corresponds to an allocated volume that is greater than the total volume of the space in the dynamically allocable portion of the receive buffer.

### Claim 18 (depends on 15)

Apparatus according to claim 15, wherein the transmitter is adapted to withhold transmission of the data if the credits allocated are not sufficient to cover an amount of the data that is to be transmitted.

### Claim 19 (depends on 15)

Apparatus according to claim 15, wherein the receiver is adapted to receive the data in the receive buffer responsive to the allocated credits, to pass the data from the receive buffer for onward transmission through the network, and to release the allocated credits after passing the data, for use in subsequent transmission of data.

### Claim 20 (depends on 19)

Apparatus according to claim 19, wherein the receiver is adapted to redistribute the released credits among the plurality of logical links.

### Claim 21 (depends on 19)

Apparatus according to claim 19, wherein the receiver is adapted to maintain a pool of credits available to the links, from which it allocates the credits to the logical links, and to return the released credits to the pool.

### Claim 22 (depends on 15)

Apparatus according to claim 15, wherein the network comprises a switching fabric, and wherein the logical links comprise virtual lanes in the switching fabric.

### Claim 23 (depends on 22)

Apparatus according to claim 22, wherein the switching fabric operates in accordance with an InfiniBand specification.

### Claim 24 (depends on 15)

Apparatus according to claim 15, wherein the data comprise data packets.

### Claim 25 (depends on 24)

Apparatus according to claim 24, wherein the receiver is adapted to send flow control packets to the transmitter, informing the transmitter of the allocated credits.
