simulation of packet-switching networks controlled on isarithmic principles
An account is given of simulation experiments on an isarithmically controlled packet-switching network. The isarithmic principle (a method of congestion control by placing an upper limit on the number of data packets in transit at one time) has been developed in such a way as to minimise the amount of empty packet traffic, whilst retaining much of the flexibility of the original concept. It is suggested that one of the important performance measuring criteria is the average time spent by traffic in awaiting admission to the network; it will be shown how this time can be minimized by best choice of the number of packets permitted to be in transit at one time and of the length of queues of empties awaiting traffic. It is further suggested that the performance (measured in terms of throughput rate and end-to-end delay) of the network being studied (a ladder-shaped network of 18 nodes and 31 links) is not improved by applying adaptive routing, though some form of this must be provided to cope with fault conditions.
simulation network account experience method congestion control place data transit timing traffic flexibility concept performance measurement queue throughput delay links adaptive routing fault packet switching