Congestion and race controlled software protocol methodology: Congestion controlled sequential contention resolution

The congestion-controlled sequential contention resolution (CCSCR) algorithm is developed for use in the node computers for parallel, simultaneous, synchronous, and asynchronous input and output networks. It is shown that no livelock or deadlock will occur within the CCSCR algorithm because of the inclusion of the preventative protocol techniques of the varying sequencing of message service, buffer storage arrangement, and rearrangement. Functional objectives in developing the features of the algorithm are presented: network fragmentation for heavy load, and topological variations and combinations under real-time conditions; the software theory for linking these algorithm sections together and to the main contention resolution sequencing algorithm; the artificial intelligence theoretical characteristics of self-organization and optimal stopping; and theoretical development of the time when a message transit stops prior to its normal stopping time. The CCSCR software theory provides the mathematical circuit control concepts required at three-computer-node or gateway-computer-node hardware levels, the front-end processor level, and the operating system arithmetic level