专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

51. 发明申请

US20060117110A1 Propagation of routing information in RSVP-TE for inter-domain TE-LSPs 有权
公开(公告)号：US20060117110A1
公开(公告)日：2006-06-01
申请号：US11001349
申请日：2004-12-01
申请人： Jean-Philippe Vasseur , Stefano Previdi
发明人： Jean-Philippe Vasseur , Stefano Previdi
IPC分类号： G06F15/16
CPC分类号： H04L45/507 , H04L45/00 , H04L45/04 , H04L45/50
摘要： A technique dynamically retrieves reachability information from a target node, including a tail-end or any intermediate node, along a traffic engineering (TE) label switched path (LSP) that spans multiple domains in a computer network. The interdomain information retrieval technique is illustratively based on a request/response signaling exchange whereby at least a portion of the reachability, i.e., routing, information maintained by the target node is propagated to a head-end node of the TE-LSP. The routing information may comprise a list of address prefixes reachable by the target node, but may optionally include next-hop and metric attributes associated with those prefixes. The head-end node uses the retrieved routing information to calculate routes reachable from the target node for insertion into its routing table.

52. 发明授权

US07483387B2 Hierarchical label distribution for inter-area summarization of edge-device addresses 有权
标题翻译：边缘设备地址的区域间聚合的分层标签分发
公开(公告)号：US07483387B2
公开(公告)日：2009-01-27
申请号：US11135600
申请日：2005-05-23
申请人： James Guichard , Daniel C. Tappan , Jean-Philippe Vasseur , Simon Spraggs
发明人： James Guichard , Daniel C. Tappan , Jean-Philippe Vasseur , Simon Spraggs
IPC分类号： H04L12/26 , H04L12/28 , H04L12/56
CPC分类号： H04L45/507 , H04L12/66 , H04L45/04
摘要： A system and method are provided for separately distributing edge-device labels and routing information across routing areas of a computer network. Because the edge-device labels are distributed separately from network routing information, the process of distributing the edge-device labels does not preclude conventional edge-device address summarizations. Illustratively, a novel “label mapping” LSA is employed for distributing the edge-device labels across routing areas. The label-mapping LSA may be embodied as an area-scope OSPF opaque LSA (type 10) or an IS-IS LSP containing TLVs of area scope. Advantageously, the present invention is generally applicable whenever label values are allocated to edge devices in a multi-area computer network and data is “tunneled” through the network from one edge device to another.
摘要翻译：提供了一种用于在计算机网络的路由区域上分开分发边缘设备标签和路由信息的系统和方法。由于边缘设备标签与网络路由信息分开分配，因此分发边缘设备标签的过程并不排除传统的边缘设备地址摘要。说明性地，使用新颖的“标签映射”LSA来跨越路由区域分配边缘设备标签。标签映射LSA可以实现为区域范围的OSPF不透明LSA（类型10）或包含区域范围的TLV的IS-IS LSP。有利地，每当标签值被分配给多区域计算机网络中的边缘设备并且数据通过网络从一个边缘设备“隧道化”到另一个边缘设备时，本发明通常是适用的。

53. 发明申请

US20070121486A1 System and method for PE-node protection 有权
标题翻译： PE节点保护的系统和方法
公开(公告)号：US20070121486A1
公开(公告)日：2007-05-31
申请号：US11287801
申请日：2005-11-28
申请人： James Guichard , Jean-Philippe Vasseur , Clarence Filsfils , Peter De Vriendt
发明人： James Guichard , Jean-Philippe Vasseur , Clarence Filsfils , Peter De Vriendt
IPC分类号： H04J1/16
CPC分类号： H04L45/04 , H04L45/02 , H04L45/22 , H04L45/28 , H04L45/50 , H04L45/54
摘要： A novel fast reroute (FRR) technique is provided for quickly and efficiently rerouting selected types of network traffic in response to a node or link failure at the edge of a computer network. According to the technique, the network includes first and second edge devices that function as “FRR mates,” such that network traffic originally destined for one FRR mate may be quickly rerouted to the other without having to wait for conventional network convergence. When an edge device receives rerouted packets originally destined for its FRR mate, the device responds by forwarding only those rerouted packets matching the selected traffic types; rerouted packets that do not match the selected traffic types are dropped or otherwise discarded. The first and second edge devices may be statically configured as FRR mates, e.g., by a network administrator, or they may be configured to automatically detect their compatibility as FRR mates.
摘要翻译：提供了一种新颖的快速重路由（FRR）技术，用于响应于计算机网络边缘的节点或链路故障，快速有效地重新路由所选类型的网络流量。根据该技术，网络包括用作“FRR配对”的第一和第二边缘设备，使得最初发往一个FRR配对的网络业务可以被快速地重新路由到另一个，而不必等待传统的网络融合。当边缘设备接收到最初发往FRR配置的重新路由的报文时，设备只通过转发与所选流量类型匹配的那些重新路由的报文进行响应; 与所选流量类型不匹配的重路由数据包将被丢弃或以其他方式丢弃。第一和第二边缘设备可以被静态配置为FRR配对，例如由网络管理员，或者它们可以被配置为自动检测它们作为FRR配对的兼容性。

54. 发明申请

US20060262735A1 Hierarchical label distribution for inter-area summarization of edge-device addresses 有权
公开(公告)号：US20060262735A1
公开(公告)日：2006-11-23
申请号：US11135600
申请日：2005-05-23
申请人： James Guichard , Daniel Tappan , Jean-Philippe Vasseur , Simon Spraggs
发明人： James Guichard , Daniel Tappan , Jean-Philippe Vasseur , Simon Spraggs
IPC分类号： H04L12/28
CPC分类号： H04L45/507 , H04L12/66 , H04L45/04
摘要： A system and method are provided for separately distributing edge-device labels and routing information across routing areas of a computer network. Because the edge-device labels are distributed separately from network routing information, the process of distributing the edge-device labels does not preclude conventional edge-device address summarizations. Illustratively, a novel “label mapping” LSA is employed for distributing the edge-device labels across routing areas. The label-mapping LSA may be embodied as an area-scope OSPF opaque LSA (type 10) or an IS-IS LSP containing TLVs of area scope. Advantageously, the present invention is generally applicable whenever label values are allocated to edge devices in a multi-area computer network and data is “tunneled” through the network from one edge device to another.

55. 发明授权

US07693047B2 System and method for PE-node protection 有权
标题翻译： PE节点保护的系统和方法
公开(公告)号：US07693047B2
公开(公告)日：2010-04-06
申请号：US11287801
申请日：2005-11-28
申请人： James Guichard , Jean-Philippe Vasseur , Clarence Filsfils , Peter De Vriendt
发明人： James Guichard , Jean-Philippe Vasseur , Clarence Filsfils , Peter De Vriendt
IPC分类号： G01R31/08 , H04L12/28
CPC分类号： H04L45/04 , H04L45/02 , H04L45/22 , H04L45/28 , H04L45/50 , H04L45/54
摘要： A novel fast reroute (FRR) technique is provided for quickly and efficiently rerouting selected types of network traffic in response to a node or link failure at the edge of a computer network. According to the technique, the network includes first and second edge devices that function as “FRR mates,” such that network traffic originally destined for one FRR mate may be quickly rerouted to the other without having to wait for conventional network convergence. When an edge device receives rerouted packets originally destined for its FRR mate, the device responds by forwarding only those rerouted packets matching the selected traffic types; rerouted packets that do not match the selected traffic types are dropped or otherwise discarded. The first and second edge devices may be statically configured as FRR mates, e.g., by a network administrator, or they may be configured to automatically detect their compatibility as FRR mates.
摘要翻译：提供了一种新颖的快速重路由（FRR）技术，用于响应于计算机网络边缘的节点或链路故障，快速有效地重新路由所选类型的网络流量。根据该技术，该网络包括用作“FRR配对”的第一和第二边缘设备，使得最初发往一个FRR配对的网络业务可能被快速重新路由到另一个，而不必等待传统的网络融合。当边缘设备接收到最初发往FRR配置的重新路由的报文时，设备只通过转发与所选流量类型匹配的那些重新路由的报文进行响应; 与所选流量类型不匹配的重路由数据包将被丢弃或以其他方式丢弃。第一和第二边缘设备可以被静态配置为FRR配对，例如由网络管理员，或者它们可以被配置为自动检测它们作为FRR配对的兼容性。

56. 发明申请

US20060274645A1 Methods and apparatus for error recovery in opaque networks using encrypted error locations 审中-公开
标题翻译：使用加密错误位置的不透明网络中的错误恢复方法和装置
公开(公告)号：US20060274645A1
公开(公告)日：2006-12-07
申请号：US11146520
申请日：2005-06-07
申请人： Richard Bradford , Jean-Philippe Vasseur , James Guichard
发明人： Richard Bradford , Jean-Philippe Vasseur , James Guichard
IPC分类号： H04L12/26
CPC分类号： H04L45/28 , H04L41/0677 , H04L41/12 , H04L45/04 , H04L45/10 , H04L45/22 , H04L63/04
摘要： In response to a failure within a sub-network of a heterogeneous network, an external device is signaled that the failure has occurred by inclusion of an encoded identifier of the failure location with the signaling. The encoded identifier enables identification of the failure location within the sub-network while masking the identity of the failure location to the external device, and may be realized by using an encrypted sub-object or a token that is associated with the failure location information, which remains stored within the sub-network. The external device responds by issuing a path-establishment message indicating that a new communications path should be established and should exclude the failure location as identified by the encoded identifier, which is included in the path-establishment message. A device within the sub-network responds by determining whether a path segment for the new communications path can be provided while excluding the failure location as identified by the encoded identifier from the path-establishment message, and further path-setup functions are performed based on the determination.
摘要翻译：响应于异构网络的子网内的故障，外部设备被发信号通知包含失败位置的编码标识符与信令发生故障。编码的标识符能够识别子网内的故障位置，同时屏蔽到外部设备的故障位置的身份，并且可以通过使用加密的子对象或与故障位置信息相关联的令牌来实现，其保持在子网内。外部设备通过发出指示应该建立新的通信路径的路径建立消息来进行响应，并且应当排除由包含在路径建立消息中的编码标识符标识的故障位置。子网内的设备通过确定是否可以提供用于新通信路径的路径段，同时从路径建立消息中排除由编码标识符识别的故障位置，并且基于决心。

57. 发明申请

US20070008878A1 Method and apparatus for providing faster convergence for redundant sites 有权
标题翻译：为冗余站点提供更快收敛的方法和装置
公开(公告)号：US20070008878A1
公开(公告)日：2007-01-11
申请号：US11159719
申请日：2005-06-23
申请人： Clarence Filsfils , James Guichard , Robert Raszuk , Jean-Philippe Vasseur , Kris Michielsen , Peter De Vriendt
发明人： Clarence Filsfils , James Guichard , Robert Raszuk , Jean-Philippe Vasseur , Kris Michielsen , Peter De Vriendt
IPC分类号： G06F11/00
CPC分类号： H04L12/66 , H04L41/0668 , H04L45/02 , H04L45/023 , H04L45/04 , H04L45/22 , H04L45/24 , H04L45/28 , H04L45/36 , H04L45/58
摘要： A method, apparatus and computer program product for providing convergence for a dual-homed site in a network is presented. An occurrence of a failure between a first Provider Edge (PE) device and a first Customer Edge (CE) device in communication with a dual-homed site is detected. A determination is made whether an alternate route exists for the dual-homed site in a routing table associated with the first PE device. When an alternate route exists then a routing entry associated with the first CE device in a routing table of said first PE device is kept from being deleted for a predetermined amount of time, the routing table is modified to reference the alternate route, the routing entry is rewritten to perform a POP and lookup in a VRF table of the first PE device, and the routing entry is deleted after the predetermined amount of time has elapsed.
摘要翻译：提出了一种用于为网络中的双归位点提供融合的方法，装置和计算机程序产品。检测到与双归位置通信的第一提供商边缘（PE）设备和第一客户边缘（CE）设备之间的故障的发生。确定在与第一PE设备相关联的路由表中是否存在用于双归属站点的备用路由。当存在替代路由时，在所述第一PE设备的路由表中与第一CE设备相关联的路由条目不被删除预定的时间量，所述路由表被修改以引用所述替代路由，所述路由条目被重写以在第一PE设备的VRF表中执行POP和查找，并且在经过预定时间量之后删除路由条目。

58. 发明授权

US07974285B2 Method and apparatus for identifying an egress point to a network location 有权
标题翻译：用于识别到网络位置的出口点的方法和装置
公开(公告)号：US07974285B2
公开(公告)日：2011-07-05
申请号：US11045015
申请日：2005-01-26
申请人： Stefano Benedetto Previdi , Clarence Filsfils , Jean-Philippe Vasseur , Benoit Claise , David Ward
发明人： Stefano Benedetto Previdi , Clarence Filsfils , Jean-Philippe Vasseur , Benoit Claise , David Ward
IPC分类号： H04L12/28 , H04L12/56 , G06F15/173
CPC分类号： H04L45/02
摘要： A method of identifying an egress point to a network location in a data communications network comprising a plurality of nodes and links there between comprises the step, performed at the identifying node, of receiving a notification through the network advertising an adjacency to a network location. The method further comprises the steps, performed at the identifying node, of deriving from the notification adjacency information and identifying, from the adjacency information, the egress point.
摘要翻译：一种识别包括在其中的多个节点和链路的数据通信网络中的网络位置的出口点的方法包括：在识别节点执行的步骤，通过网络接收通知与网络位置相邻的通知。所述方法还包括在所述识别节点处执行的从所述通知邻接信息导出并从所述邻接信息识别所述出口点的步骤。

59. 发明申请

US20060171320A1 Inter-domain path computation technique 有权
标题翻译：域间路径计算技术
公开(公告)号：US20060171320A1
公开(公告)日：2006-08-03
申请号：US11049587
申请日：2005-02-02
申请人： Jean-Philippe Vasseur , Muthurajah Sivabalan , David Ward
发明人： Jean-Philippe Vasseur , Muthurajah Sivabalan , David Ward
IPC分类号： H04J3/14 , H04L12/28
CPC分类号： H04L45/04 , H04J3/14 , H04J3/16 , H04L45/02 , H04L45/42 , H04L45/44 , H04L45/50
摘要： A technique computes a traffic engineering (TE) label switched path (LSP) that spans multiple domains of a computer network from a head-end node of a local domain to a tail-end node of a remote domain. The novel inter-domain TE-LSP computation technique comprises a computation algorithm executed by the head-end node, which utilizes Path Computation Elements (PCEs) located within the remote domains (i.e., other than the local domain). Specifically, the head-end node requests path segments from a PCE in each of the remote domains, in which the path segments represent paths between all entry border routers to either all exit border routers of the particular remote domain (i.e., through the domain), or to the tail-end node. Upon receiving path segments from each remote domain, the head-end node combines the path segments with local domain information, and performs a forward path computation from the head-end node to the tail-end node to find the best (i.e., “shortest”) path.
摘要翻译：一种技术计算跨越计算机网络的多个域的流量工程（TE）标签交换路径（LSP），从本地域的头端节点到远程域的尾端节点。新颖的域间TE-LSP计算技术包括由前端节点执行的计算算法，其利用位于远程域内的路径计算元素（PCE）（即，除本地域之外）。特别地，前端节点从每个远程域中的PCE请求路径段，其中路径段表示所有入口边界路由器之间到特定远程域的所有出口边界路由器（即，通过域）的路径，，或到尾端节点。在从每个远程域接收路径段时，前端节点将路径段与本地域信息相结合，并且执行从前端节点到尾端节点的前向路径计算，以找到最佳（即“最短” “）路径。

60. 发明授权

US09319962B2 Local path repair in a wireless deterministic network 有权
标题翻译：无线确定性网络中的本地路径修复
公开(公告)号：US09319962B2
公开(公告)日：2016-04-19
申请号：US14043974
申请日：2013-10-02
申请人： Patrick Wetterwald , Jean-Philippe Vasseur , Pascal Thubert
发明人： Patrick Wetterwald , Jean-Philippe Vasseur , Pascal Thubert
IPC分类号： H04W40/04 , H04W72/04 , H04W40/34 , H04W40/38 , H04L12/721 , H04L12/707 , H04L12/703
CPC分类号： H04W40/04 , H04L45/12 , H04L45/22 , H04L45/28 , H04W40/34 , H04W40/38 , H04W72/0446 , Y02D70/144 , Y02D70/32
摘要： In one embodiment, an initial path is established in a wireless deterministic network between a source and a destination through one or more intermediate nodes, which are typically informed of a required metric between the source and the destination for communicating a packet. The initial path is locally (e.g., without contacting a path computation engine) reconfigured to bypass at least one of the intermediate nodes creating a new path, with the new path meeting the requirement(s) of the metric. Note, “locally reconfiguring” refers to the network nodes themselves determining a replacement path without reliance on a path computation engine or other entity (e.g., network management system, operating support system) in determining the replacement path. In one embodiment, a network node not on the initial path replaces a node on the initial path while using the same receive and send timeslots used in the initial path.
摘要翻译：在一个实施例中，通过一个或多个中间节点在源和目的地之间的无线确定性网络中建立初始路径，所述中间节点通常被通知源和目的地之间用于传送分组的所需度量。初始路径在本地（例如，不接触路径计算引擎）被重新配置为绕过创建新路径的至少一个中间节点，新路径满足度量的要求。注意，“本地重新配置”是指网络节点本身在不依赖路径计算引擎或其他实体（例如，网络管理系统，操作支持系统））确定替换路径时确定替换路径。在一个实施例中，不在初始路径上的网络节点替换初始路径上的节点，同时使用在初始路径中使用的相同的接收和发送时隙。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式