IP Library Granted Patent US 12,566,554
Granted Patent B2
US 12,566,554 · App. 18/701,331 · Granted Mar 3, 2026

Managing data storage in a communications system

Inventors: Róbert Szabó (Budapest, HU); Ákos Recse (Halasztelek, HU)
Assignee: Telefonaktiebolaget LM Ericsson (publ)
G06F3/0619G06F3/065G06F3/067G06F11/2094
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,566,554
App. No.
18/701,331
Granted
Mar 3, 2026
Kind
B2
Abstract

Methods and apparatus are provided. In an example aspect, a method of managing data storage in a communication system is provided. The communication system includes a plurality of clusters of network nodes, and the network nodes in each cluster of network node include one or more data storage nodes. The method comprises receiving data to be stored from a data source node, generating, from the data to be stored, a first subset of erasure coded chunks, causing the first subset of erasure coded chunks to be stored in one or more of the data storage nodes in at least one first cluster of the plurality of clusters, and sending, to a second cluster of the plurality of clusters, the data to be stored.

Claims (20)

1 . A method of managing data storage in a communication system, wherein the communication system includes a plurality of clusters of network nodes, wherein the network nodes in each cluster of network node include one or more data storage nodes, the method comprising:

receiving data to be stored from a data source node;

generating, from the data to be stored, a first subset of erasure coded chunks;

causing the first subset of erasure coded chunks to be stored in one or more of the data storage nodes in at least one first cluster of the plurality of clusters;

determining whether to send, to a second cluster, the data to be stored or a second subset of erasure coded chunks different to the first subset of erasure coded chunks by determining whether a size of the data to be stored is smaller than a size of the second subset of erasure coded chunks;

sending, to the second cluster, the data to be stored in response to determining that the size of the data to be stored is smaller than the size of the second subset of erasure coded chunks; and

sending, to the second cluster, the second subset of erasure coded chunks in response to determining that the size of the data to be stored is larger than the size of the second subset of erasure coded chunks.

2 . Apparatus for managing data storage in a communication system, wherein the communication system includes a plurality of clusters of network nodes, wherein the network nodes in each cluster of network nodes include one or more data storage nodes, the apparatus comprising a processor and a memory, the memory containing instructions executable by the processor such that the apparatus is operable to:

receive data to be stored from a data source node;

generate, from the data to be stored, a first subset of erasure coded chunks;

cause the first subset of erasure coded chunks to be stored in one or more of the data storage nodes in at least one first cluster of the plurality of clusters;

determine whether to send, to a second cluster, the data to be stored or a second subset of erasure coded chunks different to the first subset of erasure coded chunks by determining whether a size of the data to be stored is smaller than a size of the second subset of erasure coded chunks;

send, to the second cluster, the data to be stored in response to determining that the size of the data to be stored is smaller than the size of the second subset of erasure coded chunks; and

send, to the second cluster, the second subset of erasure coded chunks in response to determining that the size of the data to be stored is larger than the size of the second subset of erasure coded chunks.

3 . The apparatus of claim 2 , wherein the memory contains instructions executable by the processor such that the apparatus is operable to determine whether to send, to the second cluster, the data to be stored or the second subset of erasure coded chunks by receiving an indication of whether to send, to the second cluster, the data to be stored or the second subset of erasure coded chunks from a data storage control node.

4 . The apparatus of claim 3 , wherein the memory contains instructions executable by the processor such that the apparatus is operable to receive, from the data storage control node, an indication identifying the second subset of erasure coded chunks when the indication of whether to send, to in the second cluster, the data to be stored or the second subset of erasure coded chunks comprises an indication to send the second subset of erasure coded chunks.

5 . The apparatus of claim 2 , wherein the memory contains instructions executable by the processor such that the apparatus is operable to receive, from a data storage control node, at least one of:

an indication identifying a data storage handling node in the second cluster;

an indication of the first subset of erasure coded chunks; or

an indication identifying a respective storage node in the at least one first cluster for each erasure coded chunk of the first subset of erasure coded chunks.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 15, 2024
From: SZABÓ, RÓBERT; RECSE, ÁKOS
To: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)
Reel/Frame 067105/0578 →
Continuity (1)
Related Publication 20250258612A1 · Aug 14, 2025
References Cited (26)
US 8266237B2 · Moore et al. · 2012 [cited by applicant]
US 8799746B2 · Baker et al. · 2014 [cited by applicant]
US 10296258B1 · Richardson · 2019 [cited by examiner]
US 10484246B1 · Leach · 2019 [cited by examiner]
US 20170185330A1 · Danilov et al. · 2017 [cited by applicant]
US 20170371571A1 · Danilov et al. · 2017 [cited by applicant]
US 20180039543A1 · Luby · 2018 [cited by examiner]
US 20200004447A1 · Danilov · 2020 [cited by examiner]
US 20200012442A1 · Yang · 2020 [cited by examiner]
US 20200201827A1 · Chacko · 2020 [cited by examiner]
US 20210133049A1 · Danilov et al. · 2021 [cited by applicant]
US 20210152364A1 · Beecham · 2021 [cited by examiner]
US 20210218571A1 · Ansari et al. · 2021 [cited by applicant]
US 20210397359A1 · Richardson · 2021 [cited by examiner]
US 20240283705A1 · Mouradian · 2024 [cited by examiner]
US 20240348685A1 · Szabó · 2024 [cited by examiner]
WO 2023284984A1 · 2023 [cited by applicant]
Xie et al., A Decentralized Storage Cluster with High Reliability and Flexibility, 2006, IEEE, pp. 1-8. (Year: 2006). [cited by examiner]
Dimakis et al., Decentralized Erasure Codes for Distributed Networked Storage, 2006, IEEE, pp. 1-8. (Year: 2006). [cited by examiner]
Author Unknown, “STORJ: A Decentralized Cloud Storage Network Framework,” Version 3.0, Oct. 30, 2018, Storj Labs, Inc, 90 pages. [cited by applicant]
Khemani, “Erasure Coding for The Masses,” Towards Data Science, Dec. 21, 2020, 31 pages. [cited by applicant]
Lakshman, et al., “Cassandra—A Decentralized Structured Storage System,” ACM SIGOPS Operating Systems Review, Apr. 2010, 7 pages. [cited by applicant]
Reed, et al., “Polynomial Codes Over Certain Finite Fields,” Journal of the Society for Industrial and Applied Mathematics, vol. 8, Issue 2, Jun. 1960, JSTOR, 6 pages. [cited by applicant]
Vorick, et al., “Sia: Simple Decentralized Storage,” Nov. 29, 2014, 8 pages. [cited by applicant]
International Search Report and Written Opinion for International Patent Application No. PCT/EP2021/078699, mailed Jul. 6, 2022, 10 pages. [cited by applicant]
Examination Report for Indian Patent Application No. 20241702645, mailed Oct. 9, 2025, 7 pages. [cited by applicant]