| 摘要 |
In a path based distributed restoration algorithm provisioned telecommunications network, the origin (O) and destination (D) nodes of a failed path (314) are appraised of the portions of the path that remain intact by "reuse" messages (316 and 318) that are sent from the custodial nodes (N2, N3) that are adjacent to the failure. As each reuse message reaches an intermediate node (N1, N4), the node ID of the intermediate node is appended to a field of the message so that, as the reuse messages are propagated along the intact portions of the failed path, a cumulative list of nodes that are encountered by the messages passing from the custodial nodes to the origin and destination nodes is set forth. Thus, the origin/destination node when in receipt of a reuse message, can read from the field that has the cumulative list of the nodes a description of the intact portions remaining from the original path. These intact portions could be reserved to be used for restoring the failed path to its original non-failed state so that less resource is utilized in the restoration of the failed path. |
