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

1. 发明授权

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.
摘要翻译：公开了一种分级多速率多优先策略器。监管者根据分配的优先级丢弃数据包。当流量超过可用服务速率时，策略者丢弃优先级较低的报文，为优先级较高的报文提供空间。在某些实现中，策略器还保证每个级别的带宽，从而在存在大量较高优先级流量时防止较低优先级流量的完全丢失。

2. 发明申请

US20060133279A1 Hierarchical multi-rate multi-precedence policer 有权
标题翻译：分层多速率多优先策略器
公开(公告)号：US20060133279A1
公开(公告)日：2006-06-22
申请号：US11019915
申请日：2004-12-21
申请人： Francois Le Faucheur , Anna Charny , Sandeep Bajaj
发明人： Francois Le Faucheur , Anna Charny , Sandeep Bajaj
IPC分类号： H04J1/16
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.
摘要翻译：公开了一种分级多速率多优先策略器。监管者根据分配的优先级丢弃数据包。当流量超过可用服务速率时，策略者丢弃优先级较低的报文，为优先级较高的报文提供空间。在某些实现中，策略器还保证每个级别的带宽，从而在存在大量较高优先级流量时防止较低优先级流量的完全丢失。

3. 发明授权

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.
摘要翻译：在一个实施例中，一种设备包括处理器，用于将与网络流相关联的分组映射到独立于设备处的拥塞级别的策略简档，以及基于拥塞状态来执行分组的策略简档。与相同网络流相关联的数据包被映射到相同的策略配置文件，并且在网络拥塞期间至少有一些网络流量受到保护。该装置还包括用于存储策略简档的存储器。还公开了一种在网络拥塞期间保护网络流的方法。

4. 发明授权

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.
摘要翻译：在一个实施例中，考虑到该集合的所有隧道，中间节点计算不包括特定链路（例如，并且可能地，每个隧道的按比例缩小的带宽）的一组隧道的路径。中间节点通知计算出的路径的隧道的头端节点（例如和缩放的带宽）和/或重新路由隧道的时间。

5. 发明授权

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).
摘要翻译：在一个实施例中，头端节点接收要从中间节点的特定链路重新路由的隧道列表。如果头端节点不能使用常规分布式路由重新路由作为头端节点的隧道，则每个头端节点执行相同的算法来计算列表中所有隧道的路径（例如，潜在地应用带宽缩放）。

6. 发明申请

US20110119397A1 Protection of network flows during congestion in a communications network 有权
标题翻译：保护通信网络拥塞期间的网络流
公开(公告)号：US20110119397A1
公开(公告)日：2011-05-19
申请号：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.
摘要翻译：在一个实施例中，一种设备包括处理器，用于将与网络流相关联的分组映射到独立于设备处的拥塞级别的策略简档，以及基于拥塞状态来执行分组的策略简档。与相同网络流相关联的数据包被映射到相同的策略配置文件，并且在网络拥塞期间至少有一些网络流量受到保护。该装置还包括用于存储策略简档的存储器。还公开了一种在网络拥塞期间保护网络流的方法。

7. 发明授权

US07733779B2 Stateless call admission and call preemption with a single metering and marking scheme 有权
标题翻译：无状态呼叫入场和电话抢占与一个单一的计量和标记方案
公开(公告)号：US07733779B2
公开(公告)日：2010-06-08
申请号：US11541964
申请日：2006-10-02
申请人： Anna Charny , Francois Le Faucheur
发明人： Anna Charny , Francois Le Faucheur
IPC分类号： H04L12/24
CPC分类号： H04L47/10 , H04L47/20 , H04L47/31 , H04L47/32
摘要： A method and system for call admission and preemption in a network having an ingress node and an egress node defining an ingress/egress node pair, and one or more core nodes located in a path between the ingress node and the egress node and configured to mark packets exceeding an admission threshold. The method includes calculating a sustainable preemption rate based on a rate of traffic received at the egress node from the ingress node that passed through the one or more core nodes without being marked, and a ratio between a preemption threshold and the admission threshold. If a traffic load to the egress node is greater than the sustainable preemption rate, at least some traffic is dropped so that the traffic load does not exceed the sustainable preemption rate for the ingress/egress node pair.
摘要翻译：一种用于在具有定义入口/出口节点对的入口节点和出口节点的网络中的呼叫准入和抢占的方法和系统，以及位于入口节点和出口节点之间的路径中的一个或多个核心节点，并且被配置为标记数据包超过准入门槛。该方法包括：基于从出口节点接收到的来自入口节点的通过一个或多个核心节点而不被标记的流量的速率以及抢占阈值与准入阈值之间的比率来计算可持续抢占率。如果出口节点的流量负载大于可持续抢占率，则至少有一些流量被丢弃，以便流量负载不超过入口/出口节点对的可持续抢占率。

8. 发明申请

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).
摘要翻译：在一个实施例中，头端节点接收要从中间节点的特定链路重新路由的隧道列表。如果头端节点不能使用常规分布式路由重新路由作为头端节点的隧道，则每个头端节点执行相同的算法来计算列表中所有隧道的路径（例如，潜在地应用带宽缩放）。

9. 发明申请

US20070291643A1 Stateless call admission and call preemption with a single metering and marking scheme 有权
标题翻译：无状态呼叫入场和电话抢占与一个单一的计量和标记方案
公开(公告)号：US20070291643A1
公开(公告)日：2007-12-20
申请号：US11541964
申请日：2006-10-02
申请人： Anna Charny , Francois Le Faucheur
发明人： Anna Charny , Francois Le Faucheur
IPC分类号： H04L12/26
CPC分类号： H04L47/10 , H04L47/20 , H04L47/31 , H04L47/32
摘要： A method and system for call admission and preemption in a network having an ingress node and an egress node defining an ingress/egress node pair, and one or more core nodes located in a path between the ingress node and the egress node and configured to mark packets exceeding an admission threshold. The method includes calculating a sustainable preemption rate based on a rate of traffic received at the egress node from the ingress node that passed through the one or more core nodes without being marked, and a ratio between a preemption threshold and the admission threshold. If a traffic load to the egress node is greater than the sustainable preemption rate, at least some traffic is dropped so that the traffic load does not exceed the sustainable preemption rate for the ingress/egress node pair.
摘要翻译：一种用于在具有定义入口/出口节点对的入口节点和出口节点的网络中的呼叫准入和抢占的方法和系统，以及位于入口节点和出口节点之间的路径中的一个或多个核心节点，并且被配置为标记数据包超过准入门槛。该方法包括：基于从出口节点接收到的来自入口节点的通过一个或多个核心节点而不被标记的流量的速率以及抢占阈值与准入阈值之间的比率来计算可持续抢占率。如果出口节点的流量负载大于可持续抢占率，则至少有一些流量被丢弃，以便流量负载不超过入口/出口节点对的可持续抢占率。

10. 发明授权

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.
摘要翻译：在一个实施例中，节点将输出的过载比确定为输出端的接收业务的总速率与输出的抢占阈值的比率。该节点还根据过载比以及从每个输入到每个输入到每个输入的总流量的先前标记的流量的比率确定要在输出处标记的流量的比率，以及是否特定的输入，先前标记的流量的比例小于在输出端被标记的流量的比率。如果是，则该节点标记特定输入的未标记的业务，其对应于要在输出处标记的业务量的比率与去往特定输入的输出的先前标记的业务量之间的差。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式