On Distributed Communications Series

III. Determination of Path-Lengths in a Distributed Network

VII. The Best-Path Algorithm

Although the algorithm used to set the hand-over number tables, Hi, to their best values was designed solely to minimize computer running time, it might also conceivably find use other than in the Distributed Adaptive Message Block Network in allowing broadcast of best-path information through a network. The algorithm requires a specific, recognizable message-type, an info-message, and a variation of the standard routine doctrine to process such messages. The algorithm is as follows:

The best-path algorithm used is a parallel application of 1) and 2) above, with all stations acting as originators once and only once. In practice, info-messages may be characterized either by the absence of an addressee or by a "universal" addressee.


Contents
Previous chapter
Appendix A