WO2001038990A1 - Procedure and system for determining a measure of probability regarding the identity between different examples of a data file - Google Patents

Procedure and system for determining a measure of probability regarding the identity between different examples of a data file Download PDF

Info

Publication number
WO2001038990A1
WO2001038990A1 PCT/SE2000/002311 SE0002311W WO0138990A1 WO 2001038990 A1 WO2001038990 A1 WO 2001038990A1 SE 0002311 W SE0002311 W SE 0002311W WO 0138990 A1 WO0138990 A1 WO 0138990A1
Authority
WO
WIPO (PCT)
Prior art keywords
data file
segment
check sum
unit
procedure
Prior art date
Application number
PCT/SE2000/002311
Other languages
French (fr)
Inventor
Anders Bergsten
Niklas Borg
Joachim Johansson
Original Assignee
Telia Ab
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Telia Ab filed Critical Telia Ab
Publication of WO2001038990A1 publication Critical patent/WO2001038990A1/en

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0061—Error detection codes

Definitions

  • the present invention generally relates to data transmission and more exactly to a procedure and a corresponding system at data transmission in a data communication network determining a measure of probability regarding identity between segments of different examples of a data file.
  • examples of a specific data file is usually stored in a plurality of different storing units. This is, for example, made with data files which shall be transmitted over Internet by means of ftp (File Transfer Protocol) or by means of http (HyperText Transfer Protocol) from an ftp-server respective a web server.
  • ftp File Transfer Protocol
  • http HyperText Transfer Protocol
  • examples of a data file are stored in a plurality of storing units in the data communication network, it is difficult for a user, who for instance wants to transmit a data file, to determine if the examples of the data file which are stored in different storing units and which apparently are identical, really are. For instance can changes of the data file have been made only in a number/share of the storing units in which examples of the data file are stored. Examples of the data file also can have been subject to corruption for instance by spreading of data virus. If an incorrect identification of a data file is made and the wrong data file is transmitted, a new transmission of the data file must be made, which results in a strongly increased transmission time.
  • a closely related problem at transmission of a data file is that the data file can be corrupted at the transmission, which also this results in that it is difficult for the user to determine if the example of the data file which has been transmitted to the user unit is identical with the data file which has been asked for. If a fault occurs at the transmission, the data file has to be transmitted again, which results in an increased transmission time.
  • the tendency at transmission via Internet is that larger and larger data files are transmitted, which increases the risk of error at transmission, and results in that repeated transmission becomes an even bigger problem.
  • Transmission of a wanted data file is made according to known technology by the data file first being located.
  • This can at ftp-transmission be made by use of, for instance, archie, which is a data base which provides information about in which ftp-servers the data file is stored.
  • archie which is a data base which provides information about in which ftp-servers the data file is stored.
  • lists over storing units, in which examples of a specific data file is stored are used. These lists can, for instance, be found on a web page for the one who provides the data file. Because archie normally is updated by another participant than the one who provides the data file, archie is not always correctly updated and therefore can return addresses to ftp-servers in which the data file is not identical with the data file that is wanted.
  • the file have been changed in only a share of the ftp-servers in which it is stored. Even if the above mentioned lists can be updated by the one who provides the data file, the ftp-servers can be maintained by another participant, at which the same problem can arise also with this solution.
  • the aim of the present invention is to, to some extent, eliminate above mentioned difficulties for the user to determine whether different examples of a data file which are stored in different storing units are identical, and to determine whether one to the user unit transmitted example of the data file is identical with the example of data file that was asked for.
  • a procedure of the in the introduction mentioned kind is achieved, including the steps to divide each of the examples of the data file into a number of segments, to calculate a check sum for each of the segments, to compare the check sum for a segment of a first example of the data file with the check sum for a corresponding segment of a second example of the data file, and, on basis of said comparison, determine a measure of probability regarding identity between said segment of the first example of the data file and said corresponding segment of the second example of the data file.
  • a system of the in the introduction mentioned kind is achieved, at which a user unit and storing units are connected to said data communication network, including in each of the storing units arranged devices for division of each of the examples of the data file into a number of segments, in each of the storing units arranged devices for calculation of a check sum for each of the segments, in the user unit arranged devices for comparison of the check sum for a segment of a first example of the data file with the check sum for corresponding segment of a second example of the data file, and in the user unit arranged devices for determining, on basis of said comparison, a measure of probability regarding identity between said segment of the first example of the data file and said corresponding segment of the second example of the data file.
  • a measure of probability regarding the identity between segments of different examples of a data file can be determined.
  • the determination is made on basis of the result of a comparison of respective check sum of the segments.
  • a segment of an example of a data file that is stored m a secondary storing unit and a segment of a data file that is stored in a reference storing unit are compared.
  • a reference storing unit can, for instance, be a storing unit in which the data file in great probability is stored m a correct version, but can also be ust any storing unit of the storing units.
  • the other storing units are secondary storing units.
  • the procedure is only repeated for each of the included segments .
  • One embodiment of a procedure according to the present invention also includes the steps to transmit the check sum for said segment of the first example of the data file from said secondary storing unit to a user unit and to transmit the check sum for said corresponding segment of the second example of the data file from the reference storing unit to the user unit .
  • Another embodiment of a procedure according to the present invention includes also the steps to transmit said segment of the first example of the data file from said secondary storing unit to a user unit, to transmit the check sum for said corresponding segment of the second example of the data file from the reference storing unit to the user unit and to, in the user unit, calculate the check sum for said transmitted segment of the first example of the data file.
  • This embodiment makes it possible to determine a measure of probability regarding the existence of transmission error at the transmission of the segment from the secondary storing unit to the user unit, and that, at determining such an error, it will possible to make it separately for an individual element.
  • Figure 1 shows schematically a system in which the present invention can be applied with advantage.
  • Figure 2 shows a flow chart for an embodiment of a procedure according to the invention.
  • Figure 3A-B shows schematically the division of examples of a data file into segments.
  • Figure 1 shows schematically a system in which the present invention can be applied with advantage.
  • a number of ftp-servers 1-5 and a user unit 6, which includes an ftp-client, are connected to a data communication network 7.
  • the ftp-servers the same set of data files are stored, so called mirroring.
  • the number of ftp-servers are five in Figure 1, which shall not be regarded as a limitation of the invention but is only intended to simplify the description.
  • One of the ftp-servers 1-5 namely the ftp-server 1 has been selected by the user as a reference server, whereas the others are secondary servers.
  • Figure 2 shows a flow chart for an embodiment of a procedure according to the invention.
  • a user has located examples of a data file in a number of different ftp- servers and wants, before he/she shall transmit a segment of the example of the data file from one of the secondary ftp-servers, verify that this segment is identical with a segment of an example of the data file that is stored in the reference server.
  • the examples of the data file in a step 11 has been divided into segments, and in step 12 a check sum has been calculated for each of these segments.
  • a step 13 the check sum for the segment in the secondary ftp-server 2 and the check sum for corresponding segment in the reference server 1 now are transmitted.
  • a corresponding segment is a segment which has the same location in the file.
  • FIGs 3A and 3B are shown the division of two examples FI and F2 of the data file in segments, and corresponding data files Cl and C2 which holds the check sums for the segments.
  • Corresponding segments are, for instance, the segment Sll in FI and the segment S21 in F2. These have the check sums Kll respective K21.
  • step 14 When the check sums have been transmitted, these are compared in a step 14, and on basis of this is determined whether the segments are identical. If the segments are found not to be identical, the step 13 is repeated for another secondary unit. If the segments are found to be identical, the segment is transmitted from the secondary ftp-server in the step 15. When the segment has been transmitted to the user unit, its check sum is calculated in the user unit. The calculated check sum is compared with the check sum which has been transmitted from the reference server. If the segments, on basis of this comparison, are found not to be identical, the step 15 is repeated for the same or another secondary unit.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Communication Control (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

Procedure and system at data transmission in a data communication network for determining a measure of probability regarding identity between segments of different examples of a data file. Said procedure, which is executed in said system, includes the steps to divide each of the examples of the data file into a number of segments and to calculate a check sum for each of the segments. Further, the procedure includes the steps to compare the check sum for a segment of a first example of the data file with the check sum for a corresponding segment of a second example of the data file, and to, on basis of said comparison, determine a measure of probability regarding identity between said segment of the first example of the data file and said corresponding segment of the second example of the data file.

Description

PROCEDURE AND SYSTEM FOR DETERMINING A MEASURE OF PROBABILITY REGARDING THE IDEN¬ TITY BETWEEN DIFFERENT EXAMPLES OF A DATA FILE
Field of the invention The present invention generally relates to data transmission and more exactly to a procedure and a corresponding system at data transmission in a data communication network determining a measure of probability regarding identity between segments of different examples of a data file.
Technical backσround
At transmission of data files from storing units in a data communication network to a user unit, examples of a specific data file is usually stored in a plurality of different storing units. This is, for example, made with data files which shall be transmitted over Internet by means of ftp (File Transfer Protocol) or by means of http (HyperText Transfer Protocol) from an ftp-server respective a web server. The procedure is called mirroring and implies anything from a copy of a data file being stored in a plurality of storing units, to an identical set of data files being stored in a plurality of storing units. By storing the data file in a plurality of storing units, load sharing between the storing units is made possible when the data file is asked for by a plurality of user units at the same time, by the data file being transmitted from different storing units to the different user units. Consequently overload of storing units can more easily be avoided.
When examples of a data file are stored in a plurality of storing units in the data communication network, it is difficult for a user, who for instance wants to transmit a data file, to determine if the examples of the data file which are stored in different storing units and which apparently are identical, really are. For instance can changes of the data file have been made only in a number/share of the storing units in which examples of the data file are stored. Examples of the data file also can have been subject to corruption for instance by spreading of data virus. If an incorrect identification of a data file is made and the wrong data file is transmitted, a new transmission of the data file must be made, which results in a strongly increased transmission time.
A closely related problem at transmission of a data file is that the data file can be corrupted at the transmission, which also this results in that it is difficult for the user to determine if the example of the data file which has been transmitted to the user unit is identical with the data file which has been asked for. If a fault occurs at the transmission, the data file has to be transmitted again, which results in an increased transmission time. The tendency at transmission via Internet is that larger and larger data files are transmitted, which increases the risk of error at transmission, and results in that repeated transmission becomes an even bigger problem.
Transmission of a wanted data file, for instance by means of ftp, is made according to known technology by the data file first being located. This can at ftp-transmission be made by use of, for instance, archie, which is a data base which provides information about in which ftp-servers the data file is stored. Alternatively, lists over storing units, in which examples of a specific data file is stored, are used. These lists can, for instance, be found on a web page for the one who provides the data file. Because archie normally is updated by another participant than the one who provides the data file, archie is not always correctly updated and therefore can return addresses to ftp-servers in which the data file is not identical with the data file that is wanted. For instance can the file have been changed in only a share of the ftp-servers in which it is stored. Even if the above mentioned lists can be updated by the one who provides the data file, the ftp-servers can be maintained by another participant, at which the same problem can arise also with this solution.
Summary of the invention
The aim of the present invention is to, to some extent, eliminate above mentioned difficulties for the user to determine whether different examples of a data file which are stored in different storing units are identical, and to determine whether one to the user unit transmitted example of the data file is identical with the example of data file that was asked for.
This aim is, according to the invention, achieved by the procedure and corresponding system according to the invention of the in the introduction described kind, being given the characteristics that can be found in the independent patent claims. Preferred embodiments can be found in the subordinate claims . According to a first aspect of the present invention, a procedure of the in the introduction mentioned kind is achieved, including the steps to divide each of the examples of the data file into a number of segments, to calculate a check sum for each of the segments, to compare the check sum for a segment of a first example of the data file with the check sum for a corresponding segment of a second example of the data file, and, on basis of said comparison, determine a measure of probability regarding identity between said segment of the first example of the data file and said corresponding segment of the second example of the data file.
According to a second aspect of the present invention, a system of the in the introduction mentioned kind is achieved, at which a user unit and storing units are connected to said data communication network, including in each of the storing units arranged devices for division of each of the examples of the data file into a number of segments, in each of the storing units arranged devices for calculation of a check sum for each of the segments, in the user unit arranged devices for comparison of the check sum for a segment of a first example of the data file with the check sum for corresponding segment of a second example of the data file, and in the user unit arranged devices for determining, on basis of said comparison, a measure of probability regarding identity between said segment of the first example of the data file and said corresponding segment of the second example of the data file.
According to the invention, consequently a measure of probability regarding the identity between segments of different examples of a data file can be determined. The determination is made on basis of the result of a comparison of respective check sum of the segments. By the comparison being made segment by segment, an individual, faulty segment can be identified. This will facilitate at a procedure in which a repeated transmission of transmission error only is made for faulty segments. By the comparison being made segment by segment, also examples of the data file which have been subject to manipulation can be easier detected. This is due to the fact that a data file which only has a check sum for the whole data file easily can be manipulated so that the check sum will be the same, whereas it is necessary to know how a segmented data file is segmented to be able to manipulate it so that the manipulated data file has the same check sums as the original data file for all segments. In one embodiment, a segment of an example of a data file that is stored m a secondary storing unit and a segment of a data file that is stored in a reference storing unit are compared.
A reference storing unit can, for instance, be a storing unit in which the data file in great probability is stored m a correct version, but can also be ust any storing unit of the storing units. The other storing units are secondary storing units. At unloading of a reference storing unit by a transmission also being made from secondary storing units, a user consequently can, to some extent, make sure that a segment of an example of the data file in said secondary storing unit really is identical with corresponding segment of the data file the user wants.
For determining, with a certain probability, whether the whole example of the data file that is stored in said secondary storing unit is identical with the example of the data file that is stored in the reference storing unit, the procedure is only repeated for each of the included segments .
One embodiment of a procedure according to the present invention also includes the steps to transmit the check sum for said segment of the first example of the data file from said secondary storing unit to a user unit and to transmit the check sum for said corresponding segment of the second example of the data file from the reference storing unit to the user unit .
By transmission only of the check sum for the segment in the reference storing unit, respective in said secondary storing unit, it will be possible to determine a measure of probability regarding the identity between the segments without any part of the segments needing to be transmitted. This reduces the risk that a faulty segment is transmitted and by that also the total transmission time.
Another embodiment of a procedure according to the present invention includes also the steps to transmit said segment of the first example of the data file from said secondary storing unit to a user unit, to transmit the check sum for said corresponding segment of the second example of the data file from the reference storing unit to the user unit and to, in the user unit, calculate the check sum for said transmitted segment of the first example of the data file. This embodiment makes it possible to determine a measure of probability regarding the existence of transmission error at the transmission of the segment from the secondary storing unit to the user unit, and that, at determining such an error, it will possible to make it separately for an individual element.
Brief description of the drawings
The invention will be described in more detail in the following, with reference to the enclosed schematic drawings which, for the purpose of exemplifying, show a preferred embodiment of the invention.
Figure 1 shows schematically a system in which the present invention can be applied with advantage. Figure 2 shows a flow chart for an embodiment of a procedure according to the invention.
A: Start
B: Divide datafile into segments
C: Calculate check sums D: Transfer/transmit check sums
E: The same check sum ?
F: Transfer/transmit segment
G: Calculate check sum
H: The same check sum ? I : Stop
Figure 3A-B shows schematically the division of examples of a data file into segments.
Description of preferred embodiments Figure 1 shows schematically a system in which the present invention can be applied with advantage. A number of ftp-servers 1-5 and a user unit 6, which includes an ftp-client, are connected to a data communication network 7. In the ftp-servers the same set of data files are stored, so called mirroring. The number of ftp-servers are five in Figure 1, which shall not be regarded as a limitation of the invention but is only intended to simplify the description. One of the ftp-servers 1-5, namely the ftp-server 1, has been selected by the user as a reference server, whereas the others are secondary servers. By this is meant that the user for some reason thinks that the probability is greater that the data files in the ftp- server 1 are correct than the probability that the data files in the secondary ftp-servers are. If the user does not have any reason to select a specific ftp-server as reference server, just any ftp-server can be selected as reference server.
Figure 2 shows a flow chart for an embodiment of a procedure according to the invention. A user has located examples of a data file in a number of different ftp- servers and wants, before he/she shall transmit a segment of the example of the data file from one of the secondary ftp-servers, verify that this segment is identical with a segment of an example of the data file that is stored in the reference server. According to the procedure, the examples of the data file in a step 11 has been divided into segments, and in step 12 a check sum has been calculated for each of these segments.
In a step 13, the check sum for the segment in the secondary ftp-server 2 and the check sum for corresponding segment in the reference server 1 now are transmitted. A corresponding segment is a segment which has the same location in the file. In the Figures 3A and 3B are shown the division of two examples FI and F2 of the data file in segments, and corresponding data files Cl and C2 which holds the check sums for the segments. Corresponding segments are, for instance, the segment Sll in FI and the segment S21 in F2. These have the check sums Kll respective K21.
When the check sums have been transmitted, these are compared in a step 14, and on basis of this is determined whether the segments are identical. If the segments are found not to be identical, the step 13 is repeated for another secondary unit. If the segments are found to be identical, the segment is transmitted from the secondary ftp-server in the step 15. When the segment has been transmitted to the user unit, its check sum is calculated in the user unit. The calculated check sum is compared with the check sum which has been transmitted from the reference server. If the segments, on basis of this comparison, are found not to be identical, the step 15 is repeated for the same or another secondary unit.
It is realised that a lot of modifications of the above described embodiments of the invention are possible within the frame of the invention, such as defined by the following patent claims.

Claims

PATENT CLAIMS
1. Procedure at data transmission in a data communication network for determining a measure of probability relating to identity between segments of different examples of a data file, including the steps to divide each of the examples of the data file into a number of segments, to calculate a check sum for each of the segments, to compare the check sum for a segment of a first example of the data file with the check sum for a corresponding segment of a second example of the data file, and to, on basis of said comparison, determine a measure of probability regarding identity between said segment of the first example of the data file and said corresponding segment of the second example of the data file.
2. Procedure as claimed in patent claim 1, at which the first example of the data file is stored in a secondary storing unit, and the second example of the data file is stored in a reference storing unit.
3. Procedure as claimed in patent claim 2, further including the steps to transmit the check sum for said segment of the first example of the data file from said secondary storing unit to a user unit, and to transmit the check sum for said corresponding segment of the second example of the data file from the reference storing unit to the user unit.
4. Procedure as claimed in patent claim 3, further including the step to, if the measure of probability indicates lack of identity between said segment of the first example of the data file and said corresponding segment of the second example of the data file, transmit the check sum for one to said segment of the first example of the data file corresponding segment from another secondary storing unit to the user unit.
5. Procedure as claimed in patent claim 2, further including the steps to transmit said segment of the first example of the data file from said secondary storing unit to a user unit, to transmit the check sum for said corresponding segment of the second example of the data file from the reference storing unit to the user unit, and to, in the user unit, calculate the check sum for said transmitted segment of the first example of the data file.
6. Procedure as claimed in patent claim 5, further including the step to, if the measure of probability indicates lacking identity between said transmitted segment of the first example of the data file and said corresponding segment of the second example of the data file, again transmit said segment of the first example of the data file from said secondary storing unit to the user unit.
7. Procedure as claimed in patent claim 5, further including the step to, if the measure of probability indicates lacking identity between said as transmitted segment of the first example of the data file and said corresponding segment of the second example of the data file, transmit one to said segment of the first example of the data file corresponding segment from another secondary storing unit to the user unit .
8. Procedure as claimed in any of the patent claims 1-
7, at which the comparing step and the determining step are executed in the user unit.
9. Procedure as claimed in any of the patent claims 1-
8, at which the calculation of the check sum is made by means of at least one of the algorithms:
CRC-coding, Tornado-coding and Reed-Solomon-coding
10. System at data transmission in a data communication network for determining a measure of probability regarding identity between segments of different examples of a data file, at which a user unit and storing units are connected to said data communication network, including in each of the storing units arranged devices for division of each of the examples of the data file into a number of segments, in each of the storing units arranged devices for calculation of a check sum for each of the segments, in the user unit arranged devices for comparison of the check sum for a segment of a first example of the data file with the check sum for corresponding segment of a second example of the data file, and in the user unit arranged devices for determining, on basis of said comparison, a measure of probability regarding identity between said segment of the first example of the data file and said corresponding segment of the second example of the data file.
11. System as claimed in patent claim 10, at which the first example of the data file is stored in a secondary storing unit, and the second example of the data file is stored in a reference storing unit.
12. System as claimed in patent claim 11, further including device for transmission of the check sum for said segment of the first example of the data file from said secondary storing unit to the user unit, and device for transmission of the check sum for said corresponding segment of the second example of the data file from the reference storing unit to the user unit.
13. System as claimed in patent claim 11, further including device for transmission of said segment of the first example of the data file from said secondary storing unit to the user unit, device for transmission of the check sum for said corresponding segment of the second example of the data file from the reference storing unit to the user unit, and in the user unit arranged devices for calculation of the check sum for said transmitted segment of the first example of the data file.
14. System as claimed in patent claim 13, further including device for determining whether the measure of probability indicates lacking identity between said transmitted segment of the first example of the data file and said corresponding segment of the second example of the data file, whether a new transmission shall be made to the user unit of said segment of the first example of the data file from said secondary storing unit or of one to said segment of the first example of the data file corresponding segment from another secondary storing unit.
PCT/SE2000/002311 1999-11-24 2000-11-23 Procedure and system for determining a measure of probability regarding the identity between different examples of a data file WO2001038990A1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
SE9904250-9 1999-11-24
SE9904250A SE9904250L (en) 1999-11-24 1999-11-24 Procedures and systems for data transmission

Publications (1)

Publication Number Publication Date
WO2001038990A1 true WO2001038990A1 (en) 2001-05-31

Family

ID=20417835

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/SE2000/002311 WO2001038990A1 (en) 1999-11-24 2000-11-23 Procedure and system for determining a measure of probability regarding the identity between different examples of a data file

Country Status (2)

Country Link
SE (1) SE9904250L (en)
WO (1) WO2001038990A1 (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2004059527A1 (en) * 2002-12-31 2004-07-15 Nokia Corporation Method for comparing contents of memory components
WO2019057023A1 (en) * 2017-09-20 2019-03-28 中兴通讯股份有限公司 Data recovery method, sending/receiving apparatus, and computer-readable storage medium

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0443977A2 (en) * 1990-02-21 1991-08-28 International Business Machines Corporation Method and apparatus for visually comparing files in a data processing system
JPH1173374A (en) * 1997-08-29 1999-03-16 Nec Corp Method for comparing file
US5978814A (en) * 1998-01-21 1999-11-02 Microsoft Corporation Native data signatures in a file system

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0443977A2 (en) * 1990-02-21 1991-08-28 International Business Machines Corporation Method and apparatus for visually comparing files in a data processing system
JPH1173374A (en) * 1997-08-29 1999-03-16 Nec Corp Method for comparing file
US5978814A (en) * 1998-01-21 1999-11-02 Microsoft Corporation Native data signatures in a file system

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
PATENT ABSTRACTS OF JAPAN *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2004059527A1 (en) * 2002-12-31 2004-07-15 Nokia Corporation Method for comparing contents of memory components
US7302529B2 (en) 2002-12-31 2007-11-27 Nokia Corporation Method for comparing contents of memory components
WO2019057023A1 (en) * 2017-09-20 2019-03-28 中兴通讯股份有限公司 Data recovery method, sending/receiving apparatus, and computer-readable storage medium

Also Published As

Publication number Publication date
SE9904250D0 (en) 1999-11-24
SE9904250L (en) 2001-05-25

Similar Documents

Publication Publication Date Title
CN111767484B (en) Industrial Internet identification analysis method and related device
US9053218B2 (en) Data transmission capture in support of medication preparation
US9942099B2 (en) Methodology and apparatus for topology discovery and mapping of chained network services
US20100250713A1 (en) Coordinated peer-to-peer (p2p) replicated backup and versioning
CN110188121B (en) Service data monitoring method, device, computer equipment and storage medium
CN108710681A (en) File acquisition method, device, equipment and storage medium
CN110708215A (en) Deep packet inspection rule base generation method and device, network equipment and storage medium
US8001349B2 (en) Access control method for a storage system
EA004379B1 (en) Electronic information inquiring method
EP3093789B1 (en) Storing structured information
CN110163009A (en) The method and apparatus of the safety check and reparation of HDFS storage platform
CN112184436B (en) Data synchronization method, electronic device and readable storage medium
US11102055B2 (en) Network self-diagnosis control device based on block chain
US20100229231A1 (en) License management system, license management method and license management program
WO2001038990A1 (en) Procedure and system for determining a measure of probability regarding the identity between different examples of a data file
US8224940B2 (en) Strategies for compressing information using bloom filters
US11064036B2 (en) System for discovering services
JPH1127342A (en) Method and system for matching network information
US8095980B2 (en) Detecting malicious behavior in data transmission of a de-duplication system
WO2018105049A1 (en) Security system and authentication server
US7694190B2 (en) Preventing distribution of modified or corrupted files
CN110493004B (en) Digital certificate configuration method and device and digital certificate signing and issuing method and device
CN110362406B (en) Event processing method and device
US11409700B2 (en) Method, electronic device and computer program product for snapshot replication
JP7234726B2 (en) Communication device, communication system, and program

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): EE LT LV NO US

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR

121 Ep: the epo has been informed by wipo that ep was designated in this application
DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
122 Ep: pct application non-entry in european phase