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

41. 发明授权

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.
摘要翻译：在一个实施例中，节点识别到目的地的多个相等成本最佳路径，最佳路径具有一个或多个相关联的链路。节点接收相关联链路的动态链路利用信息，并且确定到目的地的业务量，以在每个相等成本最佳路径上转发，该数量动态地依赖于每个相等成本的相关链路的动态链路利用率最佳路径

42. 发明授权

US07886079B2 Dynamic use of backup path computation elements across domains of a computer network 有权
标题翻译：在计算机网络的域上动态使用备份路径计算元素
公开(公告)号：US07886079B2
公开(公告)日：2011-02-08
申请号：US12706567
申请日：2010-02-16
申请人： Jean-Philippe Vasseur , Abhay Kumar Roy , Stefano B. Previdi
发明人： Jean-Philippe Vasseur , Abhay Kumar Roy , Stefano B. Previdi
IPC分类号： G06F15/173
CPC分类号： H04L47/10 , H04L45/02 , H04L45/04 , H04L45/22 , H04L45/28 , H04L45/42 , H04L47/125 , H04L63/0272 , H04L2212/00
摘要： In one embodiment, one or more path computation requests from path computation clients (PCCs) in a first network domain are received at a first border router (BR) arranged at the border of the first network domain and a second network domain. The first BR learns of a path computation element (PCE) in the second network domain. The PCE in the second network domain is informed of path computation information for the first network domain. One or more tunnels are established between the first BR and the PCE in the second network domain. One or more path computation requests from PCCs in the first network domain are passed from the first BR, through the one or more tunnels, to the PCE in the second network domain, to be serviced by the PCE in the second network domain using the path computation information for the first network domain.
摘要翻译：在一个实施例中，在布置在第一网络域和第二网络域的边界处的第一边界路由器（BR）处接收来自第一网络域中的路径计算客户端（PCC）的一个或多个路径计算请求。第一个BR学习第二个网络域中的路径计算元素（PCE）。第二网域的PCE通知第一网域的路径计算信息。在第二网络域中的第一BR和PCE之间建立一个或多个隧道。来自第一网络域中的PCC的一个或多个路径计算请求从第一BR通过一个或多个隧道传递到第二网络域中的PCE，以由第二网络中的PCE使用路径第一网域的计算信息。

43. 发明授权

US07751336B2 Technique for efficiently avoiding transient routing disturbances in link state routing protocols with link state packet fragmentation 有权
标题翻译：用于有效地避免链路状态路由协议中具有链路状态分组碎片的瞬时路由干扰的技术
公开(公告)号：US07751336B2
公开(公告)日：2010-07-06
申请号：US11449282
申请日：2006-06-08
申请人： Christian Hopps , Stefano B. Previdi
发明人： Christian Hopps , Stefano B. Previdi
IPC分类号： H04J1/16
CPC分类号： H04L45/02
摘要： A technique efficiently avoids transient routing disturbances in link state routing protocols with fragmented link state packets (LSPs) in a computer network. According to the novel technique, a link state router (LSR) specifies which of two or more links are to be advertised in each of two or more corresponding LSP fragments. The LSR advertises the states of the specified links in the corresponding LSP fragments to one or more other LSRs. In other words, each link of the LSR is assigned to a particular LSP fragment, and the state of the link is always to be advertised in that particular LSP fragment (i.e., no fragment wrapping). Upon receiving the LSP fragments, the other LSRs may update the correct link states based on the individual LSP fragments, i.e., without transient routing disturbances caused by fragment wrapping.
摘要翻译：一种技术有效地避免了在计算机网络中具有分段链路状态分组（LSP）的链路状态路由协议中的瞬时路由干扰。根据新技术，链路状态路由器（LSR）规定两个或多个对应的LSP片段中的每一个中要发布两条或多条链路中的哪条链路。 LSR将对应的LSP片段中指定链路的状态通告给一个或多个其他LSR。换句话说，LSR的每个链路被分配给特定的LSP片段，并且链路的状态总是在该特定的LSP片段中通告（即，没有片段包装）。在接收到LSP片段时，其他LSR可以基于各个LSP片段来更新正确的链路状态，即没有由片段包装引起的瞬时路由干扰。

44. 发明授权

US07684351B2 Inter-domain optimization trigger in PCE-based environment 有权
标题翻译：基于PCE的环境中的域间优化触发
公开(公告)号：US07684351B2
公开(公告)日：2010-03-23
申请号：US11052280
申请日：2005-02-07
申请人： Jean-Philippe Vasseur , David D. Ward , Muthurajah Sivabalan , Stefano B. Previdi
发明人： Jean-Philippe Vasseur , David D. Ward , Muthurajah Sivabalan , Stefano B. Previdi
IPC分类号： H04L12/28
CPC分类号： H04L45/42 , H04L45/02 , H04L45/04 , H04L45/32 , H04L45/50
摘要： A technique triggers optimization of 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 technique is based on the detection of an event in the remote domain (“event domain”) that could create a more optimal TE-LSP, such as, e.g., restoration of a network element or increased available bandwidth. Specifically, a path computation element (PCE) in the event domain learns of the event and notifies other PCEs of the event through an event notification. These PCEs then flood an event notification to label switched routers (LSRs) in their respective domain. Upon receiving the notification, if an LSR has one or more TE-LSPs (or pending TE-LSPs), it responds to the PCE with an optimization request for the TE-LSPs. The PCE determines whether a particular TE-LSP may benefit from optimization based on the event domain (i.e., whether the TE-LSP uses the event domain), and processes the request accordingly.
摘要翻译：一种技术触发跨越计算机网络的多个域从本地域的头端节点到远程域的尾端节点的流量工程（TE）标签交换路径（LSP）的优化。该技术基于对远程域（“事件域”）中的事件的检测，其可以创建更优化的TE-LSP，例如网络元件的恢复或增加的可用带宽。具体地，事件域中的路径计算元素（PCE）学习事件并通过事件通知通知其他PCE事件。然后，这些PCE将事件通知泛滥到其各自域中的标签交换路由器（LSR）。在收到通知后，如果LSR有一个或多个TE-LSP（或待处理的TE-LSP），则对该TEE的优先请求响应PCE。 PCE确定特定TE-LSP是否可以从基于事件域的优化（即，TE-LSP是否使用事件域）获益，并且相应地处理该请求。

45. 发明授权

US07675848B2 Dynamic forwarding adjacency 有权
标题翻译：动态转接邻接
公开(公告)号：US07675848B2
公开(公告)日：2010-03-09
申请号：US10891704
申请日：2004-07-15
申请人： Jean-Philippe Vasseur , Stefano B. Previdi , David D. Ward , Robert Goguen
发明人： Jean-Philippe Vasseur , Stefano B. Previdi , David D. Ward , Robert Goguen
IPC分类号： G01R31/08
CPC分类号： H04L45/50 , H04L45/02 , H04L45/28
摘要： A technique treats a protected forwarding adjacency (FA) as a dynamic entity in that it allows a backup tunnel associated with the FA to carry traffic for the FA, when it's primary tunnel has failed, up to a predetermined amount of time. If after the predetermined amount of time has elapsed and the FA has not recovered (e.g., the primary tunnel has not been reestablished), a network topology change is automatically triggered causing the network to converge on a new network topology. By triggering the network topology change, a path that is more optimal than the path associated with the backup tunnel may be subsequently determined to carry the traffic.
摘要翻译：一种技术将受保护的转发邻接（FA）视为动态实体，因为当主隧道发生故障时，它允许与FA相关联的备用隧道携带FA的流量，直到预定的时间量。如果经过了预定的时间量并且FA没有恢复（例如，主隧道没有被重新建立），则自动地触发网络拓扑变化，导致网络收敛在新的网络拓扑上。通过触发网络拓扑变化，可以随后确定比与备用隧道相关联的路径更优化的路径来承载流量。

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. 发明授权

US07515529B2 Efficient mechanism for fast recovery in case of border router node failure in a computer network 有权
标题翻译：在计算机网络中边界路由器节点故障的情况下快速恢复的高效机制
公开(公告)号：US07515529B2
公开(公告)日：2009-04-07
申请号：US11011814
申请日：2004-12-14
申请人： Jean-Philippe Vasseur , Stefano B. Previdi
发明人： Jean-Philippe Vasseur , Stefano B. Previdi
IPC分类号： H04L12/26
CPC分类号： H04L45/22 , H04L45/04 , H04L45/28 , H04L45/50
摘要： A technique protects traffic (IP) against the failure of a border router between two domains in a computer network using Fast Reroute and backup tunnels. The border router (i.e., the “protected border router”) announces/advertises a list of all its adjacent next-hop routers (i.e., its “neighbors”) residing in first and second domains interconnected by the protected border router. A neighbor in the first domain that is immediately upstream to the protected border router and that is configured to protect the border router (i.e., the “protecting router”) learns address prefixes (i.e., “protected prefixes”) reachable from the next-hop router in the second domain (i.e., “next-next-hops,” NNHOPs to the protected prefixes from the protecting router). The protecting router calculates a backup tunnel to each NNHOP that excludes the protected border router, and associates each backup tunnel with protected prefixes accordingly. When the protected border router fails, Fast Reroute is triggered, and the protected prefixes are rerouted by the protecting router onto an appropriate backup tunnel to a corresponding NNHOP.
摘要翻译：一种技术可以使用快速重路由和备份隧道来保护流量（IP）免受计算机网络中两个域之间的边界路由器故障的影响。边界路由器（即“受保护的边界路由器”）宣布/通告驻留在由受保护的边界路由器互连的第一和第二域中的所有相邻的下一跳路由器（即其“邻居”）的列表。紧邻受保护边界路由器上游并被配置为保护边界路由器（即“保护路由器”）的第一个域中的邻居学习从下一跳到达的地址前缀（即，“保护前缀”）路由器在第二个域（即“next-next-hops”，NNHOP到保护路由器的受保护的前缀）。保护路由器计算每个NNHOP的备份隧道，排除受保护的边界路由器，并相应地将每个备份隧道与受保护的前缀相关联。当受保护的边界路由器发生故障时，快速重路由被触发，受保护的前缀被保护路由器重新路由到相应的NNHOP的适当备份隧道。

50. 发明授权

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的风险链路组。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式