A study of bifurcated routing in a data network and the effect of isarithmic flow control in this context
Abstract
A routing doctrine is defined as that algorithm by which a node in a data communication network holding a packet for onward transmission selects the output link along which the packet is next to proceed and, therefore, also chooses the next node to be visited. It is shown that application of isarithmic flow control, with five permits provided per node and five allowed to wait for incoming traffic at each node (5/5), to a simple network causes hardly any reduction in the maximum carrying capacity of the network, however, the more restrictive isarithmic parameters (3/3 and 2/2) produce an unacceptable throttling effect. If bifuraction is applied, it should be applied only to through traffic, and it must be accompanied by an enhanced flow control such as is offered by the isarithmic system.
- Publication:
-
NASA STI/Recon Technical Report N
- Pub Date:
- March 1974
- Bibcode:
- 1974STIN...7529305P
- Keywords:
-
- Data Transmission;
- Network Analysis;
- Traffic Control;
- Adaptive Control;
- Algorithms;
- Data Links;
- Communications and Radar