-
1.发明申请PROBING-BASED MECHANISM TO REDUCE PREEMPTION PERTURBATION CAUSED BY HIGHER PRIORITY TUNNEL ESTABLISHMENT IN A COMPUTER NETWORK 有权基于计算机网络的高优先级隧道造成的基于机制的减少预防措施公开(公告)号：US20080198755A1
公开(公告)日：2008-08-21
申请号：US11676868
申请日：2007-02-20
IPC分类号： H04L12/28
CPC分类号： H04L45/12 , H04L45/02 , H04L45/22 , H04L47/70 , H04L47/805 , H04L47/825
摘要： In one embodiment, a routing node (e.g., a head-end node) determines a desire to route a selected tunnel (e.g., reroute), and computes a path for the selected tunnel. The routing node probes the path to discover information about tunnels that would be displaced by the selected tunnel if routed over the path (e.g., a number of tunnels), and correspondingly determines whether to establish the selected tunnel based on the information about the tunnels to be displaced. In another embodiment, intermediate nodes along the probed path of the selected tunnel may receive a probe (e.g., signaling message) requesting information about the tunnels that would be displaced by the selected tunnel. In response, each intermediate node inserts the information about the tunnels to be displaced at the intermediate node into the probe, and forwards the probe (e.g., toward the routing node initiating the probe).
摘要翻译： 在一个实施例中，路由节点（例如，头端节点）确定路由选择的隧道（例如，重新路由）的愿望，并且计算所选择的隧道的路径。 路由节点探测路径以发现关于通过路由（例如，多个隧道）路由选择的隧道将被移位的隧道的信息，并且相应地基于关于隧道的信息来确定是否建立所选择的隧道 流离失所 在另一个实施例中，沿着所选择的隧道的探测路径的中间节点可以接收请求关于将被所选择的隧道移位的隧道的信息的探测器（例如，信令消息）。 作为响应，每个中间节点将关于要在中间节点移位的隧道的信息插入到探测器中，并且将探测器（例如，朝着启动探测器的路由节点）转发。
-
公开(公告)号：US20060171316A1
公开(公告)日：2006-08-03
申请号：US10548997
申请日：2004-04-02
摘要： There is provided a traffic placement method in a communications network, the communications network comprising a plurality of nodes, the nodes being connected to one another by links, the method comprising selecting a (possibly non-strict) subset from a given set of traffic flow demands and calculating a plurality of paths for the selected demands under consideration of a set of constraints using an algorithm hybridisation combining backtrack search with local consistency techniques (BT+CS) and guiding search by the use of one or more probe generators, that is, search techniques that solve a routing sub-problem or an arbitrary relaxation of the traffic placement problem. By using a hybrid algorithm that integrates other solvers (search techniques) into BT+CS through the use of probe generators, a more powerful search strategy can be achieved compared to BT+CS or the individual search techniques.
摘要翻译： 在通信网络中提供了一种业务布置方法，所述通信网络包括多个节点，所述节点通过链路彼此连接，所述方法包括从给定的业务流集合中选择（可能非严格）的子集 在使用利用本地一致性技术（BT + CS）组合回溯搜索的算法杂交和通过使用一个或多个探测发生器引导搜索的情况下，考虑一组约束来考虑所选择的需求并计算多个路径， 搜索技术解决路由子问题或任意放宽交通布置问题。 通过使用通过使用探头发生器将其他求解器（搜索技术）集成到BT + CS中的混合算法，与BT + CS或单独的搜索技术相比，可以实现更强大的搜索策略。
-
3.发明授权公开(公告)号：US07701940B2
公开(公告)日：2010-04-20
申请号：US11684313
申请日：2007-03-09
摘要： In one embodiment, distributed path computation elements (PCEs) collaboratively build local portions of an inter-domain P2MP path to each path destination or to each ingress border router of one or more respective successor domains based on a cost associated with using one or more local ingress border routers received from each predecessor domain. Once a furthest destination is reached, each PCE may recursively return a list of local ingress border routers used in the P2MP path to each predecessor domain, where each PCE receiving the list correspondingly prunes segments of its computed local portion of the P2MP path that lead to unused successor ingress border routers, and sends a prune message to its predecessor domains accordingly. A root PCE receives the final prune message(s) and a representation of each locally computed portion of the inter-domain P2MP path, and combines the portions into a final inter-domain P2MP path.
摘要翻译： 在一个实施例中，基于与使用一个或多个本地的相关联的成本，分布式路径计算元件（PCE）协作地构建到每个路径目的地的域间P2MP路径的本地部分或一个或多个相应后继域的每个入口边界路由器 从每个前身域收到的入口边界路由器。 一旦达到最远的目的地，每个PCE可以递归地将在P2MP路径中使用的本地进入边界路由器的列表返回到每个前导域，其中接收列表的每个PCE相应地减少其计算出的P2MP路径的本地部分的段， 未使用的后继入口边界路由器，并相应地向其前身域发送剪枝消息。 根PCE接收最终的修剪消息和域间P2MP路径的每个本地计算的部分的表示，并将这些部分组合成最终的域间P2MP路径。
-
公开(公告)号：US07693061B2
公开(公告)日：2010-04-06
申请号：US10548997
申请日：2004-04-02
IPC分类号： G01R31/08 , H04J3/02 , G06F15/173
摘要： There is provided a traffic placement method in a communications network, the communications network comprising a plurality of nodes, the nodes being connected to one another by links, the method comprising selecting a (possibly non-strict) subset from a given set of traffic flow demands and calculating a plurality of paths for the selected demands under consideration of a set of constraints using an algorithm hybridization combining backtrack search with local consistency techniques (BT+CS) and guiding search by the use of one or more probe generators, that is, search techniques that solve a routing sub-problem or an arbitrary relaxation of the traffic placement problem. By using a hybrid algorithm that integrates other solvers (search techniques) into BT+CS through the use of probe generators, a more powerful search strategy can be achieved compared to BT+CS or the individual search techniques.
摘要翻译： 在通信网络中提供了一种业务布置方法，所述通信网络包括多个节点，所述节点通过链路彼此连接，所述方法包括从给定的业务流集合中选择（可能非严格）的子集 使用使用本地一致性技术（BT + CS）组合回溯搜索的算法杂交并且通过使用一个或多个探测发生器引导搜索来考虑一组约束来考虑所选择的需求并计算多个路径， 搜索技术解决路由子问题或任意放宽交通布置问题。 通过使用通过使用探头发生器将其他求解器（搜索技术）集成到BT + CS中的混合算法，与BT + CS或单独的搜索技术相比，可以实现更强大的搜索策略。
-
公开(公告)号：US08199658B2
公开(公告)日：2012-06-12
申请号：US12048390
申请日：2008-03-14
IPC分类号： G01R31/06
CPC分类号： H04L12/4633
摘要： In one embodiment, a tunnel mesh probe, initiated for a computer network having a tunnel mesh, may be received at a first tail-end node of a probed tunnel. In response, the first tail-end node processes the probe, and forwards the probe to another tail-end node of a non-probed tunnel selected from a plurality of tunnels of the tunnel mesh for which the first tail-end node is a head-end node. Illustratively, once the probe is received at its initiating node, and in response to determining that the initiating node is a head-end node for only probed tunnels, the tunnel mesh probe is completed, having probed all tunnels of the tunnel mesh.
摘要翻译： 在一个实施例中，可以在探测隧道的第一尾端节点处接收针对具有隧道网格的计算机网络启动的隧道网格探针。 作为响应，第一尾端节点处理探测器，并将探测转发到从第一尾端节点为头的隧道网格的多个隧道中选择的非探测隧道的另一个尾端节点 -end节点。 示例性地，一旦在其发起节点处接收到探测器，并且响应于确定起始节点是仅用于探测隧道的头端节点，隧道网格探测器已经探测了隧道网格的所有隧道。
-
6.发明授权Probing-based mechanism to reduce preemption perturbation caused by higher priority tunnel establishment in a computer network 有权基于探测的机制，减少计算机网络中优先级较高的隧道建立引起的抢占扰动公开(公告)号：US08189482B2
公开(公告)日：2012-05-29
申请号：US11676868
申请日：2007-02-20
IPC分类号： H04L12/26
CPC分类号： H04L45/12 , H04L45/02 , H04L45/22 , H04L47/70 , H04L47/805 , H04L47/825
摘要： In one embodiment, a routing node (e.g., a head-end node) determines a desire to route a selected tunnel (e.g., reroute), and computes a path for the selected tunnel. The routing node probes the path to discover information about tunnels that would be displaced by the selected tunnel if routed over the path (e.g., a number of tunnels), and correspondingly determines whether to establish the selected tunnel based on the information about the tunnels to be displaced. In another embodiment, intermediate nodes along the probed path of the selected tunnel may receive a probe (e.g., signaling message) requesting information about the tunnels that would be displaced by the selected tunnel. In response, each intermediate node inserts the information about the tunnels to be displaced at the intermediate node into the probe, and forwards the probe (e.g., toward the routing node initiating the probe).
摘要翻译： 在一个实施例中，路由节点（例如，头端节点）确定路由选择的隧道（例如，重新路由）的愿望，并且计算所选择的隧道的路径。 路由节点探测路径以发现关于通过路由（例如，多个隧道）路由选择的隧道将被移位的隧道的信息，并且相应地基于关于隧道的信息来确定是否建立所选择的隧道 流离失所 在另一个实施例中，沿着所选择的隧道的探测路径的中间节点可以接收请求关于将被所选择的隧道移位的隧道的信息的探测器（例如，信令消息）。 作为响应，每个中间节点将关于要在中间节点移位的隧道的信息插入到探测器中，并且将探测器（例如，朝着启动探测器的路由节点）转发。
-
公开(公告)号：US08077713B2
公开(公告)日：2011-12-13
申请号：US11853610
申请日：2007-09-11
摘要： In an example embodiment, a multicast tree is accessed. The multicast tree defines one or more destination label switch routers and paths from a source label switch router to the destination label switch routers. Multicast addresses are then transmitted to the destination label switch routers. In an example embodiment, upon receipt of the multicast addresses, a request to update the multicast tree is transmitted. The request includes the identifier of the label switch router that originated the request.
摘要翻译： 在示例实施例中，访问多播树。 多播树定义了一个或多个目标标签交换路由器和从源标签交换路由器到目标标签交换路由器的路径。 然后将多播地址发送到目标标签交换路由器。 在示例实施例中，在接收到多播地址时，发送更新多播树的请求。 该请求包括发起请求的标签交换路由器的标识符。
-
公开(公告)号：US20110286336A1
公开(公告)日：2011-11-24
申请号：US13197540
申请日：2011-08-03
IPC分类号： H04L12/26
CPC分类号： H04L45/00 , H04L45/124 , H04L45/125
摘要： In one embodiment, a target bandwidth, a lower bandwidth boundary constraint, and an upper cost boundary constraint for a constrained path are configured. A set of paths are computed that have bandwidth within the lower bandwidth boundary constraint and cost within the upper cost boundary constraint. A determination is made whether one or more paths of the set of paths has bandwidth that provides at least the target bandwidth and, if so, a path from the one or more paths of the set of paths having bandwidth that provides at least the target bandwidth is selected to use as the constrained path, and, if not, a path from the one or more paths of the set having bandwidth that does not provide at least the target bandwidth that has bandwidth closest to the target bandwidth is selected to use as the constrained path.
摘要翻译： 在一个实施例中，配置用于受约束路径的目标带宽，较低带宽边界约束和上限成本边界约束。 计算一组路径，其具有在较低带宽边界约束内的带宽和在上限成本边界约束内的成本。 确定该组路径中的一个或多个路径是否具有提供至少目标带宽的带宽，如果是，则具有至少提供目标带宽的具有带宽的路径组中的一个或多个路径的路径 被选择用作约束路径，并且如果不是，则具有不具有至少提供具有最接近目标带宽的带宽的目标带宽的带宽的集合的一个或多个路径的路径被选择为使用作为 约束路径
-
公开(公告)号：US20090232003A1
公开(公告)日：2009-09-17
申请号：US12048390
申请日：2008-03-14
IPC分类号： H04L1/14
CPC分类号： H04L12/4633
摘要： In one embodiment, a tunnel mesh probe, initiated for a computer network having a tunnel mesh, may be received at a first tail-end node of a probed tunnel. In response, the first tail-end node processes the probe, and forwards the probe to another tail-end node of a non-probed tunnel selected from a plurality of tunnels of the tunnel mesh for which the first tail-end node is a head-end node. Illustratively, once the probe is received at its initiating node, and in response to determining that the initiating node is a head-end node for only probed tunnels, the tunnel mesh probe is completed, having probed all tunnels of the tunnel mesh.
摘要翻译： 在一个实施例中，可以在探测隧道的第一尾端节点处接收针对具有隧道网格的计算机网络启动的隧道网格探针。 作为响应，第一尾端节点处理探测器，并将探测转发到从第一尾端节点为头的隧道网格的多个隧道中选择的非探测隧道的另一个尾端节点 -end节点。 示例性地，一旦在其发起节点处接收到探测器，并且响应于确定起始节点是仅用于探测隧道的头端节点，隧道网格探测器已经探测了隧道网格的所有隧道。
-
公开(公告)号：US08477629B2
公开(公告)日：2013-07-02
申请号：US13197540
申请日：2011-08-03
IPC分类号： H04J1/16
CPC分类号： H04L45/00 , H04L45/124 , H04L45/125
摘要： In one embodiment, a target bandwidth, a lower bandwidth boundary constraint, and an upper cost boundary constraint for a constrained path are configured. A set of paths are computed that have bandwidth within the lower bandwidth boundary constraint and cost within the upper cost boundary constraint. A determination is made whether one or more paths of the set of paths has bandwidth that provides at least the target bandwidth and, if so, a path from the one or more paths of the set of paths having bandwidth that provides at least the target bandwidth is selected to use as the constrained path, and, if not, a path from the one or more paths of the set having bandwidth that does not provide at least the target bandwidth that has bandwidth closest to the target bandwidth is selected to use as the constrained path.
摘要翻译： 在一个实施例中，配置用于受约束路径的目标带宽，较低带宽边界约束和上限成本边界约束。 计算一组路径，其具有在较低带宽边界约束内的带宽和在上限成本边界约束内的成本。 确定该组路径中的一个或多个路径是否具有提供至少目标带宽的带宽，如果是，则具有至少提供目标带宽的具有带宽的路径组中的一个或多个路径的路径 被选择用作约束路径，并且如果不是，则具有不具有至少提供具有最接近目标带宽的带宽的目标带宽的带宽的集合的一个或多个路径的路径被选择为使用作为 约束路径
-
-
-
-
-
-
-
-
-
搜索结果
18 条记录 (耗时 0.015 秒)
