Parallel constraint based path computation using path vector
    1.
    发明授权
    Parallel constraint based path computation using path vector 失效
    使用路径向量的基于并行约束的路径计算

    公开(公告)号:US07639631B2

    公开(公告)日:2009-12-29

    申请号:US11239111

    申请日:2005-09-30

    IPC分类号: H04L12/28 G01R31/08

    摘要: Methods of computing a path through a network between a source node and a destination node. At the source node, an explore message is launched into at least one link hosted by the source node. The explore message includes a path vector containing a node identifier of the source node. At a node intermediate the source node and the destination node, the explore message is received, and each link hosted by the node that can be operably added to the path is identified. A respective node identifier of the node is added to the path vector of the explore message, which is then forwarded through each identified link. At the destination node, the respective path vector is extracted from at least one received explore message.

    摘要翻译: 计算通过源节点和目标节点之间的网络的路径的方法。 在源节点上,将至少一个由源节点托管的链接启动探索消息。 探索消息包括包含源节点的节点标识符的路径向量。 在源节点和目的地节点之间的节点处,接收到探索消息,并且识别由可被可操作地添加到路径的节点托管的每个链路。 节点的相应节点标识符被添加到探索消息的路径向量中,然后通过每个识别的链路进行转发。 在目的地节点处,从至少一个接收到的探测消息中提取相应的路径向量。

    Parallel constraint based path computation using path vector
    2.
    发明申请
    Parallel constraint based path computation using path vector 失效
    使用路径向量的基于并行约束的路径计算

    公开(公告)号:US20070076629A1

    公开(公告)日:2007-04-05

    申请号:US11239111

    申请日:2005-09-30

    IPC分类号: H04L12/28

    摘要: Methods of computing a path through a network between a source node and a destination node. At the source node, an explore message is launched into at least one link hosted by the source node. The explore message includes a path vector containing a node identifier of the source node. At a node intermediate the source node and the destination node, the explore message is received, and each link hosted by the node that can be operably added to the path is identified. A respective node identifier of the node is added to the path vector of the explore message, which is then forwarded through each identified link. At the destination node, the respective path vector is extracted from at least one received explore message.

    摘要翻译: 计算通过源节点和目标节点之间的网络的路径的方法。 在源节点上,将至少一个由源节点托管的链接启动探索消息。 探索消息包括包含源节点的节点标识符的路径向量。 在源节点和目的地节点之间的节点处,接收到探索消息,并且识别由可被可操作地添加到路径的节点托管的每个链路。 节点的相应节点标识符被添加到探索消息的路径向量中,然后通过每个识别的链路进行转发。 在目的地节点处,从至少一个接收到的探测消息中提取相应的路径向量。

    Method and apparatus for protection switch messaging on a shared mesh network
    3.
    发明申请
    Method and apparatus for protection switch messaging on a shared mesh network 审中-公开
    用于共享网状网络上的保护交换机消息传递的方法和装置

    公开(公告)号:US20050088963A1

    公开(公告)日:2005-04-28

    申请号:US10691522

    申请日:2003-10-24

    摘要: A method for processing automatic protection switch (APS) messages at a network element in a tunnel provisioned across a data transport network in order to provide for distributed processing of protection switch request messages involves receiving new APS message at the NE; determining whether the NE is an end point of the tunnel, or a tandem of the tunnel and processing the message accordingly. If the NE is a tandem, message processing involves using local information about tunnel segments of the tunnel only maintained by the NE, to update the local information, and to selectively forward the updated information to adjacent NEs of the tunnel. If the NE is an end point, it updates a status of the tunnel. In a preferred embodiment all NEs are responsible for controlling pending and preemption indicators, and for initiating tunnel condition messages, and the end point NEs are responsible for initiating all other messages.

    摘要翻译: 在通过数据传输网络提供的隧道中的网络元件处理自动保护交换机(APS)消息以提供保护交换机请求消息的分布式处理的方法涉及在NE处接收新的APS消息; 确定所述网元是所述隧道的终点还是所述隧道的串联,并相应地处理所述消息。 如果NE是串联的,则消息处理涉及使用仅由网元维护的隧道的隧道段的本地信息,更新本地信息,并选择性地将更新的信息转发到隧道的相邻NE。 如果NE是终点,则更新隧道的状态。 在优选实施例中,所有NE负责控制挂起和抢占指示符,并且用于发起隧道条件消息,并且终点NE负责发起所有其他消息。