In one embodiment, a method includes generating a trace request at an initiator node configured for segment routing, the trace request comprising an FEC (Forwarding Equivalence Class) query corresponding to a label in an FEC stack with an unknown FEC, transmitting the trace request on a path with the unknown FEC, and receiving a response to the trace request, the response comprising FEC information including an identifier associated with a label and a forwarding path and representing a class or category of packets. An apparatus is also disclosed herein.

Systems and techniques described herein include jointly decoding coded data of different codes, including different coding algorithms, finite fields, and/or source blocks sizes. The techniques described herein can be used to improve existing distributed storage systems by allowing gradual data migration. The techniques can further be used within existing storage clients to allow application data to be stored within diverse different distributed storage systems.

Systems and techniques described herein include jointly decoding coded data of different codes, including different coding algorithms, finite fields, and/or source blocks sizes. The techniques described herein can be used to improve existing distributed storage systems by allowing gradual data migration. The techniques can further be used within existing storage clients to allow application data to be stored within diverse different distributed storage systems.

Resource-efficient data protection is performed by generating meta chunks in storage systems that utilize erasure coding. During erasure coding with a k+m configuration, a data chunk can be divided into k data fragments, having indices 1 to k, that can be encoded by combining them with corresponding coefficients of a coding matrix, to generate coding fragments. Source portions that have a reduced set (e.g., less than k data fragments) of data fragments and that are complementary (e.g., that do not have common indices) can be determined and combined to generate a meta chunk. The coding fragments of the source portions can be added to generate coding fragments for the meta chunk, which can then be utilized to recover data fragments of any of the source portions. Further, the coding fragments, that were previously generated by individually encoding each source portion, can be deleted.

Resource-efficient data protection is performed by generating meta chunks in storage systems that utilize erasure coding. During erasure coding with a k+m configuration, a data chunk can be divided into k data fragments, having indices 1 to k, that can be encoded by combining them with corresponding coefficients of a coding matrix, to generate coding fragments. Source portions that have a reduced set (e.g., less than k data fragments) of data fragments and that are complementary (e.g., that do not have common indices) can be determined and combined to generate a meta chunk. The coding fragments of the source portions can be added to generate coding fragments for the meta chunk, which can then be utilized to recover data fragments of any of the source portions. Further, the coding fragments, that were previously generated by individually encoding each source portion, can be deleted.

An encoding for data in an audio data stream may be indicated in the data stream using a footer stored in low-order bits of data frames in the audio data stream. When the audio data stream may include either Pulse Code Modulation (PCM) or Direct Stream Digital (DSD) data, PCM data may be marked with a footer to indicate the encoding as PCM. The footer may be a fixed value, an alternating fixed value, a predetermined sequence of values, or a value computed based on the PCM data. Examples of computed values for the footer marker may include an error code, an error correction code (ECC), and a scrambled code.

A frame error correction circuit may identify and correct errors in data frames provided to a receiver as part of a diversity communications scheme. The frame error correction circuit may further align the data frames so that the data frames can be compared. The frame error correction circuit may perform a bit-wise comparison of the data frames and identify inconsistent bit positions where bits in the data frames differ from one another. Once inconsistent bit positions have been identified, the frame error correction circuit may access a permutation table of permutations of bits at the inconsistent bit positions. In some implementations, the frame error correction circuit uses the permutation table to reassemble permutations of the data frames. In various implementations, the frame error correction circuit performs a CRC of each permutation of the data frames, and provides a valid permutation to a network.

A frame error correction circuit may identify and correct errors in data frames provided to a receiver as part of a diversity communications scheme. The frame error correction circuit may further align the data frames so that the data frames can be compared. The frame error correction circuit may perform a bit-wise comparison of the data frames and identify inconsistent bit positions where bits in the data frames differ from one another. Once inconsistent bit positions have been identified, the frame error correction circuit may access a permutation table of permutations of bits at the inconsistent bit positions. In some implementations, the frame error correction circuit uses the permutation table to reassemble permutations of the data frames. In various implementations, the frame error correction circuit performs a CRC of each permutation of the data frames, and provides a valid permutation to a network.

Disclosed herein are an apparatus and method for recovering a distributed file system. The method, in which the apparatus for recovering a distributed file system is used, includes detecting a failed file that needs recovery, among files stored in a distributed file system; performing recovery scheduling in order to set a recovery order based on which parallel recovery is to be performed for the failed file; and performing parallel recovery for the failed file based on the recovery scheduling.

Disclosed herein are an apparatus and method for recovering a distributed file system. The method, in which the apparatus for recovering a distributed file system is used, includes detecting a failed file that needs recovery, among files stored in a distributed file system; performing recovery scheduling in order to set a recovery order based on which parallel recovery is to be performed for the failed file; and performing parallel recovery for the failed file based on the recovery scheduling.