-
公开(公告)号：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.
-
公开(公告)号：US20080225852A1
公开(公告)日：2008-09-18
申请号：US11725157
申请日：2007-03-15
IPC分类号： H04L12/56
CPC分类号： H04L45/50 , H04L12/4633 , H04L45/04
摘要： A system receives a packet at a first node. The packet is destined for a second node. The system identifies a full routing node from a plurality of network devices. The full routing node is capable of providing routing information for each of the nodes within the plurality of network devices. The plurality of network devices comprises a subset of nodes, and a subset of full routing nodes. The subset of nodes is not capable of providing routing information for each of the nodes within the plurality of network devices. The system transmits the packet to the full routing node for future transmission to the second node.
摘要翻译： 系统在第一节点处接收分组。 数据包将发往第二个节点。 该系统从多个网络设备中识别完整的路由节点。 完整路由节点能够为多个网络设备内的每个节点提供路由信息。 多个网络设备包括节点的子集，以及完整路由节点的子集。 节点的子集不能为多个网络设备内的每个节点提供路由信息。 系统将数据包发送到完整路由节点，以便将来传输到第二个节点。
-
公开(公告)号：US08077721B2
公开(公告)日：2011-12-13
申请号：US11725157
申请日：2007-03-15
IPC分类号： H04L12/28
CPC分类号： H04L45/50 , H04L12/4633 , H04L45/04
摘要： A system receives a packet at a first node. The packet is destined for a second node. The system identifies a full routing node from a plurality of network devices. The full routing node is capable of providing routing information for each of the nodes within the plurality of network devices. The plurality of network devices comprises a subset of nodes, and a subset of full routing nodes. The subset of nodes is not capable of providing routing information for each of the nodes within the plurality of network devices. The system transmits the packet to the full routing node for future transmission to the second node.
摘要翻译： 系统在第一节点处接收分组。 数据包将发往第二个节点。 该系统从多个网络设备中识别完整的路由节点。 完整路由节点能够为多个网络设备内的每个节点提供路由信息。 多个网络设备包括节点的子集，以及完整路由节点的子集。 节点的子集不能为多个网络设备内的每个节点提供路由信息。 系统将数据包发送到完整路由节点，以便将来传输到第二个节点。
-
5.发明授权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可以在特定时间内确定隧道在业务简档内的布置。
-
公开(公告)号：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的所有者 由特定设备拥有。
-
7.发明授权Inter-domain signaling to update remote path computation elements after a call set-up failure 有权呼叫建立失败后更新远程路径计算元素的域间信令公开(公告)号：US08817591B2
公开(公告)日：2014-08-26
申请号：US13524168
申请日：2012-06-15
CPC分类号： H04L41/12 , H04L45/04 , H04L45/22 , H04L45/28 , H04L45/50 , H04L47/724 , H04L47/785 , H04L47/825
摘要： In one embodiment, a router in a non-originating domain receives a signal to establish a tunnel, the signal having an identification (ID) of an originating path computation element (PCE) of an originating domain from where the signal to establish the tunnel originated. In response to determining that establishment of the tunnel fails, the router may signal the failure of the establishment to a local PCE of the non-originating domain, the signaling indicating the ID of the originating PCE to cause the local PCE to provide updated routing information of the non-originating domain to the originating PCE.
摘要翻译： 在一个实施例中，非起始域中的路由器接收建立隧道的信号，该信号具有始发域的始发路径计算元件（PCE）的标识（ID），其中建立隧道的信号源自 。 响应于确定隧道的建立失败，路由器可以将建立的失败信号发送到非始发域的本地PCE，该信令指示发起PCE的ID，以使本地PCE提供更新的路由信息 的非始发域到原始PCE。
-
8.发明申请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.
摘要翻译： 在一个实施例中，一旦检测到主隧道的备用隧道的使用的激活，则可以确定备用隧道的路径的拥塞级别。 响应于该级别大于阈值，主隧道的前端节点被触发以重新路由主隧道（例如，请求到路径计算元件）。 相反，响应级别不大于阈值，允许备份隧道保持激活。
-
公开(公告)号：US20070047469A1
公开(公告)日：2007-03-01
申请号：US11210910
申请日：2005-08-24
IPC分类号： H04L12/28
CPC分类号： H04L45/12 , H04L45/02 , H04L45/028 , H04L45/28 , H04L45/302 , H04L45/50
摘要： A technique performs an efficient constrained shortest path first (CSPF) optimization of Traffic Engineering (TE) Label Switched Paths (LSPs) in a computer network. The novel CSPF technique is triggered upon the detection of an event in the computer network that could create a more optimal path, such as, e.g., a new or restored network element or increased path resources. Once the novel CSPF technique is triggered, the computing node (e.g., a head-end node of the TE-LSP or a Path Computation Element, PCE) determines the set of nodes adjacent to the event, and further determines which of those adjacent nodes are within the TE-LSP (“attached nodes”). The computing node performs a CSPF computation rooted at the closest attached node to determine whether a new computed path cost is less than a current path cost (e.g., by a configurable amount), and if so, triggers optimization of the TE-LSP along the new path.
摘要翻译： 一种技术在计算机网络中执行流量工程（TE）标签交换路径（LSP）的有效约束最短路径优先（CSPF）优化。 检测到计算机网络中可能产生更为优化的路径（例如，新的或恢复的网络元件或增加的路径资源）的事件触发了新的CSPF技术。 一旦新颖的CSPF技术被触发，计算节点（例如，TE-LSP的头端节点或路径计算元件PCE）确定与事件相邻的节点集合，并进一步确定那些相邻节点中的哪一个 在TE-LSP（“附属节点”）内。 计算节点执行根据最接近的附加节点的CSPF计算，以确定新的计算路径开销是否小于当前路径开销（例如，通过可配置的量），如果是，则触发TE-LSP沿着 新途径
-
10.发明申请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带宽适配到任何接收到的重定向业务 。
-
-
-
-
-
-
-
-
-
搜索结果
436 条记录 (耗时 0.035 秒)
