-
51.发明申请Technique for efficiently determining acceptable link-based loop free alternates in a computer network 有权用于有效地确定计算机网络中可接受的基于链路的无循环交替的技术公开(公告)号：US20080008104A1
公开(公告)日：2008-01-10
申请号：US11481350
申请日：2006-07-05
IPC分类号： H04L12/28
摘要： A technique efficiently determines acceptable link-based loop free alternates (LFAS) in a computer network. According to the novel technique, a protecting network device configured to protect a link (“protected link”) distinguishes other network devices (e.g., of the same domain as the protecting network device) as either network edge devices (i.e., an end point for external network traffic) or network core devices (i.e., not an end point for external network traffic). The protecting network device may then determine whether a neighboring network device loops toward a network edge device. If not, the protecting network device may determine that the neighboring network device is an acceptable LFA (e.g., for external network traffic). Notably, traffic directed to core devices may still loop, however, this traffic is generally internal (e.g., signaling) traffic, and may not be subject to the same operational constraints (e.g., protection) as external traffic.
摘要翻译： 一种技术有效地确定计算机网络中可接受的基于链路的无环交替（LFAS）。 根据该新技术，被配置为保护链路（“受保护链路”）的保护网络设备与网络边缘设备（即，用于保护网络设备的终点 外部网络流量）或网络核心设备（即，不是外部网络流量的终点）。 保护网络设备然后可以确定相邻网络设备是否循环到网络边缘设备。 如果不是，保护网络设备可以确定相邻网络设备是可接受的LFA（例如，用于外部网络业务）。 值得注意的是，指向核心设备的业务可能仍然循环，然而，该业务通常是内部（例如，信令）业务，并且可能不会受到与外部业务相同的操作限制（例如，保护）。
-
52.发明授权Computation of a shortest inter-domain TE-LSP across a set of autonomous systems 有权跨一组自治系统计算最短域间TE-LSP公开(公告)号：US07814227B2
公开(公告)日：2010-10-12
申请号：US11073348
申请日：2005-03-04
IPC分类号： G06F15/173
摘要： A technique calculates a shortest path for a traffic engineering (TE) label switched path (LSP) from a head-end node in a local domain to a tail-end node of a remote domain in a computer network. The novel path calculation technique determines a set of different remote domains through which the TE-LSP may traverse to reach the tail-end node (e.g., along “domain routes”). Once the set of possible routes is determined, the head-end node sends a path computation request to one or more path computation elements (PCEs) of its local domain requesting a computed path for each domain route. Upon receiving path responses for each possible domain route, the head-end node selects the optimal (shortest) path, and establishes the TE-LSP accordingly.
摘要翻译： 一种技术计算从本地域中的头端节点到计算机网络中远程域的尾端节点的流量工程（TE）标签交换路径（LSP）的最短路径。 新颖的路径计算技术确定了一组不同的远程域，TE-LSP可以通过该组来遍历尾端节点（例如沿着“域路由”）。 一旦确定了可能的路由集合，则前端节点向其本地域的一个或多个路径计算元件（PCE）发送路径计算请求，请求每个域路由的计算路径。 在接收每个可能的域路由的路径响应时，前端节点选择最优（最短）路径，并相应建立TE-LSP。
-
53.发明申请DYNAMIC PATH COMPUTATION ELEMENT LOAD BALANCING WITH BACKUP PATH COMPUTATION ELEMENTS 有权动态路径计算元件负载平衡与备用路径计算元件公开(公告)号：US20100146149A1
公开(公告)日：2010-06-10
申请号：US12706567
申请日：2010-02-16
IPC分类号： G06F15/173 , H04L12/56
CPC分类号： H04L47/10 , H04L45/02 , H04L45/04 , H04L45/22 , H04L45/28 , H04L45/42 , H04L47/125 , H04L63/0272 , H04L2212/00
摘要： In one embodiment, one or more path computation requests from path computation clients (PCCs) in a first network domain are received at a first border router (BR) arranged at the border of the first network domain and a second network domain. The first BR learns of a path communication element (PCE) in the second network domain. The PCE in the second network domain is informed of path computation information for the first network domain. One or more tunnels are established between the first BR and the PCE in the second network domain. One or more path computation requests from PCCs in the first network domain are passed from the first BR, through the one or more tunnels, to the PCE in the second network domain, to be serviced by the PCE in the second network domain using the path computation information for the first network domain.
摘要翻译： 在一个实施例中，在布置在第一网络域和第二网络域的边界处的第一边界路由器（BR）处接收来自第一网络域中的路径计算客户端（PCC）的一个或多个路径计算请求。 第一个BR学习第二个网络域中的路径通信元素（PCE）。 第二网域的PCE通知第一网域的路径计算信息。 在第二网络域中的第一BR和PCE之间建立一个或多个隧道。 来自第一网络域中的PCC的一个或多个路径计算请求从第一BR通过一个或多个隧道传递到第二网络域中的PCE，以由第二网络中的PCE使用路径 第一网域的计算信息。
-
54.发明申请DYNAMIC PATH COMPUTATION ELEMENT LOAD BALANCING WITH BACKUP PATH COMPUTATION ELEMENTS 有权动态路径计算元件负载平衡与备用路径计算元件公开(公告)号：US20090182894A1
公开(公告)日：2009-07-16
申请号：US12013096
申请日：2008-01-11
IPC分类号： G06F15/173
CPC分类号： H04L47/10 , H04L45/02 , H04L45/04 , H04L45/22 , H04L45/28 , H04L45/42 , H04L47/125 , H04L63/0272 , H04L2212/00
摘要： In one embodiment, a first path computation element (PCE) operates between first and second network domains, and is adapted to service requests from path computation clients (PCCs) in at least the first domain. In response to a backup event (e.g., failure of a second PCE), a backup PCE in the second domain may be informed of path computation information for the first domain used by the first PCE, and tunnels may be bi-directionally established between the first PCE and the backup PCE. Once the tunnels are established, the backup PCE may be advertised into the first domain, and the backup PCE may operate to load balance service requests for the first domain through the bi-directionally established tunnels.
摘要翻译： 在一个实施例中，第一路径计算元件（PCE）在第一和第二网络域之间操作，并且适于在至少第一域中对来自路径计算客户端（PCC）的请求进行服务。 响应于备份事件（例如，第二PCE的故障），可以向第二域中的备用PCE通知第一PCE使用的第一域的路径计算信息，并且隧道可以在第二域之间双向建立 第一个PCE和备份PCE。 一旦建立了隧道，备用PCE可以被通告到第一域，并且备份PCE可以通过双向建立的隧道来操作以对第一域的业务请求进行负载平衡。
-
55.发明授权Border router protection with backup tunnel stitching in a computer network 有权边缘路由器保护，在计算机网络中备份隧道缝合公开(公告)号：US07512063B2
公开(公告)日：2009-03-31
申请号：US11012044
申请日：2004-12-14
IPC分类号： H04J3/14
CPC分类号： H04L45/22 , H04L45/02 , H04L45/04 , H04L45/28 , H04L45/50 , H04L47/70 , H04L47/724 , H04L47/728 , H04L47/746 , H04L47/825
摘要： A technique protects against the failure of a border router between two domains in a computer network using Fast Reroute and backup tunnels. According to the technique, the protected border router advertises a list of all its adjacent next-hop routers (i.e., its “neighbors”). A neighbor in the first domain that is immediately upstream to the protected border router and that is configured to protect the border router (i.e., the “protecting router”) selects a neighbor in a second domain (i.e., a “next-next-hop,” NNHOP) to act as a “merge point” of all the NNHOPs of that domain. The protecting router calculates a backup tunnel to the merge point that excludes the protected border router and associates the backup tunnel with all “protected prefixes.” The merge point then “stitches” additional backup tunnels onto the backup tunnel to provide a stitched tunnel to each remaining NNHOP. When the protected border router fails, Fast Reroute is triggered, and all protected prefix traffic is rerouted onto the backup tunnel to the merge point, which either forwards the traffic to its reachable prefixes or to a corresponding stitched tunnel.
摘要翻译： 一种技术可以防止计算机网络中使用快速重路由和备份隧道的两个域之间的边界路由器发生故障。 根据该技术，受保护的边界路由器通告其所有相邻的下一跳路由器（即其“邻居”）的列表。 紧邻受保护边界路由器上游并被配置为保护边界路由器（即，“保护路由器”）的第一域中的邻居选择第二域中的邻居（即，下一跳） ，“NNHOP”）作为该域的所有NNHOP的“合并点”。 保护路由器计算到合并点的备用隧道，排除受保护的边界路由器，并将备份隧道与所有“受保护的前缀”相关联。 合并点然后将其他备用隧道“缝合”到备份隧道上，为每个剩余的NNHOP提供缝合隧道。 当受保护的边界路由器发生故障时，快速重路由被触发，并且所有保护的前缀流量被重新路由到到合并点的备份隧道，该合并点将流量转发到其可达到的前缀或相应的缝合隧道。
-
公开(公告)号：US20080225711A1
公开(公告)日：2008-09-18
申请号：US11685837
申请日：2007-03-14
IPC分类号： H04J3/14
摘要： In one embodiment, a node receives traffic sent from one or more sources toward one or more destinations (e.g., Multipoint-to-Point, MP2P traffic). The node may detect a burst of received traffic based on one or more characteristics of the burst traffic, and, in response, may dynamically apply traffic shaping to the burst traffic. The traffic shaping is adapted to forward burst traffic received below a configurable threshold at a configurable pace and to drop burst traffic received above the configurable threshold. In addition, the node may also store the burst traffic dropped by traffic shaping, and forwards the stored burst traffic toward its destination after a configurable delay.
摘要翻译： 在一个实施例中，节点接收从一个或多个源向一个或多个目的地（例如，多点到点，MP2P业务）发送的业务。 节点可以基于突发业务的一个或多个特性来检测接收到的流量的突发，并且作为响应，可以动态地将流量整形应用于突发业务。 流量整形适于以可配置的速度转发在可配置的阈值以下接收的突发流量，并且将接收到高于可配置阈值的突发流量丢弃。 此外，节点还可以存储由流量整形丢失的突发流量，并且在可配置的延迟之后将存储的突发业务转发到其目的地。
-
公开(公告)号：US07460481B2
公开(公告)日：2008-12-02
申请号：US11001459
申请日：2004-12-01
IPC分类号： H04L12/26
CPC分类号： H04L47/825 , H04L45/02 , H04L45/04 , H04L45/28 , H04L45/502 , H04L47/70 , H04L47/724 , H04L47/785
摘要： A technique propagates reachability information for a tail-end node of a traffic engineering (TE) label switched path (LSP) to a head-end node of the TE-LSP in a computer network. The TE-LSP preferably spans multiple domains of the network such that the tail-end node resides in a domain that is different (remote) from the domain of the head-end node. The inter-domain information propagation technique employs an Interior Gateway Protocol (IGP) to transmit the remote reachability information from a target node residing in the same domain as the tail-end node to the head-end node. The head-end node uses the remote information to calculate routes, i.e., address prefixes and associated attributes, reachable from the tail-end node for insertion into its routing table.
摘要翻译： 一种技术将流量工程（TE）标签交换路径（LSP）的尾端节点的可达性信息传播到计算机网络中的TE-LSP的前端节点。 TE-LSP优选地跨越网络的多个域，使得尾端节点驻留在与头端节点的域不同（远程）的域中。 域间信息传播技术采用内部网关协议（IGP）来将远程可达性信息从驻留在与尾端节点相同的域中的目标节点传送到头端节点。 前端节点使用远程信息来计算从尾端节点可到达其路由表的路由，即地址前缀和相关联的属性。
-
58.发明申请Technique for efficiently avoiding transient routing disturbances in link state routing protocols with link state packet fragmentation 有权用于有效地避免链路状态路由协议中具有链路状态分组碎片的瞬时路由干扰的技术公开(公告)号：US20070286091A1
公开(公告)日：2007-12-13
申请号：US11449282
申请日：2006-06-08
CPC分类号： H04L45/02
摘要： A technique efficiently avoids transient routing disturbances in link state routing protocols with fragmented link state packets (LSPs) in a computer network. According to the novel technique, a link state router (LSR) specifies which of two or more links are to be advertised in each of two or more corresponding LSP fragments. The LSR advertises the states of the specified links in the corresponding LSP fragments to one or more other LSRs. In other words, each link of the LSR is assigned to a particular LSP fragment, and the state of the link is always to be advertised in that particular LSP fragment (i.e., no fragment wrapping). Upon receiving the LSP fragments, the other LSRs may update the correct link states based on the individual LSP fragments, i.e., without transient routing disturbances caused by fragment wrapping.
摘要翻译： 一种技术有效地避免了在计算机网络中具有分段链路状态分组（LSP）的链路状态路由协议中的瞬时路由干扰。 根据新技术，链路状态路由器（LSR）规定两个或多个对应的LSP片段中的每一个中要发布两条或多条链路中的哪条链路。 LSR将对应的LSP片段中指定链路的状态通告给一个或多个其他LSR。 换句话说，LSR的每个链路被分配给特定的LSP片段，并且链路的状态总是在该特定LSP片段中通告（即，没有片段包装）。 在接收到LSP片段时，其他LSR可以基于各个LSP片段来更新正确的链路状态，即没有由片段包装引起的瞬时路由干扰。
-
59.发明授权Propagation of routing information in RSVP-TE for inter-domain TE-LSPs 有权在RSVP-TE中进行域间TE-LSP的路由信息的传播公开(公告)号：US08549176B2
公开(公告)日：2013-10-01
申请号：US11001349
申请日：2004-12-01
IPC分类号： G06F15/173 , H04L12/28 , H04L12/56
CPC分类号： H04L45/507 , H04L45/00 , H04L45/04 , H04L45/50
摘要： A technique dynamically retrieves reachability information from a target node, including a tail-end or any intermediate node, along a traffic engineering (TE) label switched path (LSP) that spans multiple domains in a computer network. The interdomain information retrieval technique is illustratively based on a request/response signaling exchange whereby at least a portion of the reachability, i.e., routing, information maintained by the target node is propagated to a head-end node of the TE-LSP. The routing information may comprise a list of address prefixes reachable by the target node, but may optionally include next-hop and metric attributes associated with those prefixes. The head-end node uses the retrieved routing information to calculate routes reachable from the target node for insertion into its routing table.
摘要翻译： 一种技术从跨越计算机网络中的多个域的流量工程（TE）标签交换路径（LSP）动态地从目标节点（包括尾端或任何中间节点）检索可达性信息。 域间信息检索技术说明性地基于请求/响应信令交换，由此目的节点维护的可达性即路由信息的至少一部分被传播到TE-LSP的头端节点。 路由信息可以包括目标节点可达到的地址前缀的列表，但是可以可选地包括与这些前缀相关联的下一跳和度量属性。 前端节点使用检索到的路由信息来计算从目标节点可到达的路由，以插入其路由表。
-
公开(公告)号：US08077607B2
公开(公告)日：2011-12-13
申请号：US11685837
申请日：2007-03-14
IPC分类号： H04J1/16
摘要： In one embodiment, a node receives traffic sent from one or more sources toward one or more destinations (e.g., Multipoint-to-Point, MP2P traffic). The node may detect a burst of received traffic based on one or more characteristics of the burst traffic, and, in response, may dynamically apply traffic shaping to the burst traffic. The traffic shaping is adapted to forward burst traffic received below a configurable threshold at a configurable pace and to drop burst traffic received above the configurable threshold. In addition, the node may also store the burst traffic dropped by traffic shaping, and forwards the stored burst traffic toward its destination after a configurable delay.
摘要翻译： 在一个实施例中，节点接收从一个或多个源向一个或多个目的地（例如，多点到点，MP2P业务）发送的业务。 节点可以基于突发业务的一个或多个特性来检测接收到的流量的突发，并且作为响应，可以动态地将流量整形应用于突发业务。 流量整形适于以可配置的速度转发在可配置的阈值以下接收的突发流量，并且将接收到高于可配置阈值的突发流量丢弃。 此外，节点还可以存储由流量整形丢失的突发流量，并且在可配置的延迟之后将存储的突发业务转发到其目的地。
-
-
-
-
-
-
-
-
-
搜索结果
63 条记录 (耗时 0.031 秒)
