INFORMATION TRANSMISSION CHARACTERISTICS OF LADDER TYPE COMPUTER NETWORKS.

A systematic algorithm is given for determining the traffic density of the transmission path for the case of fixed path selection in a ladder type computer network. The algorithm is then used to examine the effect of inserting a bypass into a system in the case of parallel and crossing types, indicating its effectiveness. It is shown that the effect varies with the direction of transmission of the inserted bypass. It is also shown that a ladder type computer network in which the main loop employs bilateral transmission can be considered as being decomposed into ladder type computer networks with main loops employing unilateral transmission in opposite directions by controlling the packet routing.