专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US07701940B2 Inter-domain point-to-multipoint path computation in a computer network 有权
标题翻译：计算机网络中的域间点对多点路径计算
公开(公告)号：US07701940B2
公开(公告)日：2010-04-20
申请号：US11684313
申请日：2007-03-09
申请人： Stefano Novello , Jean-Philippe Vasseur
发明人： Stefano Novello , Jean-Philippe Vasseur
IPC分类号： H04L12/28 , H04L12/16 , H04L12/46
CPC分类号： H04L45/04 , H04L47/11
摘要： 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路径。

2. 发明授权

US08477629B2 Relaxed constrained shortest path first (R-CSPF) 有权
标题翻译：轻松约束最短路径（R-CSPF）
公开(公告)号：US08477629B2
公开(公告)日：2013-07-02
申请号：US13197540
申请日：2011-08-03
申请人： Jean-Philippe Vasseur , Stefano Novello , Steve Y. Chiu
发明人： Jean-Philippe Vasseur , Stefano Novello , Steve Y. Chiu
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.
摘要翻译：在一个实施例中，配置用于受约束路径的目标带宽，较低带宽边界约束和上限成本边界约束。计算一组路径，其具有在较低带宽边界约束内的带宽和在上限成本边界约束内的成本。确定该组路径中的一个或多个路径是否具有提供至少目标带宽的带宽，如果是，则具有至少提供目标带宽的具有带宽的路径组中的一个或多个路径的路径被选择用作约束路径，并且如果不是，则具有不具有至少提供具有最接近目标带宽的带宽的目标带宽的带宽的集合的一个或多个路径的路径被选择为使用作为约束路径

3. 发明授权

US08194546B2 Traffic flow determination in communications networks 有权
标题翻译：通信网络中的流量确定
公开(公告)号：US08194546B2
公开(公告)日：2012-06-05
申请号：US10554047
申请日：2005-02-14
申请人： Jean-Philippe Vasseur , Eric Osborne , Josh Singer , Stefano Novello , Helmut Matthias Simonis
发明人： Jean-Philippe Vasseur , Eric Osborne , Josh Singer , Stefano Novello , Helmut Matthias Simonis
IPC分类号： G01R31/08 , H04L12/28
CPC分类号： H04L45/10 , H04L45/50 , H04L45/52
摘要： A method of determining traffic paths between one or more source-destination node pairs in a communications network, comprising starting from a first set of paths between said source-destination node pairs, determining a second set of paths between said source-destination node pairs while taking into account a set of constraints, such that said second set of paths emulates said first set of paths.
摘要翻译：一种确定通信网络中一个或多个源 - 目的地节点对之间的业务路径的方法，包括从所述源 - 目的地节点对之间的第一组路径开始，确定所述源 - 目的地节点对之间的第二组路径，考虑一组约束，使得所述第二组路径模拟所述第一组路径。

4. 发明授权

US08014291B2 Relaxed constrained shortest path first (R-CSPF) 有权
标题翻译：轻松约束最短路径（R-CSPF）
公开(公告)号：US08014291B2
公开(公告)日：2011-09-06
申请号：US11605013
申请日：2006-11-28
申请人： Jean-Philippe Vasseur , Stefano Novello , Steve Y. Chiu
发明人： Jean-Philippe Vasseur , Stefano Novello , Steve Y. Chiu
IPC分类号： H04J1/16
CPC分类号： H04L45/00 , H04L45/124 , H04L45/125
摘要： In one embodiment, a target bandwidth, a lower boundary constraint on bandwidth, and an upper boundary constraint on cost are configured on a path computation device. The device may then compute a set of paths that is within the lower bandwidth boundary and upper cost boundary constraints. If the set of paths contains one or more paths, the device may select a path having a bandwidth value that is closest to the target bandwidth. However if the set of paths contains no paths, the device may search amongst paths that violate either the maximum cost or minimum bandwidth limits, selecting the path closest to the violated constraint (e.g., whose combined violation is minimized). Also, a weighting factor may be configured to establish the relative importance for a cost violation in comparison to a bandwidth violation.
摘要翻译：在一个实施例中，在路径计算设备上配置目标带宽，带宽下边界约束和成本上限约束。然后，设备可以计算处于较低带宽边界内的一组路径和上限成本边界约束。如果路径集合包含一个或多个路径，则设备可以选择具有最接近目标带宽的带宽值的路径。然而，如果路径集合不包含路径，则设备可以在违反最大成本或最小带宽限制的路径中搜索，选择最接近违反约束的路径（例如，其组合违例被最小化）。此外，加权因子可以被配置为与带宽违规相比建立成本违规的相对重要性。

5. 发明申请

US20080198755A1 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
申请人： Jean-Philippe Vasseur , Stefano Novello
发明人： Jean-Philippe Vasseur , Stefano Novello
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).
摘要翻译：在一个实施例中，路由节点（例如，头端节点）确定路由选择的隧道（例如，重新路由）的愿望，并且计算所选择的隧道的路径。路由节点探测路径以发现关于通过路由（例如，多个隧道）路由选择的隧道将被移位的隧道的信息，并且相应地基于关于隧道的信息来确定是否建立所选择的隧道流离失所在另一个实施例中，沿着所选择的隧道的探测路径的中间节点可以接收请求关于将被所选择的隧道移位的隧道的信息的探测器（例如，信令消息）。作为响应，每个中间节点将关于要在中间节点移位的隧道的信息插入到探测器中，并且将探测器（例如，朝着启动探测器的路由节点）转发。

6. 发明授权

US08199658B2 OAM tools for meshed tunnels in a computer network 有权
标题翻译：用于计算机网络中网状隧道的OAM工具
公开(公告)号：US08199658B2
公开(公告)日：2012-06-12
申请号：US12048390
申请日：2008-03-14
申请人： Jean-Philippe Vasseur , Stefano Novello
发明人： Jean-Philippe Vasseur , Stefano Novello
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节点。示例性地，一旦在其发起节点处接收到探测器，并且响应于确定起始节点是仅用于探测隧道的头端节点，隧道网格探测器已经探测了隧道网格的所有隧道。

7. 发明授权

US08189482B2 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
申请人： Jean-Philippe Vasseur , Stefano Novello
发明人： Jean-Philippe Vasseur , Stefano Novello
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).
摘要翻译：在一个实施例中，路由节点（例如，头端节点）确定路由选择的隧道（例如，重新路由）的愿望，并且计算所选择的隧道的路径。路由节点探测路径以发现关于通过路由（例如，多个隧道）路由选择的隧道将被移位的隧道的信息，并且相应地基于关于隧道的信息来确定是否建立所选择的隧道流离失所在另一个实施例中，沿着所选择的隧道的探测路径的中间节点可以接收请求关于将被所选择的隧道移位的隧道的信息的探测器（例如，信令消息）。作为响应，每个中间节点将关于要在中间节点移位的隧道的信息插入到探测器中，并且将探测器（例如，朝着启动探测器的路由节点）转发。

8. 发明申请

US20110286336A1 RELAXED CONSTRAINED SHORTEST PATH FIRST (R-CSPF) 有权
标题翻译：放松约束最短路径（R-CSPF）
公开(公告)号：US20110286336A1
公开(公告)日：2011-11-24
申请号：US13197540
申请日：2011-08-03
申请人： Jean-Philippe Vasseur , Stefano Novello , Steve Y. Chiu
发明人： Jean-Philippe Vasseur , Stefano Novello , Steve Y. Chiu
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.
摘要翻译：在一个实施例中，配置用于受约束路径的目标带宽，较低带宽边界约束和上限成本边界约束。计算一组路径，其具有在较低带宽边界约束内的带宽和在上限成本边界约束内的成本。确定该组路径中的一个或多个路径是否具有提供至少目标带宽的带宽，如果是，则具有至少提供目标带宽的具有带宽的路径组中的一个或多个路径的路径被选择用作约束路径，并且如果不是，则具有不具有至少提供具有最接近目标带宽的带宽的目标带宽的带宽的集合的一个或多个路径的路径被选择为使用作为约束路径

9. 发明申请

US20090232003A1 OAM TOOLS FOR MESHED TUNNELS IN A COMPUTER NETWORK 有权
标题翻译：用于计算机网络中的MESHED TUNNELS的OAM工具
公开(公告)号：US20090232003A1
公开(公告)日：2009-09-17
申请号：US12048390
申请日：2008-03-14
申请人： Jean-Philippe Vasseur , Stefano Novello
发明人： Jean-Philippe Vasseur , Stefano Novello
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节点。示例性地，一旦在其发起节点处接收到探测器，并且响应于确定起始节点是仅用于探测隧道的头端节点，隧道网格探测器已经探测了隧道网格的所有隧道。

10. 发明申请

US20080219272A1 INTER-DOMAIN POINT-TO-MULTIPOINT PATH COMPUTATION IN A COMPUTER NETWORK 有权
标题翻译：计算机网络中的域间点到多点路径计算
公开(公告)号：US20080219272A1
公开(公告)日：2008-09-11
申请号：US11684313
申请日：2007-03-09
申请人： Stefano Novello , Jean-Philippe Vasseur
发明人： Stefano Novello , Jean-Philippe Vasseur
IPC分类号： H04L12/56
CPC分类号： H04L45/04 , H04L47/11
摘要： 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路径。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式