公开(公告)号：US20140078927A1

公开(公告)日：2014-03-20

申请号：US13620677

申请日：2012-09-14

Applicant: Pascal THUBERT ,  Patrice BELLAGAMBA ,  Dirk ANTEUNIS

Inventor： Pascal THUBERT ,  Patrice BELLAGAMBA ,  Dirk ANTEUNIS

IPC: H04L12/28 ,  H04L12/56

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

公开(公告)号：US20130208594A1

公开(公告)日：2013-08-15

申请号：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: H04L12/26

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.

公开(公告)号：US20140098711A1

公开(公告)日：2014-04-10

申请号：US13648500

申请日：2012-10-10

Applicant: Pascal THUBERT ,  Patrice BELLAGAMBA ,  Ijsbrand WIJNANDS

Inventor： Pascal THUBERT ,  Patrice BELLAGAMBA ,  Ijsbrand WIJNANDS

IPC: H04L12/28

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

公开(公告)号：US20130301470A1

公开(公告)日：2013-11-14

申请号：US13467603

申请日：2012-05-09

Applicant: Pascal THUBERT ,  Patrice BELLAGAMBA

Inventor： Pascal THUBERT ,  Patrice BELLAGAMBA

IPC: H04L12/56

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

公开(公告)号：US20120300668A1

公开(公告)日：2012-11-29

申请号：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

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

公开(公告)号：US20140036729A1

公开(公告)日：2014-02-06

申请号：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

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

公开(公告)号：US20120063436A1

公开(公告)日：2012-03-15

申请号：US13300384

申请日：2011-11-18

Applicant: Pascal THUBERT ,  Patrick WETTERWALD ,  Vincent Jean RIBIERE

Inventor： Pascal THUBERT ,  Patrick WETTERWALD ,  Vincent Jean RIBIERE

IPC: H04W40/00

CPC classification number: H04W8/26 ,  H04L45/04 ,  H04W40/22 ,  H04W80/04 ,  H04W84/005 ,  H04W84/18

Abstract: In one embodiment, a method comprises attaching, by a mobile router, to an attachment router according to a protocol requiring establishment of a tree topology having a single clusterhead, the attaching by the mobile router based on the mobile router receiving, from the attachment router, an advertisement message specifying an attachment prefix; outputting a second advertisement message specifying availability of a prescribed address prefix used by the mobile router, and further specifying attributes of the mobile router relative to the tree topology; receiving a plurality of sensor data messages from at least one attached sensor host node, each sensor data message specifying at least one sensor data element specifying a detected sensor parameter; aggregating the sensor data elements from the sensor data messages into aggregated sensor data; and generating and outputting a neighbor advertisement message to the attachment router, the neighbor advertisement message specifying the aggregated sensor data.

Abstract translation: 在一个实施例中，一种方法包括：根据需要建立具有单一簇头的树形拓扑的协议，通过移动路由器将连接路由器附接到移动路由器，所述移动路由器基于从附件路由器接收的移动路由器 指定附件前缀的广告消息; 输出指定所述移动路由器使用的规定地址前缀的可用性的第二广告消息，以及进一步指定所述移动路由器相对于所述树形拓扑的属性; 从至少一个附接的传感器主机节点接收多个传感器数据消息，每个传感器数据消息指定指定检测到的传感器参数的至少一个传感器数据元素; 将传感器数据消息中的传感器数据元素聚合成聚合的传感器数据; 并且向所述附件路由器生成并输出邻居通告消息，所述邻居通告消息指定所述聚合的传感器数据。

公开(公告)号：US20120257624A1

公开(公告)日：2012-10-11

申请号：US13528578

申请日：2012-06-20

Applicant: Pascal THUBERT ,  Patrick WETTERWALD ,  Vincent Jean RIBIERE ,  Alpesh S. PATEL ,  Jean-Philippe VASSEUR

Inventor： Pascal THUBERT ,  Patrick WETTERWALD ,  Vincent Jean RIBIERE ,  Alpesh S. PATEL ,  Jean-Philippe VASSEUR

IPC: H04L12/56

CPC classification number: H04W40/246 ,  H04W40/20

Abstract: In one embodiment, a method comprises an Internet Protocol (IP) router receiving sensor data from at least one of a second IP router or an attached host sensor node, the sensor data distinct from link data of a network link; the IP router generating sensor information based on storing the sensor data with metadata describing reception of the sensor data by the IP router in a routing information base; and the IP router executing a routing operation based on the sensor information stored in the routing information base.

Abstract translation: 在一个实施例中，一种方法包括从第二IP路由器或附接主机传感器节点中的至少一个接收传感器数据的互联网协议（IP）路由器，所述传感器数据与网络链路的链路数据不同; 所述IP路由器基于通过所述IP路由器在路由信息库中接收所述传感器数据的元数据来存储所述传感器数据来生成传感器信息; 并且IP路由器基于存储在路由信息库中的传感器信息来执行路由操作。

公开(公告)号：US20120093037A1

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

申请号：US13338187

申请日：2011-12-27

Applicant: Pascal THUBERT ,  Patrick WETTERWALD ,  Vincent Jean RIBIERE ,  Billy Gayle MOON ,  Johannes Petrus KRUYS

Inventor： Pascal THUBERT ,  Patrick WETTERWALD ,  Vincent Jean RIBIERE ,  Billy Gayle MOON ,  Johannes Petrus KRUYS

IPC: H04W84/18

CPC classification number: H04W40/22 ,  H04W40/08

Abstract: In one embodiment, a method includes a mesh point receiving mesh advertisement messages from advertising mesh points of a wireless mesh network having a mesh portal with a wired connection to a wired network. Each mesh advertisement message specifies a corresponding metric for reaching the mesh portal and has a corresponding signal strength indicator. An ordered group of parent access points, ordered based on the respective metrics, is generated from among the advertising mesh points, starting with a first parent access point having a corresponding optimum metric for reaching the mesh portal and independent of the corresponding signal strength indicator. A registration message is sent to each of the parent access points identifying a corresponding specified priority based on a corresponding position in the ordered group, for use by the corresponding parent access point in selecting a minimum interframe spacing for forwarding a wireless packet received from the mesh point.

Abstract translation: 在一个实施例中，一种方法包括网格点从具有具有到有线网络的有线连接的网状门户的无线网状网络的广告网点接收网格广告消息。 每个网格广告消息指定到达网格门户的相应度量，并具有对应的信号强度指示符。 从广告网格点中生成基于相应度量排序的有序的父接入点组，从具有到达网格门户的相应最佳度量的第一父接入点开始，并且独立于相应的信号强度指示符。 基于有序组中的对应位置，向每个父接入点发送标识相应的指定优先级的注册消息，供相应的父接入点选择用于转发从网状接收的无线分组的最小帧间间隔 点。

公开(公告)号：US20100188979A1

公开(公告)日：2010-07-29

申请号：US12751841

申请日：2010-03-31

Applicant: Pascal THUBERT ,  Francois Laurent LE FAUCHEUR ,  Eric M. LEVY-ABEGNOLI

Inventor： Pascal THUBERT ,  Francois Laurent LE FAUCHEUR ,  Eric M. LEVY-ABEGNOLI

IPC: G01R31/08 ,  H04J1/16

CPC classification number: H04L43/022 ,  H04L43/08 ,  H04L45/123 ,  H04L45/20 ,  H04W40/24

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

Abstract translation: 具有朝向有向非循环图（DAG）目的地的至少一个目的地定向链路的每个网络节点可以经由目的地定向链路接收相应的一组路径性能度量。 由DAG目的地发起的路由性能度量集合，其每个源连接链路上的初始链路度量在每个源连接链路上输出，通过相应的目的地导向链路来标识到达目​​的地的相应路径的聚合链路度量。 网络节点基于所接收的路径性能度量集合和对应的源连接链路的相应链路度量，在其每个源连接链路上输出对应的更新路径性能度量集合。 因此，DAG中的每个网络节点可以评估到DAG目的地的每个连接路径的性能，并且基于所转发的数据分组的相应路径性能度量和转发策略，经由所选择的目的地定向链路转发数据分组。