Analysis and simulation of message-switched loop data networks

The loop or ring-type data networks using full duplex-communication links between the nodes have been investigated. The results presented in the paper concern two specific modes for handling the messages. These are termed `store and forward¿ and `check and forward¿. Both modes have been analysed using extensions of the single-server queueing theory and also simulated extensively using GPSS software. The message traffic is Poisson distributed and can arise from any node with equal probability. The destination is selected to be any other node again with equal probability. The study has also considered the performance of the two modes for traffic having priorities. One conclusion arrived at in this investigation is that the traffic with priorities can be better handled by a network which handles messages in either store and forward or check and forward mode depending on the priority of the message.