CN111124316A - Method and device for sharing storage space and computer readable storage medium - Google Patents
Method and device for sharing storage space and computer readable storage medium Download PDFInfo
- Publication number
- CN111124316A CN111124316A CN201911393851.6A CN201911393851A CN111124316A CN 111124316 A CN111124316 A CN 111124316A CN 201911393851 A CN201911393851 A CN 201911393851A CN 111124316 A CN111124316 A CN 111124316A
- Authority
- CN
- China
- Prior art keywords
- storage space
- node
- nodes
- sharing
- target data
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 65
- 230000002776 aggregation Effects 0.000 claims description 69
- 238000004220 aggregation Methods 0.000 claims description 69
- 230000006854 communication Effects 0.000 description 14
- 238000004891 communication Methods 0.000 description 12
- 238000010586 diagram Methods 0.000 description 9
- 230000008569 process Effects 0.000 description 8
- 230000006870 function Effects 0.000 description 5
- 238000012546 transfer Methods 0.000 description 5
- 238000004590 computer program Methods 0.000 description 4
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 230000006855 networking Effects 0.000 description 3
- 230000006978 adaptation Effects 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 2
- 230000003993 interaction Effects 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 125000004122 cyclic group Chemical group 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000001052 transient effect Effects 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
- 238000005406 washing Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/0608—Saving storage space on storage systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0629—Configuration or reconfiguration of storage systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
- G06F3/067—Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
Abstract
The application relates to the technical field of storage and discloses a storage space sharing method. The sharing party of the storage space is applied to a mesh network, the mesh network comprises a plurality of nodes, and the sharing party of the storage space comprises: publishing the remaining storage space to other nodes of the plurality of nodes; and after receiving a storage space sharing request sent by other nodes, sharing the rest storage space to other nodes. The method and the device can realize the sharing of the storage space between the nodes, thereby improving the utilization rate of the storage space and further improving the user experience. The application also discloses a sharing device of the storage space and a computer readable storage medium.
Description
Technical Field
The present application relates to the field of storage technologies, and for example, to a method and an apparatus for sharing a storage space, and a computer-readable storage medium.
Background
The Internet of Things (IoT) is a network that connects any object to the network according to an agreed protocol through Radio Frequency Identification (RFID), infrared sensor, Global Positioning System (GPS), laser scanner, and other information sensing devices, and the object performs information exchange and communication through an information propagation medium, so as to realize intelligent identification, Positioning, tracking, monitoring, and management.
With the vigorous development of the internet of things, more and more intelligent household appliances and household equipment enter thousands of households, and the intelligent household appliances and the household equipment are in networking communication through an ad hoc network technology.
In the process of implementing the embodiments of the present disclosure, it is found that at least the following problems exist in the related art: because the storage space of intelligent household appliances and home equipment is limited, the storage space is easy to be insufficient in the networking communication process, and the intelligent household appliances and the home equipment can not be normally used.
Disclosure of Invention
The following presents a simplified summary in order to provide a basic understanding of some aspects of the disclosed embodiments. This summary is not an extensive overview nor is intended to identify key/critical elements or to delineate the scope of such embodiments but rather as a prelude to the more detailed description that is presented later.
The embodiment of the disclosure provides a storage space sharing method and device and a computer readable storage medium, so as to solve the technical problem that insufficient storage space is easy to occur in the networking communication process due to limited storage space of intelligent household appliances and household equipment.
In some embodiments, a method for sharing a storage space is applied to a mesh network, the mesh network comprises a plurality of nodes, and the method comprises: publishing the remaining storage space to other nodes of the plurality of nodes; and after receiving a storage space sharing request sent by other nodes, sharing the rest storage space to other nodes.
In some embodiments, the storage space sharing apparatus is applied to a mesh network, the mesh network includes a plurality of nodes, and the apparatus includes: a publishing module configured to publish the remaining storage space to other nodes of the plurality of nodes; and the sharing module is configured to share the residual storage space to other nodes after receiving the storage space sharing request sent by other nodes.
In some embodiments, the apparatus for sharing a memory space comprises a processor and a memory storing program instructions, wherein the processor is configured to execute the method for sharing a memory space as described above when executing the program instructions.
In some embodiments, a computer-readable storage medium stores computer-executable instructions that, when executed by a processor, implement a method of sharing memory space as described above.
The method and the device for sharing the storage space and the computer-readable storage medium provided by the embodiment of the disclosure can achieve the following technical effects:
by issuing the remaining storage space to other nodes in the plurality of nodes and sharing the remaining storage space to other nodes after receiving the storage space sharing request sent by other nodes, the storage space sharing between the nodes can be realized, so that the utilization rate of the storage space is improved, and the user experience is further improved.
The foregoing general description and the following description are exemplary and explanatory only and are not restrictive of the application.
Drawings
One or more embodiments are illustrated by way of example in the accompanying drawings, which correspond to the accompanying drawings and not in limitation thereof, in which elements having the same reference numeral designations are shown as like elements and not in limitation thereof, and wherein:
fig. 1 is a schematic flowchart of a method for sharing a storage space according to an embodiment of the present disclosure;
fig. 2 is a flowchart illustrating a method for sharing a storage space according to an embodiment of the present disclosure;
fig. 3 is a flowchart illustrating a method for sharing a storage space according to an embodiment of the present disclosure;
fig. 4 is a flowchart illustrating a method for sharing a storage space according to an embodiment of the present disclosure;
fig. 5 is a schematic structural diagram of a device for sharing a storage space according to an embodiment of the present disclosure;
fig. 6 is a schematic structural diagram of a device for sharing a storage space according to an embodiment of the present disclosure.
Detailed Description
So that the manner in which the features and elements of the disclosed embodiments can be understood in detail, a more particular description of the disclosed embodiments, briefly summarized above, may be had by reference to the embodiments, some of which are illustrated in the appended drawings. In the following description of the technology, for purposes of explanation, numerous details are set forth in order to provide a thorough understanding of the disclosed embodiments. However, one or more embodiments may be practiced without these details. In other instances, well-known structures and devices may be shown in simplified form in order to simplify the drawing.
Fig. 1 is a schematic flowchart of a method for sharing a storage space according to an embodiment of the present disclosure. As shown in fig. 1, the method for sharing a storage space is applied to a Mesh (Mesh) network, the Mesh network includes a plurality of nodes, and the method for sharing a storage space includes:
s110, issuing the residual storage space to other nodes in the plurality of nodes;
and S120, after receiving the storage space sharing request sent by other nodes, sharing the residual storage space to other nodes.
Specifically, in the Mesh network, when any node in the plurality of nodes has a remaining storage space, the node may broadcast the remaining storage space to other nodes in the plurality of nodes, so that the other nodes may use the remaining storage space of the node to store data in the case that their own storage spaces are insufficient; further, when it is determined that the storage space of the node is insufficient, the other node may send a storage space sharing request to the node, and after receiving the storage space sharing request sent by the other node, the node shares the remaining storage space of the node to the other node.
Here, the Mesh network is also called a multi-hop (multi-hop) network, and is a dynamic and scalable network architecture that can efficiently transmit between wireless devices. The Mesh network consists of a Mesh router and a Mesh client, wherein the Mesh router forms a backbone network, is connected with the wired Internet (Internet) and is responsible for providing multi-hop wireless Internet connection for the Mesh client. Further, in the Mesh network, any wireless device node can simultaneously serve as a wireless Access Point (AP) and a router, each node in the network can send and receive signals, and each node can directly communicate with one or more peer nodes, that is, if the nearest Access Point is congested due to too much traffic, data can be automatically rerouted to a neighboring node with smaller traffic for transmission.
A node (node) is a connection point representing a redistribution point or a communication end point (some end devices). In a computer network, a node is an active electronic device connected to the network that is capable of sending, receiving, or forwarding information over a communication channel. Further, the node may be a home appliance such as a refrigerator, a washing machine, an air conditioner, or the like, a terminal device such as a mobile phone, a notebook computer, a personal digital assistant, or the like, or may also be a gateway device such as a router, a gateway, an exchange, or the like, which is not limited in this disclosure.
Storage space refers to the media required for data storage. In the embodiment of the present disclosure, the storage space refers to the total capacity of the device node, and the remaining storage space refers to the storage space that the device node can share to other device nodes.
According to the technical scheme provided by the embodiment of the disclosure, the residual storage space is issued to other nodes in the plurality of nodes, and after the storage space sharing request sent by other nodes is received, the residual storage space is shared to other nodes, so that the storage space sharing between the nodes can be realized, the utilization rate of the storage space is improved, and the user experience is further improved.
In some embodiments, publishing the remaining storage space to other nodes of the plurality of nodes comprises: detecting the self residual storage space of each node in the plurality of nodes; and issuing the residual storage space to other nodes in the plurality of nodes under the condition that the detected residual storage space is larger than a preset storage space threshold value.
Specifically, each node in the plurality of nodes detects the remaining storage space of the node at preset time intervals to obtain the storage capacity of the remaining storage space; further, the node compares the storage capacity with a preset storage space threshold, and if the storage capacity is greater than the preset storage space threshold, it indicates that the node has enough remaining storage space to share, at this time, the node may be used as a sharing node to broadcast its remaining storage space to other nodes in the plurality of nodes, so that the other nodes can use the remaining storage space of the sharing node when their own storage space is insufficient; if the storage capacity is smaller than or equal to the preset storage space threshold, it indicates that the node does not have enough remaining storage space to share, at this time, the node may send a prompt message such as "remaining storage space is insufficient" and continue to detect its own remaining storage space at preset time intervals.
Here, the preset time interval may be a system default time, such as 1 minute, 2 minutes, 5 minutes, etc.; or may be a time set by a user, such as 30 seconds, 10 minutes, 1 hour, etc., which is not limited by the embodiments of the present disclosure. The preset memory threshold may be a system default memory threshold, such as 500 bytes, 200 megabytes, 1 gigabyte, etc.; or a user-set storage space threshold, for example, 50 megabytes, 500 megabytes, 2 gigabytes, etc., which is not limited by the embodiments of the present disclosure.
In addition, when broadcasting the remaining storage space to other nodes in the Mesh network, the sharing node broadcasts the network address of the corresponding device node to the other nodes so that the other nodes can find the sharing node based on the network address.
It should be noted that the sharing node is not limited to the network address of the broadcasting device node, for example, the device identifier (Identity), the device name, and the like of the broadcasting device node may also be broadcast, and this is not limited in this disclosure. In addition, it should be further noted that the number of shared nodes may be one, two, three, or more, which is not limited by the embodiments of the present disclosure.
According to the technical scheme provided by the embodiment of the disclosure, the residual storage space of each node in the Mesh network is detected, and the residual storage space is broadcasted to other nodes when the residual storage space is larger than the preset storage space threshold value, so that other nodes in the Mesh network can timely acquire the related information of the residual storage space, and therefore, the utilization rate of the storage space is improved.
In some embodiments, after receiving a storage space sharing request sent by another node, sharing the remaining storage space to the other node includes: and after receiving data writing requests sent by other nodes, allowing the other nodes to write the target data into the residual storage space.
Specifically, under the condition that it is determined that any node in the plurality of nodes has a remaining storage space, when it is detected that the storage space of the node is insufficient, the other nodes may compare the storage space occupied by the target data to be stored with the remaining storage space of the node, if the storage space occupied by the target data is less than or equal to the remaining storage space of the node, the other nodes may send a data write request to the node, and after receiving the data write request sent by the other nodes, the node allows the other nodes to write the target data into the remaining storage space of the node; if the target data occupies a storage space larger than the remaining storage space of the node, the other nodes give up the node and attempt to communicate with another node. Here, the destination data may be stored in the form of a Key-Value dictionary for reading and fragmented transmission.
Optionally, in a case that it is determined that any node in the plurality of nodes has a remaining storage space, when it is detected that its own storage space is insufficient, the other nodes may send data write requests to the node; further, after receiving a data write request sent by another node, the node may obtain a storage space occupied by target data of the other node, and compare the storage space occupied by the target data with a remaining storage space of the node itself, and if the storage space occupied by the target data is less than or equal to the remaining storage space of the node itself, the node allows the other node to write the target data into the remaining storage space of the node; if the storage space occupied by the target data is larger than the remaining storage space of the node, the node sends prompt information such as 'the remaining storage space is insufficient' to other nodes.
Optionally, after writing the target data into the remaining storage space, the other nodes may send check codes to the node to check the correctness and integrity of the target data, and if the check is successful, the node sends prompt information such as "verification is successful" to the other nodes; if the check fails, the node will release the occupied remaining storage space. Further, the method of checking the target data may include, but is not limited to, parity checking, exclusive-or checking, cyclic redundancy checking, and the like.
In addition, for some private data, a process of data encryption and decryption may be added, or an authentication means of a reading node may be added, and since the contents of this portion are prior art, no further description is given here.
It should be noted that other nodes may send data write requests to any node in the Mesh network that can directly communicate with the other nodes and has the remaining storage space until a node that can provide enough storage space for the node is found.
According to the technical scheme provided by the embodiment of the disclosure, whether the residual storage space meets the requirement of the storage space occupied by the target data or not is judged before the data write-in request is sent, so that the searching speed of the adaptable node can be increased, the adaptation time is saved, and the adaptation efficiency is improved.
In some embodiments, after allowing other nodes to write the target data into the remaining storage space, the method for sharing the storage space of fig. 1 further includes: and after receiving the data reading request sent by other nodes, allowing the other nodes to read the target data from the residual storage space.
Specifically, after the target data is successfully written into the remaining storage space, when the target data in the remaining storage space needs to be read, other nodes may send data read requests to the shared node; and after receiving data reading requests sent by other nodes, the sharing node sends the target data in the residual storage space to other nodes.
In some embodiments, the step of sharing the remaining storage space to the other node after receiving the storage space sharing request sent by the other node includes: and after receiving a storage space sharing request sent by other nodes through the routing node, sharing the residual storage space to other nodes through the routing node.
Specifically, when the own storage space is insufficient and the shared node cannot directly communicate with the other nodes, the other nodes send data write requests to the routing nodes in the plurality of nodes, and the data write requests are used for requesting to write target data into the remaining storage space; after receiving data write-in requests sent by other nodes, the routing node acquires the storage space occupied by the target data of the other nodes and sends a data write-in request to the shared node according to the storage space occupied by the target data, wherein the data write-in request is used for requesting to write the target data into the residual storage space of the shared node; after receiving the prompt information such as 'the residual storage space is shared' sent by the sharing node, the routing node sends the prompt information such as 'the write target data is allowed' to other nodes; after receiving the prompt message sent by the routing node, other nodes send target data to be written into the residual storage space to the routing node; and after receiving the target data sent by other nodes, the routing node writes the target data into the residual storage space of the sharing node.
Further, when the target data in the remaining storage space of the shared node needs to be read, other nodes send data reading requests to the routing node, and the data reading requests are used for requesting to read the target data from the remaining storage space; after receiving data reading requests sent by other nodes, the routing node sends the data reading requests to the sharing node, wherein the data reading requests are used for requesting to read target data from the residual storage space of the sharing node; after receiving a data reading request sent by a routing node, the sharing node sends target data stored in the residual storage space of the sharing node to the routing node; after receiving the target data sent by the sharing node, the routing node sends the target data to other nodes.
It should be noted that the number of routing nodes may be one, two, three, or more, and the embodiment of the present disclosure does not limit this.
According to the technical scheme provided by the embodiment of the disclosure, the routing node is used as the transfer node to provide routing service for the node needing to share the storage space, so that communication connection can be established between the sharing node which originally cannot directly share the storage space and other nodes, the problem that the storage space cannot be shared between the nodes is solved, the utilization rate of the storage space is improved, and the user experience is further improved.
In some embodiments, the sharing of the remaining storage space to other nodes after receiving a storage space sharing request sent by other nodes includes: after receiving data writing requests sent by other nodes, the aggregation node acquires a storage space occupied by target data; under the condition that the storage space occupied by the target data is determined to be larger than the first remaining storage space of the first sharing node or the second remaining storage space of the second sharing node and smaller than the sum of the first remaining storage space and the second remaining storage space, the aggregation node divides the target data based on the first remaining storage space and the second remaining storage space to obtain a first target data segment and a second target data segment; and the aggregation node writes the first target data segment and the second target data segment into the first residual storage space and the second residual storage space respectively.
Specifically, in the mesh network, each node in the plurality of nodes detects its own remaining storage space according to a preset time interval, and when one node in the plurality of nodes detects that its remaining storage space is greater than a preset storage space threshold, the node may serve as a first sharing node to issue a first remaining storage space of the first sharing node to other nodes; in the case that another node of the plurality of nodes detects that its remaining storage space is greater than the preset storage space threshold, the node may issue, as a second sharing node, a second remaining storage space of the second sharing node to the other node.
Then, under the condition that the storage space of the node is determined to be insufficient and the node cannot directly communicate with the first sharing node and/or the second sharing node, other nodes send data writing requests to an aggregation node in the plurality of nodes, wherein the data writing requests are used for requesting to write target data into the residual storage space; after receiving data write-in requests sent by other nodes, the aggregation node acquires storage space occupied by target data of the other nodes, compares the storage space occupied by the target data with the first remaining storage space and/or the second remaining storage space, and sends a first data write-in request to the first sharing node under the condition that the storage space occupied by the target data is larger than the first remaining storage space or the second remaining storage space and smaller than the sum of the first remaining storage space and the second remaining storage space, wherein the first data write-in request is used for requesting to write a part of the target data into the first remaining storage space; after receiving a first data write request sent by an aggregation node, a first sharing node shares a first residual storage space of the first sharing node with the aggregation node, and sends prompt information such as 'write target data permission' to the aggregation node; the aggregation node sends a second data write request to the second sharing node, wherein the second data write request is used for requesting to write another part of target data into the second residual storage space; after receiving a second data write request sent by the aggregation node, the second sharing node shares the second remaining storage space of the second sharing node with the aggregation node, and sends prompt information such as "write target data is allowed" to the aggregation node; after receiving the prompt messages sent by the first sharing node and the second sharing node, the aggregation node sends prompt messages such as 'permission to write target data' to other nodes; after receiving the prompt message sent by the aggregation node, other nodes send target data to the aggregation node; after receiving target data sent by other nodes, the aggregation node divides the target data based on the first remaining storage space and the second remaining storage space to obtain a first target data segment and a second target data segment; the aggregation node writes the first target data segment into the first residual storage space; the first sharing node sends prompt information such as 'successful writing of the first target data segment' to the aggregation node; the aggregation node writes the second target data segment into the second residual storage space; the second sharing node sends a hint information such as "second target data segment write success" to the aggregation node.
Further, in the case that the target data in the remaining storage space needs to be read, the other nodes may send a data read request to the aggregation node, where the data read request is used to request to read the target data from the remaining storage space; after receiving data reading requests sent by other nodes, the aggregation node sends a first data reading request to the first sharing node, wherein the first data reading request is used for requesting to read a first target data segment from the first residual storage space; after receiving a first data reading request sent by the aggregation node, the first sharing node sends a first target data segment stored in the first residual storage space to the aggregation node; the aggregation node sends a second data reading request to the second sharing node, wherein the second data reading request is used for requesting to read a second target data segment from the second residual storage space; after receiving a second data reading request sent by the aggregation node, the second sharing node sends a second target data segment stored in the second remaining storage space to the aggregation node; after receiving the first target data segment and the second target data segment, the aggregation node splices the first target data segment and the second target data segment to obtain target data; and the aggregation node sends the target data to other nodes.
Here, the aggregation node not only has a routing capability, but also has a splitting and splicing capability of the target data, that is, in the writing process of the target data, if the storage space occupied by the target data is too large, the aggregation node may split the target data according to the remaining storage space to obtain a plurality of target data segments, and store the plurality of target data segments in a plurality of sharing nodes, respectively; in the reading process of the target data, the aggregation node can respectively read the target data segments from the plurality of sharing nodes, and the read target data segments are spliced according to the rules during writing to obtain the complete target data.
It should be noted that the aggregation node may divide the target data into any number of target data segments based on the storage space occupied by the target data and the remaining storage space, that is, the number of target data segments may be one, two, three, or more, which is not limited in this disclosure. In addition, the number of aggregation nodes may be one, two, three, or more, which is not limited by the embodiments of the present disclosure.
In addition, it should be noted that the sharing node is not limited to the first sharing node and the second sharing node as described above, and for example, a third sharing node, a fourth sharing node, and the like may also be included; that is, the number of shared nodes may be one, two, three, or more, which is not limited in this disclosure, and any node in the plurality of nodes may be regarded as a shared node as long as there is a remaining storage space in the node.
According to the technical scheme provided by the embodiment of the disclosure, by using the aggregation node as the transfer node, the target data can be segmented when the storage space occupied by the target data is larger than the remaining storage space, and the segmented target data segments are respectively stored in the remaining storage spaces of different sharing nodes; and when the target data is read, the target data segments are spliced, and the spliced target data is sent to other nodes, so that the problem of insufficient storage space of the nodes due to the fact that the storage space occupied by the target data is too large is solved, the utilization rate of the storage space is improved, and user experience is further improved.
In some embodiments, the method for sharing a storage space of fig. 1 further includes: and updating the residual storage space.
Specifically, any node in the plurality of nodes updates its own remaining storage space at preset time intervals, so that other nodes in the mesh network can timely learn the relevant information of the remaining storage space of the node.
According to the technical scheme provided by the embodiment of the disclosure, the self residual storage space of any node in the plurality of nodes is updated according to the preset time interval, so that other nodes in the mesh network can timely acquire the relevant information of the residual storage space of the node, thereby improving the utilization rate of the storage space and further improving the user experience.
All the above optional technical solutions may be combined arbitrarily to form optional embodiments of the present application, and are not described herein again.
Fig. 2 is a schematic flowchart of a method for sharing a storage space according to an embodiment of the present disclosure. The method for sharing the storage space of fig. 2 is applied to a mesh network, the mesh network comprises a plurality of nodes, and as shown in fig. 2, the method for sharing the storage space comprises:
s210, detecting the self residual storage space of each node in a plurality of nodes;
s220, determining whether the residual storage space is larger than a preset storage space threshold value;
s230, if the residual storage space is larger than a preset storage space threshold value, issuing the residual storage space to other nodes in the plurality of nodes;
s240, if the residual storage space is less than or equal to the preset storage space threshold, sending out prompt information, and continuing to execute S210;
s250, after receiving data writing requests sent by other nodes, acquiring storage space occupied by target data of other nodes;
s260, determining whether the storage space occupied by the target data is less than or equal to the residual storage space;
s270, if the storage space occupied by the target data is smaller than or equal to the residual storage space, allowing other nodes to write the target data into the residual storage space;
s280, if the storage space occupied by the target data is larger than the residual storage space, sending prompt information;
and S290, after receiving the data reading request sent by other nodes, allowing the other nodes to read the target data from the residual storage space.
Specifically, in the Mesh network, each node in a plurality of nodes detects its own remaining storage space at preset time intervals; if the fact that the remaining storage space of any node in the plurality of nodes is larger than the preset storage space threshold value is detected, the node can be used as a sharing node to broadcast the remaining storage space to other nodes in the plurality of nodes, so that the other nodes can use the remaining storage space of the sharing node to store data under the condition that the storage space of the other nodes is insufficient; if the fact that the remaining storage space of any node in the plurality of nodes is smaller than or equal to the preset storage space threshold value is detected, prompt information such as 'the remaining storage space is insufficient' is sent out, and the detection of the remaining storage space of the node is continued at the preset time interval.
Next, under the condition that the storage space of the other node is insufficient, the other nodes send data writing requests to the shared node, wherein the data writing requests are used for requesting to write target data into the residual storage space of the shared node; after receiving data writing requests sent by other nodes, the sharing node acquires the storage space occupied by the target data of the other nodes, compares the storage space occupied by the target data with the remaining storage space of the sharing node, and allows the other nodes to write the target data into the remaining storage space if the storage space occupied by the target data is smaller than or equal to the remaining storage space; and if the storage space occupied by the target data is larger than the residual storage space, the sharing node refuses other nodes to write the target data into the residual storage space, and sends prompt information such as 'the residual storage space is insufficient' to the other nodes.
Further, after the target data is successfully written into the remaining storage space, if the target data in the remaining storage space is desired to be read, the other nodes may send data read requests to the sharing node; and after receiving data reading requests sent by other nodes, the sharing node sends the target data in the residual storage space to other nodes.
According to the technical scheme provided by the embodiment of the disclosure, by detecting the remaining storage space of each node in the plurality of nodes and allowing other nodes to write the target data into the remaining storage space under the condition that the remaining storage space is larger than the preset storage space threshold, the storage space sharing among the nodes can be realized under the condition that the storage space supported by the nodes is not changed, so that the hardware cost is saved, the utilization rate of the storage space is improved, and the user experience is further improved.
Fig. 3 is a flowchart illustrating a method for sharing a storage space according to an embodiment of the present disclosure. The method for sharing the storage space of fig. 3 is applied to a mesh network, the mesh network includes a plurality of nodes, the interaction subject involved in fig. 3 is a shared node, a routing node and other nodes in the plurality of nodes, as shown in fig. 3, the method for sharing the storage space includes:
s301, the shared node detects the residual storage space of the shared node and determines whether the residual storage space is larger than a preset storage space threshold value;
s302, when detecting that the residual storage space is larger than a preset storage space threshold value, the sharing node issues the residual storage space to other nodes;
s303, when detecting that the storage space of the node is insufficient and the node cannot directly communicate with the shared node, other nodes send data write-in requests to the routing node, wherein the data write-in requests are used for requesting to write target data into the residual storage space;
s304, after receiving data writing requests sent by other nodes, the routing node acquires the storage space occupied by the target data of other nodes;
s305, the routing node sends a data writing request to the sharing node according to the storage space occupied by the target data, wherein the data writing request is used for requesting to write the target data into the residual storage space of the sharing node;
s306, after receiving the data writing request sent by the routing node, the sharing node shares the residual storage space of the sharing node with the routing node and sends the prompt information such as 'the residual storage space is shared' to the routing node;
s307, after receiving the prompt message sent by the sharing node, the routing node sends the prompt message such as 'write target data is allowed' to other nodes;
s308, after receiving the prompt message sent by the routing node, other nodes send the target data to the routing node;
s309, after receiving the target data sent by other nodes, the routing node writes the target data into the remaining storage space of the shared node;
s310, under the condition that target data in the residual storage space of the shared node needs to be read, other nodes send data reading requests to the routing node, and the data reading requests are used for requesting to read the target data from the residual storage space;
s311, after receiving data reading requests sent by other nodes, the routing node sends the data reading requests to the sharing node, and the data reading requests are used for requesting to read target data from the residual storage space of the sharing node;
s312, after receiving the data reading request sent by the routing node, the sharing node sends the target data stored in the residual storage space to the routing node;
s313, after receiving the target data sent by the sharing node, the routing node sends the target data to another node.
Specifically, in the mesh network, each node in a plurality of nodes detects its own remaining storage space according to a preset time interval; in the case that it is detected that the remaining storage space of any one of the plurality of nodes is larger than the preset storage space threshold, the node may broadcast its remaining storage space to other nodes of the plurality of nodes as a shared node, so that the other nodes may use the remaining storage space of the shared node if their own storage space is insufficient.
Then, under the condition that the own storage space is determined to be insufficient and the shared node cannot directly communicate, other nodes send data writing requests to routing nodes in the plurality of nodes, wherein the data writing requests are used for requesting to write target data into the residual storage space; after receiving data write-in requests sent by other nodes, the routing node acquires the storage space occupied by the target data of the other nodes and sends a data write-in request to the shared node according to the storage space occupied by the target data, wherein the data write-in request is used for requesting to write the target data into the residual storage space of the shared node; after receiving the prompt information such as 'the residual storage space is shared' sent by the sharing node, the routing node sends the prompt information such as 'the write target data is allowed' to other nodes; after receiving the prompt message sent by the routing node, other nodes send target data to be written into the residual storage space to the routing node; and after receiving the target data sent by other nodes, the routing node writes the target data into the residual storage space of the sharing node.
Further, when the target data in the remaining storage space of the shared node needs to be read, other nodes send data reading requests to the routing node, and the data reading requests are used for requesting to read the target data from the remaining storage space; after receiving data reading requests sent by other nodes, the routing node sends the data reading requests to the sharing node, wherein the data reading requests are used for requesting to read target data from the residual storage space of the sharing node; after receiving a data reading request sent by a routing node, the sharing node sends target data stored in the residual storage space of the sharing node to the routing node; after receiving the target data sent by the sharing node, the routing node sends the target data to other nodes.
According to the technical scheme provided by the embodiment of the disclosure, the routing node is used as the transfer node to provide routing service for the node needing to share the storage space, so that communication connection can be established between the sharing node which originally cannot directly share the storage space and other nodes, the problem that the storage space cannot be shared between the nodes is solved, the utilization rate of the storage space is improved, and the user experience is further improved.
Fig. 4 is a flowchart illustrating a method for sharing a storage space according to an embodiment of the present disclosure. The method for sharing the storage space of fig. 4 is applied to a mesh network, the mesh network includes a plurality of nodes, and the interaction subjects related to fig. 4 are a first sharing node, a second sharing node, an aggregation node and other nodes in the plurality of nodes, as shown in fig. 4, the method for sharing the storage space includes:
s401, a first sharing node detects a first residual storage space of the first sharing node, and issues the first residual storage space to other nodes when the first residual storage space is detected to be larger than a preset first storage space threshold value;
s402, the second sharing node detects the second residual storage space of the second sharing node, and issues the second residual storage space to other nodes when the second residual storage space is detected to be larger than a preset second storage space threshold value;
s403, when detecting that the storage space of the node is insufficient and the node cannot directly communicate with the first sharing node and/or the second sharing node, sending a data writing request to the aggregation node by other nodes, wherein the data writing request is used for requesting to write target data into the residual storage space;
s404, after receiving data writing requests sent by other nodes, the aggregation node acquires storage space occupied by target data of other nodes;
s405, when the storage space occupied by the target data is larger than the first remaining storage space or the second remaining storage space and smaller than the sum of the first remaining storage space and the second remaining storage space, the aggregation node sends a first data write request to the first sharing node, wherein the first data write request is used for requesting to write a part of the target data into the first remaining storage space;
s406, after receiving a first data write request sent by the aggregation node, the first sharing node shares the first remaining storage space of the first sharing node with the aggregation node, and sends prompt information such as 'write target data permission' to the aggregation node;
s407, the aggregation node sends a second data write request to the second sharing node, wherein the second data write request is used for requesting to write another part of target data into the second remaining storage space;
s408, after receiving a second data write request sent by the aggregation node, the second sharing node shares the second remaining storage space of the second sharing node with the aggregation node, and sends prompt information such as 'write target data allowed' to the aggregation node;
s409, after receiving the prompt messages sent by the first sharing node and the second sharing node, the aggregation node sends the prompt messages such as 'permission to write target data' to other nodes;
s410, after receiving the prompt message sent by the aggregation node, other nodes send target data to the aggregation node;
s411, after receiving target data sent by other nodes, the aggregation node divides the target data based on the first remaining storage space and the second remaining storage space to obtain a first target data segment and a second target data segment;
s412, the aggregation node writes the first target data segment into the first residual storage space;
s413, the first sharing node sends a prompt message such as "the first target data segment is successfully written" to the aggregation node;
s414, the aggregation node writes the second target data segment into the second residual storage space;
s415, the second sharing node sends a prompt message such as "the second target data segment is successfully written" to the aggregation node;
s416, under the condition that the target data in the residual storage space needs to be read, other nodes send data reading requests to the aggregation node, wherein the data reading requests are used for requesting to read the target data from the residual storage space;
s417, after receiving data reading requests sent by other nodes, the aggregation node sends a first data reading request to the first sharing node, wherein the first data reading request is used for requesting to read a first target data segment from the first remaining storage space;
s418, after receiving a first data reading request sent by the aggregation node, the first sharing node sends a first target data segment stored in the first remaining storage space to the aggregation node;
s419, the aggregation node sends a second data reading request to the second sharing node, wherein the second data reading request is used for requesting to read a second target data segment from the second residual storage space;
s420, after receiving a second data reading request sent by the aggregation node, the second sharing node sends a second target data segment stored in the second remaining storage space to the aggregation node;
s421, after receiving the first target data segment and the second target data segment, the aggregation node splices the first target data segment and the second target data segment to obtain target data;
s422, the aggregation node sends the target data to other nodes.
According to the technical scheme provided by the embodiment of the disclosure, by using the aggregation node as the transfer node, the target data can be segmented when the storage space occupied by the target data is larger than the remaining storage space, and the segmented target data segments are respectively stored in the remaining storage spaces of different sharing nodes; and when the target data is read, the target data segments are spliced, and the spliced target data is sent to other nodes, so that the problem of insufficient storage space of the nodes due to the fact that the storage space occupied by the target data is too large is solved, the utilization rate of the storage space is improved, and user experience is further improved.
The following are embodiments of the apparatus of the present application that may be used to perform embodiments of the method of the present application. For details which are not disclosed in the embodiments of the apparatus of the present application, reference is made to the embodiments of the method of the present application.
Fig. 5 is a schematic structural diagram of a device for sharing a storage space according to an embodiment of the present disclosure. As shown in fig. 5, the storage space sharing apparatus is applied to a mesh network, the mesh network includes a plurality of nodes, and the storage space sharing apparatus includes:
a publishing module 510 configured to publish the remaining storage space to other nodes of the plurality of nodes;
and the sharing module 520 is configured to share the remaining storage space to other nodes after receiving the storage space sharing request sent by other nodes.
According to the technical scheme provided by the embodiment of the disclosure, the residual storage space is issued to other nodes in the plurality of nodes, and after the storage space sharing request sent by other nodes is received, the residual storage space is shared to other nodes, so that the storage space sharing between the nodes can be realized, the utilization rate of the storage space is improved, and the user experience is further improved.
In some embodiments, publish module 510 of FIG. 5 includes: a detecting unit 5101 and a publishing unit 5102, wherein the detecting unit 5101 is configured to detect a remaining storage space of each node of the plurality of nodes; the publishing unit 5102 is configured to publish the remaining storage space to other nodes of the plurality of nodes if it is detected that the remaining storage space is greater than a preset storage space threshold.
In some embodiments, the sharing module 520 of fig. 5 includes: the writing unit 5201 is configured to allow the other node to write the target data into the remaining storage space after receiving the data write request sent by the other node.
In some embodiments, the sharing module 520 of fig. 5 further comprises: the reading unit 5202 is configured to allow the other node to read the target data from the remaining storage space after receiving the data reading request sent by the other node.
In some embodiments, the plurality of nodes includes a routing node, and the sharing module 520 of fig. 5 further includes: the sharing unit 5203 is configured to share the remaining storage space to the other node via the routing node after receiving the storage space sharing request sent by the other node via the routing node.
In some embodiments, the plurality of nodes includes an aggregation node, a first sharing node, and a second sharing node, and the sharing module 520 of fig. 5 further includes: an acquisition unit 5204 and a division unit 5205.
Specifically, the obtaining unit 5204 is configured to obtain, after receiving a data write request sent by another node, a storage space occupied by the target data; the dividing unit 5205 is configured to, when determining that the storage space occupied by the target data is greater than a first remaining storage space of the first sharing node or a second remaining storage space of the second sharing node and smaller than a sum of the first remaining storage space and the second remaining storage space, divide the target data based on the first remaining storage space and the second remaining storage space to obtain a first target data segment and a second target data segment; the write unit 5201 writes the first destination data segment and the second destination data segment into the first remaining storage space and the second remaining storage space, respectively.
In some embodiments, the apparatus for sharing a storage space of fig. 5 further includes: an update module 530 configured to update the remaining storage space.
Fig. 6 is a schematic structural diagram of a device for sharing a storage space according to an embodiment of the present disclosure. As shown in fig. 6, the apparatus for sharing the storage space includes: a Processor (Processor)610 and a Memory (Memory)620, and may further include a Communication Interface (Communication Interface)630 and a bus 640. The processor 610, the communication interface 630 and the memory 620 may communicate with each other through the bus 640. Communication interface 630 may be used for information transfer. The processor 610 may call logic instructions in the memory 620 to perform the memory space sharing method of the above-described embodiments.
In addition, the logic instructions in the memory 620 may be implemented in the form of software functional units and stored in a computer readable storage medium when the software functional units are sold or used as independent products.
The memory 620 is used as a computer-readable storage medium for storing software programs, computer-executable programs, such as program instructions/modules corresponding to the methods in the embodiments of the present disclosure. The processor 610 executes functional applications and data processing by executing program instructions/modules stored in the memory 620, i.e., implements the method of sharing memory space in the above-described method embodiments.
The memory 620 may include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function; the storage data area may store data created according to the use of the terminal device, and the like. Further, the memory 620 may include a high-speed random access memory, and may also include a non-volatile memory.
The disclosed embodiments provide a computer-readable storage medium storing computer-executable instructions configured to perform the above-mentioned method for sharing a storage space.
An embodiment of the present disclosure provides a computer program product including a computer program stored on a computer-readable storage medium, the computer program including program instructions that, when executed by a computer, cause the computer to perform the above-mentioned method of sharing a storage space.
The computer-readable storage medium described above may be a transitory computer-readable storage medium or a non-transitory computer-readable storage medium.
The technical solution of the embodiments of the present disclosure may be embodied in the form of a software product, where the computer software product is stored in a storage medium and includes one or more instructions to enable a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method of the embodiments of the present disclosure. And the aforementioned storage medium may be a non-transitory storage medium comprising: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes, and may also be a transient storage medium.
The above description and drawings sufficiently illustrate embodiments of the disclosure to enable those skilled in the art to practice them. Other embodiments may incorporate structural, logical, electrical, process, and other changes. The examples merely typify possible variations. Individual components and functions are optional unless explicitly required, and the sequence of operations may vary. Portions and features of some embodiments may be included in or substituted for those of others. The scope of the disclosed embodiments includes the full ambit of the claims, as well as all available equivalents of the claims. As used in this application, although the terms "first," "second," etc. may be used in this application to describe various elements, these elements should not be limited by these terms. These terms are only used to distinguish one element from another. For example, a first element could be termed a second element, and, similarly, a second element could be termed a first element, unless the meaning of the description changes, so long as all occurrences of the "first element" are renamed consistently and all occurrences of the "second element" are renamed consistently. The first and second elements are both elements, but may not be the same element. Furthermore, the words used in the specification are words of description only and are not intended to limit the claims. As used in the description of the embodiments and the claims, the singular forms "a", "an" and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. Similarly, the term "and/or" as used in this application is meant to encompass any and all possible combinations of one or more of the associated listed. Furthermore, the terms "comprises" and/or "comprising," when used in this application, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof. Without further limitation, an element defined by the phrase "comprising an …" does not exclude the presence of other like elements in a process, method or apparatus that comprises the element. In this document, each embodiment may be described with emphasis on differences from other embodiments, and the same and similar parts between the respective embodiments may be referred to each other. For methods, products, etc. of the embodiment disclosures, reference may be made to the description of the method section for relevance if it corresponds to the method section of the embodiment disclosure.
Those of skill in the art would appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software may depend upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the disclosed embodiments. It can be clearly understood by the skilled person that, for convenience and brevity of description, the specific working processes of the system, the apparatus and the unit described above may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the embodiments disclosed herein, the disclosed methods, products (including but not limited to devices, apparatuses, etc.) may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units may be merely a logical division, and in actual implementation, there may be another division, for example, multiple units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form. The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to implement the present embodiment. In addition, functional units in the embodiments of the present disclosure may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. In the description corresponding to the flowcharts and block diagrams in the figures, operations or steps corresponding to different blocks may also occur in different orders than disclosed in the description, and sometimes there is no specific order between the different operations or steps. For example, two sequential operations or steps may in fact be executed substantially concurrently, or they may sometimes be executed in the reverse order, depending upon the functionality involved. Each block of the block diagrams and/or flowchart illustrations, and combinations of blocks in the block diagrams and/or flowchart illustrations, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
Claims (10)
1. A method for sharing storage space, applied to a mesh network, wherein the mesh network includes a plurality of nodes, the method comprising:
publishing the remaining storage space to other nodes of the plurality of nodes;
and after receiving the storage space sharing request sent by the other node, sharing the residual storage space to the other node.
2. The method of claim 1, wherein said publishing the remaining storage space to other nodes of the plurality of nodes comprises:
detecting the remaining storage space of each node in the plurality of nodes;
and issuing the remaining storage space to other nodes in the plurality of nodes when the remaining storage space is detected to be larger than a preset storage space threshold.
3. The method according to claim 1, wherein the sharing the remaining storage space to the other node after receiving the storage space sharing request sent by the other node, comprises:
and after receiving the data writing request sent by the other node, allowing the other node to write the target data into the residual storage space.
4. The method of claim 3, wherein after said allowing the other nodes to write target data into the remaining storage space, the method further comprises:
and after receiving a data reading request sent by the other node, allowing the other node to read the target data from the residual storage space.
5. The method according to claim 1, wherein the plurality of nodes include a routing node, and the sharing the remaining storage space to the other node after receiving the storage space sharing request sent by the other node comprises:
and after receiving the storage space sharing request sent by the other nodes through the routing node, sharing the residual storage space to the other nodes through the routing node.
6. The method according to claim 1, wherein the plurality of nodes include an aggregation node, a first sharing node, and a second sharing node, and the sharing the remaining storage space to the other nodes after receiving the storage space sharing request sent by the other nodes comprises:
after receiving data writing requests sent by other nodes, the aggregation node acquires a storage space occupied by target data;
under the condition that the storage space occupied by the target data is determined to be larger than the first remaining storage space of the first sharing node or the second remaining storage space of the second sharing node and smaller than the sum of the first remaining storage space and the second remaining storage space, the aggregation node divides the target data based on the first remaining storage space and the second remaining storage space to obtain a first target data segment and a second target data segment;
the aggregation node writes the first target data segment and the second target data segment into the first remaining storage space and the second remaining storage space, respectively.
7. The method of any one of claims 1 to 6, further comprising:
and updating the residual storage space.
8. An apparatus for sharing storage space, the apparatus being applied to a mesh network, the mesh network comprising a plurality of nodes, the apparatus comprising:
a publishing module configured to publish the remaining storage space to other nodes of the plurality of nodes;
and the sharing module is configured to share the remaining storage space to the other nodes after receiving the storage space sharing request sent by the other nodes.
9. An apparatus for sharing a memory space, comprising a processor and a memory storing program instructions, wherein the processor is configured to execute the method for sharing a memory space according to any one of claims 1 to 7 when executing the program instructions.
10. A computer-readable storage medium having computer-executable instructions stored thereon, which when executed by a processor implement a method of sharing a storage space according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911393851.6A CN111124316B (en) | 2019-12-30 | 2019-12-30 | Storage space sharing method and device and computer readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911393851.6A CN111124316B (en) | 2019-12-30 | 2019-12-30 | Storage space sharing method and device and computer readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111124316A true CN111124316A (en) | 2020-05-08 |
| CN111124316B CN111124316B (en) | 2023-12-19 |
Family
ID=70504940
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911393851.6A Active CN111124316B (en) | 2019-12-30 | 2019-12-30 | Storage space sharing method and device and computer readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111124316B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113504879A (en) * | 2021-07-27 | 2021-10-15 | 华帝股份有限公司 | Data storage method and intelligent household appliance |
| US11683375B2 (en) | 2021-08-31 | 2023-06-20 | Cisco Technology, Inc. | Dynamic storage sharing across network devices |
Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2011145833A (en) * | 2010-01-13 | 2011-07-28 | Hitachi High-Technologies Corp | Data distribution management system and data distribution management method |
| JP2014174597A (en) * | 2013-03-06 | 2014-09-22 | Kddi Corp | In-memory distributed database, data distribution method, and program |
| US20160034397A1 (en) * | 2013-04-16 | 2016-02-04 | Huawei Technologies Co., Ltd. | Method and Apparatus for Processing Data and Computer System |
| CN105530197A (en) * | 2014-10-23 | 2016-04-27 | 华为技术有限公司 | Resource sharing configuration method and device between SoC nodes |
| CN107948248A (en) * | 2017-11-01 | 2018-04-20 | 平安科技（深圳）有限公司 | Distributed storage method, control server and computer-readable recording medium |
| US20180302825A1 (en) * | 2017-04-17 | 2018-10-18 | Qualcomm Incorporated | Flow control for wireless devices |
| CN108900626A (en) * | 2018-07-18 | 2018-11-27 | 中国联合网络通信集团有限公司 | Date storage method, apparatus and system under a kind of cloud environment |
| US10148751B1 (en) * | 2015-12-28 | 2018-12-04 | EMC IP Holding Company LLC | Asymmetric active-active storage for hyper-converged system |
| CN108959463A (en) * | 2018-06-19 | 2018-12-07 | 广东美的厨房电器制造有限公司 | Information sharing method and household appliance and information sharing system and storage medium |
| CN108984323A (en) * | 2018-07-13 | 2018-12-11 | 上海联影医疗科技有限公司 | A kind of dispatching method and system of shared memory space |
| US10282136B1 (en) * | 2017-11-30 | 2019-05-07 | Hitachi, Ltd. | Storage system and control method thereof |
| CN110069386A (en) * | 2019-04-29 | 2019-07-30 | 深圳市网心科技有限公司 | A kind of operation terminal data processing method, operation terminal, system and medium |
| CN110597824A (en) * | 2019-09-20 | 2019-12-20 | 腾讯科技（深圳）有限公司 | Data storage method and device based on block chain network |
-
2019
- 2019-12-30 CN CN201911393851.6A patent/CN111124316B/en active Active
Patent Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2011145833A (en) * | 2010-01-13 | 2011-07-28 | Hitachi High-Technologies Corp | Data distribution management system and data distribution management method |
| JP2014174597A (en) * | 2013-03-06 | 2014-09-22 | Kddi Corp | In-memory distributed database, data distribution method, and program |
| US20160034397A1 (en) * | 2013-04-16 | 2016-02-04 | Huawei Technologies Co., Ltd. | Method and Apparatus for Processing Data and Computer System |
| CN105530197A (en) * | 2014-10-23 | 2016-04-27 | 华为技术有限公司 | Resource sharing configuration method and device between SoC nodes |
| US10148751B1 (en) * | 2015-12-28 | 2018-12-04 | EMC IP Holding Company LLC | Asymmetric active-active storage for hyper-converged system |
| US20180302825A1 (en) * | 2017-04-17 | 2018-10-18 | Qualcomm Incorporated | Flow control for wireless devices |
| CN107948248A (en) * | 2017-11-01 | 2018-04-20 | 平安科技（深圳）有限公司 | Distributed storage method, control server and computer-readable recording medium |
| US10282136B1 (en) * | 2017-11-30 | 2019-05-07 | Hitachi, Ltd. | Storage system and control method thereof |
| CN108959463A (en) * | 2018-06-19 | 2018-12-07 | 广东美的厨房电器制造有限公司 | Information sharing method and household appliance and information sharing system and storage medium |
| CN108984323A (en) * | 2018-07-13 | 2018-12-11 | 上海联影医疗科技有限公司 | A kind of dispatching method and system of shared memory space |
| CN108900626A (en) * | 2018-07-18 | 2018-11-27 | 中国联合网络通信集团有限公司 | Date storage method, apparatus and system under a kind of cloud environment |
| CN110069386A (en) * | 2019-04-29 | 2019-07-30 | 深圳市网心科技有限公司 | A kind of operation terminal data processing method, operation terminal, system and medium |
| CN110597824A (en) * | 2019-09-20 | 2019-12-20 | 腾讯科技（深圳）有限公司 | Data storage method and device based on block chain network |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113504879A (en) * | 2021-07-27 | 2021-10-15 | 华帝股份有限公司 | Data storage method and intelligent household appliance |
| US11683375B2 (en) | 2021-08-31 | 2023-06-20 | Cisco Technology, Inc. | Dynamic storage sharing across network devices |
| US11956313B2 (en) | 2021-08-31 | 2024-04-09 | Cisco Technology, Inc. | Dynamic storage sharing across network devices |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111124316B (en) | 2023-12-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR102243972B1 (en) | User terminal location area update method, access network entity, user terminal and core network entity | |
| CN108353351B (en) | Method for selecting service network, network equipment and management equipment | |
| CN107820700B (en) | Learned roaming authentication profiles | |
| CN105847447B (en) | Message pushing method and device | |
| KR102288521B1 (en) | Apparatus and method for storing data based on blockchain | |
| JP2017525226A (en) | Apparatus and method for controlling wireless network access and wireless data traffic | |
| US20190007825A1 (en) | Carrier configuration processing method, device and system, and computer storage medium | |
| CN105337941A (en) | Method and device for providing device identifier | |
| CN110995513A (en) | Data sending and receiving method in Internet of things system, Internet of things equipment and platform | |
| EP2823578A1 (en) | Systems and methods for implementing peer-to-peer wireless connections | |
| CN111124316B (en) | Storage space sharing method and device and computer readable storage medium | |
| CN111401904B (en) | Consensus method and system in alliance chain | |
| CN102404710B (en) | Method, device and system for contract signing data management of machine type communication device | |
| WO2015051120A1 (en) | Creating, joining, finding, discovering, restoring and relocating process-based channels | |
| CN110888892B (en) | Block synchronization method, device and storage medium | |
| CN108738027B (en) | Network processing method, resource management system and network equipment | |
| CN108270724B (en) | Method, device and system for acquiring access information of shared wireless access point | |
| US20180176781A1 (en) | Method and device for managing wireless access point | |
| CN107431634B (en) | Method, device and system for establishing interface between VNFM | |
| RU2767991C1 (en) | Information processing method, terminal device and data medium | |
| CN109275125B (en) | Resource sharing method, device, equipment and storage medium | |
| CN106028303B (en) | Intelligent device discovery method and device | |
| EP3318077B1 (en) | Circumventing wireless device spatial tracking based on wireless device identifiers | |
| CN114080003B (en) | Method and device for accessing network | |
| JP2021516470A (en) | System broadcast information instruction method, network device and terminal device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |