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