-
公开(公告)号：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。
-
13.发明授权Congestion-based notification during fast reroute operations in stateful path computation element environments 有权在状态路径计算元素环境中进行快速重路由操作期间基于拥塞的通知公开(公告)号：US09065750B2
公开(公告)日：2015-06-23
申请号：US13524135
申请日：2012-06-15
IPC分类号： H04J3/14 , G06F11/00 , H04L12/729 , H04L12/707 , H04L12/703 , H04L12/801 , H04L12/911
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.
摘要翻译： 在一个实施例中，一旦检测到主隧道的备用隧道的使用的激活，则可以确定备用隧道的路径的拥塞级别。 响应于该级别大于阈值，主隧道的前端节点被触发以重新路由主隧道（例如，请求到路径计算元件）。 相反，响应级别不大于阈值，允许备份隧道保持激活。
-
14.发明申请公开(公告)号：US20130336107A1
公开(公告)日：2013-12-19
申请号：US13524769
申请日：2012-06-15
IPC分类号： H04L12/24
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）监视计算机网络内的隧道建立失败率，并且基于隧道建立失败率来确定是否调整路由信息的准确性。 例如，隧道建立故障率高于第一阈值表示需要更高的精度。 响应于隧道建立失败率高于第一阈值，设备然后可以指示一个或多个路由器缩短其在计算机网络中的路由更新间隔。
-
15.发明申请TIME-BASED SCHEDULING FOR TUNNELS COMPUTED BY A STATEFUL PATH COMPUTATION ELEMENT 有权一个稳定的路径计算元素计算的隧道的基于时间的调度公开(公告)号：US20130336126A1
公开(公告)日：2013-12-19
申请号：US13524751
申请日：2012-06-15
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可以在特定时间内确定隧道在业务简档内的布置。
-
公开(公告)号：US20060153200A1
公开(公告)日：2006-07-13
申请号：US11025251
申请日：2004-12-29
IPC分类号： H04L12/56
摘要： 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, as a next-hop address, since external connectivity relies on such a route. A routing information base process executing on the node stores the advertised route and, notably, 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.
摘要翻译： 一种技术配置中间网络节点，以自动确定路由协议发布的路由是否对计算机网络中的快速收敛很重要。 如本文所使用的，快速收敛所需的重要路线是路由协议（例如外部网关路由协议）作为下一跳地址通告的路由，因为外部连接依赖于这样的路由。 在节点上执行的路由信息库过程存储所通告的路由，并且特别地与在节点上执行的内部网关路由协议（IGP）进程进行交互，以将该路由识别为重要路由。 识别重要的路由又反过来允许IGP以高优先级的方式处理路由，从而促进快速收敛。
-
公开(公告)号：US08855014B2
公开(公告)日：2014-10-07
申请号：US13524071
申请日：2012-06-15
申请人： Stefano Previdi , Jean-Philippe Vasseur , Jan Medved , David Ward
发明人： Stefano Previdi , Jean-Philippe Vasseur , Jan Medved , David Ward
摘要： In one embodiment, a particular device in a computer network maintains a locally owned tunnel-state table, and joins a distributed hash table (DHT) ring. In addition, the locally owned tunnel-state table is shared with other devices of the DHT ring to establish a DHT-owned tunnel-state table. The particular device (and other devices) determines ownership of link-state advertisements (LSAs) for a specific portion of a traffic engineering database (TED) according to the DHT ring. As such, when the particular device (or any device) computes a path for a tunnel using a local TED, the particular device may request permission to use resources along the computed path that were advertised in particular LSAs from owners of those particular LSAs when not owned by the particular device.
摘要翻译： 在一个实施例中，计算机网络中的特定设备维护本地拥有的隧道状态表，并且连接分布式散列表（DHT）环。 此外，本地拥有的隧道状态表与DHT环的其他设备共享，以建立DHT拥有的隧道状态表。 特定设备（和其他设备）根据DHT环确定针对流量工程数据库（TED）的特定部分的链路状态通告（LSA）的所有权。 因此，当特定设备（或任何设备）使用本地TED计算隧道的路径时，特定设备可以请求允许沿着所计算的路径使用资源，这些资源在特定LSA的特定LSA中被发布，来自那些特定LSA的所有者 由特定设备拥有。
-
18.发明申请Method and apparatus to compute local repair paths taking into account link resources and attributes 有权考虑链路资源和属性来计算局部修复路径的方法和装置公开(公告)号：US20060140111A1
公开(公告)日：2006-06-29
申请号：US11025179
申请日：2004-12-29
摘要： A technique for calculating local repair paths through a computer network using one or more dynamically measured parameters in place of, or in addition to, statically assigned cost metrics. The dynamically measured parameters include various statistical measures of resources and attributes associated with data links and/or network nodes in the computer network. In operation, an intermediate node monitors a set of local link and/or node parameters. The node may generate an advertisement in response to at least one of its monitored parameters crossing a predetermined threshold value or changing value by a predetermined percentage or amount. The advertisement is “flooded” so as to advertise the dynamically measured parameter value to other neighboring intermediate nodes. After receiving the advertisement, each node may recalculate one or more local repair paths based on the advertised parameter value. The node may utilize a recalculated repair path if it provides an appreciably lower-cost path, e.g., by a predetermined percentage, as compared with the currently deployed repair path.
摘要翻译： 一种用于通过使用一个或多个动态测量参数来代替静态分配的成本度量来计算通过计算机网络的局部修复路径的技术。 动态测量的参数包括与计算机网络中的数据链路和/或网络节点相关联的资源和属性的各种统计测量。 在操作中，中间节点监视一组本地链路和/或节点参数。 该节点可以响应于其所监视的参数中的至少一个与预定阈值相交或者以预定百分比或数量改变值来生成广告。 广告被“淹没”，以便将动态测量的参数值通告给其他相邻的中间节点。 在接收到广告之后，每个节点可以基于所通告的参数值重新计算一个或多个本地修复路径。 如果节点可以使用重新计算的修复路径，如果其与当前部署的修复路径相比提供了明显较低成本的路径，例如，以预定百分比。
-
19.发明申请System and method for reporting out-of-resources (OOR) conditions in a data network 有权在数据网络中报告资源不足（OOR）条件的系统和方法公开(公告)号：US20060092952A1
公开(公告)日：2006-05-04
申请号：US10964184
申请日：2004-10-13
申请人： Sami Boutros , Muthurajah Sivabalan , David Ward , Stefano Previdi , Jean-Philippe Vasseur , Rodolphe Figaro , Reshad Rahman
发明人： Sami Boutros , Muthurajah Sivabalan , David Ward , Stefano Previdi , Jean-Philippe Vasseur , Rodolphe Figaro , Reshad Rahman
IPC分类号： H04L12/56
CPC分类号： H04L47/125 , H04L41/06 , H04L45/00 , H04L45/50 , H04L47/2408 , H04L47/745
摘要： A system and method for advertising out-of-resources (OOR) conditions for entities, such as nodes, line cards and data links, in a manner that does not involve using a maximum cost to indicate the entity is “out-of-resources.” According to the technique, an OOR condition for an entity is advertised in one or more type-length-value (TLV) objects contained in an advertisement message. The advertisement message is flooded to nodes on a data network to inform them of the entity's OOR condition. Head-end nodes that process the advertisement message may use information contained in the TLV object to determine a path for a new label switched path (LSP) that does not include the entity associated with the OOR condition.
摘要翻译： 用于以不涉及使用最大成本来指示实体的方式向诸如节点，线路卡和数据链路的实体（例如节点，线路卡和数据链路）广告外部资源（OOR）条件的系统和方法是“超出资源 “。 根据该技术，在广告消息中包含的一个或多个类型长度值（TLV）对象中通告实体的OOR条件。 广告消息被洪泛到数据网络上的节点，以通知他们实体的OOR条件。 处理广告消息的头端节点可以使用包含在TLV对象中的信息来确定不包括与OOR条件相关联的实体的新标签交换路径（LSP）的路径。
-
公开(公告)号：US09300564B2
公开(公告)日：2016-03-29
申请号：US13524057
申请日：2012-06-15
IPC分类号： H04L12/26 , H04L12/24 , H04L12/751 , H04L12/703 , H04L12/717 , H04L12/723
摘要： In one embodiment, a stateful path computation element (PCE) in a computer network determines a need to route at least a threshold number of tunnels, and in response, triggers a routing update from a determined set of routers. Having updated the routing information and available network resources for the set of routers, the stateful PCE may then compute the tunnels based on the update.
摘要翻译： 在一个实施例中，计算机网络中的有状态路径计算元件（PCE）确定需要路由至少一个阈值数量的隧道，并且作为响应，从确定的一组路由器触发路由更新。 为了更新路由器集合的路由信息和可用的网络资源，状态PCE然后可以基于更新来计算隧道。
-
-
-
-
-
-
-
-
-
搜索结果
436 条记录 (耗时 0.031 秒)
