The problem of routing flow in a network of computers is extremely complex. This is especially formidable when routing is to be incorporated in iterative analysis and design. Among the properties of desirable flow patterns is low average delay from message inception to arrival. In this paper, we discuss procedures for minimizing average delay subject to a set of flow constraints. Heuristic routing procedures are presented and compared to optimum routing procedures. Computational experience is given.
No takes yet. Share an insight, caveat, or question.
Frank et al. (1971) studied this question.
Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context: