System and method for automatic management of many computer data processing system pipes

Abstract

A process control method and system including partitioning transmit decisions and certain measurements into one logical entity (Data Plane) and partitioning algorithm computation to update transmit probabilities into a second logical entity (Control Plane), the two entities periodically communicating fresh measurements from Data Plane to Control Plane and adjusted transmit probabilities from Control Plane to Data Plane. The transmit probability may be used in transmit / discard decisions of packets or instructions exercised at every arrival of a packet or instruction. In an alternative embodiment, the transmit probability may be used in transmit / delay decisions of awaiting instructions or packets exercised at every service event.

Description

CROSS REFERENCE TO RELATED APPLICATIONS AND PATENTS[0001]The present invention relates to the following documents, all of which have been assigned to the assignee of the present invention and are fully incorporated by reference herein.[0002]Patent application Ser. No. 10 / 405,673 filed Apr. 1, 2003, by Ganesh Balakrishnan, et al., entitled “Method and System for Managing Traffic within a Data Communication Network”.[0003]U.S. Pat. No. 6,404,752 filed Aug. 27, 1999, issued Jun. 11, 2002, entitled “Network Switch Using Network Processor and Methods”.[0004]Patent application Ser. No. 09 / 543,531, filed Apr. 6, 2000, by Brian M. Bass, et al., entitled “Full Match (FM) Search Algorithm Implementation for a Network Processor”.BACKGROUND OF THE INVENTION[0005]1. Technical Field[0006]The present invention relates to congestion management of information in computer systems and / or communications networks.[0007]2. Prior Art[0008]The use of flow control mechanisms and techniques for managing cong...

AI Technical Summary

Benefits of technology

[0034]In one embodiment, values for pipei possibly including mini, maxi, precedence value, and previous Ti value for each pipe could be stored in the algorithm processor that runs the algorithm for adjusting Ti values. This would reduce the bandwidth required to send information from the lookup mechanism to the algorithm processor. Only congestion indication information and the identity of the pipe would be communicated to the algorithm processor.

[0035]In an alternative embodiment, the values for pipei possibly including mini, maxi, precedence value, and previous Ti value for each pipe could be stored in the lookup mechanism and sent along with congestion information for pipei to the algorithm processor that runs the algorithm for adjusting Ti values. This would reduce the information required to be stored in the algorithm processor.

Problems solved by technology

The problem is: how can many pipes, perhaps thousands of pipes, be allocated bandwidth correctly with minimal processor assets and computational complexity?

Images