Low-loss, fair bandwidth allocation flow control in a packet switch

Abstract

In a switch fabric environment, which includes a buffer, packet data of different class-types from different sources is received, stored in the buffer, processed and outputted to its intended destination. As the buffer fills up, transmission from some of the data sources is stopped to avoid dropping of packets. To avoid packet loss, when the occupancy of the buffer reaches a first threshold value, further transmission of a first-class type of data is precluded from the particular source of that data then being received, while transmission from other sources of that same first-class type of data is not precluded from these other data sources until first-class type of data from such other sources is also received. Further, data of a second-class type is not precluded from being transmitted as long as the amount of data stored in the buffer remains below a second threshold, which is greater than the first threshold. When the occupancy of the buffer reaches that second threshold, further transmissions from the particular source of that second-class type of data then being received is also precluded. As data from other sources of that second-class type of data is received, further transmissions from those other sources are also precluded. A third-class type of data, however, is not precluded from transmission as long as the amount of data remains below a third threshold value, which is greater than the second threshold value. In order to avoid packet loss, when a packet from any source is received, it is stored regardless of whether transmission from the source of that packet has been precluded. Advantageously, a MAX/MIN distribution of the available bandwidth can be probabilistically achieved without packet loss.

Dependencies are inferred from the claim text.