CN108242931A - A kind of data compression providing method - Google Patents

A kind of data compression providing method Download PDF

Info

Publication number
CN108242931A
CN108242931A CN201611208590.2A CN201611208590A CN108242931A CN 108242931 A CN108242931 A CN 108242931A CN 201611208590 A CN201611208590 A CN 201611208590A CN 108242931 A CN108242931 A CN 108242931A
Authority
CN
China
Prior art keywords
data
receiving terminal
providing method
compression
common receiving
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
Application number
CN201611208590.2A
Other languages
Chinese (zh)
Other versions
CN108242931B (en
Inventor
曾刚
王焰辉
黄玉甫
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Space Star Technology (beijing) Co Ltd
Original Assignee
Space Star Technology (beijing) Co Ltd
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 Space Star Technology (beijing) Co Ltd filed Critical Space Star Technology (beijing) Co Ltd
Priority to CN201611208590.2A priority Critical patent/CN108242931B/en
Publication of CN108242931A publication Critical patent/CN108242931A/en
Application granted granted Critical
Publication of CN108242931B publication Critical patent/CN108242931B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/30Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/3059Digital compression and data reduction techniques where the original information is represented by a subset or similar information, e.g. lossy compression
    • H03M7/3064Segmenting
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/30Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/60General implementation details not specific to a particular type of compression
    • H03M7/6058Saving memory space in the encoder or decoder

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)
  • Information Transfer Between Computers (AREA)

Abstract

The present invention relates to a kind of data compression providing method, this method includes data source the selection based on control platform, obtains the data of corrresponding quality grade, will the credit rating data carry out piecemeal and compression after accordingly common receiving terminal is provided;Common receiving terminal receives the data block that data source provides, and the data block received is saved in local storage space in order;This method can consider the available situation of storage/computing resource of data receiver when proceeding by data compression, in the case of the receiving ability for obtaining data receiver, carry out the splits' positions of data, using the compression for completing coordinates data in limited there are the short period can be used, in the case where not reducing performance, reduce the EMS memory occupation of program so that can carry out data compression in less time with less machine.

Description

A kind of data compression providing method
【Technical field】
The invention belongs to field of data compression more particularly to a kind of data compression providing methods.
【Background technology】
Compressionism refers to represents the technology of information using less bits (bits) or byte (bytes).Compression method It can detect and use the structure being present in information, to establish a representation method relatively simplified so that raw information can be again It is construed as a compressed version.In an information delivery context, Information Compression becomes more and more important.Information Compression skill Art can reduce the cost for being associated with bandwidth demand, input/output lead time and communication delay, in other words, can be used less Time transmit compressed information.Therefore, it is necessary to a kind of information compressing method and system, effectively to compress information.
Data compression providing method of the prior art cannot be carried out based on the available situation of data receiver storage resource Data compression is all to sacrifice the promotion that compression efficiency is realized on the basis of program internal memory.Based on above-mentioned problems, now urgently A kind of new data compression providing method is needed, the storage resource of data receiver can be considered when proceeding by data compression It can use situation, in the case of the receiving ability for obtaining data receiver, carry out the splits' positions of data, using can be with limited The compression of coordinates data is inside completed there are the short period, in the case where not reducing performance, reduces the EMS memory occupation of program so that Data compression can be carried out with less machine in less time.
【Invention data】
In order to solve the above problem of the prior art, the technical solution adopted by the present invention is as follows:A kind of data compression carries For method, which is characterized in that this method comprises the following steps:
Step 1:The common receiving terminal of selection or non-common receiving terminal carry out client user data offer and based on numbers Data loading is carried out according to the one or more common receiving terminals of priority selection;
Step 2:Selection of the data source based on control platform obtains the data of corrresponding quality grade, by the credit rating Data are provided after carrying out piecemeal and compression to accordingly common receiving terminal;
Step 3:Common receiving terminal receives the data block that data source provides, and the data block received is saved in order In local storage space;
Further, the priority of data reflects data source and wishes to serve data to the strong of the wish of receiving terminal, The more strong then priority of the wish of offer is higher.
Further, which is set by control platform or data terminal.
Further, data are carried out with piecemeal needs to consider the available storage resource situation of receiving terminal.
Further, which includes the available order caching space size of receiving terminal.
Further, which includes the available storage port situation of receiving terminal.
Further, data are cut into larger block, on the contrary then cutting when the available storage resource of receiving terminal is more Into smaller piece.
Further, which is provided by receiving terminal, which is to occur in real time Variation.
Further, the available storage resource situation that receiving terminal provides distributes to what the data terminal was provided when time data for it All available storage resource situations of storage resource situation rather than reality.
Further, data are carried out with piecemeal needs to consider the available computational resources situation of receiving terminal.
Beneficial effects of the present invention include:Storage/meter of data receiver can be considered when proceeding by data compression The available situation of resource is calculated, in the case of the receiving ability for obtaining data receiver, carries out the splits' positions of data, using can With the compression for completing coordinates data in limited there are the short period, in the case where not reducing performance, the memory of program is reduced It occupies so that can carry out data compression in less time with less machine.
【Description of the drawings】
Attached drawing described herein is to be used to provide further understanding of the present invention, and forms the part of the application, but It does not constitute improper limitations of the present invention, in the accompanying drawings:
Fig. 1 is a kind of flow chart of data compression providing method of the present invention;
Fig. 2 is that a kind of data compression of the present invention provides the structure chart of system.
【Specific embodiment】
Come that the present invention will be described in detail below in conjunction with attached drawing and specific embodiment, illustrative examples therein and say It is bright to be only used for explaining the present invention, but not as a limitation of the invention.
Referring to attached drawing 1, it illustrates a kind of basic steps of data compression providing method of the present invention:
Step 1:The common receiving terminal of selection or non-common receiving terminal carry out client user data offer and based on numbers Data loading is carried out according to the one or more common receiving terminals of priority selection;
Step 2:Selection of the data source based on control platform obtains the data of corrresponding quality grade, by the credit rating Data are provided after carrying out piecemeal and compression to accordingly common receiving terminal;
Step 3:Common receiving terminal receives the data block that data source provides, and the data block received is saved in order In local storage space;
It is that a kind of data compression that the present invention is applied provides system, which includes one or more numbers referring to attached drawing 2 According to source, one or more control platforms, one or more receiving terminals, one or more client.
Based on above system, a kind of data compression providing method of the present invention is described in detail below:
(1) client is sent out by request of data interface for the request of data for specifying data, and data are carried in the request Mark;The request of data is sent to control platform;The demand parameter (Q, S) of requested data is carried in request of data;Its In, Q is the quality of data, and S is arrival rate;Wherein, the presentation quality for the requested data that the quality of data limits, in general, number Size according to the higher data of quality is bigger;And arrival rate limits the loading velocity that data reach client;It the quality of data and arrives Up between speed there may be contradiction, when the quality of data is higher, it may be necessary to sacrifice arrival rate;
Preferably:The request of data interface is presented by the application program of client, webpage, specific function, the presentation Data provided by data source;
(2) control platform is received to the corresponding common receiving terminal group transmission data inquiry request of the client, each commonly use End group searches the data of client request according to Data Identification from local directory, if finding requested data, returns The quality of data for returning requested data in response, does not otherwise respond;
Control platform preserves the correspondence table of client and its common receiving terminal group;The corresponding common receiving terminal of each client Group may be identical or different (difference includes entirely different different with part);The table of comparisons is by control platform real-time update; The communication overhead that common receiving terminal in common receiving terminal group is selected between client is less than the receiving terminal of first threshold;It is common Receiving terminal makes a secondary response, then its hit rate increases by 1;It often crosses a time cycle hit rate and reduces by the first preset value, at this point, If hit rate is less than the second preset value, the receiving terminal which is less than to the second preset value is corresponding common from client It is deleted in receiving terminal group;If the communication overhead between a receiving terminal and the client is less than first threshold, it is added to The corresponding common receiving terminal group of the client, and its hit rate is set as an initial value;Preferably:The initial value is more than second Preset value;First preset value and the second preset value are set by control platform;
(3) response based on common receiving terminal selects common receiving terminal or non-common receiving terminal to carry out client user Data provide and carry out data loading based on the one or more common receiving terminals of data priority selection;Common receiving terminal and Non- common receiving terminal is opposite and dynamic change, and a receiving terminal is common for a client, to another It may be what is be of little use for client, be common at this time, it is not just common to carry out after once updating;
If control platform receives the response of common receiving terminal, receiving terminal Li and its number of return are commonly used according to response A common receiving terminal is selected to provide data according to quality Q Li and demand parameter (Q, S);Specifically:It is calculated according to formula (1) each The coefficient of balance Bi of the common receiving terminal of response, communication overheads of the wherein Ci between receiving terminal Li and client;The communication overhead It is worth for dynamic value, needs regularly to carry out real-time update, w1 is adjusted value, the preset value of adjusted value platform setting in order to control; The common receiving terminal of Bi minimums is selected as selected common receiving terminal;The quality of data that the common receiving terminal can be provided with And the demand of arrival rate and client is closest;
Preferably:When a common receiving terminal is capable of providing the data of multiple credit ratings, for each credit rating Calculate the coefficient of balance value;Wherein, credit rating is divided into n grade, respectively Q1~Qn;
If control platform connects the response for not receiving any one common receiving terminal, according to data priority level HT One or more common receiving terminal is selected to carry out data loading, and a non-common receiving terminal is selected to provide data;It is wherein excellent First grade is divided into m grade;The priority reflects content by the favorite degree of user, and higher by the favorite degree of user, this is excellent First grade is higher, on the contrary then lower;Preferably:The priority reflects data terminal and wishes to serve data to the strong of client wish Strong degree;
A non-common receiving terminal is selected, specially:Obtain the non-common receiving terminal that communication overhead Ci is less than second threshold In be capable of providing quality of data grade be more than or equal to Q non-common receiving terminal group, if in group element number be less than 1, lead to Know that user waits for;User needs that common receive after end data loads is waited for carry out data offer at this time;Otherwise, it is connect from non-commonly use The non-common receiving terminal of communication overhead Ci minimums is selected in receiving end group as selected non-common receiving terminal;It is connect by non-commonly use Receiving end is clients providing data, specially:Obtain the data block Block, wherein SB=(w2 × Q)/MIN that size is SB { Ci }, w2 is regulatory factor, in the case that communication overhead is larger, first sends smaller data block;If the non-common receiving terminal The quality of data being capable of providing is more than Q, then data block Block is first carried out lossy compression, by the data block boil down to quality The data block Q_Block of grade Q, then carrying out lossless compression to the data block Q_Block after lossy compression becomes number According to block C_Q_Block, data block C_Q_Block is then supplied into client;
According to data priority HT grades (HT is HT1~HTm, and wherein HT1 priority is minimum, HTm highest priorities) choosing It selects one or more common receiving terminal and carries out data loading, specially:
(A) if data priority P1 × HTm<HT=<HTm;The common receiving terminal of communication overhead Ci minimums is selected first Load mass grade is the data of Q, then obtains the free memory that receiving terminal is each commonly used in remaining common receiving terminal group, Free memory is arranged from big to small, selection arrangement before n-1 common receiving terminal load respectively in addition to credit rating Q it The data of n-1 outer credit rating, each common receiving terminal load the data of a credit rating;Wherein, P1 compares for first Rate value;Preferably:P1=90%;
(B) if data priority P2 × HTm<HT=<P1×HTm;Common the connecing of selection communication overhead Ci minimums first Receiving end load mass grade is the data of Q, then obtains the available storage that receiving terminal is each commonly used in remaining common receiving terminal group Space arranges free memory from big to small, selection arrangement before (n-1) mod 2 common receiving terminal load respectively in addition to The data of 2 credit ratings of (n-1) mod except credit rating Q, each common receiving terminal load the number of a credit rating According to;
Wherein, P2 is the second rate value;Preferably:P1=80%;
(C) if data priority P3 × HTm<HT=<P2×HTm;Common the connecing of selection communication overhead Ci minimums first Receiving end load mass grade is the data of Q, then obtains the common receiving terminal of remaining free memory maximum for loading matter The data of grade Qn are measured, the common receiving terminal for obtaining free memory minimum is used for the data of load mass grade Q1;Wherein, P3 is third rate value;Preferably:P1=50%;
(D) if data priority HT=<P3×HTm;The common receiving terminal of communication overhead Ci minimums is then selected to load matter The data that grade is Q are measured, wherein, P3 is third rate value;Preferably:P1=50%;
(4) selection of the data source based on control platform obtains the data of corrresponding quality grade, by the data of the credit rating It is provided after carrying out piecemeal and compression to accordingly common receiving terminal;Specially:For it is each need to provide it the common of data connect Receiving end, data source create offer process first, which obtains the available order caching size Siz_Buf of the common receiving terminal, It is the corresponding minimal compression of credit rating Qk data to calculate deblocking size Siz_BlK, wherein CPmin_Qk according to formula (2) Rate, PC are redundancy percentage, and PC is preset value corresponding with compression algorithm;
Siz_BlK=Siz_Buf/ (CPmin_Qk × (1+PC)) (2)
Data are divided into the block that multiple sizes are Siz_BlK by process by sequence from the beginning to the end, less than the data of 1 block size It is divided into 1 piece;In space of the application size for Siz_Buf in sending spatial cache of data source, process obtains each point one by one The piecemeal is saved in the transmission spatial cache that the size is Siz_Buf, then by this compressed point by block after overcompression Block is sent in corresponding common receiving terminal;After being sent completely, by the size be Siz_Buf space release after, process into Enter dormant state, after the message that common receiving terminal finishes receiving is received, which is waken up and continues subsequent data chunk It obtains, compress and sends, until all data blocks, which have been processed, to be finished;
Since data source is towards all receiving terminals, transmission spatial cache is very limited, is called out by the way that process is asynchronous Awake mode so that send spatial cache can be realized on time dimension and Spatial Dimension it is shared, so as to increase space Availability;
Preferably:Credit rating and its corresponding minimal compression rate is associated is stored in the table of comparisons, which preserves In being locally stored of data source;Preferred PC=10%;
(5) order caching size Siz_Buf can be used for calculating by commonly using receiving terminal, receive the data block that data source provides, And the data block received is saved in local storage space in order;Specially:Common receiving terminal is calculated based on formula (3) Order caching size Siz_Buf can be used;Wherein, the Qk qualities of data to be loaded that platform distributes in order to control, Buf_All are normal for this Order caching size, quantity of the Par_Cur for current ongoing loaded in parallel, Par_ can be all used with receiving terminal is current All is the quantity of maximum loaded in parallel that the common receiving terminal is supported;
Siz_Buf=Buf_All × (Qk/Qk+Q1)/(Par_all-Par_Cur) (3)
Common receiving terminal creates receiving process, which applies for that size is Siz_Buf's in order caching space Space, by the data block received storage within this space, the data block received is suitable by the logic of data after receiving Sequence is associated with preservation with Data Identification and carries in local cache space;Common receiving terminal sends number after current data block receives Message is received to data source according to block to continue the offer of subsequent data blocks;The size of this application is that the space of Siz_Buf exists Retain always in data load process without discharging, after the corresponding all equal loadeds of data block of data, process release Simultaneously terminate receiving process in the order caching space of this application;
Common receiving terminal needs to reserve a small amount of space, and minimum clothes can also be allowed except the maximum parallelism degree beyond support The data loading for quality of being engaged in;It can be substantially reduced in the loading efficiency except maximum parallelism degree, so as to which its service quality is opposite It is relatively low;
(6) quality of reception grade is that the common receiving terminal of the data of Q provides data to client;Specifically:When the reception The data block that the common receiving terminal for the data that credit rating is Q receives is that selected non-common receiving terminal is supplied to visitor not yet During the data at family end, the data for stopping the non-common receiving terminal provide, and are changed to commonly use receiving terminal progress data offer by this;Also It is to say:When the loading velocity of common receiving terminal pulls up to the offer speed of non-common receiving terminal, carry out providing cutting for receiving terminal It changes;
(7) client obtains the data block that common receiving terminal or non-common receiving terminal provide, by the data block received into It is stored in local storage space after being associated with after row decompression by the logical order of data with Data Identification;The data block received Do not need to be all here, as long as the data block for meeting presentation sequence has received, it is possible to which the data block is suitable by presenting Sequence is presented to the user;
The step of further including hot spot data active push:
(8) new hot spot data is supplied to each receiving terminal by data source;Specifically:Data source obtains liveness higher than the The receiving terminal group of one active value obtains the free memory size of each receiving terminal in the receiving terminal group, based on storage sky Between size provided for the receiving terminal corrresponding quality grade data;Preferably:The receiving terminal larger for free memory There is provided credit rating higher data;
A kind of data compression providing method of the present invention, can consider data receiver when proceeding by data compression The available situation of storage/computing resource in the case of the receiving ability for obtaining data receiver, carries out the piecemeal pressure of data Contracting using that can use the compression for completing coordinates data in limited there are the short period, in the case where not reducing performance, reduces journey The EMS memory occupation of sequence so that can carry out data compression in less time with less machine.
The above is only the better embodiment of the present invention, therefore all constructions according to described in present patent application range, The equivalent change or modification that feature and principle are done, is included in the range of present patent application.

Claims (10)

1. a kind of data compression providing method, which is characterized in that this method comprises the following steps:
Step 1:The common receiving terminal of selection or non-common receiving terminal are excellent to client user's progress data offer and based on data The first one or more common receiving terminals of grade selection carry out data loading;
Step 2:Selection of the data source based on control platform obtains the data of corrresponding quality grade, by the data of the credit rating It is provided after carrying out piecemeal and compression to accordingly common receiving terminal;
Step 3:Common receiving terminal receives the data block that data source provides, and the data block received is saved in local in order In memory space.
2. data compression providing method according to claim 1, which is characterized in that the priority of data reflects data source Wish to serve data to the strong of the wish of receiving terminal, the more strong then priority of the wish provided is higher.
3. according to the data compression providing method described in claim 1-2 any one, which is characterized in that the priority is by controlling Platform or data terminal setting.
4. according to the data compression providing method described in claim 1-3 any one, which is characterized in that carry out piecemeal to data Need the available storage resource situation of consideration receiving terminal.
5. data compression providing method according to claim 4, which is characterized in that the available storage resource situation includes connecing The available order caching space size of receiving end.
6. data compression providing method according to claim 5, which is characterized in that the available storage resource situation includes connecing The available storage port situation of receiving end.
7. data compression providing method according to claim 6, which is characterized in that when receiving terminal available storage resource compared with Data are cut into larger block when more, it is on the contrary then be cut into smaller piece.
8. data compression providing method according to claim 7, which is characterized in that the available storage resource situation is by receiving End provides, which is changed in real time.
9. data compression providing method according to claim 7, which is characterized in that the available storage resource that receiving terminal provides Situation distributes to the data terminal for it and works as storage resource situation rather than the practical all available storage resource feelings that time data provide Condition.
10. data compression providing method according to claim 1, which is characterized in that carrying out piecemeal to data needs to consider The available computational resources situation of receiving terminal.
CN201611208590.2A 2016-12-23 2016-12-23 Data compression providing method Active CN108242931B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201611208590.2A CN108242931B (en) 2016-12-23 2016-12-23 Data compression providing method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201611208590.2A CN108242931B (en) 2016-12-23 2016-12-23 Data compression providing method

Publications (2)

Publication Number Publication Date
CN108242931A true CN108242931A (en) 2018-07-03
CN108242931B CN108242931B (en) 2023-04-28

Family

ID=62704221

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201611208590.2A Active CN108242931B (en) 2016-12-23 2016-12-23 Data compression providing method

Country Status (1)

Country Link
CN (1) CN108242931B (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110209640A (en) * 2019-06-06 2019-09-06 四川长虹电器股份有限公司 The method of switching at runtime lz4 compression algorithm type under cell phone system operating status
CN111277274A (en) * 2020-01-13 2020-06-12 平安国际智慧城市科技股份有限公司 Data compression method, device, equipment and storage medium
CN117749908A (en) * 2023-12-01 2024-03-22 盐城中科高通量计算研究院有限公司 High-flux data compression transmission method based on cooperation of control flow and data flow

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101527654A (en) * 2009-04-20 2009-09-09 中兴通讯股份有限公司 Data transmission method and system in network management system
CN101820426A (en) * 2010-04-22 2010-09-01 华中科技大学 Data compression method in on-line backup service software
US7930436B1 (en) * 2009-03-09 2011-04-19 Znosko Dmitry Y System and method for dynamically adjusting data compression parameters
CN105045873A (en) * 2015-07-17 2015-11-11 深圳市腾讯计算机系统有限公司 Data file pushing method, apparatus and system
WO2016095149A1 (en) * 2014-12-18 2016-06-23 华为技术有限公司 Data compression and storage method and device, and distributed file system
CN105791245A (en) * 2014-12-26 2016-07-20 北京航天测控技术有限公司 Data sending and receiving method and device

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7930436B1 (en) * 2009-03-09 2011-04-19 Znosko Dmitry Y System and method for dynamically adjusting data compression parameters
CN101527654A (en) * 2009-04-20 2009-09-09 中兴通讯股份有限公司 Data transmission method and system in network management system
CN101820426A (en) * 2010-04-22 2010-09-01 华中科技大学 Data compression method in on-line backup service software
WO2016095149A1 (en) * 2014-12-18 2016-06-23 华为技术有限公司 Data compression and storage method and device, and distributed file system
CN106170968A (en) * 2014-12-18 2016-11-30 华为技术有限公司 A kind of data compression storage method, device, and distributed file system
CN105791245A (en) * 2014-12-26 2016-07-20 北京航天测控技术有限公司 Data sending and receiving method and device
CN105045873A (en) * 2015-07-17 2015-11-11 深圳市腾讯计算机系统有限公司 Data file pushing method, apparatus and system

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110209640A (en) * 2019-06-06 2019-09-06 四川长虹电器股份有限公司 The method of switching at runtime lz4 compression algorithm type under cell phone system operating status
CN111277274A (en) * 2020-01-13 2020-06-12 平安国际智慧城市科技股份有限公司 Data compression method, device, equipment and storage medium
CN117749908A (en) * 2023-12-01 2024-03-22 盐城中科高通量计算研究院有限公司 High-flux data compression transmission method based on cooperation of control flow and data flow

Also Published As

Publication number Publication date
CN108242931B (en) 2023-04-28

Similar Documents

Publication Publication Date Title
US9172771B1 (en) System and methods for compressing data based on data link characteristics
US9514209B2 (en) Data processing method and data processing device
CN102065098A (en) Method and system for synchronizing data among network nodes
CN106790552B (en) A kind of content providing system based on content distributing network
CN108242931A (en) A kind of data compression providing method
WO2016095149A1 (en) Data compression and storage method and device, and distributed file system
CN101197773B (en) Packet compressed transmitting and received de-compression method and system based on multilink
CN105718538A (en) Adaptive compression method and system for distributed file system
CN108494788A (en) Transmission method, data transmission device and the computer readable storage medium of data
CN112650721A (en) File storage method, device, system and equipment
WO2020147024A1 (en) Data transmission method and electronic device
CN101305577A (en) Device and method correlating message transmission
JP2024116161A (en) Techniques for updating files
CN104768079A (en) Method, device and system for distributing multimedia resources
EP3258673B1 (en) Efficient information exchange between servers in content transmission network system
CN104954497A (en) Data transmission method and system for cloud storage system
CN110225352B (en) Cloud game video coding and decoding selection method based on capability negotiation
CN105282045B (en) A kind of distributed computing and storage method based on consistency hash algorithm
CN106686399A (en) Intra-network video buffering method based on combined buffering architecture
US10728291B1 (en) Persistent duplex connections and communication protocol for content distribution
CN112350979B (en) Data transmission method and device
CN113438301B (en) Network load balancer, request message distribution method, program product and system
CN109947716A (en) A kind of file memory method, equipment and computer readable storage medium
CN108076116B (en) Intelligent reading method and system based on cloud storage data
CN109787899B (en) Data partition routing method, device and system

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
CB02 Change of applicant information
CB02 Change of applicant information

Address after: 101399 No. 2 East Airport Road, Shunyi Airport Economic Core Area, Beijing (1st, 5th and 7th floors of Industrial Park 1A-4)

Applicant after: Zhongke Star Map Co.,Ltd.

Address before: 101399 Building 1A-4, National Geographic Information Technology Industrial Park, Guomen Business District, Shunyi District, Beijing

Applicant before: GEOVIS TECHNOLOGY (BEIJING) Co.,Ltd.

SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant