The general cyclical allocation algorithm for packet-switched store-and-forward computer communication network design

Abstract

Abstract A novel algorithm for the computation of total service time in a packet-switched network is presented and analysed. Its adaptability to any network design without necessitating changes in the algorithm, in comparison to a simulation which would most likely require changes, perhaps extensive ones, in the program structure for each design, makes it a powerful tool for analysis. Further refinements in the algorithm are then discussed along with an easily constructed graphical representation that points out how they may be achieved. Results can be obtained regardless of the statistical distribution with which the message arrived at the source node. The exact service time is computed by the algorithm presented, as opposed to an approximation that characterizes the usage of the independence assumption in this class of problems. The algorithm uses a true-to-life model in deriving the results reported.