Least cost route selection in distributed digital communication networks

摘要: A distributed digital communications network (10) has an originating node (12) and a multiplicity of destination nodes (18, 20, 22, 24, 26). The various are interconnected by links (28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54) at least some the accessible to other only multiple links. To save time in establishing cost path from node, attributes stored memory (14) is calculated response connection request memory. Then, when subsequent requires same link as already memory, that used if it still operational. Significant saving achieved no new calculation need be made.