A random network model of message transmission
Karen W. Pullen · Networks · 1986
Abstract A model for message transmission through a network with unreliable nodes and links is presented; the assumptions are that nodes and links operate independently with probabilities α and β respectively. The following performance measures are derived: the probability of reaching k nodes by transmission m, the probability an arbitrary operable node is reached on the mth transmission, and the probability that d transmissions are required to reach all operable nodes. The algorithms are illustrated with a five‐node example network; some performance measures are shown graphically for a range of parameter values. This work was sponsored by the Electronic Systems Division of the United States Air Force Systems Command.