-
11.发明申请公开(公告)号：US20060045024A1
公开(公告)日：2006-03-02
申请号：US10928866
申请日：2004-08-27
申请人： Stefano Previdi , Clarence Filsfils , David Ward
发明人： Stefano Previdi , Clarence Filsfils , David Ward
CPC分类号： H04L45/56 , H04L45/02 , H04L45/12 , H04L47/24 , H04L47/6235 , H04L49/90 , H04L49/9078
摘要： A technique enables an intermediate network node to efficiently process link-state packets using a single running context (i.e., process or thread). The intermediate network node floods received link-state packets (LSP) before performing shortest path first (SPF) calculations and routing information base (RIB) updates. In addition, the node limits the number of LSPs that are permitted to be flooded before the node performs its SPF calculations. More specifically, if the number of link-state packets that are flooded during a flooding cycle exceeds a first predetermined threshold value, the node performs the SPF calculations before additional packets may be flooded. The intermediate network node also limits how long its RIB update may be delayed in favor of flooding operations. When the number of LSPs flooded after the SPF calculations exceeds a second predetermined threshold value or there are no more packets to be flooded, the node updates the contents of its RIB based on the SPF calculations.
-
12.发明申请Method and apparatus for determining network routing information based on shared risk link group information 有权基于共享风险链路组信息确定网络路由信息的方法和装置公开(公告)号：US20050111349A1
公开(公告)日：2005-05-26
申请号：US10719003
申请日：2003-11-21
申请人： Jean Vasseur , Stefano Previdi , Clarence Filsfils , David Ward
发明人： Jean Vasseur , Stefano Previdi , Clarence Filsfils , David Ward
IPC分类号： G01S13/00 , H04B20060101 , H04B1/00 , H04B1/40 , H04B1/69 , H04L5/04 , H04L12/28 , H04L12/56 , H04M1/00 , H04W88/06 , H04W88/10 , 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的风险链路组。
-
13.发明申请公开(公告)号：US20060165013A1
公开(公告)日：2006-07-27
申请号：US11045015
申请日：2005-01-26
IPC分类号： H04L12/28
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.
摘要翻译： 一种识别包括在其中的多个节点和链路的数据通信网络中的网络位置的出口点的方法包括：在识别节点执行的步骤，通过网络接收通知与网络位置相邻的通知。 所述方法还包括在所述识别节点处执行的从所述通知邻接信息导出并从所述邻接信息识别所述出口点的步骤。
-
公开(公告)号：US20090010153A1
公开(公告)日：2009-01-08
申请号：US11824885
申请日：2007-07-03
申请人： Clarence Filsfils , Stefano Previdi , David Ward
发明人： Clarence Filsfils , Stefano Previdi , David Ward
IPC分类号： H04L12/24
摘要： A method and system for failure notification at a remote node in communication with a local node are disclosed. The local node is configured for faster failure detection than the remote node. In one embodiment, the method includes establishing a failure monitoring session between the local node and the remote node, receiving at the remote node, a failure notification from the local node, the failure notification sent using a protocol of the failure monitoring session, and rerouting traffic at the remote node in response to the failure notification.
摘要翻译： 公开了一种在与本地节点通信的远程节点处的故障通知的方法和系统。 本地节点配置为比远程节点更快的故障检测。 在一个实施例中，该方法包括在本地节点和远程节点之间建立故障监视会话，在远程节点接收来自本地节点的故障通知，使用故障监视会话的协议发送的故障通知和重新路由 响应故障通知在远程节点的流量。
-
15.发明授权公开(公告)号：US09185022B2
公开(公告)日：2015-11-10
申请号：US13524769
申请日：2012-06-15
IPC分类号： H04L12/24 , H04J3/14 , H04L12/759 , H04L12/915 , H04L12/911 , H04L12/721 , H04L12/717
CPC分类号： H04L45/028 , H04L41/0654 , H04L45/42 , H04L45/44 , H04L47/785 , H04L47/825
摘要： In one embodiment, a device (e.g., a path computation element, PCE) monitors a tunnel set-up failure rate within a computer network, and determines whether to adjust an accuracy of routing information based on the tunnel set-up failure rate. For instance, the tunnel set-up failure rate being above a first threshold indicates a need for greater accuracy. In response to the tunnel set-up failure rate being above the first threshold, the device may then instruct one or more routers to shorten their routing update interval in the computer network.
摘要翻译： 在一个实施例中，设备（例如，路径计算元件，PCE）监视计算机网络内的隧道建立失败率，并且基于隧道建立失败率来确定是否调整路由信息的准确性。 例如，隧道建立故障率高于第一阈值表示需要更高的精度。 响应于隧道建立失败率高于第一阈值，设备然后可以指示一个或多个路由器缩短其在计算机网络中的路由更新间隔。
-
公开(公告)号：US07512064B2
公开(公告)日：2009-03-31
申请号：US10868721
申请日：2004-06-15
CPC分类号： H04L45/28 , H04L45/02 , H04L45/023 , H04L45/18
摘要： A technique incorporates an efficient means for avoiding micro-loops on a backup path associated with a failed protected link. An intermediate node delays updating a forwarding database (FDB) contained in the intermediate node based on the intermediate node's distance from the failed link. Specifically, intermediate nodes near the failed protected link delay updating their FDBs for a longer period of time than nodes farther away from the failed link. By updating FDBs in this manner, micro-loops may be avoided on the failed link's backup path as nodes on the backup path that are close to the failed link do not update their FDBs ahead of nodes farther away on the backup path.
摘要翻译： 一种技术结合了一种有效的方法来避免与故障保护链路相关联的备份路径上的微循环。 中间节点基于中间节点与故障链路的距离来延迟更新包含在中间节点中的转发数据库（FDB）。 具体来说，故障保护链路附近的中间节点延迟更长时间段的节点，而不是远离故障链路的节点。 通过以这种方式更新FDB，可以在故障链路的备份路径上避免微循环，因为靠近故障链路的备份路径上的节点在备份路径之前的节点之前不更新其FDB。
-
公开(公告)号：US20060140136A1
公开(公告)日：2006-06-29
申请号：US11025203
申请日：2004-12-29
IPC分类号： H04L12/28
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以高优先级的方式处理路由，从而促进快速收敛。
-
公开(公告)号：US20050276216A1
公开(公告)日：2005-12-15
申请号：US10868721
申请日：2004-06-15
CPC分类号： H04L45/28 , H04L45/02 , H04L45/023 , H04L45/18
摘要： A technique incorporates an efficient means for avoiding micro-loops on a backup path associated with a failed protected link. An intermediate node delays updating a forwarding database (FDB) contained in the intermediate node based on the intermediate node's distance from the failed link. Specifically, intermediate nodes near the failed protected link delay updating their FDBs for a longer period of time than nodes farther away from the failed link. By updating FDBs in this manner, micro-loops may be avoided on the failed link's backup path as nodes on the backup path that are close to the failed link do not update their FDBs ahead of nodes farther away on the backup path.
摘要翻译： 一种技术结合了一种有效的方法来避免与故障保护链路相关联的备份路径上的微循环。 中间节点基于中间节点与故障链路的距离来延迟更新包含在中间节点中的转发数据库（FDB）。 具体来说，故障保护链路附近的中间节点延迟更长时间段的节点，而不是远离故障链路的节点。 通过以这种方式更新FDB，可以在故障链路的备份路径上避免微循环，因为靠近故障链路的备份路径上的节点在备份路径之前的节点之前不更新其FDB。
-
19.发明授权Time-based scheduling for tunnels computed by a stateful path computation element 有权由状态路径计算元素计算的隧道的基于时间的调度公开(公告)号：US09197508B2
公开(公告)日：2015-11-24
申请号：US13524751
申请日：2012-06-15
IPC分类号： H04L12/24 , H04L12/26 , H04L12/911
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可以在特定时间内确定隧道在业务简档内的布置。
-
20.发明申请CONGESTION-BASED NOTIFICATION DURING FAST REROUTE OPERATIONS IN STATEFUL PATH COMPUTATION ELEMENT ENVIRONMENTS 有权紧急路线计算元件环境中快速REROUTE操作下的基于约束的通知公开(公告)号：US20130336116A1
公开(公告)日：2013-12-19
申请号：US13524135
申请日：2012-06-15
IPC分类号： H04L12/56
CPC分类号： H04L45/125 , H04L45/22 , H04L45/28 , H04L47/11 , H04L47/825
摘要： In one embodiment, once activation of use of a backup tunnel is detected for a primary tunnel, then a level of congestion of the path of the backup tunnel may be determined. In response to the level being greater than a threshold, a head-end node of the primary tunnel is triggered to reroute the primary tunnel (e.g., requesting to a path computation element). Conversely, in response to the level not being greater than the threshold, the backup tunnel is allowed to remain activated.
摘要翻译： 在一个实施例中，一旦检测到主隧道的备用隧道的使用的激活，则可以确定备用隧道的路径的拥塞级别。 响应于该级别大于阈值，主隧道的前端节点被触发以重新路由主隧道（例如，请求到路径计算元件）。 相反，响应级别不大于阈值，允许备份隧道保持激活。
-
-
-
-
-
-
-
-
-
搜索结果
91 条记录 (耗时 0.025 秒)
