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

1. 发明授权

US07246175B1 IPv6 over MPLS IPv4 core 有权
标题翻译： IPv6 over MPLS IPv4内核
公开(公告)号：US07246175B1
公开(公告)日：2007-07-17
申请号：US10013818
申请日：2001-12-07
申请人： Daniel C. Tappan , Eric C. Rosen , Ole Troan , Parag Jain , Eric Levy-Abegnoli , Luc Revardel , Francois Le Faucheur
发明人： Daniel C. Tappan , Eric C. Rosen , Ole Troan , Parag Jain , Eric Levy-Abegnoli , Luc Revardel , Francois Le Faucheur
IPC分类号： G06F15/16
CPC分类号： H04L29/12358 , H04L29/12424 , H04L29/12509 , H04L29/12547 , H04L45/502 , H04L61/251 , H04L61/2535 , H04L61/2567 , H04L61/2582 , H04L69/16 , H04L69/167
摘要： IPv6 traffic may be carried through an MPLS IPv4 network without the use of IPv6-over-IPv4 tunneling. This provides great savings in overhead, signaling, and state information storage and also allows for routing through the MPLS IPv4 network to adjust in response to changes in network state. In one embodiment, an edge node of an MPLS IPv4 network resolves a destination IPv6 network of a received IPv6 packet to an MPLS label switched path. The resolution exploits received inter-domain routing information. This information identifies the IPv4 address of an egress node that is usable as a gateway to the destination network. Within the inter-domain routing information, the IPv4 address may be encoded in IPv6 format.
摘要翻译： IPv6流量可以通过MPLS IPv4网络进行，而不需要使用IPv6 over-IPv4隧道。这提供了开销，信令和状态信息存储的巨大节省，还允许通过MPLS IPv4网络进行路由以根据网络状态的变化进行调整。在一个实施例中，MPLS IPv4网络的边缘节点将接收的IPv6分组的目的IPv6网络解析为MPLS标签交换路径。该解决方案利用收到的域间路由信息。该信息标识可用作目的地网络的网关的出口节点的IPv4地址。在域间路由信息中，IPv4地址可以以IPv6格式编码。

2. 发明授权

US07526571B1 IPv6 over MPLS IPv4 core 有权
标题翻译： IPv6 over MPLS IPv4内核
公开(公告)号：US07526571B1
公开(公告)日：2009-04-28
申请号：US11811515
申请日：2007-06-11
申请人： Daniel C. Tappan , Eric C. Rosen , Ole Troan , Parag Jain , Eric Levy-Abegnoli , Luc Revardel , Francois Le Faucheur
发明人： Daniel C. Tappan , Eric C. Rosen , Ole Troan , Parag Jain , Eric Levy-Abegnoli , Luc Revardel , Francois Le Faucheur
IPC分类号： G06F15/16
CPC分类号： H04L29/12358 , H04L29/12424 , H04L29/12509 , H04L29/12547 , H04L45/502 , H04L61/251 , H04L61/2535 , H04L61/2567 , H04L61/2582 , H04L69/16 , H04L69/167
摘要： IPv6 traffic may be carried through an MPLS IPv4 network without the use of IPv6-over-IPv4 tunneling. This provides great savings in overhead, signaling, and state information storage and also allows for routing through the MPLS IPv4 network to adjust in response to changes in network state. In one embodiment, an edge node of an MPLS IPv4 network resolves a destination IPv6 network of a received IPv6 packet to an MPLS label switched path. The resolution exploits received inter-domain routing information. This information identifies the IPv4 address of an egress node that is usable as a gateway to the destination network. Within the inter-domain routing information, the IPv4 address may be encoded in IPv6 format.
摘要翻译： IPv6流量可以通过MPLS IPv4网络进行，而不需要使用IPv6 over-IPv4隧道。这提供了开销，信令和状态信息存储的巨大节省，还允许通过MPLS IPv4网络进行路由以根据网络状态的变化进行调整。在一个实施例中，MPLS IPv4网络的边缘节点将接收的IPv6分组的目的IPv6网络解析为MPLS标签交换路径。该解决方案利用收到的域间路由信息。该信息标识可用作目的地网络的网关的出口节点的IPv4地址。在域间路由信息中，IPv4地址可以以IPv6格式编码。

3. 发明授权

US07243161B1 Two label stack for transport of network layer protocols over label switched networks 有权
标题翻译：用于通过标签交换网络传输网络层协议的两个标签栈
公开(公告)号：US07243161B1
公开(公告)日：2007-07-10
申请号：US10013817
申请日：2001-12-07
申请人： Daniel C. Tappan , Eric C. Rosen , Parag Jain , Eric Levy-Abegnoli , Luc Revardel , Francois Le Faucheur
发明人： Daniel C. Tappan , Eric C. Rosen , Parag Jain , Eric Levy-Abegnoli , Luc Revardel , Francois Le Faucheur
IPC分类号： G06F15/16
CPC分类号： H04L45/50 , H04L29/12358 , H04L61/251 , H04L61/2592 , H04L69/18 , H04L2212/00
摘要： IPv6 traffic may be carried through an MPLS IPv4 network without the use of IPv6-over-IPv4 tunneling. An IPv6 packet is sent through the MPLS IPv4 network through a label switched path (LSP). The IPv6 packet is encapsulated with a label stack associated with the LSP. A second level label is used in the label stack (in addition to the label associated with the LSP). This second level label provides important benefits.
摘要翻译： IPv6流量可以通过MPLS IPv4网络进行，而不需要使用IPv6 over-IPv4隧道。 IPv6报文通过MPLS IPv4网络通过标签交换路径（LSP）发送。 IPv6报文封装有与LSP关联的标签栈。在标签堆栈中使用第二级标签（除了与LSP相关联的标签之外）。这个第二级标签提供了重要的好处。

4. 发明申请

US20070091811A1 Forwarding packets to a directed acyclic graph destination using link selection based on received link metrics 有权
标题翻译：基于接收到的链路指标，使用链路选择将分组转发到有向非循环图目的地
公开(公告)号：US20070091811A1
公开(公告)日：2007-04-26
申请号：US11255966
申请日：2005-10-24
申请人： Pascal Thubert , Francois Le Faucheur , Eric Levy-Abegnoli
发明人： Pascal Thubert , Francois Le Faucheur , Eric Levy-Abegnoli
IPC分类号： H04J3/14
CPC分类号： H04L43/022 , H04L43/08 , H04L45/123 , H04L45/20 , H04W40/24
摘要： Each network node having at least one destination-oriented link toward a directed acyclic graph (DAG) destination can receive a corresponding set of path performance metrics via the destination-oriented link. The set of path performance metrics, initiated by the DAG destination outputting initial link metrics on each of its source-connecting links, identifies aggregate link metrics for a corresponding path to the DAG destination via the corresponding destination-oriented link. The network node outputs a corresponding updated set of path performance metrics on each of its source-connecting links based on the received set of path performance metrics and the corresponding link metric for the corresponding source-connecting link. Hence, each network node in the DAG can assess the performance of each connected path to the DAG destination, and forward a data packet via a selected destination-oriented link based on the corresponding path performance metrics and forwarding policies for the forwarded data packet.
摘要翻译：具有朝向有向非循环图（DAG）目的地的至少一个目的地定向链路的每个网络节点可以经由目的地定向链路接收相应的一组路径性能度量。由DAG目的地发起的路由性能度量集合，其每个源连接链路上的初始链路度量在每个源连接链路上输出，通过相应的目的地导向链路来标识到达目的地的相应路径的聚合链路度量。网络节点基于所接收的路径性能度量集合和对应的源连接链路的相应链路度量，在其每个源连接链路上输出对应的更新路径性能度量集合。因此，DAG中的每个网络节点可以评估到DAG目的地的每个连接路径的性能，并且基于所转发的数据分组的相应路径性能度量和转发策略，经由所选择的目的地定向链路转发数据分组。

5. 发明申请

US20080080473A1 Efficiently decoupling reservation and data forwarding of data flows in a computer network 有权
标题翻译：有效地解耦计算机网络中数据流的预留和数据转发
公开(公告)号：US20080080473A1
公开(公告)日：2008-04-03
申请号：US11542186
申请日：2006-10-03
申请人： Pascal Thubert , Eric Levy-Abegnoli , Francois Le Faucheur
发明人： Pascal Thubert , Eric Levy-Abegnoli , Francois Le Faucheur
IPC分类号： H04B7/212
CPC分类号： G06F13/4045
摘要： In one embodiment, a node (e.g., a router) performs reservations for data flows, each on a corresponding selected (reserved) path having adequate reservation availability. Also, the node forwards data from data flows, each over a corresponding selected (forwarded) path having adequate load availability, wherein forwarded paths are decoupled from reserved paths for the data flows.
摘要翻译：在一个实施例中，节点（例如，路由器）对数据流执行预留，每个在相应的所选（保留）路径上具有足够的预留可用性。此外，节点从数据流中转发数据，每个数据流都通过具有足够负载可用性的相应的所选（转发）路径，其中转发的路径与用于数据流的保留路径分离。

6. 发明授权

US08976672B2 Efficiently decoupling reservation and data forwarding of data flows in a computer network 有权
标题翻译：有效地解耦计算机网络中数据流的预留和数据转发
公开(公告)号：US08976672B2
公开(公告)日：2015-03-10
申请号：US11542186
申请日：2006-10-03
申请人： Pascal Thubert , Eric Levy-Abegnoli , Francois Le Faucheur
发明人： Pascal Thubert , Eric Levy-Abegnoli , Francois Le Faucheur
IPC分类号： G01R31/08 , G06F11/00 , G08C15/00 , H04J1/16 , H04J3/14 , H04L1/00 , H04L12/26 , G06F13/40
CPC分类号： G06F13/4045
摘要： In one embodiment, a node (e.g., a router) performs reservations for data flows, each on a corresponding selected (reserved) path having adequate reservation availability. Also, the node forwards data from data flows, each over a corresponding selected (forwarded) path having adequate load availability, wherein forwarded paths are decoupled from reserved paths for the data flows.
摘要翻译：在一个实施例中，节点（例如，路由器）对数据流执行预留，每个在相应的所选（保留）路径上具有足够的预留可用性。此外，节点从数据流中转发数据，每个数据流都通过具有足够负载可用性的相应的所选（转发）路径，其中转发的路径与用于数据流的保留路径分离。

7. 发明授权

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

8. 发明授权

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

9. 发明申请

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.
摘要翻译：公开了具有具有至少一个出口接口的核心设备的网络中用于抢占的方法和系统。在一个实施例中，该方法包括使用多个哈希桶来执行基于流的散列，每个哈希桶被设置为第一状态或第二状态，并且基于速率测量来计算负载，所述速率测量将哈希散列到具有状态的哈希桶中的流设置到第二个状态。将计算出的负载与抢占阈值进行比较，并且如果计算出的负载超过抢占阈值，则至少一个哈希桶的状态从第一状态改变到第二状态。对于处于第二状态的哈希桶中的流哈希，执行诸如丢弃所有数据包或标记所有数据包的动作。

10. 发明申请

US20070030852A1 Method and apparatus for enabling routing of label switched data packets 审中-公开
标题翻译：用于启用标签交换数据分组路由的方法和装置
公开(公告)号：US20070030852A1
公开(公告)日：2007-02-08
申请号：US11199938
申请日：2005-08-08
申请人： Mark Szczesniak , Francois Le Faucheur , Johnny Poulin
发明人： Mark Szczesniak , Francois Le Faucheur , Johnny Poulin
IPC分类号： H04L12/56
CPC分类号： H04L45/302 , H04L45/02 , H04L45/50 , H04L45/54
摘要： A method of enabling routing of label switched data packets in a data communications network comprising a plurality of nodes and supporting multiple topologies, is performed at an enabling node and comprises constructing a per-topology label forwarding table.
摘要翻译：在启用节点处执行能够在包括多个节点并支持多个拓扑的数据通信网络中进行标签交换数据分组的路由的方法，并且包括构建每个拓扑标签转发表。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式