MODELLING OF COMPUTER COMMUNICATION NETWORKS VIA PROBABILISTIC AUTOMATA

An interdisciplinary approach for computing the point‐to‐point message delay, a measure of congestion in a computer communication network, is derived by the inclusion of a queueing theory result in a probabilistic automaton model. This network model is structurally composed of the interconnection of two distinct repetitive probabilistic automatons. The formulation of the solution is based on the network probability transition matrix which represents the state transitions for the number of customers in the GI/G/1 queue at each computer node and the intranode and internode port routing.