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

41. 发明授权

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片段来更新正确的链路状态，即没有由片段包装引起的瞬时路由干扰。

42. 发明授权

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的适当备份隧道。

43. 发明授权

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

44. 发明申请

US20080008104A1 Technique for efficiently determining acceptable link-based loop free alternates in a computer network 有权
标题翻译：用于有效地确定计算机网络中可接受的基于链路的无循环交替的技术
公开(公告)号：US20080008104A1
公开(公告)日：2008-01-10
申请号：US11481350
申请日：2006-07-05
申请人： Stefano B. Previdi , Raffaele Gigantino
发明人： Stefano B. Previdi , Raffaele Gigantino
IPC分类号： H04L12/28
CPC分类号： H04L12/66 , H04L45/04 , H04L45/18 , H04L45/22 , H04L45/28
摘要： A technique efficiently determines acceptable link-based loop free alternates (LFAS) in a computer network. According to the novel technique, a protecting network device configured to protect a link (“protected link”) distinguishes other network devices (e.g., of the same domain as the protecting network device) as either network edge devices (i.e., an end point for external network traffic) or network core devices (i.e., not an end point for external network traffic). The protecting network device may then determine whether a neighboring network device loops toward a network edge device. If not, the protecting network device may determine that the neighboring network device is an acceptable LFA (e.g., for external network traffic). Notably, traffic directed to core devices may still loop, however, this traffic is generally internal (e.g., signaling) traffic, and may not be subject to the same operational constraints (e.g., protection) as external traffic.
摘要翻译：一种技术有效地确定计算机网络中可接受的基于链路的无环交替（LFAS）。根据该新技术，被配置为保护链路（“受保护链路”）的保护网络设备与网络边缘设备（即，用于保护网络设备的终点外部网络流量）或网络核心设备（即，不是外部网络流量的终点）。保护网络设备然后可以确定相邻网络设备是否循环到网络边缘设备。如果不是，保护网络设备可以确定相邻网络设备是可接受的LFA（例如，用于外部网络业务）。值得注意的是，指向核心设备的业务可能仍然循环，然而，该业务通常是内部（例如，信令）业务，并且可能不会受到与外部业务相同的操作限制（例如，保护）。

45. 发明授权

US09143431B2 Hiding a service node in a network from a network routing topology 有权
标题翻译：从网络路由拓扑中隐藏网络中的服务节点
公开(公告)号：US09143431B2
公开(公告)日：2015-09-22
申请号：US12981444
申请日：2010-12-29
申请人： Pradosh Mohapatra , Stefano B. Previdi , Clarence Filsfils , David Ward
发明人： Pradosh Mohapatra , Stefano B. Previdi , Clarence Filsfils , David Ward
IPC分类号： H04L12/28 , H04L12/751
CPC分类号： H04L45/025
摘要： Hiding a service node in a network from a network topology is provided. In one embodiment, for example, an apparatus for hiding a service node in a network from a network topology, the apparatus comprising: a network interface; a processor; and one or more stored sequences of instructions which, when executed by the processor, cause the processor to perform: discovering a service node in a data network in accordance with a link-state protocol wherein the service node provides a network topology dependent service other than packet forwarding; establishing a link-state adjacency with the service node and one or more packet forwarding nodes in accordance with the link-state protocol; receiving a link-state advertisement; in response to identifying the link-state advertisement as an originating link-state advertisement sent from the service node, suppressing flooding of the received link-state advertisement to the one or more packet forwarding nodes.
摘要翻译：提供了从网络拓扑中隐藏网络中的服务节点。在一个实施例中，例如，一种用于从网络拓扑中隐藏网络中的服务节点的装置，所述装置包括：网络接口; 处理器以及一个或多个存储的指令序列，当由所述处理器执行时，所述指令序列使所述处理器执行：根据链路状态协议在数据网络中发现服务节点，其中所述服务节点提供除分组转发; 根据链路状态协议与服务节点和一个或多个分组转发节点建立链路状态邻接; 接收链接状态广告; 响应于将所述链路状态广告识别为从所述服务节点发送的始发链路状态广告，抑制所接收的链路状态广告对所述一个或多个分组转发节点的洪泛。

46. 发明授权

US08467394B2 Automatic route tagging of BGP next-hop routes in IGP 有权
标题翻译：在IGP中自动路由标记BGP下一跳路由
公开(公告)号：US08467394B2
公开(公告)日：2013-06-18
申请号：US13149535
申请日：2011-05-31
申请人： Clarence Filsfils , Stefano B. Previdi , Jean-Philippe Vasseur
发明人： Clarence Filsfils , Stefano B. Previdi , Jean-Philippe Vasseur
IPC分类号： H04L12/28 , H04L12/56
CPC分类号： H04L45/04 , H04L45/02 , H04L45/026 , H04L45/28 , H04L45/52
摘要： In one embodiment, a router in a routing domain exchanges routing information with one or more other routers located external to the routing domain using an exterior gateway protocol (EGP). The router exchanges routing information with one or more other routers located internal to the routing domain using an interior gateway protocol (IGP). The router detects a route to be advertised by the IGP is also used as a next-hop attribute of a route advertised by the EGP. In response, the router tags the route advertised by the IGP as an important route for convergence to indicate that the tagged route is to be processed before other routes that have not been tagged during convergence processing. The tagged route is advertised within the routing domain using the IGP.
摘要翻译：在一个实施例中，路由域中的路由器使用外部网关协议（EGP）与位于路由域外部的一个或多个其他路由器交换路由信息。路由器使用内部网关协议（IGP）与位于路由域内部的一个或多个其他路由器交换路由信息。路由器检测到IGP发布的路由也被用作EGP发布的路由的下一跳属性。作为响应，路由器将IGP发布的路由标记为收敛的重要路由，以指示在收敛处理期间未标记的其他路由之前要标记的路由将被处理。使用IGP在路由域内通告标记的路由。

47. 发明授权

US07978708B2 Automatic route tagging of BGP next-hop routes in IGP 有权
标题翻译：在IGP中自动路由标记BGP下一跳路由
公开(公告)号：US07978708B2
公开(公告)日：2011-07-12
申请号：US11025203
申请日：2004-12-29
申请人： Clarence Filsfils , Stefano B. Previdi , Jean-Philippe Vasseur
发明人： Clarence Filsfils , Stefano B. Previdi , Jean-Philippe Vasseur
IPC分类号： H04L12/28 , H04L12/56
CPC分类号： H04L45/04 , H04L45/02 , H04L45/026 , H04L45/28 , H04L45/52
摘要： A technique configures an intermediate network node to automatically determine whether a route advertised by a routing protocol is important for fast convergence in a computer network. As used herein, an important route needed for fast convergence is a route advertised by the routing protocol, such as an exterior gateway routing protocol (EGP) process executing on the node, as a next-hop address, since external connectivity relies on such a route. Notably, the EGP process interacts with an interior gateway routing protocol (IGP) process executing on the node to identify the route as an important route. Identification of an important route, in turn, allows IGP to process the route in a high priority fashion, thereby facilitating fast convergence.
摘要翻译：一种技术配置中间网络节点，以自动确定路由协议发布的路由是否对计算机网络中的快速收敛很重要。如本文所使用的，快速收敛所需的重要路由是路由协议所通告的路由，例如在节点上执行的外部网关路由协议（EGP）过程作为下一跳地址，因为外部连接依赖于路线。值得注意的是，EGP进程与在节点上执行的内部网关路由协议（IGP）进程交互，以将路由标识为重要路由。识别重要的路由又反过来允许IGP以高优先级的方式处理路由，从而促进快速收敛。

48. 发明授权

US07855953B2 Method and apparatus for managing forwarding of data in an autonomous system 有权
标题翻译：用于管理自主系统中的数据转发的方法和装置
公开(公告)号：US07855953B2
公开(公告)日：2010-12-21
申请号：US11254468
申请日：2005-10-20
申请人： Clarence Filsfils , John Galen Scudder , Stefano B. Previdi
发明人： Clarence Filsfils , John Galen Scudder , Stefano B. Previdi
IPC分类号： H04L12/26
CPC分类号： H04L45/22 , H04L12/4633 , H04L45/04 , H04L45/28 , H04L45/50
摘要： A method of managing forwarding of data in a first autonomous system (AS) is described. The first AS includes a plurality of border routers having inter-domain links to one or more remote AS's and an associated exterior communications protocol. The border routers use an interior communications protocol with other border routers in the first AS using primary tunnels. The method comprises the steps, performed at a first border router having a primary route via an inter-domain link to a remote AS, of constructing an alternate route to the remote AS via second border router in the first AS, instigating a backup tunnel to the second border router upon failure of the primary route and sending a failure message to the other border routers.
摘要翻译：描述了在第一自治系统（AS）中管理数据转发的方法。第一AS包括具有到一个或多个远程AS的域间链接和相关联的外部通信协议的多个边界路由器。边界路由器使用内部通信协议与第一AS中的其他边界路由器使用主隧道。该方法包括以下步骤：在具有通过到远程AS的域间链路的主路由的第一边界路由器上执行的步骤，通过第一AS中的第二边界路由器构建到远程AS的备用路由，将备用隧道引导到主路由器故障时的第二个边界路由器，并向其他边界路由器发送故障消息。

49. 发明授权

US07814227B2 Computation of a shortest inter-domain TE-LSP across a set of autonomous systems 有权
标题翻译：跨一组自治系统计算最短域间TE-LSP
公开(公告)号：US07814227B2
公开(公告)日：2010-10-12
申请号：US11073348
申请日：2005-03-04
申请人： Jean-Philippe Vasseur , Stefano B. Previdi
发明人： Jean-Philippe Vasseur , Stefano B. Previdi
IPC分类号： G06F15/173
CPC分类号： H04L45/12 , H04L45/04 , H04L45/42 , H04L45/50
摘要： A technique calculates a shortest path for a traffic engineering (TE) label switched path (LSP) from a head-end node in a local domain to a tail-end node of a remote domain in a computer network. The novel path calculation technique determines a set of different remote domains through which the TE-LSP may traverse to reach the tail-end node (e.g., along “domain routes”). Once the set of possible routes is determined, the head-end node sends a path computation request to one or more path computation elements (PCEs) of its local domain requesting a computed path for each domain route. Upon receiving path responses for each possible domain route, the head-end node selects the optimal (shortest) path, and establishes the TE-LSP accordingly.
摘要翻译：一种技术计算从本地域中的头端节点到计算机网络中远程域的尾端节点的流量工程（TE）标签交换路径（LSP）的最短路径。新颖的路径计算技术确定了一组不同的远程域，TE-LSP可以通过该组来遍历尾端节点（例如沿着“域路由”）。一旦确定了可能的路由集合，则前端节点向其本地域的一个或多个路径计算元件（PCE）发送路径计算请求，请求每个域路由的计算路径。在接收每个可能的域路由的路径响应时，前端节点选择最优（最短）路径，并相应建立TE-LSP。

50. 发明授权

US07801137B2 Receiver-based construction of point-to-multipoint trees using path computation elements in a computer network 有权
标题翻译：在计算机网络中使用路径计算元素的基于接收器的点对多点树的构造
公开(公告)号：US07801137B2
公开(公告)日：2010-09-21
申请号：US12045749
申请日：2008-03-11
申请人： Jean-Philippe Vasseur , Stefano B. Previdi , Clarence Filsfils
发明人： Jean-Philippe Vasseur , Stefano B. Previdi , Clarence Filsfils
IPC分类号： H04L12/28
CPC分类号： H04L45/16 , H04L12/185 , H04L45/00 , H04L45/04 , H04L45/48 , H04L45/50
摘要： In one embodiment, a trigger to add a leaf node to a multicast group of a computer network is detected, and the leaf node may determine a root node of the multicast group to request a path between a tunnel tree and the leaf node of the multicast group. In response to the multicast group having an existing tree, a reply is received from the root node with a computed path to add the leaf node to the tree at a selected node of the tree. The leaf node may then be added to the multicast group tunnel tree over the computed path at the selected node.
摘要翻译：在一个实施例中，检测到向计算机网络的多播组添加叶节点的触发器，并且叶节点可以确定多播组的根节点以请求隧道树和多播的叶节点之间的路径组。响应于具有现有树的多播组，使用计算的路径从根节点接收回复，以将叶节点添加到树的所选节点处的树。然后可以通过所选节点处的计算路径将叶节点添加到多播组隧道树中。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式