MAP AND INTERFACE MULTIPLE ACCESS ALGORITHM FOR HIERARCHICAL COMPUTER METWORK DELAY TABLE TRANSFER

摘要

Delay tables are used in computer network computer nodes to assist in routing decisions to ensure congestion reduced,selected,or percentage-free message transit.Time domain multiaccessing for packet switching message operation is considered as the basis for the conceptual development of these algorithms.The concepts underlying the transfer of delay tables between the hierarchical levels of single or multiple computer networks are identified here as the marriage of computer networking multiple access theory and computer science closed hashing theory. It was determined that the level common HAP and INTERFACE Algorlthms must be appended to the basic congestion control policy structure,at both the computer node software,i.e.the Nodal Congestion Control Policy (NCCP),and gateway level,i.e.Gateway Congestion Control Policy (GCCP).These algorithms operate together with the NCCP and GCCP to ensure conflict resolution because they provide a sequence of actions enabling routing by nth level subnetwork computer nodes and gateways following collision detection.