Steadystate performance of an adaptive sequential routing algorithm
Abstract
A brief review is given of the characteristics of the sequential routing algorithm and the rationale for its potential applicability in the environment for which it was conceived. It is pointed out that the algorithm is also applicable in other networks where routing intelligence is present in the nodes. Two categories of recent results on the steadystate performance of the sequential routing algorithm are given. The first category is an iterative closedform analytic solution for endtoend blocking probability for certain idealized symmetric tree networks. The second is a pair of extremely compact recursive programming techniques for calculating endtoend blocking probability for networks of arbitrary topology under, respectively, sequential routing and conventional spillforward routing. It is shown that these programming techniques permit convenient steadystate performance comparisons to the two routing algorithms for a range of network loadings and traffic conditions.
 Publication:

NTC '81; National Telecommunications Conference, Volume 3
 Pub Date:
 1981
 Bibcode:
 1981ntc.....3R...7H
 Keywords:

 Algorithms;
 Communication Networks;
 Defense Communications System (Dcs);
 Network Control;
 Sequential Control;
 Steady State;
 Adaptive Control;
 EndToEnd Data Systems;
 Iterative Solution;
 Onboard Data Processing;
 Trees (Mathematics);
 Communications and Radar