-
91.发明申请SUBSETS OF THE FORWARD INFORMATION BASE (FIB) DISTRIBUTED AMONG LINE CARDS IN A SWITCHING DEVICE 有权在切换设备中的线卡上分配的前向信息库（FIB）的附件公开(公告)号：US20100215047A1
公开(公告)日：2010-08-26
申请号：US12390391
申请日：2009-02-20
申请人： Clarence Filsfils , Pradosh Mohapatra , Dheerendra Talur , John H. W. Bettink , Pranav Dharwadkar , David Delano Ward
发明人： Clarence Filsfils , Pradosh Mohapatra , Dheerendra Talur , John H. W. Bettink , Pranav Dharwadkar , David Delano Ward
IPC分类号： H04L12/56
CPC分类号： H04L45/00 , H04L45/38 , H04L45/54 , H04L49/3009
摘要： Disclosed are, inter alia, methods, apparatus, computer-storage media, mechanisms, and means associated with subsets of the Forward Information Base (FIB) distributed among line cards in a switching device; especially wherein one or more of the line cards does not contain the complete FIB, and this line card forwards packets, for which it does not have the forwarding information, to another line card which has the forwarding information for the packet.
摘要翻译： 公开了尤其涉及在交换设备中的线路卡之间分配的前向信息库（FIB）的子集的方法，装置，计算机存储介质，机制和装置; 特别是其中一个或多个线路卡不包含完整的FIB，并且该线路卡将不具有转发信息的分组转发到具有用于分组的转发信息的另一线路卡。
-
公开(公告)号：US20100150020A1
公开(公告)日：2010-06-17
申请号：US12336469
申请日：2008-12-16
申请人： Eric C. Rosen , Clarence Filsfils , James Neil Guichard , Keyur P. Patel , Pradosh Kumar Mohapatra
发明人： Eric C. Rosen , Clarence Filsfils , James Neil Guichard , Keyur P. Patel , Pradosh Kumar Mohapatra
IPC分类号： H04L12/24
摘要： A method is provided for generating a backup route. Here, a route and a route distinguisher type associated with the route are received and a backup route is generated based on attributes of the route. A particular backup route distinguisher type that is associated with the route distinguisher type is assigned to the backup route. The backup route with the backup route distinguisher type are then advertised. Another method is provided that identifies the backup route. When the route and its route distinguisher type are received from the advertisement, an identification is made as to whether the route distinguisher type is assigned to a backup route. The route may then be designated as a backup route based on the identification.
摘要翻译： 提供了一种用于生成备份路由的方法。 这里，接收与路由相关联的路由和路由识别器类型，并且基于路由的属性生成备份路由。 与路由识别器类型相关联的特定备份路由识别器类型被分配给备份路由。 然后通告备份路由标识符类型的备份路由。 提供了另一种标识备份路由的方法。 当从广告接收到路由和路由识别器类型时，确定路由识别器类型是否被分配给备份路由。 然后可以基于识别将路由指定为备用路由。
-
公开(公告)号：US07693047B2
公开(公告)日：2010-04-06
申请号：US11287801
申请日：2005-11-28
摘要： A novel fast reroute (FRR) technique is provided for quickly and efficiently rerouting selected types of network traffic in response to a node or link failure at the edge of a computer network. According to the technique, the network includes first and second edge devices that function as “FRR mates,” such that network traffic originally destined for one FRR mate may be quickly rerouted to the other without having to wait for conventional network convergence. When an edge device receives rerouted packets originally destined for its FRR mate, the device responds by forwarding only those rerouted packets matching the selected traffic types; rerouted packets that do not match the selected traffic types are dropped or otherwise discarded. The first and second edge devices may be statically configured as FRR mates, e.g., by a network administrator, or they may be configured to automatically detect their compatibility as FRR mates.
摘要翻译： 提供了一种新颖的快速重路由（FRR）技术，用于响应于计算机网络边缘的节点或链路故障，快速有效地重新路由所选类型的网络流量。 根据该技术，该网络包括用作“FRR配对”的第一和第二边缘设备，使得最初发往一个FRR配对的网络业务可能被快速重新路由到另一个，而不必等待传统的网络融合。 当边缘设备接收到最初发往FRR配置的重新路由的报文时，设备只通过转发与所选流量类型匹配的那些重新路由的报文进行响应; 与所选流量类型不匹配的重路由数据包将被丢弃或以其他方式丢弃。 第一和第二边缘设备可以被静态配置为FRR配对，例如由网络管理员，或者它们可以被配置为自动检测它们作为FRR配对的兼容性。
-
94.发明授权公开(公告)号：US07639688B2
公开(公告)日：2009-12-29
申请号：US11183381
申请日：2005-07-18
IPC分类号： H04L12/56
CPC分类号： H04L45/742 , H04L45/04 , H04L63/10
摘要： A method and system for protecting valuable resources within an autonomous system network. Address prefixes within the system are designated as valuable and a flag bit is associated with the address within routing tables of routers of the network. Interfaces to border routers are identified and when packets are received at those interfaces, the packets are flagged with a flag or tag bit. The destination address of the received packet is compared to the flag bit associated with the valuable resource prefix, and if the packet is directed to that resource the packet is dropped and/or logged, but the packet is not forwarded to that resource. In specific cases an interface from an external source may be configured to not create the flag or tag bit, wherein that packet will be delivered to the destination prefix of the packet.
摘要翻译： 一种用于保护自治系统网络内有价值资源的方法和系统。 系统中的地址前缀被指定为有价值的，并且标志位与网络的路由器的路由表中的地址相关联。 识别到边界路由器的接口，并且当在这些接口处接收到分组时，分组被标记为标志或标记位。 将接收到的分组的目的地地址与与有价值的资源前缀相关联的标志位进行比较，并且如果分组指向该资源，则分组被丢弃和/或记录，但是分组不被转发到该资源。 在特定情况下，来自外部源的接口可以被配置为不创建标志或标记位，其中该分组将被传递到分组的目的地前缀。
-
95.发明申请RECEIVER-BASED CONSTRUCTION OF POINT-TO-MULTIPOINT TREES USING PATH COMPUTATION ELEMENTS IN A COMPUTER NETWORK 有权使用计算机网络中的路径计算元素的基于接收器的点到多点路径的构造公开(公告)号：US20090232031A1
公开(公告)日：2009-09-17
申请号：US12045749
申请日：2008-03-11
IPC分类号： H04L12/28
摘要： 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.
摘要翻译： 在一个实施例中，检测到向计算机网络的多播组添加叶节点的触发器，并且叶节点可以确定多播组的根节点以请求隧道树和多播的叶节点之间的路径 组。 响应于具有现有树的多播组，使用计算的路径从根节点接收回复，以将叶节点添加到树的所选节点处的树。 然后可以通过所选节点处的计算路径将叶节点添加到多播组隧道树中。
-
公开(公告)号：US07535828B2
公开(公告)日：2009-05-19
申请号：US11084838
申请日：2005-03-18
CPC分类号： H04L45/28 , H04L45/04 , H04L45/502
摘要： A fast reroute (FRR) technique is implemented at the edge of a computer network. 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 backup edge device is not permitted to reroute the packets a second time. According to the inventive technique, the edge device first identifies a group one or more possible backup edge devices and then selects at least one preferred backup edge device from the group. The edge device makes its selection based on the values of one or more metrics associated with the possible backup edge devices. The metrics are input to a novel selection algorithm that selects the preferred backup edge device(s) using a hierarchical selection process or a weighted-metric selection process, or some combination thereof.
摘要翻译： 在计算机网络的边缘实现快速重路由（FRR）技术。 如果边缘设备检测到阻止其与相邻路由域通信的节点或链路故障，则边缘设备将至少一些寻址到该域的数据分组重新路由到备份边缘设备，该备份边缘设备又将分组转发到邻居 域。 备份边缘设备不允许再次重新路由数据包。 根据本发明的技术，边缘设备首先识别一个或多个可能的备份边缘设备，然后从组中选择至少一个优选的备份边缘设备。 边缘设备根据与可能的备份边缘设备相关联的一个或多个度量值进行选择。 将度量输入到新颖的选择算法，其使用分层选择过程或加权度量选择过程或其某种组合来选择优选的备份边缘设备。
-
公开(公告)号：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。
-
98.发明授权公开(公告)号：US07508829B2
公开(公告)日：2009-03-24
申请号：US11291940
申请日：2005-11-30
IPC分类号： H04L12/28
CPC分类号： H04L47/6215 , H04L45/02 , H04L45/021 , H04L45/023 , H04L45/028 , H04L45/54 , H04L45/60 , H04L47/50
摘要： A method, performed in a network packet routing element, comprises establishing a forwarding information base (FIB) lacking a hierarchical data structure but in which one or more dependent FIB entries are associated with a parent FIB entry; establishing a plurality of strict priority queues, each having an associated priority; receiving a change to the parent FIB entry; for each of the dependent FIB entries, selecting one of the queues and enqueuing the dependent FIB entries in the selected queues for re-resolution; dequeuing the dependent FIB entries for re-resolution, according to a priority order of the queues.
摘要翻译： 一种在网络分组路由选择单元中执行的方法，包括：建立一个缺少分层数据结构的转发信息库（FIB），其中一个或多个从属FIB表项与父FIB表项相关联; 建立多个严格优先级队列，每个具有相关优先权; 接收对父FIB条目的更改; 对于每个依赖FIB条目，选择一个队列并对所选队列中的依赖FIB条目进行排队以进行重新分辨; 根据队列的优先级顺序对依赖FIB条目进行队列重新分辨。
-
99.发明授权Method and apparatus for establishing adjacency for a restarting router during convergence 有权在收敛期间为重新启动的路由器建立邻接的方法和装置公开(公告)号：US07466661B1
公开(公告)日：2008-12-16
申请号：US10668655
申请日：2003-09-22
CPC分类号： H04L45/02 , H04L45/026
摘要： A method and apparatus are disclosed for establishing adjacencies on a network, the method comprising, at a first node of the network, sending hello packets on the network and receiving hello packets from other nodes on the network on the basis of the received hello packets. The node then sends a link-state packet without adjacency information and without an overload bit set. The node then interrogates a link-state adjacency table and, when only one adjacency is listed in the link-state table, sends a further link-state packet with the adjacency information and the overload bit set. On convergence of a forward cache, the node sends a further link-state packet with adjacency information and without the overload bit set.
摘要翻译： 公开了一种用于在网络上建立邻接的方法和装置，所述方法包括：在所述网络的第一节点处，在所述网络上发送hello分组，并基于所接收的hello分组从所述网络上的其他节点接收hello分组。 然后，该节点发送没有邻接信息的链路状态分组，并且没有设置过载位。 然后，节点询问链路状态邻接表，并且当在链路状态表中仅列出一个邻接关系时，发送具有邻接信息和过载比特集的另外的链路状态分组。 在转发高速缓存的收敛时，节点发送另一个具有邻接信息的链路状态分组，并且没有设置过载位。
-
公开(公告)号：US20080123532A1
公开(公告)日：2008-05-29
申请号：US11604461
申请日：2006-11-27
IPC分类号： G01R31/08
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.
摘要翻译： 在一个实施例中，节点识别到目的地的多个相等成本最佳路径，最佳路径具有一个或多个相关联的链路。 节点接收相关联链路的动态链路利用信息，并且确定到目的地的业务量，以在每个相等成本最佳路径上转发，该数量动态地依赖于每个相等成本的相关链路的动态链路利用率 最佳路径
-
-
-
-
-
-
-
-
-
搜索结果
186 条记录 (耗时 0.043 秒)
