Sparse graph coding scheduling for deterministic Ethernet
First Claim
1. A method, comprising:
- receiving, at a first device in a deterministic Ethernet network, a deterministic binary schedule specifying timing information for transmitting data fragments relating to a plurality of data flows;
receiving data packets to transmit to a destination device within the deterministic Ethernet network;
fragmenting each of the data packets into two or more fragments;
encoding, by operation of one or more computer processors, at least one of the two or more fragments for each of the data packets with a respective sparse graph code; and
transmitting the encoded fragments to the destination device, across multiple paths through the deterministic Ethernet network, according to timing information specified in the deterministic binary schedule, comprising;
transmitting a first one of the data fragments at a first moment in time, according to the timing information specified in the deterministic binary schedule; and
transmitting a duplicate copy of the first data fragment at a second moment in time, according to the timing information specified in the deterministic binary schedule, wherein the second moment in time is subsequent to the first moment in time.
1 Assignment
0 Petitions
Accused Products
Abstract
Embodiments provide techniques for transmitting data packets across a deterministic Ethernet network. Embodiments receive, at a first device in the deterministic Ethernet network, a deterministic binary schedule specifying timing information for transmitting data fragments relating to a plurality of data flows. Data packets to transmit to a destination device within the deterministic Ethernet network are received at the first device. Embodiments include fragmenting each of the data packets into two or more fragments and encoding at least one of the two or more fragments for each of the data packets with a respective sparse graph code. The encoded fragments are transmitted to the destination device, across multiple paths through the deterministic Ethernet network, according to timing information specified in the deterministic binary schedule.
-
Citations
18 Claims
-
1. A method, comprising:
-
receiving, at a first device in a deterministic Ethernet network, a deterministic binary schedule specifying timing information for transmitting data fragments relating to a plurality of data flows; receiving data packets to transmit to a destination device within the deterministic Ethernet network; fragmenting each of the data packets into two or more fragments; encoding, by operation of one or more computer processors, at least one of the two or more fragments for each of the data packets with a respective sparse graph code; and transmitting the encoded fragments to the destination device, across multiple paths through the deterministic Ethernet network, according to timing information specified in the deterministic binary schedule, comprising; transmitting a first one of the data fragments at a first moment in time, according to the timing information specified in the deterministic binary schedule; and transmitting a duplicate copy of the first data fragment at a second moment in time, according to the timing information specified in the deterministic binary schedule, wherein the second moment in time is subsequent to the first moment in time. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. A network device, comprising:
-
one or more computer processors; one or more ports connecting the network device to a deterministic Ethernet network; and logic for; receiving, at the network device, a deterministic binary schedule specifying timing information for transmitting data fragments relating to a plurality of data flows; receiving data packets to transmit to a destination device within the deterministic Ethernet network; fragmenting each of the data packets into two or more fragments; encoding, by operation of the one or more computer processors, at least one of the two or more fragments for each of the data packets with a respective sparse graph code; and transmitting, using the one or more ports, the encoded fragments to the destination device across multiple paths through the deterministic Ethernet network, according to timing information specified in the deterministic binary schedule, comprising; transmitting a first one of the data fragments at a first moment in time, according to the timing information specified in the deterministic binary schedule; and transmitting a duplicate copy of the first data fragment at a second moment in time, according to the timing information specified in the deterministic binary schedule, wherein the second moment in time is subsequent to the first moment in time. - View Dependent Claims (11, 12, 13, 14, 15, 16, 17)
-
-
18. A non-transitory computer-readable medium storing computer program codes that, when executed, perform an operation for:
-
receiving, at a first device in a deterministic Ethernet network, a deterministic binary schedule specifying timing information for transmitting data fragments relating to a plurality of data flows; receiving data packets to transmit to a destination device within the deterministic Ethernet network; fragmenting each of the data packets into two or more fragments; encoding at least one of the two or more fragments for each of the data packets with a respective sparse graph code; and transmitting the encoded fragments to the destination device, across multiple paths through the deterministic Ethernet network, according to timing information specified in the deterministic binary schedule, comprising; transmitting a first one of the data fragments at a first moment in time, according to the timing information specified in the deterministic binary schedule; and transmitting a duplicate copy of the first data fragment at a second moment in time, according to the timing information specified in the deterministic binary schedule, wherein the second moment in time is subsequent to the first moment in time.
-
Specification