公开(公告)号：US08897135B2

公开(公告)日：2014-11-25

申请号：US13371065

申请日：2012-02-10

Applicant: Pascal Thubert ,  Dirk Anteunis ,  Eric Michel Levy-Abegnoli ,  Patrice Bellagamba

Inventor： Pascal Thubert ,  Dirk Anteunis ,  Eric Michel Levy-Abegnoli ,  Patrice Bellagamba

IPC: G01R31/08

CPC classification number: H04L47/125 ,  H04L41/0663 ,  H04L45/02 ,  H04L45/18 ,  H04L45/22

Abstract: In one embodiment, a method comprises creating, in a computing network, a loop-free routing topology comprising a plurality of routing arcs for reaching a destination device, each routing arc comprising a first network device as a first end of the routing arc, a second network device as a second end of the routing arc, and at least a third network device configured for routing any network traffic along the routing arc toward the destination device via any one of the first or second ends of the routing arc; and load balancing the network traffic along the routing arcs based on traffic metrics obtained at the first and second ends of the routing arcs, including selectively sending a backpressure command to a first one of the routing arcs supplying at least a portion of the network traffic to a congested one of the routing arcs.

Abstract translation: 在一个实施例中，一种方法包括在计算网络中创建包括用于到达目的地设备的多个路由弧的无环路由拓扑，每个路由弧包括作为路由电弧的第一端的第一网络设备， 第二网络设备作为路由电弧的第二端，以及至少第三网络设备，被配置为经由所述路由电弧的所述第一或第二端中的任何一个沿着所述路由电弧将任何网络业务路由到目的地设备; 以及基于在所述路由弧的第一和第二端处获得的流量度量来沿着所述路由弧负载平衡网络流量，包括选择性地向所述路由弧中的所述路由弧中的第一个提供所述网络业务的至少一部分， 拥塞的一个路由弧。

公开(公告)号：US09246794B2

公开(公告)日：2016-01-26

申请号：US13566029

申请日：2012-08-03

Applicant: Pascal Thubert ,  Patrice Bellagamba ,  Dirk Anteunis ,  Eric Michel Levy-Abegnoli

Inventor： Pascal Thubert ,  Patrice Bellagamba ,  Dirk Anteunis ,  Eric Michel Levy-Abegnoli

IPC: H04L12/28 ,  H04L12/705 ,  H04L12/723 ,  H04L12/751 ,  H04L12/721 ,  H04L12/707 ,  H04L12/703

CPC classification number: H04L45/18 ,  H04L45/02 ,  H04L45/12 ,  H04L45/1283 ,  H04L45/22 ,  H04L45/28 ,  H04L45/507

Abstract: In one embodiment, a method comprises creating, in a computing network, a loop-free routing topology for reaching a destination device, the loop-free routing topology comprising distinct paths for reaching the destination device; generating a set of serialized representations describing the loop-free routing topology, each serialized representation describing a corresponding one of the paths; and propagating the set of serialized representations from the destination device to network nodes in the computing network, enabling the network nodes to establish loop-free label switched paths for reaching the destination device via the loop-free routing topology.

Abstract translation: 在一个实施例中，一种方法包括在计算网络中创建用于到达目的地设备的无环路由拓扑，所述无环路由拓扑包括用于到达目的地设备的不同路径; 生成描述无环路由拓扑的一系列序列化表示，每个序列化表示描述对应的一个路径; 并将该集合的序列化表示从目的地设备传播到计算网络中的网络节点，使得网络节点能够建立无循环标签交换路径，以经由无环路由拓扑到达目的地设备。

公开(公告)号：US09338086B2

公开(公告)日：2016-05-10

申请号：US13620677

申请日：2012-09-14

Applicant: Pascal Thubert ,  Patrice Bellagamba ,  Dirk Anteunis

Inventor： Pascal Thubert ,  Patrice Bellagamba ,  Dirk Anteunis

IPC: H04L12/26 ,  H04L12/723 ,  H04L12/705 ,  H04L12/707 ,  H04L12/703 ,  H04L12/715

CPC classification number: H04L45/18 ,  H04L12/4637 ,  H04L45/22 ,  H04L45/28 ,  H04L45/50 ,  H04L45/507 ,  H04L45/64 ,  H04L2012/421

Abstract: In one embodiment, a method comprises creating, in a computing network, a loop-free routing topology comprising a plurality of routing arcs for reaching a destination network node, each routing arc comprising a first network node as a first end of the routing arc, a second network node as a second end of the routing arc, and at least a third network node configured for routing any network traffic along the routing arc toward the destination node via any one of the first or second ends of the routing arc, at least one of the first, second, or third network nodes are implemented as a ring-based network having a prescribed ring topology; and establishing loop-free label switched paths for reaching the destination network node via the routing arcs of the loop-free routing topology, the label switched paths independent and distinct from any attribute of the prescribed ring topology.

Abstract translation: 在一个实施例中，一种方法包括在计算网络中创建包括用于到达目的地网络节点的多个路由弧的无环路由拓扑，每个路由弧包括作为路由电弧的第一端的第一网络节点， 第二网络节点作为路由电弧的第二端，以及至少第三网络节点，被配置为经由路由选择电弧的第一或第二端中的任何一个路由沿着路由电弧的任何网络业务，至少 第一，第二或第三网络节点之一被实现为具有规定的环形拓扑的基于环的网络; 以及建立无循环标签交换路径，用于经由无环路由拓扑的路由弧到达目的网络节点，标签交换路径与规定的环形拓扑的任何属性独立且不同。

公开(公告)号：US09088502B2

公开(公告)日：2015-07-21

申请号：US13113113

申请日：2011-05-23

Applicant: Pascal Thubert ,  Patrice Bellagamba ,  Dirk Anteunis ,  Eric Michel Levy-Abegnoli

Inventor： Pascal Thubert ,  Patrice Bellagamba ,  Dirk Anteunis ,  Eric Michel Levy-Abegnoli

IPC: H04L12/28 ,  H04L12/721 ,  H04L12/705

CPC classification number: H04L45/18 ,  H04L41/0803 ,  H04L45/02 ,  H04L45/14

Abstract: In one embodiment, a method comprises creating, in a computing network, a loop-free routing topology comprising a plurality of routing arcs for reaching a destination device, each routing arc comprising a first network device as a first end of the routing arc, a second network device as a second end of the routing arc, and at least a third network device configured for routing any network traffic along the routing arc toward the destination device via any one of the first or second ends of the routing arc; and causing the network traffic to be forwarded along at least one of the routing arcs to the destination device.

Abstract translation: 在一个实施例中，一种方法包括在计算网络中创建包括用于到达目的地设备的多个路由弧的无环路由拓扑，每个路由弧包括作为路由电弧的第一端的第一网络设备， 第二网络设备作为路由电弧的第二端，以及至少第三网络设备，被配置为经由所述路由电弧的所述第一或第二端中的任何一个沿着所述路由电弧将任何网络业务路由到目的地设备; 并且使得网络业务沿着至少一个路由弧被转发到目的地设备。

公开(公告)号：US09112788B2

公开(公告)日：2015-08-18

申请号：US13648500

申请日：2012-10-10

Applicant: Pascal Thubert ,  Patrice Bellagamba ,  Ijsbrand Wijnands

Inventor： Pascal Thubert ,  Patrice Bellagamba ,  Ijsbrand Wijnands

IPC: H04L12/28 ,  H04L12/735 ,  H04L12/705 ,  H04L12/707

CPC classification number: H04L45/18 ,  H04L41/0803 ,  H04L45/02 ,  H04L45/128 ,  H04L45/24

Abstract: In one embodiment, a method comprises creating, in a computing network, a loop-free routing topology comprising a plurality of routing arcs for reaching a destination network node, each routing arc comprising a first network node as a first end of the routing arc, a second network node as a second end of the routing arc, and at least a third network node configured for routing any network traffic along the routing arc toward the destination node via any one of the first or second ends of the routing arc, the loop-free routing topology providing first and second non-congruent paths; and forwarding bicasting data, comprising a data packet in a first direction from a network node and a bicasted copy of the data packet in a second direction from the network node, concurrently to the destination node respectively via the first and second non-congruent paths.

Abstract translation: 在一个实施例中，一种方法包括在计算网络中创建包括用于到达目的地网络节点的多个路由弧的无环路由拓扑，每个路由弧包括作为路由电弧的第一端的第一网络节点， 作为所述路由选择电弧的第二端的第二网络节点，以及至少第三网络节点，被配置为经由所述路由选择电弧的任何网络业务通过所述路由电弧的所述第一或第二端中的任何一个路向所述目的地节点，所述环路 - 提供第一和第二非一致路径的自由路由拓扑; 以及分别经由所述第一和第二非全等路径将包括来自网络节点的第一方向上的数据分组和来自所述网络节点的第二方向的所述数据分组的多播复制同时发送到所述目的地节点。

公开(公告)号：US09413638B2

公开(公告)日：2016-08-09

申请号：US13467603

申请日：2012-05-09

Applicant: Pascal Thubert ,  Patrice Bellagamba

Inventor： Pascal Thubert ,  Patrice Bellagamba

IPC: H04L12/26 ,  H04L12/705 ,  H04L12/735 ,  H04L12/751 ,  H04L12/707

CPC classification number: H04L45/18 ,  H04L45/02 ,  H04L45/128 ,  H04L45/22 ,  H04L45/24

Abstract: In one embodiment, a method comprises creating, in a computing network, a loop-free routing topology comprising a plurality of routing arcs for reaching a destination device, each routing arc routing any network traffic along the routing arc toward the destination device via any one of first or second ends of the corresponding routing arc, the creating including forming a buttressing arc having an originating end joined to a first of the routing arcs and a terminating end joined to a second of the routing arcs, the buttressing arc inheriting from the first routing arc a first height to the destination device, the first height of the first routing arc higher than a corresponding second height of the second routing arc; and causing the network traffic to be forwarded, to the destination device, via the buttressing arc and at least one of the first routing arc or the second routing arc.

Abstract translation: 在一个实施例中，一种方法包括在计算网络中创建包括用于到达目的地设备的多个路由弧的无环路由拓扑，每个路由选择弧路由沿着路由选择弧的任何网络业务经由任何一个 所述创建包括形成具有连接到所述路线弧中的第一路线弧的始发端的支撑弧，以及连接到所述路线弧中的第二路径弧的终止端，所述支撑弧从所述第一 所述第一路由的第一高度高于所述第二路由选择弧的对应的第二高度; 并且通过所述支撑弧和所述第一路由弧或所述第二路由弧中的至少一个将所述网络业务转发到所述目的地设备。

公开(公告)号：US09319962B2

公开(公告)日：2016-04-19

申请号：US14043974

申请日：2013-10-02

Applicant: Patrick Wetterwald ,  Jean-Philippe Vasseur ,  Pascal Thubert

Inventor： Patrick Wetterwald ,  Jean-Philippe Vasseur ,  Pascal Thubert

IPC: H04W40/04 ,  H04W72/04 ,  H04W40/34 ,  H04W40/38 ,  H04L12/721 ,  H04L12/707 ,  H04L12/703

CPC classification number: H04W40/04 ,  H04L45/12 ,  H04L45/22 ,  H04L45/28 ,  H04W40/34 ,  H04W40/38 ,  H04W72/0446 ,  Y02D70/144 ,  Y02D70/32

Abstract: 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.

Abstract translation: 在一个实施例中，通过一个或多个中间节点在源和目的地之间的无线确定性网络中建立初始路径，所述中间节点通常被通知源和目的地之间用于传送分组的所需度量。 初始路径在本地（例如，不接触路径计算引擎）被重新配置为绕过创建新路径的至少一个中间节点，新路径满足度量的要求。 注意，“本地重新配置”是指网络节点本身在不依赖路径计算引擎或其他实体（例如，网络管理系统，操作支持系统））确定替换路径时确定替换路径。 在一个实施例中，不在初始路径上的网络节点替换初始路径上的节点，同时使用在初始路径中使用的相同的接收和发送时隙。

公开(公告)号：US20150071255A1

公开(公告)日：2015-03-12

申请号：US14021744

申请日：2013-09-09

Applicant: Patrick Wetterwald ,  Jean-Philippe Vasseur ,  Pascal Thubert

Inventor： Patrick Wetterwald ,  Jean-Philippe Vasseur ,  Pascal Thubert

IPC: H04L5/00

CPC classification number: H04L5/0037 ,  H04L12/46 ,  H04L12/56 ,  H04W4/38 ,  Y02D70/144

Abstract: In one embodiment, sensor data is transported in a network to a rendezvous point network node, which consolidates the information into a consolidated result which is communicated to the destination. Such consolidation by a network node reduces the number of paths required in the network between the sensors and the destination. One embodiment includes acquiring, by each of a plurality of originating nodes in a wireless deterministic network, external data related to a same physical event; communicating through the network said external data from each of the plurality of originating nodes to a rendezvous point network node (RP) within the network; processing, by the RP, said external data from each of the plurality of originating nodes to produce a consolidated result; and communicating the consolidated result to a destination node of the network. In one embodiment, the network is a low power lossy network (LLN).

Abstract translation: 在一个实施例中，传感器数据在网络中传送到会合点网络节点，其将信息合并到通信到目的地的综合结果中。 网络节点的这种整合减少了传感器和目的地之间网络中所需的路径数量。 一个实施例包括由无线确定性网络中的多个始发节点中的每一个获取与相同物理事件相关的外部数据; 通过所述网络将来自所述多个始发节点中的每一个的所述外部数据传送到所述网络内的会合点网络节点（RP）; 通过RP处理来自多个始发节点中的每一个的外部数据来产生合并结果; 并将合并结果传送到网络的目的地节点。 在一个实施例中，网络是低功率有损网络（LLN）。

公开(公告)号：US08976672B2

公开(公告)日：2015-03-10

申请号：US11542186

申请日：2006-10-03

Applicant: Pascal Thubert ,  Eric Levy-Abegnoli ,  Francois Le Faucheur

Inventor： 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 classification number: G06F13/4045

Abstract: 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.

Abstract translation: 在一个实施例中，节点（例如，路由器）对数据流执行预留，每个在相应的所选（保留）路径上具有足够的预留可用性。 此外，节点从数据流中转发数据，每个数据流都通过具有足够负载可用性的相应的所选（转发）路径，其中转发的路径与用于数据流的保留路径分离。

公开(公告)号：US20150023328A1

公开(公告)日：2015-01-22

申请号：US14020936

申请日：2013-09-09

Applicant: Pascal Thubert ,  Jean-Philippe Vasseur ,  Patrick Wetterwald

Inventor： Pascal Thubert ,  Jean-Philippe Vasseur ,  Patrick Wetterwald

IPC: H04W72/04

CPC classification number: H04W72/0446 ,  H04J3/1694 ,  H04L43/067 ,  H04L43/0876 ,  H04L45/32 ,  H04W40/023

Abstract: In one embodiment, a network of nodes is configured to communicate according to a configuration of Available Routing Construct (ARC) chains as well as monitoring communication in the network, and/or selectively controls whether or not provisioned particular links will be used. One embodiment colors nodes of the network (e.g., a wireless deterministic network) along different paths through the network and marks packets with the color of each traversed node to track a path taken by a packet. One embodiment sends a particular packet through the network and marks over which links the packet traverses and aggregates these traversed links of other copies of the particular packet. One embodiment controls whether or not the provisioned time slots are used based on flooding a control packet through the network with enable or disable information for each of these links.

Abstract translation: 在一个实施例中，节点网络被配置为根据可用路由构造（ARC）链的配置进行通信，以及监视网络中的通信，和/或选择性地控制是否使用所提供的特定链路。 一个实施例沿着通过网络的不同路径来颜色网络的节点（例如，无线确定性网络），并且以每个遍历节点的颜色标记分组以跟踪由分组采取的路径。 一个实施例通过网络发送特定数据包，并标记数据包穿过哪个链接并聚合特定数据包的其他副本的这些遍历链接。 一个实施例控制是否基于通过网络淹没控制分组来使用所提供的时隙，而对于这些链路中的每一个，启用或禁用信息。