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

1. 发明授权

US07903584B2 Technique for dynamically splitting MPLS TE-LSPs 有权
标题翻译：动态分割MPLS TE-LSP的技术
公开(公告)号：US07903584B2
公开(公告)日：2011-03-08
申请号：US11327150
申请日：2006-01-06
申请人： Jean-Philippe Vasseur , Jeff Apcar
发明人： Jean-Philippe Vasseur , Jeff Apcar
IPC分类号： H04L12/28
CPC分类号： H04L47/10 , H04L45/02 , H04L45/125 , H04L45/24 , H04L45/302 , H04L45/50 , H04L47/125
摘要： A technique dynamically splits Traffic Engineering (TE) Label Switched Paths (LSPs) in a computer network. According to the novel technique, a head-end node may determine that a TE-LSP to a destination needs to be sized to a larger bandwidth (a “larger” TE-LSP) than currently available over a single path to the destination (e.g., a path that may also be required to meet other constraints, such as cost, delay, etc.). In response, the head-end node may dynamically “split” the larger TE-LSP, and create a first split TE-LSP over a best (e.g., shortest) available path (e.g., that meets other constraints). The first split TE-LSP may reserve a maximum available bandwidth for that best available path. The head-end node may then continue recursively creating subsequent split TE-LSPs for any remaining bandwidth of the larger TE-LSP over available paths until the larger TE-LSP may no longer be split (e.g., all bandwidth has been placed, configurable maximum number of splits reached, etc.). Notably, the split TE-LSPs may be “re-groomed” at a later time to recombine and reorganize the split TE-LSPs.
摘要翻译：技术在计算机网络中动态分割流量工程（TE）标签交换路径（LSP）。根据这种新颖的技术，前端节点可以确定到目的地的TE-LSP需要被设置为比通过到达目的地的单个路径上的当前可用的较大带宽（“较大”TE-LSP）的大小（例如，，也可能需要满足其他约束（例如成本，延迟等）的路径）。作为响应，前端节点可以动态地“拆分”较大的TE-LSP，并且通过最佳（例如，最短）可用路径（例如，满足其他约束）创建第一分裂TE-LSP。第一个分离的TE-LSP可以保留最佳可用路径的最大可用带宽。然后，头端节点可以继续递归地创建用于可用路径上较大TE-LSP的任何剩余带宽的后续拆分TE-LSP，直到较大的TE-LSP可能不再被拆分（例如，已经放置了所有带宽，可配置的最大值达到的分割数等）。值得注意的是，分裂的TE-LSP可以在稍后的时间“重新整理”，以重组和重组分裂的TE-LSP。

2. 发明授权

US07945696B2 Differentiated routing using tunnels in a computer network 有权
标题翻译：在计算机网络中使用隧道的差分路由
公开(公告)号：US07945696B2
公开(公告)日：2011-05-17
申请号：US11947876
申请日：2007-11-30
申请人： Jean-Philippe Vasseur , Jeff Apcar , Jim Guichard , Robert H. Thomas
发明人： Jean-Philippe Vasseur , Jeff Apcar , Jim Guichard , Robert H. Thomas
IPC分类号： G06F15/173
CPC分类号： H04L45/04 , H04L45/02 , H04L45/30
摘要： In one embodiment, one or more tunnel mesh groups may be established in at least a portion of a computer network, where each tunnel mesh group corresponds to a differentiated routing profile. Traffic may then be received at the portion of the computer network, the traffic indicating a particular differentiated routing profile (e.g., based on a received label corresponding to the differentiated routing profile as advertised by the portion of the computer network). Accordingly, the traffic may be routed through the portion of the computer network along a tunnel of a particular tunnel mesh group corresponding to the particular differentiated routing profile traffic.
摘要翻译：在一个实施例中，可以在计算机网络的至少一部分中建立一个或多个隧道网格组，其中每个隧道网格组对应于不同的路由简档。然后可以在计算机网络的部分处接收业务，该业务指示特定差分路由配置文件（例如，基于与该计算机网络的部分所通告的差分路由配置文件对应的接收到的标签）。因此，业务可以沿着与特定差异化路由选择业务对应的特定隧道网状组的隧道路由到计算机网络的部分。

3. 发明申请

US20080205272A1 SLICED TUNNELS IN A COMPUTER NETWORK 有权
标题翻译：计算机网络中的SLIED TUNNELS
公开(公告)号：US20080205272A1
公开(公告)日：2008-08-28
申请号：US11680286
申请日：2007-02-28
申请人： Jean-Philippe Vasseur , Jeff Apcar
发明人： Jean-Philippe Vasseur , Jeff Apcar
IPC分类号： H04J3/14
CPC分类号： H04L12/4633 , H04L45/00 , H04L45/50 , H04L2212/00
摘要： In one embodiment, a sliced tunnel is signaled between a head-end node and a tail-end node. One or more fork nodes along the sliced tunnel are configured to furcate the sliced tunnel into a plurality of child tunnels of the sliced tunnel. Also, one or more merge nodes along the sliced tunnel are configured to merge a plurality of child tunnels of the sliced tunnel that intersect at the merge node.
摘要翻译：在一个实施例中，在前端节点和尾端节点之间用信号通知切片隧道。沿着切片隧道的一个或多个叉节点被配置为将切片的隧道分割成切片隧道的多个子隧道。此外，沿着切片隧道的一个或多个合并节点被配置为合并在合并节点处相交的分片隧道的多个子隧道。

4. 发明授权

US08634292B2 Sliced tunnels in a computer network 有权
标题翻译：计算机网络中的切片隧道
公开(公告)号：US08634292B2
公开(公告)日：2014-01-21
申请号：US13247548
申请日：2011-09-28
申请人： Jean-Philippe Vasseur , Jeff Apcar
发明人： Jean-Philippe Vasseur , Jeff Apcar
IPC分类号： H04J1/16
CPC分类号： H04L12/4633 , H04L45/00 , H04L45/50 , H04L2212/00
摘要： In one embodiment, a path for a sliced tunnel that extends from a head-end node to a tail-end node is computed. The sliced tunnel is furcated into a plurality of child tunnels at one or more fork nodes located downstream from the head-end node. Each child tunnel carries a portion of traffic for the sliced tunnel. The sliced tunnel is merged at one or more merge nodes located downstream from respective ones of the fork nodes. The portions of traffic on the child tunnels are aggregated at the merge nodes. The head-end node sends a signaling message to establish the sliced tunnel along the computed path. The signaling message includes an indication of the one or more fork nodes where the sliced tunnel is furcated into child tunnels and the one or more merge nodes where child tunnels are merged. The head-end node then forwards traffic onto the sliced tunnel.
摘要翻译：在一个实施例中，计算从头端节点延伸到尾端节点的切片隧道的路径。切割的隧道在位于头端节点下游的一个或多个叉节点处分割成多个子隧道。每个子隧道都携带切片隧道的一部分流量。切片隧道在位于相应叉节点下游的一个或多个合并节点处合并。子隧道上的部分流量在合并节点处聚合。头端节点发送信令消息，以沿着计算的路径建立切片隧道。所述信令消息包括所述一个或多个叉节点的指示，其中所述切片的隧道分割成子隧道，以及所述一个或多个合并节点，其中子隧道被合并。然后，头端节点将流量转发到切片隧道。

5. 发明授权

US08040797B2 Sliced tunnels in a computer network 有权
标题翻译：计算机网络中的切片隧道
公开(公告)号：US08040797B2
公开(公告)日：2011-10-18
申请号：US11680286
申请日：2007-02-28
申请人： Jean-Philippe Vasseur , Jeff Apcar
发明人： Jean-Philippe Vasseur , Jeff Apcar
IPC分类号： H04J1/16
CPC分类号： H04L12/4633 , H04L45/00 , H04L45/50 , H04L2212/00
摘要： In one embodiment, a sliced tunnel is signaled between a head-end node and a tail-end node. One or more fork nodes along the sliced tunnel are configured to furcate the sliced tunnel into a plurality of child tunnels of the sliced tunnel. Also, one or more merge nodes along the sliced tunnel are configured to merge a plurality of child tunnels of the sliced tunnel that intersect at the merge node.
摘要翻译：在一个实施例中，在头端节点和尾端节点之间用信号通知切片隧道。沿着切片隧道的一个或多个叉节点被配置为将切片的隧道分割成切片隧道的多个子隧道。此外，沿着切片隧道的一个或多个合并节点被配置为合并在合并节点处相交的分片隧道的多个子隧道。

6. 发明申请

US20120020224A1 SLICED TUNNELS IN A COMPUTER NETWORK 有权
标题翻译：计算机网络中的SLIED TUNNELS
公开(公告)号：US20120020224A1
公开(公告)日：2012-01-26
申请号：US13247548
申请日：2011-09-28
申请人： Jean-Philippe Vasseur , Jeff Apcar
发明人： Jean-Philippe Vasseur , Jeff Apcar
IPC分类号： H04L12/56 , H04L12/26
CPC分类号： H04L12/4633 , H04L45/00 , H04L45/50 , H04L2212/00
摘要： In one embodiment, a path for a sliced tunnel that extends from a head-end node to a tail-end node is computed. The sliced tunnel is furcated into a plurality of child tunnels at one or more fork nodes located downstream from the head-end node. Each child tunnel carries a portion of traffic for the sliced tunnel. The sliced tunnel is merged at one or more merge nodes located downstream from respective ones of the fork nodes. The portions of traffic on the child tunnels are aggregated at the merge nodes. The head-end node sends a signaling message to establish the sliced tunnel along the computed path. The signaling message includes an indication of the one or more fork nodes where the io sliced tunnel is furcated into child tunnels and the one or more merge nodes where child tunnels are merged. The head-end node then forwards traffic onto the sliced tunnel.
摘要翻译：在一个实施例中，计算从头端节点延伸到尾端节点的切片隧道的路径。切割的隧道在位于头端节点下游的一个或多个叉节点处分割成多个子隧道。每个子隧道都携带切片隧道的一部分流量。切片隧道在位于相应叉节点下游的一个或多个合并节点处合并。子隧道上的部分流量在合并节点处聚合。头端节点发送信令消息，以沿着计算的路径建立切片隧道。信令消息包括一个或多个叉节点的指示，其中io切片隧道分割成子隧道以及合并子隧道的一个或多个合并节点。然后，头端节点将流量转发到切片隧道。

7. 发明申请

US20090144443A1 DIFFERENTIATED ROUTING USING TUNNELS IN A COMPUTER NETWORK 有权
标题翻译：在计算机网络中使用隧道的差分路由
公开(公告)号：US20090144443A1
公开(公告)日：2009-06-04
申请号：US11947876
申请日：2007-11-30
申请人： Jean-Philippe Vasseur , Jeff Apcar , Jim Guichard , Robert H. Thomas
发明人： Jean-Philippe Vasseur , Jeff Apcar , Jim Guichard , Robert H. Thomas
IPC分类号： G06F15/16
CPC分类号： H04L45/04 , H04L45/02 , H04L45/30
摘要： In one embodiment, one or more tunnel mesh groups may be established in at least a portion of a computer network, where each tunnel mesh group corresponds to a differentiated routing profile. Traffic may then be received at the portion of the computer network, the traffic indicating a particular differentiated routing profile (e.g., based on a received label corresponding to the differentiated routing profile as advertised by the portion of the computer network). Accordingly, the traffic may be routed through the portion of the computer network along a tunnel of a particular tunnel mesh group corresponding to the particular differentiated routing profile traffic.
摘要翻译：在一个实施例中，可以在计算机网络的至少一部分中建立一个或多个隧道网格组，其中每个隧道网格组对应于不同的路由简档。然后可以在计算机网络的部分处接收业务，该业务指示特定差分路由配置文件（例如，基于与该计算机网络的部分所通告的差分路由配置文件对应的接收到的标签）。因此，业务可以沿着与特定差异化路由选择业务对应的特定隧道网状组的隧道路由到计算机网络的部分。

8. 发明申请

US20070160061A1 Technique for dynamically splitting MPLS TE-LSPs 有权
标题翻译：动态分割MPLS TE-LSP的技术
公开(公告)号：US20070160061A1
公开(公告)日：2007-07-12
申请号：US11327150
申请日：2006-01-06
申请人： Jean-Philippe Vasseur , Jeff Apcar
发明人： Jean-Philippe Vasseur , Jeff Apcar
IPC分类号： H04L12/56
CPC分类号： H04L47/10 , H04L45/02 , H04L45/125 , H04L45/24 , H04L45/302 , H04L45/50 , H04L47/125
摘要： A technique dynamically splits Traffic Engineering (TE) Label Switched Paths (LSPs) in a computer network. According to the novel technique, a head-end node may determine that a TE-LSP to a destination needs to be sized to a larger bandwidth (a “larger” TE-LSP) than currently available over a single path to the destination (e.g., a path that may also be required to meet other constraints, such as cost, delay, etc.). In response, the head-end node may dynamically “split” the larger TE-LSP, and create a first split TE-LSP over a best (e.g., shortest) available path (e.g., that meets other constraints). The first split TE-LSP may reserve a maximum available bandwidth for that best available path. The head-end node may then continue recursively creating subsequent split TE-LSPs for any remaining bandwidth of the larger TE-LSP over available paths until the larger TE-LSP may no longer be split (e.g., all bandwidth has been placed, configurable maximum number of splits reached, etc.). Notably, the split TE-LSPs may be “re-groomed” at a later time to recombine and reorganize the split TE-LSPs.
摘要翻译：技术在计算机网络中动态分割流量工程（TE）标签交换路径（LSP）。根据这种新颖的技术，前端节点可以确定到目的地的TE-LSP需要被设置为比通过到达目的地的单个路径上的当前可用的较大带宽（“较大”TE-LSP）的大小（例如，，也可能需要满足其他约束（例如成本，延迟等）的路径）。作为响应，前端节点可以动态地“拆分”较大的TE-LSP，并且通过最佳（例如，最短）可用路径（例如，满足其他约束）创建第一分裂TE-LSP。第一个分离的TE-LSP可以保留最佳可用路径的最大可用带宽。然后，头端节点可以继续递归地创建用于可用路径上较大TE-LSP的任何剩余带宽的后续拆分TE-LSP，直到较大的TE-LSP可能不再被拆分（例如，已经放置了所有带宽，可配置的最大值达到的分割数等）。值得注意的是，分裂的TE-LSP可以在稍后的时间“重新整理”，以重组和重组分裂的TE-LSP。

9. 发明授权

US09319962B2 Local path repair in a wireless deterministic network 有权
标题翻译：无线确定性网络中的本地路径修复
公开(公告)号：US09319962B2
公开(公告)日：2016-04-19
申请号：US14043974
申请日：2013-10-02
申请人： Patrick Wetterwald , Jean-Philippe Vasseur , Pascal Thubert
发明人： Patrick Wetterwald , Jean-Philippe Vasseur , Pascal Thubert
IPC分类号： H04W40/04 , H04W72/04 , H04W40/34 , H04W40/38 , H04L12/721 , H04L12/707 , H04L12/703
CPC分类号： H04W40/04 , H04L45/12 , H04L45/22 , H04L45/28 , H04W40/34 , H04W40/38 , H04W72/0446 , Y02D70/144 , Y02D70/32
摘要： In one embodiment, an initial path is established in a wireless deterministic network between a source and a destination through one or more intermediate nodes, which are typically informed of a required metric between the source and the destination for communicating a packet. The initial path is locally (e.g., without contacting a path computation engine) reconfigured to bypass at least one of the intermediate nodes creating a new path, with the new path meeting the requirement(s) of the metric. Note, “locally reconfiguring” refers to the network nodes themselves determining a replacement path without reliance on a path computation engine or other entity (e.g., network management system, operating support system) in determining the replacement path. In one embodiment, a network node not on the initial path replaces a node on the initial path while using the same receive and send timeslots used in the initial path.
摘要翻译：在一个实施例中，通过一个或多个中间节点在源和目的地之间的无线确定性网络中建立初始路径，所述中间节点通常被通知源和目的地之间用于传送分组的所需度量。初始路径在本地（例如，不接触路径计算引擎）被重新配置为绕过创建新路径的至少一个中间节点，新路径满足度量的要求。注意，“本地重新配置”是指网络节点本身在不依赖路径计算引擎或其他实体（例如，网络管理系统，操作支持系统））确定替换路径时确定替换路径。在一个实施例中，不在初始路径上的网络节点替换初始路径上的节点，同时使用在初始路径中使用的相同的接收和发送时隙。

10. 发明授权

US09306831B2 Technique for efficient load balancing of TE-LSPs 有权
标题翻译： TE-LSP高效负载均衡技术
公开(公告)号：US09306831B2
公开(公告)日：2016-04-05
申请号：US11057641
申请日：2005-02-14
申请人： Jean-Philippe Vasseur
发明人： Jean-Philippe Vasseur
IPC分类号： H04L12/26 , G06F15/173 , H04L12/701 , H04L12/707 , H04L12/723
CPC分类号： H04L45/00 , H04L45/24 , H04L45/502
摘要： A technique efficiently load balances traffic engineering (TE) label switched paths (LSPs) from a head-end node to a tail-end node of a computer network. The novel load balancing technique identifies (e.g., at the head-end node or a path computation element, PCE) a set of paths with equal costs from the head-end node to the tail-end node, where each path of the set is composed of one or more associated links. “Link values” such as, e.g., the number of unconstrained TE-LSPs on the link, the amount of available bandwidth on the link, or the percent of total available bandwidth already in use on the link, are applied to each link of each path. The most restrictive link values (link availability) of each path of the set, such as, e.g., the link with the lowest amount of available bandwidth, etc., are then compared. Upon comparing the link availability, the novel technique load balances established and/or new TE-LSPs from the head-end node to the tail-end node over the set of paths accordingly.
摘要翻译：技术有效地将流量工程（TE）标签交换路径（LSP）从头端节点负载平衡到计算机网络的尾端节点。新颖的负载平衡技术在头端节点到尾端节点识别（例如，在头端节点或路径计算元件PCE）具有相同成本的路径集合，其中集合的每个路径为由一个或多个相关联的链接组成。 “链路值”例如链路上的无约束TE-LSP的数量，链路上的可用带宽的数量或链路上已经使用的总可用带宽的百分比被应用于每个链路的每个链路路径。然后比较集合的每个路径的最严格的链路值（链路可用性），例如具有最低可用带宽量的链路等。在比较链路可用性时，新技术相应地通过该组路径从前端节点到尾端节点建立和/或新的TE-LSP平衡。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式