-
71.发明申请System and method for dynamically responding to event-based traffic redirection 有权用于动态响应基于事件的流量重定向的系统和方法公开(公告)号：US20060291391A1
公开(公告)日：2006-12-28
申请号：US11168694
申请日：2005-06-27
CPC分类号： H04L45/22 , H04L45/02 , H04L45/28 , H04L47/70 , H04L47/746 , H04L47/762 , H04L47/825 , H04L47/829
摘要： A technique dynamically resizes Traffic Engineering (TE) Label Switched Paths (LSPs) at a head-end node of the TE-LSPs in preparation to receive redirected traffic in response to an event in a computer network. The novel dynamic TE-LSP resizing technique is based on the detection of an event in the network that could cause traffic destined for one or more other (“remote”) head-end nodes of one or more TE-LSPs to be redirected to an event-detecting (“local”) head-end node of one or more TE-LSPs. An example of such a traffic redirection event is failure of a remote head-end node or failure of any of its TE-LSPs. Specifically, the local head-end node maintains TE-LSP steady state sampling and resizing frequencies to adapt the bandwidth of its TE-LSP(s) to gradual changes in the network over time. Upon detection of an event identifying possible traffic redirection, the local head-end node enters a Fast Resize (FR) state, in which the sampling and resizing frequencies are increased to quickly adapt the TE-LSP bandwidth(s) to any received redirected traffic.
摘要翻译： 技术动态地调整TE-LSP的头端节点处的流量工程（TE）标签交换路径（LSP），准备响应于计算机网络中的事件接收重定向的流量。 新型动态TE-LSP调整大小技术基于网络中可能导致一个或多个TE-LSP的一个或多个其他（“远程”）头端节点的流量被重定向到的事件的检测 一个或多个TE-LSP的事件检测（“本地”）头端节点。 这种流量重定向事件的示例是远程头端节点的故障或其任何TE-LSP的故障。 具体来说，本地前端节点维护TE-LSP稳态采样和调整频率，以适应其TE-LSP的带宽随时间逐渐变化的网络。 在检测到识别可能的业务重定向的事件时，本地前端节点进入快速调整大小（FR）状态，其中增加采样和调整大小频率以快速地将TE-LSP带宽适配到任何接收到的重定向业务 。
-
公开(公告)号：US20060262735A1
公开(公告)日：2006-11-23
申请号：US11135600
申请日：2005-05-23
IPC分类号： H04L12/28
CPC分类号： H04L45/507 , H04L12/66 , H04L45/04
摘要： A system and method are provided for separately distributing edge-device labels and routing information across routing areas of a computer network. Because the edge-device labels are distributed separately from network routing information, the process of distributing the edge-device labels does not preclude conventional edge-device address summarizations. Illustratively, a novel “label mapping” LSA is employed for distributing the edge-device labels across routing areas. The label-mapping LSA may be embodied as an area-scope OSPF opaque LSA (type 10) or an IS-IS LSP containing TLVs of area scope. Advantageously, the present invention is generally applicable whenever label values are allocated to edge devices in a multi-area computer network and data is “tunneled” through the network from one edge device to another.
-
公开(公告)号：US20060209682A1
公开(公告)日：2006-09-21
申请号：US11084838
申请日：2005-03-18
IPC分类号： H04L1/00
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.
-
公开(公告)号：US20060193248A1
公开(公告)日：2006-08-31
申请号：US11068081
申请日：2005-02-28
申请人： Clarence Filsfils , David Ward , Stefano Previdi , Jean-Philippe Vasseur , Jim Guichard , Robert Raszuk
发明人： Clarence Filsfils , David Ward , Stefano Previdi , Jean-Philippe Vasseur , Jim Guichard , Robert Raszuk
摘要： A local fast reroute (FRR) technique is implemented at the edge of a computer 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. The backup edge device identifies protected data packets as those which contain a predetermined “service” label in their MPLS label stacks. In other words, the service label is used as an identifier for packets that have been FRR rerouted. Upon receiving a data packet containing a service label, 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）技术在计算机网络的边缘实现。 根据该技术，如果边缘设备检测到阻止其与相邻路由域通信的节点或链路故障，则边缘设备将至少一些寻址到该域的数据分组重新路由到备用边缘设备， 将数据包转发到相邻域。 重新路由的数据包在被转发到备份边缘设备之前被指定为“保护”（即重新路由）数据分组。 备份边缘设备将受保护的数据包标识为在其MPLS标签堆栈中包含预定“服务”标签的数据包。 换句话说，服务标签被用作已被FRR重新路由的数据包的标识符。 在接收到包含服务标签的数据分组时，不允许备份边缘设备第二次重新路由该分组，例如响应于另一个域间节点或链路故障，从而防止在网络边缘发展的环路 。
-
公开(公告)号：US20060164975A1
公开(公告)日：2006-07-27
申请号：US11046163
申请日：2005-01-26
摘要： 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.
-
公开(公告)号：US20060126496A1
公开(公告)日：2006-06-15
申请号：US11010225
申请日：2004-12-10
申请人： Clarence Filsfils , Stefano Previdi , John Scudder , David Ward , Jean-Philippe Vasseur , Jim Guichard
发明人： Clarence Filsfils , Stefano Previdi , John Scudder , David Ward , Jean-Philippe Vasseur , Jim Guichard
IPC分类号： H04L12/26
摘要： 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.
-
77.发明申请公开(公告)号：US20060098657A1
公开(公告)日：2006-05-11
申请号：US10982641
申请日：2004-11-05
IPC分类号： H04L12/56
摘要： A technique retrieves computed path segments across one or more domains of a computer network in accordance with a stateful (“semi-stateful”) path computation element (PCE) model. The stateful PCE model includes a data structure configured to store one or more path segments computed by a PCE in response to a path computation request issued by a Path Computation Client (PCC). Notably, each computed path segment stored in the data structure is identified by an associated path-key value (“path key”). The path segment and path key contents of the data structure are temporarily saved (“cached”) at a predetermined location in the network for a configurable period of time.
-
公开(公告)号：US07031262B2
公开(公告)日：2006-04-18
申请号：US10848744
申请日：2004-05-19
IPC分类号： H04L12/26
CPC分类号： H04L45/12 , H04L45/04 , H04L45/125 , H04L45/42 , H04L45/44 , H04L45/50 , H04L45/70 , H04L47/125 , H04L47/762 , H04L47/822 , H04L47/825
摘要： A mechanism to alleviate bandwidth fragmentation in a network employing path computation element(s) to place MPLS Traffic Engineering tunnels. One application is a multiple Autonomous System or multiple area network employing distributed computation of MPLS Traffic Engineering LSPs. A particular path computation element may determine that bandwidth fragmentation is present based on monitoring of path computation failures where desired paths are blocked due to bandwidth constraints. In response to the detected bandwidth fragmentation condition, the path computation element floods a routing notification within its Autonomous System or area. Nodes respond to the routing notification by requesting reoptimization of their own previously requested Traffic Engineering LSPs allowing the path computation element an opportunity to alleviate bandwidth fragmentation.
摘要翻译： 一种减轻使用路径计算元素的网络中带宽分段的放置MPLS流量工程隧道的机制。 一个应用是采用MPLS流量工程LSP的分布式计算的多自治系统或多区域网络。 特定路径计算元件可以基于由于带宽限制阻止期望路径的路径计算失败的监视来确定存在带宽分段。 响应于检测到的带宽分段条件，路径计算元件在其自治系统或区域内泛洪路由通知。 节点通过请求重新优化自己先前请求的流量工程LSP来响应路由通知，允许路径计算元素减轻带宽分段的机会。
-
公开(公告)号：US10299265B2
公开(公告)日：2019-05-21
申请号：US15275542
申请日：2016-09-26
IPC分类号： H04W72/04 , H04J3/16 , H04L12/721 , H04L12/26 , H04W40/02
摘要： In one embodiment, a network of nodes is configured to communicate according to a configuration of a vertical ladder topology as well as monitoring communication in the network, and/or selectively controls whether or not provisioned particular links will be used. One embodiment colors nodes of the network (e.g., a wireless deterministic network) along different paths through the network and marks packets with the color of each traversed node to track a path taken by a packet. One embodiment sends a particular packet through the network and marks over which links the packet traverses and aggregates these traversed links of other copies of the particular packet. One embodiment controls whether or not the provisioned time slots are used based on flooding a control packet through the network with enable or disable information for each of these links.
-
公开(公告)号：US09462040B2
公开(公告)日：2016-10-04
申请号：US13313817
申请日：2011-12-07
CPC分类号： H04L65/1073 , G06F17/30551 , H04L67/10 , H04L67/18
摘要： In one embodiment, a router operating in a hierarchically routed computer network may receive collected data from one or more hierarchically lower devices in the network (e.g., hierarchically lower sensors or routers). The collected data may then be converted to aggregated metadata according to a dynamic schema, and the aggregated metadata is stored at the router. The aggregated metadata may also be transmitted to one or more hierarchically higher routers in the network. Queries may then be served by the router based on the aggregated metadata, accordingly.
摘要翻译： 在一个实施例中，在分层路由的计算机网络中操作的路由器可以从网络中的一个或多个分层较低的设备接收收集的数据（例如，分层较低的传感器或路由器）。 所收集的数据然后可以根据动态模式被转换成聚合的元数据，并且聚合的元数据被存储在路由器处。 聚合的元数据也可以被发送到网络中的一个或多个分层更高的路由器。 因此，路由器可以根据汇总的元数据来进行查询。
-
-
-
-
-
-
-
-
-
搜索结果
452 条记录 (耗时 0.029 秒)
