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

1. 发明授权

US08369213B2 Optimization of distributed tunnel rerouting in a computer network with path computation at an intermediate node 有权
标题翻译：在具有中间节点的路径计算的计算机网络中优化分布式隧道重路由
公开(公告)号：US08369213B2
公开(公告)日：2013-02-05
申请号：US11676675
申请日：2007-02-20
申请人： Jean-Philippe Vasseur , Francois Le Faucheur , Anna Charny
发明人： Jean-Philippe Vasseur , Francois Le Faucheur , Anna Charny
IPC分类号： H04L12/28
CPC分类号： H04L45/00 , H04L12/4633 , H04L12/5691 , H04L45/22 , H04L45/28 , H04L45/50
摘要： In one embodiment, an intermediate node computes paths for a set of tunnels that do not include a particular link (e.g., and possibly a scaled-down bandwidth for each tunnel), considering all of the tunnels of the set. The intermediate node informs head-end nodes of the tunnels of the computed paths (e.g., and scaled bandwidth) and/or a time to reroute the tunnels.
摘要翻译：在一个实施例中，考虑到该集合的所有隧道，中间节点计算不包括特定链路（例如，并且可能地，每个隧道的按比例缩小的带宽）的一组隧道的路径。中间节点通知计算出的路径的隧道的头端节点（例如和缩放的带宽）和/或重新路由隧道的时间。

2. 发明授权

US07660254B2 Optimization of distributed tunnel rerouting in a computer network with coordinated head-end node path computation 有权
标题翻译：在具有协调的头端节点路径计算的计算机网络中优化分布式隧道重路由
公开(公告)号：US07660254B2
公开(公告)日：2010-02-09
申请号：US11676582
申请日：2007-02-20
申请人： Jean-Philippe Vasseur , Francois Le Faucheur , Anna Charny
发明人： Jean-Philippe Vasseur , Francois Le Faucheur , Anna Charny
IPC分类号： H04L12/26
CPC分类号： H04L45/00 , H04L12/4633 , H04L45/22 , H04L45/28 , H04L45/302
摘要： In one embodiment, head-end nodes receive a list of tunnels to be rerouted from a particular link of an intermediate node. If a head-end node is unable to reroute a tunnel for which it is the head-end node using conventional distributed routing, each head-end node executes the same algorithm to compute paths for all tunnels in the list (e.g., potentially applying bandwidth scaling).
摘要翻译：在一个实施例中，头端节点接收要从中间节点的特定链路重新路由的隧道列表。如果头端节点不能使用常规分布式路由重新路由作为头端节点的隧道，则每个头端节点执行相同的算法来计算列表中所有隧道的路径（例如，潜在地应用带宽缩放）。

3. 发明申请

US20080151756A1 OPTIMIZATION OF DISTRIBUTED TUNNEL REROUTING IN A COMPUTER NETWORK WITH COORDINATED HEAD-END NODE PATH COMPUTATION 有权
标题翻译：在具有协调的头端节点计算的计算机网络中分布式隧道改造的优化
公开(公告)号：US20080151756A1
公开(公告)日：2008-06-26
申请号：US11676582
申请日：2007-02-20
申请人： Jean-Philippe Vasseur , Francois Le Faucheur , Anna Charny
发明人： Jean-Philippe Vasseur , Francois Le Faucheur , Anna Charny
IPC分类号： G06F11/00
CPC分类号： H04L45/00 , H04L12/4633 , H04L45/22 , H04L45/28 , H04L45/302
摘要： In one embodiment, head-end nodes receive a list of tunnels to be rerouted from a particular link of an intermediate node. If a head-end node is unable to reroute a tunnel for which it is the head-end node using conventional distributed routing, each head-end node executes the same algorithm to compute paths for all tunnels in the list (e.g., potentially applying bandwidth scaling).
摘要翻译：在一个实施例中，头端节点接收要从中间节点的特定链路重新路由的隧道列表。如果头端节点不能使用常规分布式路由重新路由作为头端节点的隧道，则每个头端节点执行相同的算法来计算列表中所有隧道的路径（例如，潜在地应用带宽缩放）。

4. 发明授权

US07693055B2 Optimization of distributed tunnel rerouting in a computer network with intermediate node feedback 有权
标题翻译：在具有中间节点反馈的计算机网络中优化分布式隧道重路由
公开(公告)号：US07693055B2
公开(公告)日：2010-04-06
申请号：US11676614
申请日：2007-02-20
申请人： Jean-Philippe Vasseur , Francois Le Faucheur , Anna Charny
发明人： Jean-Philippe Vasseur , Francois Le Faucheur , Anna Charny
IPC分类号： H04L12/26
CPC分类号： H04L45/22 , H04L12/4633 , H04L45/04 , H04L45/28 , H04L45/302 , H04L45/50
摘要： In one embodiment, a head-end node determines a path for un-reroutable tunnels, and establishes a tunnel having zero bandwidth indicating the corresponding bandwidth desired for the tunnel. Intermediate nodes send feedback regarding a bandwidth scaling factor for the path, and the head-end node resizes each tunnel accordingly.
摘要翻译：在一个实施例中，头端节点确定不可重新路由的隧道的路径，并且建立具有指示隧道所需的相应带宽的零带宽的隧道。中间节点发送关于路径的带宽缩放因子的反馈，并且头端节点相应地调整每个隧道的大小。

5. 发明申请

US20080151933A1 OPTIMIZATION OF DISTRIBUTED TUNNEL REROUTING IN A COMPUTER NETWORK WITH INTERMEDIATE NODE FEEDBACK 有权
标题翻译：在具有中间节点反馈的计算机网络中分布式隧道转发优化
公开(公告)号：US20080151933A1
公开(公告)日：2008-06-26
申请号：US11676614
申请日：2007-02-20
申请人： Jean-Philippe Vasseur , Francois Le Faucheur , Anna Charny
发明人： Jean-Philippe Vasseur , Francois Le Faucheur , Anna Charny
IPC分类号： G06F11/00
CPC分类号： H04L45/22 , H04L12/4633 , H04L45/04 , H04L45/28 , H04L45/302 , H04L45/50
摘要： In one embodiment, a head-end node determines a path for un-reroutable tunnels, and establishes a tunnel having zero bandwidth indicating the corresponding bandwidth desired for the tunnel. Intermediate nodes send feedback regarding a bandwidth scaling factor for the path, and the head-end node resizes each tunnel accordingly.
摘要翻译：在一个实施例中，头端节点确定不可重新路由的隧道的路径，并且建立具有指示隧道所需的相应带宽的零带宽的隧道。中间节点发送关于路径的带宽缩放因子的反馈，并且头端节点相应地调整每个隧道的大小。

6. 发明申请

US20080151746A1 OPTIMIZATION OF DISTRIBUTED TUNNEL REROUTING IN A COMPUTER NETWORK WITH PATH COMPUTATION AT AN INTERMEDIATE NODE 有权
标题翻译：计算机网络中分布式隧道路由优化与中间节点路径计算
公开(公告)号：US20080151746A1
公开(公告)日：2008-06-26
申请号：US11676675
申请日：2007-02-20
申请人： Jean-Philippe Vasseur , Francois Le Faucheur , Anna Charny
发明人： Jean-Philippe Vasseur , Francois Le Faucheur , Anna Charny
IPC分类号： G06F11/00
CPC分类号： H04L45/00 , H04L12/4633 , H04L12/5691 , H04L45/22 , H04L45/28 , H04L45/50
摘要： In one embodiment, an intermediate node computes paths for a set of tunnels that do not include a particular link (e.g., and possibly a scaled-down bandwidth for each tunnel), considering all of the tunnels of the set. The intermediate node informs head-end nodes of the tunnels of the computed paths (e.g., and scaled bandwidth) and/or a time to reroute the tunnels.
摘要翻译：在一个实施例中，考虑到该集合的所有隧道，中间节点计算不包括特定链路（例如，并且可能地，每个隧道的按比例缩小的带宽）的一组隧道的路径。中间节点通知计算出的路径的隧道的头端节点（例如和缩放的带宽）和/或重新路由隧道的时间。

7. 发明授权

US08429291B2 Protection of network flows during congestion in a communications network 有权
标题翻译：在通信网络拥塞期间保护网络流
公开(公告)号：US08429291B2
公开(公告)日：2013-04-23
申请号：US12592047
申请日：2009-11-18
申请人： John Evans , Francois Le Faucheur , Anna Charny , Xinyang Zhang
发明人： John Evans , Francois Le Faucheur , Anna Charny , Xinyang Zhang
IPC分类号： G06F15/16
CPC分类号： H04L47/32 , H04L47/12 , H04L47/2441 , H04L47/6215
摘要： In one embodiment, an apparatus includes a processor for mapping packets associated with network flows to policy profiles independent of congestion level at the apparatus, and enforcing the policy profiles for the packets based on a congestion state. Packets associated with the same network flow are mapped to the same policy profile and at least some of the network flows are protected during network congestion. The apparatus further includes memory for storing the policy profiles. A method for protecting network flows during network congestion is also disclosed.
摘要翻译：在一个实施例中，一种设备包括处理器，用于将与网络流相关联的分组映射到独立于设备处的拥塞级别的策略简档，以及基于拥塞状态来执行分组的策略简档。与相同网络流相关联的数据包被映射到相同的策略配置文件，并且在网络拥塞期间至少有一些网络流量受到保护。该装置还包括用于存储策略简档的存储器。还公开了一种在网络拥塞期间保护网络流的方法。

8. 发明授权

US08437253B2 Control of preemption-based beat-down effect 有权
标题翻译：控制抢占的打败效果
公开(公告)号：US08437253B2
公开(公告)日：2013-05-07
申请号：US12791476
申请日：2010-06-01
申请人： Anna Charny , Francois Le Faucheur
发明人： Anna Charny , Francois Le Faucheur
IPC分类号： G01R31/08
CPC分类号： H04L47/10 , H04L47/11 , H04L47/29 , H04L47/31
摘要： In one embodiment, a node determines an overload ratio for an output as a ratio of a total rate of received traffic at the output to a preemption threshold of the output. The node also determines a ratio of traffic that is to be marked at the output based on the overload ratio and a ratio of previously marked traffic destined for the output from each input to the total traffic from each input to the output, and whether, for a particular input, the ratio of previously marked traffic is less than the ratio of traffic that is to be marked at the output. If so, the node marks unmarked traffic of the particular input corresponding to a difference between the ratio of traffic that is to be marked at the output and the ratio of previously marked traffic destined for the output from the particular input.
摘要翻译：在一个实施例中，节点将输出的过载比确定为输出端的接收业务的总速率与输出的抢占阈值的比率。该节点还根据过载比以及从每个输入到每个输入到每个输入的总流量的先前标记的流量的比率确定要在输出处标记的流量的比率，以及是否特定的输入，先前标记的流量的比例小于在输出端被标记的流量的比率。如果是，则该节点标记特定输入的未标记的业务，其对应于要在输出处标记的业务量的比率与去往特定输入的输出的先前标记的业务量之间的差。

9. 发明授权

US07738382B2 Hierarchical multi-rate multi-precedence policer 有权
标题翻译：分层多速率多优先策略器
公开(公告)号：US07738382B2
公开(公告)日：2010-06-15
申请号：US11019915
申请日：2004-12-21
申请人： Francois Le Faucheur , Anna Charny , Sandeep Bajaj
发明人： Francois Le Faucheur , Anna Charny , Sandeep Bajaj
IPC分类号： H04J1/16 , H04J3/14 , H04L1/00
CPC分类号： H04L47/10 , H04L47/20 , H04L47/215 , H04L47/2416 , H04L47/31 , H04L47/32 , H04L47/41
摘要： A hierarchical multi-rate multi-precedence policer is disclosed. The policer discards packets based on assigned precedence levels. When traffic exceeds an available service rate, the policer drops packets of lower precedence levels to make room for packets of higher precedence levels. In certain implementations, the policer also guarantees bandwidth to each level, thus preventing complete loss of lower precedence traffic when there is a large amount of higher precedence traffic.
摘要翻译：公开了一种分级多速率多优先策略器。监管者根据分配的优先级丢弃数据包。当流量超过可用服务速率时，策略者丢弃优先级较低的报文，为优先级较高的报文提供空间。在某些实现中，策略器还保证每个级别的带宽，从而在存在大量较高优先级流量时防止较低优先级流量的完全丢失。

10. 发明申请

US20080112316A1 Hash-based preemption 有权
标题翻译：基于哈希的抢占
公开(公告)号：US20080112316A1
公开(公告)日：2008-05-15
申请号：US11598475
申请日：2006-11-13
申请人： Anna Charny , Francois Le Faucheur
发明人： Anna Charny , Francois Le Faucheur
IPC分类号： H04L12/26
CPC分类号： H04L12/66 , H04L47/12 , H04L47/2441 , H04L47/31 , H04L47/32
摘要： Methods and systems for preemption in a network having a core device with at least one egress interface are disclosed. In one embodiment, the method includes performing flow-based hash utilizing a plurality of hash-buckets each set to a first state or a second state and computing a load based on a rate measurement that excludes flows which hash into hash-buckets having a state set to the second state. The computed load is compared to a preemption threshold and if the computed load exceeds the preemption threshold, the state of at least one of the hash-buckets is changed from the first state to the second state. An action, such as dropping all packets or marking all packets, is performed on flows hashing in a hash-bucket in the second state.
摘要翻译：公开了具有具有至少一个出口接口的核心设备的网络中用于抢占的方法和系统。在一个实施例中，该方法包括使用多个哈希桶来执行基于流的散列，每个哈希桶被设置为第一状态或第二状态，并且基于速率测量来计算负载，所述速率测量将哈希散列到具有状态的哈希桶中的流设置到第二个状态。将计算出的负载与抢占阈值进行比较，并且如果计算出的负载超过抢占阈值，则至少一个哈希桶的状态从第一状态改变到第二状态。对于处于第二状态的哈希桶中的流哈希，执行诸如丢弃所有数据包或标记所有数据包的动作。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式