KR20140061109A - Method and apparatus for file synchronization - Google Patents
Method and apparatus for file synchronizationInfo
- Publication number
- KR20140061109A KR20140061109A KR1020120128302A KR20120128302A KR20140061109A KR 20140061109 A KR20140061109 A KR 20140061109A KR 1020120128302 A KR1020120128302 A KR 1020120128302A KR 20120128302 A KR20120128302 A KR 20120128302A KR 20140061109 A KR20140061109 A KR 20140061109A
- Authority
- KR
- South Korea
- Prior art keywords
- file
- nodes
- size
- bandwidth information
- node
- Prior art date
Links
Images
Classifications
-
- 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/1095—Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
A file synchronization method and apparatus are disclosed. According to a preferred embodiment of the present invention, it is determined whether a size of a file to be transmitted is larger than a preset reference size. When the size of a file to be transmitted is larger than a preset reference size, bandwidth information is received from a plurality of nodes, Calculates a weight for each of the plurality of nodes, divides the file according to the calculated weight, assigns the fragmented file fragments to each of the plurality of nodes, and transmits the fragment to each of the plurality of nodes.
According to the present invention, there is an advantage that more efficient file synchronization can be performed according to the size of a file, and file synchronization can be performed more efficiently in consideration of a network state between a node and a node
Description
The present invention relates to a file synchronization method and apparatus, and more particularly, to a method and apparatus for synchronizing a file through asymmetric file division.
Recently, due to the expansion and development of networks such as the Internet and mobile communication networks, the types and sizes of files to be transmitted through the network have greatly increased.
In particular, recently, it is required to construct a cloud environment in which a user can freely download and upload a desired file so that the user can freely use the file. Accordingly, And to synchronize the files to make them available to the user.
On the other hand, the devices constituting the network are called various names such as a server, a client, a router, a switch and the like depending on functions and locations, but generally, And a set of combinations thereof are collectively referred to as a node, each set is collectively referred to as a node.
Conventional file synchronization methods between these nodes use various methods.
First, the most common method is to transfer the entire file to another node, or to receive the file from another node, and to transfer the file to other nodes that do not have the file again.
Such a general method has a problem in that it takes much time to synchronize the files in all the nodes as the size of the file increases and the number of nodes to be owned by the file increases.
In order to overcome this problem, a method of dividing a file into several segments rather than the whole file, and delivering the fragmented file fragments to a plurality of nodes, respectively, thereby shortening the time of file synchronization has been proposed and used.
The fragmented file fragment is also referred to as a segment, a chunked file, or chunked data, and is hereinafter referred to as a file fragment.
On the other hand, as a file synchronization method using divided file fragments, a method called Fast Replica and a method called Julia Algorithm are widely used at present.
In addition, Adaptive Fast Replica, which is another variant of Fast Replica, is also used.
Fast Replica and Adaptive Fast Replica The Julia Algorithm is a common feature that divides a file, sends a file fragment to a plurality of specific nodes, and a node that has transmitted a file fragment transmits it to other nodes again.
The way to split these files and synchronize them is generally faster than the way to transfer and synchronize the entire file.
However, when the size of the file itself is small, the method of dividing the file and synchronizing the file takes into consideration the time required to split the file, the time to reconstruct the file fragment, and the transmission time between the nodes according to the number of file fragments It is more time consuming to do so.
In the conventional method of file synchronization using file division, the size of file fragments is divided equally and transmitted to other nodes.
However, since the network situation between each node is different, for example, when the network situation between a specific node and a node is not good and it takes a long time to send and receive a file fragment, a file The synchronization time is increased.
In order to solve the above-mentioned problems, the present invention proposes a file synchronization method and apparatus that enables file synchronization more efficiently according to the size of a file.
In addition, the present invention proposes a file synchronization method and apparatus that enable file synchronization more efficiently by considering the network state between a node and a node.
Other objects of the present invention will become readily apparent from the following description of the embodiments.
According to an aspect of the present invention, there is provided a file synchronization method.
According to a preferred embodiment of the present invention, there is provided a file synchronization method performed by the origin node in a file synchronization system including an origin node having a file to be transferred and a plurality of nodes, Determining whether the size is larger than the size; Receiving bandwidth information from the plurality of nodes when the size of the file to be transmitted is larger than a preset reference size; Calculating a weight for each of the plurality of nodes according to the received bandwidth information; Dividing the file according to the calculated weight; And allocating the fragmented file fragment to each of the plurality of nodes and transmitting the fragmented file fragment to each of the plurality of nodes.
If the size of the file to be transmitted is smaller than a preset reference size, the file to be transmitted can be transmitted to the plurality of nodes without being divided.
The weight for each of the plurality of nodes calculated according to the received bandwidth information may be proportional to the received bandwidth.
Wherein the bandwidth information received from the plurality of nodes includes a bandwidth including both a bandwidth with the origin node and a bandwidth with another node to which a piece of the file received from the origin node is to be transmitted, Information.
Receiving the bandwidth information from the plurality of nodes may utilize RTT (Round Trip Time) information from the origin node to the plurality of nodes.
According to another aspect of the present invention, a file synchronization apparatus is provided.
According to a preferred embodiment of the present invention, there is provided an apparatus for synchronizing a file to a plurality of nodes, the apparatus comprising: a file size comparing unit for determining whether a size of the file to be transferred is larger than a preset reference size; A bandwidth information receiver for receiving bandwidth information from the plurality of nodes when the size of the file to be transmitted is larger than a preset reference size; A weight calculation unit for calculating a weight for each of the plurality of nodes according to the received bandwidth information; A file dividing unit dividing the file according to the calculated weight value; And a file transfer unit for transferring the divided file fragments to each of the plurality of nodes by allocating the divided file fragments to each of the plurality of nodes.
If the size of the file to be transmitted is smaller than a preset reference size, the file transfer unit may transmit the file to the plurality of nodes without dividing the file to be transferred.
The weights for each of the plurality of nodes calculated in the weight calculation unit according to the received bandwidth information may be proportional to the received bandwidth.
Wherein the bandwidth information received from the plurality of nodes received by the bandwidth information receiving unit includes at least one of bandwidth information including a bandwidth with the file synchronizing apparatus and a bandwidth with another node to transmit a file fragment received from the file synchronizing apparatus .
The bandwidth information received from the plurality of nodes received by the bandwidth information receiving unit may use RTT (Round Trip Time) information from the file synchronizing apparatus to the plurality of nodes.
According to another aspect of the present invention, there is provided a recording medium recording a program for implementing a file synchronization method.
According to a preferred embodiment of the present invention, there is provided a recording medium on which is recorded a program for implementing a file synchronization method performed in the origin node in a file synchronization system including an origin node having a file to be transferred and a plurality of nodes, Determining whether a size of the file to be transferred is larger than a preset reference size; Receiving bandwidth information from the plurality of nodes when the size of the file to be transmitted is larger than a preset reference size; Calculating a weight for each of the plurality of nodes according to the received bandwidth information; Dividing the file according to the calculated weight; And allocating the fragmented file fragment to each of the plurality of nodes and transmitting the fragmented file fragment to each of the plurality of nodes.
If the size of the file to be transmitted is smaller than a preset reference size, the file to be transmitted can be transmitted to the plurality of nodes without being divided.
The weight for each of the plurality of nodes calculated according to the received bandwidth information may be proportional to the received bandwidth.
Wherein the bandwidth information received from the plurality of nodes includes a bandwidth including both a bandwidth with the origin node and a bandwidth with another node to which a piece of the file received from the origin node is to be transmitted, Information.
Receiving the bandwidth information from the plurality of nodes may utilize RTT (Round Trip Time) information from the origin node to the plurality of nodes.
As described above, according to the file synchronization method and apparatus of the present invention, more efficient file synchronization can be performed according to the size of a file.
In addition, there is an advantage that the file synchronization can be performed more efficiently by considering the network state between the node and the node.
1 illustrates an exemplary file synchronization system in which file synchronization according to a preferred embodiment of the present invention can be performed;
BACKGROUND OF THE INVENTION 1. Field of the Invention [0002] The present invention relates to a file synchronization method,
3 is a diagram illustrating a configuration of a file synchronization apparatus according to a preferred embodiment of the present invention.
FIG. 4 is a graph illustrating a comparison between experimental results of file download completion time of a file synchronization method and a conventional file synchronization method according to a preferred embodiment of the present invention.
5 is a graph illustrating a comparison between an average and a standard deviation of file download completion times with respect to experimental results of a file synchronization method and a conventional file synchronization method according to a preferred embodiment of the present invention.
FIG. 6 is a graph illustrating a download completion time according to a file size of a file synchronization method and a conventional file synchronization method according to a preferred embodiment of the present invention.
While the invention is susceptible to various modifications and alternative forms, specific embodiments thereof are shown by way of example in the drawings and will herein be described in detail. It should be understood, however, that the invention is not intended to be limited to the particular embodiments, but includes all modifications, equivalents, and alternatives falling within the spirit and scope of the invention.
Like reference numerals are used for like elements in describing each drawing. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Hereinafter, the present invention will be described in detail with reference to the accompanying drawings.
The terms first, second, etc. may be used to describe various components, but the components should not be limited by the terms. The terms are used only for the purpose of distinguishing one component from another.
For example, without departing from the scope of the present invention, the first component may be referred to as a second component, and similarly, the second component may also be referred to as a first component.
And / or < / RTI > includes any combination of a plurality of related listed items or any of a plurality of related listed items.
It is to be understood that when an element is referred to as being "connected" or "connected" to another element, it may be directly connected or connected to the other element, .
On the other hand, when an element is referred to as being "directly connected" or "directly connected" to another element, it should be understood that there are no other elements in between.
The terminology used in this application is used only to describe a specific embodiment and is not intended to limit the invention.
The singular expressions include plural expressions unless the context clearly dictates otherwise. In the present application, the terms "comprises" or "having" and the like are used to specify that there is a feature, a number, a step, an operation, an element, a component or a combination thereof described in the specification, But do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, or combinations thereof.
Unless defined otherwise, all terms used herein, including technical or scientific terms, have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs.
Terms such as those defined in commonly used dictionaries are to be interpreted as having a meaning consistent with the contextual meaning of the related art and are to be interpreted as either ideal or overly formal in the sense of the present application Do not.
Hereinafter, preferred embodiments of the present invention will be described in detail with reference to the accompanying drawings, wherein like or corresponding elements are denoted by the same reference numerals, and a duplicate description thereof will be omitted.
First, a file synchronization system in which file synchronization according to a preferred embodiment of the present invention can be performed will be described with reference to FIG.
1 is a diagram illustrating a file synchronization system in which file synchronization according to a preferred embodiment of the present invention can be performed.
1, a file synchronization system according to an exemplary embodiment of the present invention may include a plurality of
A node including the
The node may be, for example, a wireless terminal such as a user personal computer (PC), a cellular phone, a personal digital assistant (PDA), or a server serving as a computing device for providing services to other terminals Do.
Hereinafter, for convenience of explanation, a file for synchronizing a file is first uploaded or a node having an original of the file is connected to an
Each node is connected through a
In addition, the mobile communication network includes an access gateway (Access) which enables transmission and reception of wireless packet data in addition to a base station (BS), a mobile telephone switching office (MTSO), a home location register (HLR) Gateway, a PDSN (Packet Data Serving Node), and the like.
Hereinafter, a file synchronization method according to the present invention will be described with reference to FIG. 2 in a file synchronization system having such a configuration.
FIG. 2 is a flowchart illustrating a procedure for performing a file synchronization method according to an exemplary embodiment of the present invention.
As shown in FIG. 2, the file synchronization method according to an exemplary embodiment of the present invention determines whether a size of a file to be transmitted is larger than a preset reference size (S200).
If the size of a file to be transferred is not larger than a preset reference, a file is allocated to each of a plurality of nodes to receive the file without dividing the file (S202), and the files are received at each of the plurality of nodes by transmitting the files to the respective nodes (S210).
However, if the size of the file to be transferred is larger than a preset reference, bandwidth information is received from a plurality of nodes to perform file synchronization (S204).
The bandwidth information received from the plurality of nodes may include reception bandwidth information for receiving a file or fragment of a file from the origin node and transmission bandwidth information for receiving the fragment and transmitting the fragment to another node.
That is, it receives not only the bandwidth received from the origin node but also information on the bandwidth with other nodes to transmit the received file fragments again.
On the other hand, a weight for each of the plurality of nodes is calculated according to the received bandwidth information (S206).
Conventionally, a file is divided uniformly regardless of a bandwidth. In the present invention, a weight is calculated according to bandwidth information between an origin node and another node, and a file is divided according to a weight.
It is also possible to use RTT (Round Trip Time) information in addition to the bandwidth information for the calculation of the weight.
On the other hand, the weights may preferably be first proportional to the bandwidth between the origin node and each of the other nodes.
It is also possible to consider a case in which a node receiving a piece of a file transmits it again to other nodes as a calculation method of another weight.
In this case, the node receiving the fragment may again consider the method according to the method of transmitting the packet to other nodes.
First, when a node that receives a fragment of a file from an origin node transmits the completed fragment of the file to another node after the completion of reception, and when the node receiving the fragment of the file from the origin node transmits the fragment of the file to another node .
Further, even when the received file fragments are transmitted to another node again, it is possible to consider whether to transmit the fragments to a plurality of nodes at once or to transmit the fragment of a file to only one node.
First, after the node receiving the file fragment sends the file fragments to other nodes after receiving the file fragment, if the received file fragments are transmitted to several different nodes at the same time, Is the sum of the file fragment transmission time between the origin node and the node receiving the file fragment and the file fragment transmission time between other nodes receiving the fragment of the file with the minimum bandwidth, It is time to exist in.
However, when the node receiving the file fragment transmits the file fragments to other nodes in sequence after receiving the fragment of the file, the file fragment is transmitted to the other nodes, Is the sum of the file fragment transfer time between the origin node and the node receiving the file fragment and the file fragment transfer time between all other nodes receiving the file fragment. Time.
On the other hand, if the node receiving the file fragment receives the fragment of the file and transmits the fragment of the file to other nodes, if the received fragment of the file is transmitted to several different nodes at the same time, The larger the value of the file fragment transmission time between the origin node and the node receiving the file fragment and the file fragment transmission time between other nodes receiving the fragment of the file with the minimum bandwidth, It is time to exist in all nodes.
On the other hand, if the node receiving the file fragment receives the fragment of the file and transmits the fragment of the file to other nodes, but if the received fragment of the file is sequentially transmitted to several different nodes, Is the larger of the sum of the file fragment transfer time between the origin node and the node receiving the file fragment and the file fragment transfer time between all other nodes receiving the file fragment, It is time to exist at the nodes.
Therefore, it is possible to set the weights according to the difference of the file fragment transmission method between the nodes. However, the weight is calculated by considering both the file fragment receipt time from the origin node and the time of transmitting the received file fragment to another node. It divides a file into individual file fragments.
That is, in the present invention, not only the reception bandwidth for receiving the fragment of a file from the origin node but also the transmission bandwidth of the received fragment of the file to other nodes to be transmitted can be calculated.
Meanwhile, the file is divided according to the weight value thus calculated, and the fragmented file fragment is allocated to each of the plurality of nodes (S208) and transmitted to each of the plurality of nodes (S210).
Then, each node that receives the fragmented file fragments of different sizes according to the weights transmits the received fragmented file to other nodes that do not have the corresponding fragmented file, and finally, And file synchronization is performed.
Meanwhile, it is apparent that the file synchronization method according to the present invention can be implemented in the form of a program and installed in a digital processing apparatus and executed.
Hereinafter, a configuration of a file synchronizing apparatus according to a preferred embodiment of the present invention will be described with reference to FIG.
3 is a block diagram of a file synchronization apparatus according to an embodiment of the present invention.
As described above, the file synchronization apparatus according to the present invention may correspond to a node to which a file to be synchronized is initially uploaded or an original file, that is, an
The
The
The bandwidth
The
As described above, the calculation of the weight includes not only the bandwidth information with the nodes connected to the
The
The
It is obvious that the bandwidth
Meanwhile, it is apparent that the file synchronizing apparatus according to the preferred embodiment of the present invention can be implemented by being included in the
In addition, the file synchronization method according to the present invention may be implemented in the form of a program and may be implemented in the form of a digital processing apparatus such as a server in which a program is installed.
Hereinafter, a file synchronization method according to the present invention will be described with reference to an example of FIG. 1, assuming that one file is transmitted to five nodes.
In the file synchronization method according to the preferred embodiment of the present invention, the size of a file is compared first, and if the number is greater than a reference value, the file is divided into five file segments a, b, c, d and e according to the number of nodes to receive the file .
In this case, the size of the file fragment is not uniformly divided as in the conventional method, but the file fragment is divided in consideration of bandwidths of nodes A, B, C, D, and E connected to the origin node.
For example, assume that the bandwidths of the nodes A, B, C, D, and E are respectively connected to the origin nodes at 10 Mbps, 9 Mbps, 7 Mbps, 2 Mbps, and 8 Mbps.
In the present invention, a size of one file is divided and assigned to each node. A weight for determining the size of a fragment of a file transmitted to the node A may be set in proportion to the bandwidth between the origin node and each of the other nodes have.
For example, the size of a file fragment sent to node A is 10/36, the size of a file fragment sent to node B is 9/36, the size of a file fragment sent to node C is 2/36, The size of the transferred file fragments is 8/36.
Next, it is possible to consider not only the reception bandwidth, which is the bandwidth between the origin server and each of the nodes, but also the bandwidth between the node receiving the fragment of each file and the node other than the origin node.
For example, if a node receives a fragment of a file and then sends it to nodes B, C, D, and E, then the bandwidth between node A and node B, the bandwidth between node A and node C, Weights can be calculated by considering both the bandwidth between A node and D node and the bandwidth between A node and E node.
For example, a file is divided into five pieces of a, b, c, d, and e, and a file fragment is received from the originating node first by the node A, The weight for node A can be calculated according to the minimum of the bandwidth between A node and origin node and the bandwidth between A node and B, C, D, and E nodes.
The nodes A, B, C, D, and E have respective bandwidths of 10 Mbps, 9 Mbps, 7 Mbps, 2 Mbps, and 8 Mbps connected to the origin nodes, And the size of the file to be synchronized at the origin node is assumed to be 100 Mbytes.
In this case, the weight for calculating the size of the file fragment a transmitted from the origin node to the node A is the bandwidth of 10 Mbps between the origin node and the A node and the bandwidths of the other B, C, D, and E nodes connected to the node A Which is a minimum bandwidth between the A node and the B node.
Experimental results obtained by comparing the synchronization time of the file according to the present invention with the file synchronization time using the fast replica method, which is a conventional file synchronization method, will be described with reference to FIGS. 4, 5, and 6. FIG.
FIG. 4 is a graph illustrating a comparison between experimental results of the file download completion time of the file synchronization method and the conventional file synchronization method according to the preferred embodiment of the present invention. FIG. FIG. 5 is a graph illustrating a comparison between an average and a standard deviation of a file download completion time with respect to experimental results of a synchronization method and a conventional file synchronization method; FIG.
FIG. 6 is a graph illustrating a download completion time according to a file size of a file synchronization method and a conventional file synchronization method according to an exemplary embodiment of the present invention.
First, as shown in FIG. 4, it is a result of showing a time for completing a file download in each node by the file synchronization method according to the present invention.
As shown in FIG. 4, the time required for downloading all the files of 100 Mbytes in the node A and the node C is somewhat later than the conventional fast replica method. However, in the case of the nodes B, D and E, the download completion time is shorter than the conventional fast replica method .
Meanwhile, the synchronization completion time of the file can be regarded as the time when the file downloading is completed in all of the nodes A, B, C, D, E, and finally, the download completion time at the node B, Is the synchronization completion time of the mobile station.
Therefore, it can be seen that the download completion time at the node B is the completion time of the file synchronization and the overall file synchronization completion time is shortened compared to the conventional file synchronization method.
In particular, in the case of file synchronization, it is important that all nodes finally receive all the file fragments and finally own one file.
That is, no matter how quickly a specific node owns the entire file, if the other node does not yet own the entire file, it is because the file synchronization is not completely completed.
Therefore, it is desirable to minimize the difference in the time at which each node owns the whole file.
FIG. 5 is a graph illustrating an average and a standard deviation of file download completion times for experimental results of a file synchronization method and a conventional file synchronization method according to a preferred embodiment of the present invention.
As shown in FIG. 5, the average of the file download completion time according to the present invention does not show a significant difference compared to the conventional fast replica.
However, it can be seen that the deviation is greatly reduced in comparison with the conventional fast replica method in terms of standard deviation.
This means that the timing of completion of file synchronization in all the nodes does not differ greatly. Therefore, it can be seen that the file synchronization method according to the present invention is a more effective file synchronization method than the conventional method due to the characteristics of file synchronization.
FIG. 6 is a graph illustrating file download completion times at respective nodes according to a file synchronization method and a conventional file synchronization method according to a preferred embodiment of the present invention, according to file sizes.
As shown in FIG. 6, when the file size is 1 Mbytes and 10 Mbytes, there is no significant difference in the file download completion time compared to the file synchronization method of the present invention or the conventional fast replica method.
However, when the size of the file is 100 Mbytes or more, the file synchronization method according to the present invention is faster than the conventional fast replica method in that file downloading is completed at each node, that is, .
5, the average of the file download completion time according to the present invention does not show a significant difference compared to the conventional fast replica. However, compared with the conventional fast replica method, Can be confirmed.
That is, it is more effective to synchronize the file synchronization at the time of completing the file synchronization at all the nodes. Therefore, it can be seen that the file synchronization method according to the present invention is a more effective file synchronization method than the conventional method.
It will be apparent to those skilled in the relevant art that various modifications, additions and substitutions are possible, without departing from the spirit and scope of the invention as defined by the appended claims. The appended claims are to be considered as falling within the scope of the following claims.
Claims (11)
Determining whether a size of the file to be transferred is larger than a preset reference size;
Receiving bandwidth information from the plurality of nodes when the size of the file to be transmitted is larger than a preset reference size;
Calculating a weight for each of the plurality of nodes according to the received bandwidth information;
Dividing the file according to the calculated weight; And
And allocating the fragmented file fragment to each of the plurality of nodes and transmitting the fragmented file fragment to each of the plurality of nodes.
Wherein if the size of the file to be transferred is smaller than a preset reference size, the file to be transmitted is transmitted to the plurality of nodes without being divided.
Wherein the weight for each of the plurality of nodes calculated in accordance with the received bandwidth information is proportional to the received bandwidth.
Receiving bandwidth information from the plurality of nodes,
Wherein the bandwidth information received from the plurality of nodes is bandwidth information including a bandwidth with the origin node and a bandwidth with another node to which a file fragment received from the origin node is to be transmitted.
Wherein receiving the bandwidth information from the plurality of nodes uses RTT information from the origin node to the plurality of nodes.
A file size comparing unit for determining whether the size of the file to be transferred is larger than a preset reference size;
A bandwidth information receiver for receiving bandwidth information from the plurality of nodes when the size of the file to be transmitted is larger than a preset reference size;
A weight calculation unit for calculating a weight for each of the plurality of nodes according to the received bandwidth information;
A file dividing unit dividing the file according to the calculated weight value; And
And a file transfer unit for transferring the divided file fragments to each of the plurality of nodes by assigning the divided file fragments to each of the plurality of nodes.
If the size of the file to be transferred is smaller than a preset reference size, the file transfer unit transfers the file to the plurality of nodes without dividing the file to be transferred.
Wherein the weight for each of the plurality of nodes calculated in the weight calculation unit according to the received bandwidth information is proportional to the received bandwidth.
Wherein the bandwidth information received from the plurality of nodes, received by the bandwidth information receiver,
And the bandwidth information includes the bandwidth of the file synchronizer and the bandwidth of another node to which the file fragment received from the file synchronizer is to be transmitted.
Wherein the bandwidth information received from the plurality of nodes, received by the bandwidth information receiver,
Wherein the file synchronization apparatus uses RTT (Round Trip Time) information to the plurality of nodes in the file synchronization apparatus.
Determining whether a size of the file to be transferred is larger than a preset reference size;
Receiving bandwidth information from the plurality of nodes when the size of the file to be transmitted is larger than a preset reference size;
Calculating a weight for each of the plurality of nodes according to the received bandwidth information;
Dividing the file according to the calculated weight; And
And allocating the fragmented file fragment to each of the plurality of nodes and transmitting the fragmented file fragment to each of the plurality of nodes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| KR1020120128302A KR20140061109A (en) | 2012-11-13 | 2012-11-13 | Method and apparatus for file synchronization |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| KR1020120128302A KR20140061109A (en) | 2012-11-13 | 2012-11-13 | Method and apparatus for file synchronization |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| KR20140061109A true KR20140061109A (en) | 2014-05-21 |
Family
ID=50890246
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| KR1020120128302A KR20140061109A (en) | 2012-11-13 | 2012-11-13 | Method and apparatus for file synchronization |
Country Status (1)
| Country | Link |
|---|---|
| KR (1) | KR20140061109A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20190054355A (en) * | 2017-11-13 | 2019-05-22 | 권흥열 | Method and system for managing data transfer |
| KR20200042740A (en) * | 2018-10-16 | 2020-04-24 | 삼성전자주식회사 | Method and apparatus for splitting data in multi-connectivity |
-
2012
- 2012-11-13 KR KR1020120128302A patent/KR20140061109A/en not_active Application Discontinuation
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20190054355A (en) * | 2017-11-13 | 2019-05-22 | 권흥열 | Method and system for managing data transfer |
| US11122107B2 (en) | 2017-11-13 | 2021-09-14 | Heung Yeol KWON | File transmission method and system performing the same |
| US11588879B2 (en) | 2017-11-13 | 2023-02-21 | Heung Yeol KWON | File transmission method and system performing the same |
| KR20200042740A (en) * | 2018-10-16 | 2020-04-24 | 삼성전자주식회사 | Method and apparatus for splitting data in multi-connectivity |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP3879879B1 (en) | Time sensitive networking communication method and apparatus thereof | |
| JP2020509635A (en) | Network slice selection method, user equipment, and network device | |
| JP6389280B2 (en) | Protocol stack conforming method and apparatus | |
| US9525755B2 (en) | Providing content based on user bandwidth | |
| US20170027016A1 (en) | Communication device, wireless communication device, and communication method | |
| US10153975B2 (en) | Method for controlling user plane traffic flows in a wireless telecommunication network | |
| KR102233371B1 (en) | Method and apparatus for relaying in multicast network | |
| US9432440B2 (en) | Method of content delivery in LTE RAN, an eNB and communication system | |
| US10728001B2 (en) | Unified indexing framework for reference signals | |
| WO2021051420A1 (en) | Dns cache record determination method and apparatus | |
| US20140289313A1 (en) | Communication device, communication system, and communication method | |
| US20200112870A1 (en) | Method for transmitting information, method for receiving information, pdcp entity, and computer storage medium | |
| KR100929031B1 (en) | Block selection method in file parallel download, file parallel download method using the same, and recording medium recording a program for implementing the same | |
| CN104853388A (en) | Method for generating group data packet serial number in cluster communication system and base station | |
| US10070327B2 (en) | Centralized channel coding and shaping for a multi-node RAN | |
| KR20140061109A (en) | Method and apparatus for file synchronization | |
| KR20190143462A (en) | Preconditioning of Traffic within a Telecommunications Network | |
| Haw et al. | An efficient content delivery framework for SDN based LTE network | |
| CN114374553A (en) | Time synchronization method and system | |
| US11575601B2 (en) | Network device and packet processing method using same | |
| EP2829041B1 (en) | A method of content delivery in lte ran, an enb and communication system | |
| CN103384395A (en) | Uplink bandwidth configuring method and device | |
| KR20180110565A (en) | Method for controlling of contents transmition, apparatus thereof, computer-readable medium and program thereof | |
| JP2009044693A (en) | Transmission method, transmitter, and computer program | |
| WO2020103086A1 (en) | Wireless communication method, network node and terminal device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| A201 | Request for examination | ||
| E902 | Notification of reason for refusal | ||
| E601 | Decision to refuse application |