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

41. 发明申请

US20060193248A1 Loop prevention technique for MPLS using service labels 有权
标题翻译：使用服务标签的MPLS环路防护技术
公开(公告)号：US20060193248A1
公开(公告)日：2006-08-31
申请号：US11068081
申请日：2005-02-28
申请人： Clarence Filsfils , David Ward , Stefano Previdi , Jean-Philippe Vasseur , Jim Guichard , Robert Raszuk
发明人： Clarence Filsfils , David Ward , Stefano Previdi , Jean-Philippe Vasseur , Jim Guichard , Robert Raszuk
IPC分类号： H04J3/14 , H04L12/56 , H04J1/16 , H04L12/28
CPC分类号： H04L45/18 , H04L45/04 , H04L45/22 , H04L45/28 , H04L45/50
摘要： A local fast reroute (FRR) technique is implemented at the edge of a computer network. In accordance with the technique, if an edge device detects a node or link failure that prevents it from communicating with a neighboring routing domain, the edge device reroutes at least some data packets addressed to that domain to a backup edge device which, in turn, forwards the packets to the neighboring domain. The rerouted packets are designated as being “protected” (i.e., rerouted) data packets before they are forwarded to the backup edge device. The backup edge device identifies protected data packets as those which contain a predetermined “service” label in their MPLS label stacks. In other words, the service label is used as an identifier for packets that have been FRR rerouted. Upon receiving a data packet containing a service label, the backup edge device is not permitted to reroute the packet a second time, e.g., in response to another inter-domain node or link failure, thereby preventing loops from developing at the edge of the network.
摘要翻译：本地快速重路由（FRR）技术在计算机网络的边缘实现。根据该技术，如果边缘设备检测到阻止其与相邻路由域通信的节点或链路故障，则边缘设备将至少一些寻址到该域的数据分组重新路由到备用边缘设备，将数据包转发到相邻域。重新路由的数据包在被转发到备份边缘设备之前被指定为“保护”（即重新路由）数据分组。备份边缘设备将受保护的数据包标识为在其MPLS标签堆栈中包含预定“服务”标签的数据包。换句话说，服务标签被用作已被FRR重新路由的数据包的标识符。在接收到包含服务标签的数据分组时，不允许备份边缘设备第二次重新路由该分组，例如响应于另一个域间节点或链路故障，从而防止在网络边缘发展的环路。

42. 发明申请

US20060164975A1 Loop prevention technique for MPLS using two labels 有权
公开(公告)号：US20060164975A1
公开(公告)日：2006-07-27
申请号：US11046163
申请日：2005-01-26
申请人： Clarence Filsfils , Jim Guichard , Jean-Philippe Vasseur , Stefano Previdi , Robert Raszuk
发明人： Clarence Filsfils , Jim Guichard , Jean-Philippe Vasseur , Stefano Previdi , Robert Raszuk
IPC分类号： H04L12/28 , G08C15/00
CPC分类号： H04L45/00 , H04L45/18 , H04L45/22 , H04L45/28 , H04L45/50 , H04W12/02
摘要： A fast reroute (FRR) technique is implemented at the edge of a network. In accordance with the technique, if an edge device detects a node or link failure that prevents it from communicating with a neighboring routing domain, the edge device reroutes at least some data packets addressed to that domain to a backup edge device which, in turn, forwards the packets to the neighboring domain. The rerouted packets are designated as being “protected” (i.e., rerouted) data packets before they are forwarded to the backup edge device. To differentiate which data packets are protected and which are not, the backup edge device employs different sets of VPN label values for protected and non-protected network traffic. That is, the backup edge device may allocate two different VPN label values for at least some destination address prefixes that are reachable through the neighboring domain: a first VPN label value for FRR protected traffic and a second VPN label value for non-protected traffic. Upon receiving a data packet containing a protected VPN label value, the backup edge device is not permitted to reroute the packet a second time, e.g., in response to another inter-domain node or link failure, thereby preventing loops from developing at the edge of the network.

43. 发明申请

US20060126496A1 Fast reroute (FRR) protection at the edge of a RFC 2547 network 有权
公开(公告)号：US20060126496A1
公开(公告)日：2006-06-15
申请号：US11010225
申请日：2004-12-10
申请人： Clarence Filsfils , Stefano Previdi , John Scudder , David Ward , Jean-Philippe Vasseur , Jim Guichard
发明人： Clarence Filsfils , Stefano Previdi , John Scudder , David Ward , Jean-Philippe Vasseur , Jim Guichard
IPC分类号： H04L12/26
CPC分类号： H04L45/28 , H04L45/02 , H04L45/04 , H04L45/22 , H04L45/50
摘要： A fast reroute (FRR) technique that may be deployed at the edge of a network having first and second edge devices coupled to a neighboring routing domain. If the first edge device detects a node or link failure that prevents it from communicating with the neighboring domain, the first edge device reroutes at least some data packets addressed to the neighboring domain to the second edge device. The second edge device receives the rerouted packets and then forwards the packets to the neighboring domain. Notably, the second edge device is not permitted to reroute the received packets a second time, e.g., upon identifying another inter-domain node or link failure. As such, loops are avoided at the edge of the network and packets are rerouted to the neighboring routing domain faster and more efficiently than in prior implementations.

44. 发明申请

US20130336126A1 TIME-BASED SCHEDULING FOR TUNNELS COMPUTED BY A STATEFUL PATH COMPUTATION ELEMENT 有权
标题翻译：一个稳定的路径计算元素计算的隧道的基于时间的调度
公开(公告)号：US20130336126A1
公开(公告)日：2013-12-19
申请号：US13524751
申请日：2012-06-15
申请人： Jean-Philippe Vasseur , Stefano Previdi , Clarence Filsfils , George Swallow
发明人： Jean-Philippe Vasseur , Stefano Previdi , Clarence Filsfils , George Swallow
IPC分类号： H04L12/24 , H04L12/26
CPC分类号： H04L41/0896 , H04L41/147 , H04L47/823 , H04L47/825 , H04L47/826
摘要： In one embodiment, a path computation element (PCE) in a computer network receives one or more path computation requests (PCReqs), and records a time of each PCReq and the corresponding requested bandwidth. Based on this information, the PCE may determine a traffic profile of the computer network, and may augment a traffic engineering database (TED) with requested bandwidth according to time based on the traffic profile. As such, prior to a particular time, the PCE may determine placement of tunnels within the traffic profile for the particular time.
摘要翻译：在一个实施例中，计算机网络中的路径计算元件（PCE）接收一个或多个路径计算请求（PCReq），并记录每个PCReq的时间和相应的请求带宽。基于该信息，PCE可以确定计算机网络的流量简档，并且可以基于流量简档来根据时间来增加具有所请求带宽的流量工程数据库（TED）。因此，在特定时间之前，PCE可以在特定时间内确定隧道在业务简档内的布置。

45. 发明授权

US08094555B2 Dynamic weighted-fair load-balancing 有权
标题翻译：动态加权平衡负载均衡
公开(公告)号：US08094555B2
公开(公告)日：2012-01-10
申请号：US11604461
申请日：2006-11-27
申请人： David D. Ward , Clarence Filsfils , Stefano B. Previdi , Jean-Philippe Vasseur
发明人： David D. Ward , Clarence Filsfils , Stefano B. Previdi , Jean-Philippe Vasseur
IPC分类号： H04J1/16
CPC分类号： H04L47/10 , H04L45/125 , H04L47/125
摘要： In one embodiment, a node identifies a plurality of equal cost best paths to a destination, the best paths having one or more associated links. The node receives dynamic link utilization information for the associated links, and determines an amount of traffic to the destination to forward over each of the equal cost best paths, the amount being dynamically dependent upon the dynamic link utilization of the associated links for each equal cost best path.
摘要翻译：在一个实施例中，节点识别到目的地的多个相等成本最佳路径，最佳路径具有一个或多个相关联的链路。节点接收相关联链路的动态链路利用信息，并且确定到目的地的业务量，以在每个相等成本最佳路径上转发，该数量动态地依赖于每个相等成本的相关链路的动态链路利用率最佳路径

46. 发明授权

US07633859B2 Loop prevention technique for MPLS using two labels 有权
标题翻译：使用两个标签的MPLS环路防护技术
公开(公告)号：US07633859B2
公开(公告)日：2009-12-15
申请号：US11046163
申请日：2005-01-26
申请人： Clarence Filsfils , Jim Guichard , Jean-Philippe Vasseur , Stefano B. Previdi , Robert Raszuk
发明人： Clarence Filsfils , Jim Guichard , Jean-Philippe Vasseur , Stefano B. Previdi , Robert Raszuk
IPC分类号： H04L12/56
CPC分类号： H04L45/00 , H04L45/18 , H04L45/22 , H04L45/28 , H04L45/50 , H04W12/02
摘要： A fast reroute (FRR) technique is implemented at the edge of a network. In accordance with the technique, if an edge device detects a node or link failure that prevents it from communicating with a neighboring routing domain, the edge device reroutes at least some data packets addressed to that domain to a backup edge device which, in turn, forwards the packets to the neighboring domain. The rerouted packets are designated as being “protected” (i.e., rerouted) data packets before they are forwarded to the backup edge device. To differentiate which data packets are protected and which are not, the backup edge device employs different sets of VPN label values for protected and non-protected network traffic. That is, the backup edge device may allocate two different VPN label values for at least some destination address prefixes that are reachable through the neighboring domain: a first VPN label value for FRR protected traffic and a second VPN label value for non-protected traffic. Upon receiving a data packet containing a protected VPN label value, the backup edge device is not permitted to reroute the packet a second time, e.g., in response to another inter-domain node or link failure, thereby preventing loops from developing at the edge of the network.
摘要翻译：在网络边缘实现快速重路由（FRR）技术。根据该技术，如果边缘设备检测到阻止其与相邻路由域通信的节点或链路故障，则边缘设备将至少一些寻址到该域的数据分组重新路由到备用边缘设备，将数据包转发到相邻域。重新路由的数据包在被转发到备份边缘设备之前被指定为“保护”（即重新路由）数据分组。为了区分哪些数据包受到保护，哪些数据包不受保护，备份边缘设备对受保护和未受保护的网络流量采用不同的VPN标签值集合。也就是说，备份边缘设备可以为可通过相邻域到达的至少一些目的地地址前缀分配两个不同的VPN标签值：用于FRR保护的业务的第一VPN标签值和用于非保护业务的第二VPN标签值。在接收到包含受保护的VPN标签值的数据分组时，不允许备份边缘设备第二次重新路由该分组，例如响应于另一个域间节点或链路故障，从而防止循环在网络。

47. 发明申请

US20090245259A1 FAST REROUTE (FRR) PROTECTION AT THE EDGE OF A RFC 2547 NETWORK 有权
标题翻译：快速REROUTE（FRR）保护在RFC 2547网络的边缘
公开(公告)号：US20090245259A1
公开(公告)日：2009-10-01
申请号：US12481411
申请日：2009-06-09
申请人： Clarence Filsfils , Stefano B. Previdi , John Galen Scudder , David D. Ward , Jean-Philippe Vasseur , Jim Guichard
发明人： Clarence Filsfils , Stefano B. Previdi , John Galen Scudder , David D. Ward , Jean-Philippe Vasseur , Jim Guichard
IPC分类号： H04L12/56
CPC分类号： H04L45/28 , H04L45/02 , H04L45/04 , H04L45/22 , H04L45/50
摘要： In one embodiment, an edge device in a first routing domain is configured to communicate with a second routing domain via a data link. The edge device receives a data packet containing a destination address that is reachable via the second routing domain and an indication that the data packet is a protected packet that was previously rerouted from another edge device in the first routing domain via a Multi-Protocol Label Switching (MPLS) Fast Reroute (FRR) backup path. The edge device determines if communication with the second routing domain is still available via the data link, and if so, removes the indication that the data packet is a protected packet and forwards the data packet to the second routing domain, and, if not, drops the data packet to prevent the data packet from being rerouted a second time in the first routing domain on another MPLS FRR backup path.
摘要翻译：在一个实施例中，第一路由域中的边缘设备被配置为经由数据链路与第二路由域进行通信。边缘设备接收包含经由第二路由域可到达的目的地地址的数据分组，以及指示数据分组是先前通过多协议标签交换在第一路由域中从另一边缘设备重新路由的受保护分组的指示（MPLS）快速重路由（FRR）备份路径。边缘设备确定与第二路由域的通信是否仍然通过数据链路可用，如果是，则删除数据分组是受保护分组的指示，并将数据分组转发到第二路由域，如果不是，删除数据包，以防止数据包在另一个MPLS FRR备份路径上的第一个路由域再次被重新路由。

48. 发明授权

US07551551B2 Fast reroute (FRR) protection at the edge of a RFC 2547 network 有权
标题翻译：在RFC 2547网络边缘的快速重路由（FRR）保护
公开(公告)号：US07551551B2
公开(公告)日：2009-06-23
申请号：US11010225
申请日：2004-12-10
申请人： Clarence Filsfils , Stefano B. Previdi , John Galen Scudder , David D. Ward , Jean-Philippe Vasseur , Jim Guichard
发明人： Clarence Filsfils , Stefano B. Previdi , John Galen Scudder , David D. Ward , Jean-Philippe Vasseur , Jim Guichard
IPC分类号： H04J1/16 , H04J3/14 , H04L1/00 , H04L12/26
CPC分类号： H04L45/28 , H04L45/02 , H04L45/04 , H04L45/22 , H04L45/50
摘要： A fast reroute (FRR) technique that may be deployed at the edge of a network having first and second edge devices coupled to a neighboring routing domain. If the first edge device detects a node or link failure that prevents it from communicating with the neighboring domain, the first edge device reroutes at least some data packets addressed to the neighboring domain to the second edge device. The second edge device receives the rerouted packets and then forwards the packets to the neighboring domain. Notably, the second edge device is not permitted to reroute the received packets a second time, e.g., upon identifying another inter-domain node or link failure. As such, loops are avoided at the edge of the network and packets are rerouted to the neighboring routing domain faster and more efficiently than in prior implementations.
摘要翻译：可以部署在具有耦合到相邻路由域的第一和第二边缘设备的网络边缘的快速重路由（FRR）技术。如果第一边缘设备检测到阻止其与相邻域通信的节点或链路故障，则第一边缘设备将寻址到相邻域的至少一些数据分组路由到第二边缘设备。第二边缘设备接收重新路由的报文，然后将报文转发给邻近的域。值得注意的是，第二边缘设备不允许第二次重新路由所接收的分组，例如在识别出另一个域间节点或链路故障时。因此，在网络的边缘避免了循环，并且与先前的实现相比，分组被更快地和更有效地重新路由到相邻路由域。

49. 发明授权

US07428213B2 Method and apparatus for determining network routing information based on shared risk link group information 有权
标题翻译：基于共享风险链路组信息确定网络路由信息的方法和装置
公开(公告)号：US07428213B2
公开(公告)日：2008-09-23
申请号：US10719003
申请日：2003-11-21
申请人： Jean Philippe Vasseur , Stefano B. Previdi , Clarence Filsfils , David Ward
发明人： Jean Philippe Vasseur , Stefano B. Previdi , Clarence Filsfils , David Ward
IPC分类号： H04L12/26
CPC分类号： H04L45/12 , H04B1/71635 , H04L45/02 , H04L45/18 , H04L45/22 , H04L45/28 , H04L45/46 , H04L45/48 , H04L45/50 , H04W88/06 , H04W88/10
摘要： A method and apparatus are disclosed for performing a shortest path first network routing path determination in a data communications network based in part on information about links that are associated as shared risk link groups. Micro-loops are avoided in computing shortest path first trees by considering whether links are within shared risk link groups. In a first approach, for each link state packet in a link state database, listed adjacencies are removed if the link between the node originating the LSP and the reported adjacency belongs to a shared risk link group for which one component (local link) is known as down, and a shortest path first computation is then performed. In a second approach, during the SPT computation and after having added a first node to a path, each neighboring node is added to a tentative tree if and only if, a link between the first node and the neighboring node does not belong to a shared risk link group for which one component (local link) is known as down.
摘要翻译：公开了一种用于在数据通信网络中执行最短路径第一网络路由路径确定的方法和装置，部分地基于关于作为共享风险链路组关联的链路的信息。通过考虑链路是否在共享风险链路组内，避免了计算最短路径树的微循环。在第一种方法中，对于链路状态数据库中的每个链路状态分组，如果发起LSP的节点和报告的邻接关系之间的链路属于已知一个组件（本地链路）的共享风险链路组，则删除列出的邻接关系然后执行最短路径优先计算。在第二种方法中，在SPT计算期间，并且在将第一节点添加到路径之后，当且仅当第一节点和相邻节点之间的链路不属于共享时，每个相邻节点被添加到暂定树一个组件（本地链路）被称为down的风险链路组。

50. 发明申请

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和查找，并且在经过预定时间量之后删除路由条目。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式