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

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

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