The application of a genetic algorithm to trunk network routing table optimisation
Mark C. Sinclair · 1993
this paper, however, we will only be considering OOC. Using Tandem Node Matrix routing (TNM) [3]. In this paper, however, we will only be considering OOC. Using this call control rule, if a call is at its originating node, a free circuit will be searched for, trying the firstthis call control rule, if a call is at its originating node, a free circuit will be searched for, trying the firstchoice, and then the other links in order. If a free circuit is found, then the call is passed to the next node choice, and then the other links in order. If a free circuit is found, then the call is passed to the next node over that link, otherwise the call is lost. At a tandem (intermediate) node, however, only the first-choice over that link, otherwise the call is lost. At a tandem (intermediate) node, however, only the first-choice link will be tried. If this link is unavailable, the call will not be lost, but will drop back to the link will be tried. If this link is unavailable, the call will not be lost, but will drop back to the originating node, where the next choice link will be tried. The call is only lost if the last choice link (and originating node, where the next choice link will be tried. The call is only lost if the last choice link (and all previous choices of course!) from the originating node is unavailable. For a more detailed discussion, all previous choices of course!) from the originating node is unavailable. For a more detailed discussion, and examples, see Lin et al. [2]. The Network Configuration Table (e.g. Table 3) is an n x n array of link numbers, with an empty forward The Network Configuration Table (e.g. Table 3) is an n x n array of link numbers, with an empty forward diagonal, the (S,T) entry being either the link number of the link connecting these two...