An extended least-hop distributed routing algorithm

A routing strategy called NELHNET has been developed for networks with multiprecedence traffic and operating under dynamic traffic and topological conditions. An adaptive distributed algorithm that uses least-hop and least-hop-plus-1 routes in a table of routing vectors, as opposed to the usual table of routing scalars, is described. Current delays are passed backward and forward with the packets to allow development of expected delays to each node via all acceptable routes. The route then selected is the acceptable route with the least expected delay. For speedier recovery, a node returning to service receives the current network status from an adjoining node as soon as the link connecting them is operational. The resultant algorithms show far greater than the marginal improvements originally expected over Arpanet simulations. NELHENET strategies also permit the network to function stably under more heavily loaded conditions than do the Arpanet strategies.>