-
1.发明授权Extensions to the path verification protocol to support link bundling constructs 有权扩展到路径验证协议，以支持链路捆绑结构公开(公告)号：US07782790B1
公开(公告)日：2010-08-24
申请号：US11638063
申请日：2006-12-12
摘要： To reveal link bundles' component links in an MPLS network, transmit a sequence of request and reply packets. For a router receiving a request packet, the packet identifies that link bundles should be revealed, detect the link bundle links connected to the router, and for each, its component links are added to a downstream mapping field (DMF). A link bundle mapping field (LBMF) is also added to the request packet. Each LBMF specifies the component links of that link bundle by pointing to the component links added to the DMF. For a router responding to a request packet with a reply packet, determine if any links in the DMF are component links, and for each, identify a LBMF containing information regarding that link. Each component link in the DMF is processed. The component links in each LBMF are iterated through to ensure each matches the determined links in the DMF.
摘要翻译： 为了在MPLS网络中显示链路束的组件链路，发送请求和应答数据包的顺序。 对于接收到请求报文的路由器，报文会识别链路捆绑应该被显示出来，检测连接到路由器的链路捆绑链路，并且每个链路捆绑链路都被添加到下游映射域（DMF）。 链路捆绑映射字段（LBMF）也被添加到请求包中。 每个LBMF通过指向添加到DMF的组件链接来指定该链接束的组件链接。 对于响应具有应答分组的请求分组的路由器，确定DMF中的任何链路是否是组件链路，并且对于每个链路，标识包含关于该链路的信息的LBMF。 处理DMF中的每个组件链接。 迭代每个LBMF中的组件链接，以确保每个LBMF与DMF中确定的链接匹配。
-
2.发明授权Optimal automated exploration of hierarchical multiprotocol label switching label switch paths 有权分层多协议标签交换标签交换路径的最佳自动化探索公开(公告)号：US08717936B1
公开(公告)日：2014-05-06
申请号：US13358290
申请日：2012-01-25
申请人： Danny Prairie , Yufei Shi , George Swallow , Thomas D. Nadeau , Vanson Lim , Jean-Philippe Vasseur
发明人： Danny Prairie , Yufei Shi , George Swallow , Thomas D. Nadeau , Vanson Lim , Jean-Philippe Vasseur
IPC分类号： H04L12/28
摘要： Optimal automated exploration of hierarchical Multiprotocol Label Switching Label Switch Paths (MPLS LSPs) is disclosed. A path verification message (PVM) is transmitted from an initial router. Each label in the PVM's label stack corresponds to a hierarchy layer and is associated with a time-to-live (TTL) field. The TTL field for the label of a current layer is set so the PVM travels one hop from the initial router. In response, a reply message indicating that the PVM reached its destination is received.
摘要翻译： 披露了分层多协议标签交换标签交换路径（MPLS LSP）的最佳自动化探索。 从初始路由器发送路径验证消息（PVM）。 PVM标签堆栈中的每个标签对应于层次结构层，并与生存时间（TTL）字段相关联。 当前层的标签的TTL字段设置为使PVM从初始路由器传播一跳。 作为响应，接收到指示PVM到达其目的地的应答消息。
-
公开(公告)号：US08374164B2
公开(公告)日：2013-02-12
申请号：US11697571
申请日：2007-04-06
申请人： Thomas D. Nadeau , Danny Prairie , George Swallow , Reshad Rahman
发明人： Thomas D. Nadeau , Danny Prairie , George Swallow , Reshad Rahman
摘要： Improved detection of specific BFD LSP path failures is herein disclosed. The improved detection described herein allow for faster fault isolation of a failure along a LSP path, which in turn may allow for faster repair of the failure. When opening a BFD session with a LSP egress node, the LSP ingress node provides the LSP egress node a path descriptor along with the BFD Discriminator. If a BFD failure is detected at the LSP egress node, the LSP egress node can signal an alarm that includes a full description of the path.
摘要翻译： 本文公开了对特定BFD LSP路径故障的改进的检测。 这里描述的改进的检测允许沿着LSP路径的故障的更快的故障隔离，这进而可以允许更快地修复故障。 当与LSP出口节点打开BFD会话时，LSP入口节点向LSP出口节点提供与BFD鉴别器一起的路径描述符。 如果在LSP出口节点检测到BFD故障，则LSP出口节点可以发出包含路径完整描述的告警信号。
-
4.发明授权Optimal automated exploration of hierarchical multiprotocol label switching label switch paths 有权分层多协议标签交换标签交换路径的最佳自动化探索公开(公告)号：US08116227B1
公开(公告)日：2012-02-14
申请号：US11642473
申请日：2006-12-20
申请人： Danny Prairie , Yufei Shi , George Swallow , Thomas D. Nadeau , Vanson Lim , Jean-Philippe Vasseur
发明人： Danny Prairie , Yufei Shi , George Swallow , Thomas D. Nadeau , Vanson Lim , Jean-Philippe Vasseur
摘要： Optimal automated exploration of hierarchical MPLS LSPs is disclosed. A path verification message (PVM) is transmitted from an initial router. Each label in the PVM's label stack corresponds to a hierarchy layer and is associated with a time-to-live (TTL) field. The TTL field for the label of a current layer is set so the PVM travels one hop from the initial router. In response, a reply message indicating that the PVM reached its destination is received. These steps are then repeated. For each successive PVM transmitted, the TTL field associated with a label corresponding to the current hierarchy layer is incremented. For any reply message including information describing a non-current layer, modify the next PVM's label stack and increment the TTL field of the label for the described different layer; any other TTL fields are unchanged. If any received reply message indicates a destination router was reached, the process terminates.
摘要翻译： 公开了分层MPLS LSP的最佳自动化探索。 从初始路由器发送路径验证消息（PVM）。 PVM标签堆栈中的每个标签对应于层次结构层，并与生存时间（TTL）字段相关联。 当前层的标签的TTL字段设置为使PVM从初始路由器传播一跳。 作为响应，接收到指示PVM到达其目的地的应答消息。 然后重复这些步骤。 对于发送的每个连续的PVM，与当前层级层相对应的标签相关联的TTL字段递增。 对于包含描述非当前层的信息的任何回复消息，修改下一个PVM的标签栈，并增加描述的不同层的标签的TTL字段; 任何其他TTL字段都不变。 如果任何接收到的回复消息指示到达目的地路由器，则该过程终止。
-
公开(公告)号：US20080247324A1
公开(公告)日：2008-10-09
申请号：US11697571
申请日：2007-04-06
申请人： Thomas D. Nadeau , Danny Prairie , George Swallow , Reshad Rahman
发明人： Thomas D. Nadeau , Danny Prairie , George Swallow , Reshad Rahman
IPC分类号： H04L12/26
摘要： Improved detection of specific BFD LSP path failures is herein disclosed. The improved detection described herein allow for faster fault isolation of a failure along a LSP path, which in turn may allow for faster repair of the failure. When opening a BFD session with a LSP egress node, the LSP ingress node provides the LSP egress node a path descriptor along with the BFD Discriminator. If a BFD failure is detected at the LSP egress node, the LSP egress node can signal an alarm that includes a full description of the path.
摘要翻译： 本文公开了对特定BFD LSP路径故障的改进的检测。 这里描述的改进的检测允许沿着LSP路径的故障的更快的故障隔离，这进而可以允许更快地修复故障。 当与LSP出口节点打开BFD会话时，LSP入口节点向LSP出口节点提供与BFD鉴别器一起的路径描述符。 如果在LSP出口节点检测到BFD故障，则LSP出口节点可以发出包含路径完整描述的告警信号。
-
6.发明申请LOCATING TUNNEL FAILURE BASED ON NEXT-NEXT HOP CONNECTIVITY IN A COMPUTER NETWORK 有权基于计算机网络中下一个下一个HOP连接的定位隧道故障公开(公告)号：US20090225652A1
公开(公告)日：2009-09-10
申请号：US12044620
申请日：2008-03-07
IPC分类号： G01R31/08
CPC分类号： H04L41/0677 , H04L43/0811
摘要： In one embodiment, a trigger is signaled to protect a tunnel from a head-end node to one or more tail-end nodes in a computer network via one or more intermediate nodes along the tunnel. One or more receiving nodes along the tunnel receive the trigger, and in response, establish a tunnel connectivity verification session from the receiving node to a corresponding downstream next-next-hop (NNHOP) node along the tunnel. Illustratively, the head-end node may thus recompute a new tunnel path excluding a path segment corresponding to a particular failed tunnel connectivity verification session.
摘要翻译： 在一个实施例中，通过沿着隧道的一个或多个中间节点，用信号通知触发器以保护隧道从计算机网络中的头端节点到一个或多个尾端节点。 沿着隧道的一个或多个接收节点接收触发，并且作为响应，建立从接收节点到沿着隧道的对应的下游下一跳（NNHOP）节点的隧道连接性验证会话。 说明性地，头端节点因此可以重新计算除了对应于特定故障隧道连通性验证会话的路径段的新隧道路径。
-
公开(公告)号：US06834139B1
公开(公告)日：2004-12-21
申请号：US09969937
申请日：2001-10-02
IPC分类号： G02B628
CPC分类号： H04L43/0811 , G02B6/3546 , G02B6/356 , G02B6/3564 , H04Q2011/0039
摘要： Systems and methods for link discovery and verification technique that minimize the need for line termination resources that generate and interpret packets. Of two nodes verifying a link to one another, only one node need have any line termination capability. The node lacking line termination capability simply loops back packets generated by the other node thus verifying the link. Thus, an optical cross-connect can verify links to a wide variety of node types by employing a single line termination unit capable of terminating any suitable packet type. Alternatively, a router can verify connectivity to an optical cross-connect even when the optical cross-connect lacks any line termination capability at all. This saves greatly on implementation costs for optical networks.
摘要翻译： 用于链接发现和验证技术的系统和方法，其最小化对生成和解释分组的线路终端资源的需求。 在验证彼此链接的两个节点中，只有一个节点需要具有任何线路终止能力。 缺少线路终端能力的节点简单地循环由另一个节点生成的分组，从而验证链路。 因此，光交叉连接可以通过采用能够终止任何合适的分组类型的单个线路终端单元来验证到各种节点类型的链路。 或者，即使光交叉连接缺少任何线路终端功能，路由器也可以验证与光交叉连接的连接。 这大大节省了光网络的实施成本。
-
8.发明授权Locating tunnel failure based on next-next hop connectivity in a computer network 有权基于计算机网络中的下一跳连接定位隧道故障公开(公告)号：US08531976B2
公开(公告)日：2013-09-10
申请号：US12044620
申请日：2008-03-07
IPC分类号： H04J1/16
CPC分类号： H04L41/0677 , H04L43/0811
摘要： In one embodiment, a trigger is signaled to protect a tunnel from a head-end node to one or more tail-end nodes in a computer network via one or more intermediate nodes along the tunnel. One or more receiving nodes along the tunnel receive the trigger, and in response, establish a tunnel connectivity verification session from the receiving node to a corresponding downstream next-next-hop (NNHOP) node along the tunnel. Illustratively, the head-end node may thus recompute a new tunnel path excluding a path segment corresponding to a particular failed tunnel connectivity verification session.
摘要翻译： 在一个实施例中，通过沿着隧道的一个或多个中间节点，用信号通知触发器以保护隧道从计算机网络中的头端节点到一个或多个尾端节点。 沿着隧道的一个或多个接收节点接收触发，并且作为响应，建立从接收节点到沿着隧道的对应的下游下一跳（NNHOP）节点的隧道连接性验证会话。 说明性地，头端节点因此可以重新计算除了对应于特定故障隧道连通性验证会话的路径段的新隧道路径。
-
公开(公告)号：US07065268B2
公开(公告)日：2006-06-20
申请号：US10975279
申请日：2004-10-27
CPC分类号： H04L43/0811 , G02B6/3546 , G02B6/356 , G02B6/3564 , H04Q2011/0039
摘要： Systems and methods for link discovery and verification technique that minimize the need for line termination resources that generate and interpret packets. Of two nodes verifying a link to one another, only one node need have any line termination capability. The node lacking line termination capability simply loops back packets generated by the other node thus verifying the link. Thus, an optical cross-connect can verify links to a wide variety of node types by employing a single line termination unit capable of terminating any suitable packet type. Alternatively, a router can verify connectivity to an optical cross-connect even when the optical cross-connect lacks any line termination capability at all. This saves greatly on implementation costs for optical networks.
摘要翻译： 用于链接发现和验证技术的系统和方法，其最小化生成和解释分组的线路终端资源的需要。 在验证彼此链接的两个节点中，只有一个节点需要具有任何线路终止能力。 缺少线路终端能力的节点简单地循环由另一个节点生成的分组，从而验证链路。 因此，光交叉连接可以通过采用能够终止任何合适的分组类型的单个线路终端单元来验证到各种节点类型的链路。 或者，即使光交叉连接缺少任何线路终端功能，路由器也可以验证与光交叉连接的连接。 这大大节省了光网络的实施成本。
-
公开(公告)号：US20050083835A1
公开(公告)日：2005-04-21
申请号：US10975279
申请日：2004-10-27
申请人： Danny Prairie , Daniel Tappan , Richard Bradford
发明人： Danny Prairie , Daniel Tappan , Richard Bradford
CPC分类号： H04L43/0811 , G02B6/3546 , G02B6/356 , G02B6/3564 , H04Q2011/0039
摘要： Systems and methods for link discovery and verification technique that minimize the need for line termination resources that generate and interpret packets. Of two nodes verifying a link to one another, only one node need have any line termination capability. The node lacking line termination capability simply loops back packets generated by the other node thus verifying the link. Thus, an optical cross-connect can verify links to a wide variety of node types by employing a single line termination unit capable of terminating any suitable packet type. Alternatively, a router can verify connectivity to an optical cross-connect even when the optical cross-connect lacks any line termination capability at all. This saves greatly on implementation costs for optical networks.
摘要翻译： 用于链接发现和验证技术的系统和方法，其最小化生成和解释分组的线路终端资源的需要。 在验证彼此链接的两个节点中，只有一个节点需要具有任何线路终止能力。 缺少线路终端能力的节点简单地循环由另一个节点生成的分组，从而验证链路。 因此，光交叉连接可以通过采用能够终止任何合适的分组类型的单个线路终端单元来验证到各种节点类型的链路。 或者，即使光交叉连接缺少任何线路终端功能，路由器也可以验证与光交叉连接的连接。 这大大节省了光网络的实施成本。
-
-
-
-
-
-
-
-
-
搜索结果
10 条记录 (耗时 0.026 秒)
