CN106897160A - A kind of document handling method, apparatus and system - Google Patents
A kind of document handling method, apparatus and system Download PDFInfo
- Publication number
- CN106897160A CN106897160A CN201710050027.5A CN201710050027A CN106897160A CN 106897160 A CN106897160 A CN 106897160A CN 201710050027 A CN201710050027 A CN 201710050027A CN 106897160 A CN106897160 A CN 106897160A
- Authority
- CN
- China
- Prior art keywords
- file
- module
- application module
- queue
- name
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 64
- 230000008569 process Effects 0.000 claims description 41
- 230000000903 blocking effect Effects 0.000 claims description 27
- 230000009471 action Effects 0.000 claims description 9
- 238000003672 processing method Methods 0.000 claims description 9
- 230000009286 beneficial effect Effects 0.000 description 9
- 230000000694 effects Effects 0.000 description 7
- 238000010586 diagram Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 230000004075 alteration Effects 0.000 description 1
- 238000012550 audit Methods 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000026676 system process Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/54—Interprogram communication
- G06F9/546—Message passing systems or structures, e.g. queues
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The present invention relates to a kind of document handling method, apparatus and system, the method is applied to a kind of document handling system, document handling system at least includes the first application module, the second application module and first queue module, wherein, the method that the first application module is performed includes：First queue module is read, for determining whether first queue module is empty；When it is determined that first queue module be space-time, into blocked state；Or, when it is determined that first queue module is non-NULL, read the title of the first file in first queue module；And according to the title of the first file, read the content of the first file；Content to the first file is processed, and is generated the second file and is stored, wherein, after the first file is processed the 3rd file for the second application module, the file for generating and storing.
Description
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a method, an apparatus, and a system for processing a file.
Background
When a traditional file processing application system processes file data, the file data is processed by the module A and then is sent to the module B for processing. And the module A and the module B adopt a directory concatenation mode to realize file transmission. For example, the exit directory of the file generated by the module a is the entry directory of the file that needs to be processed by the module B. The module A reads in the file F from the entry directory and performs corresponding processing on the file F. After the processing is completed, file F' is generated in the egress directory. The module B scans the exit directory (the entry directory of the module B) of the module a at regular time, and when finding that there is a file F ' in the directory, the module B starts to read the file F ' and performs corresponding processing on the file F '.
However, since the B module does not know when the a module will generate the file F', it is necessary to continuously scan the B module entry directory at regular intervals (e.g., every 15 seconds) to determine whether a new file is generated in the B module entry directory when the B module entry directory is empty. And when detecting that the entry directory of the B module has a new file, the B module starts to process the file.
In this way, if module a has already generated file F ', but it has not yet reached the scanning time point of module B, module B will not immediately process file F', thereby causing file processing delay. Furthermore, as the flow of the service system is gradually lengthened, the number of modules through which a file passes increases, and if each module needs to scan the entry directory corresponding to the module at regular time, the delay of the file in the whole processing process is certainly greatly increased, and the working efficiency of the system is seriously reduced.
Disclosure of Invention
The technical problem to be solved by the invention is to provide a file processing method, device and system, which can avoid unnecessary time delay caused by the file processing process and improve the working efficiency of the system.
The technical scheme for solving the technical problems is as follows:
in a first aspect, an embodiment of the present invention provides a file processing method, which is applied to a file processing system. The file processing system at least comprises a first application module, a second application module and a first queue module. The method executed by the first application module comprises the following steps:
reading the first queue module for determining whether the first queue module is empty; and entering a blocking state when the first queue module is determined to be empty. And switching from the blocking state to the running state until the first queue module is not empty, and continuously reading the first queue module to obtain the first file name. For subsequent operations.
Or when the first queue module is determined to be non-empty, reading the name of the first file in the first queue module; reading the content of the first file according to the name of the first file; and processing the content of the first file to generate and store a second file, wherein the first file is generated and stored after the second application module processes the third file.
The invention has the beneficial effects that: when the first queue module is empty, the first application module enters a blocking state. When the first queue module is not empty, the first application module switches from the blocking state to the running state. And acquiring a first file name in the first queue module at the first time, reading the content of the first file from the memory according to the first file name, and carrying out corresponding processing on the content of the first file. Therefore, after the second application module is determined to process the third file, the first application module can immediately perform corresponding processing on the newly generated first file. Therefore, unnecessary time delay can be reduced, and the system efficiency is improved. Only the file name is added into the message queue, the circulation speed between the modules can be increased, and the consumption of the message queue on the memory can be reduced.
Further, after the content of the first file is processed, and a second file is generated and stored, the method further comprises: and adding the name of the second file into a third queue module, wherein the third queue module is a queue module corresponding to the application module which is behind the first application module and is next to the first application module to execute the action.
The beneficial technical effect of adopting the above further scheme is that only after the name of the second file is added into the third queue module, the name of the second file can be read from the third queue module after the first application module and the application module next to the first application module, for example, the third application module, and then the blocking state is switched to the running state. And the second file is processed at the first time by the third application module, so that the time delay is reduced.
Further, the method also includes: the second application module transmits the first file name to the first application module in a pushing mode through the first queue module.
The beneficial technical effect of adopting the further technical scheme is that the first file name is transmitted between the second application module and the first application module in a pushing mode through the message queue, and the one-to-one correspondence between the transmitted file name and the file content can be realized. The first application module can conveniently process the files in order. Meanwhile, the data balance auditing and regular backup capabilities in the traditional file processing system are also reserved.
Further, the second file processing process performed by the second application module is the same as the first file processing process performed by the first application module.
The beneficial technical effect of adopting the above further technical scheme is that when the second application module processes the third file, the process is actually the same as or similar to the process when the first application module processes the first file. The method aims to generate and store a first file for the first application module to process the first file.
In a second aspect, an embodiment of the present invention provides a file processing apparatus, where the file processing apparatus corresponds to a first application module in a file processing system, where the apparatus includes:
a reading unit for reading the first queue module for determining whether the first queue module is empty; when the first queue module is determined to be empty, controlling the first application module to enter a blocking state; and switching from the blocking state to the running state until the first queue module is not empty, and continuously reading the first queue module to obtain the first file name. For subsequent operations.
Or,
the reading unit is used for switching from a blocking state to a running state when the first queue module is determined to be non-empty, and continuously reading the name of the first file in the first queue module; reading the content of the first file according to the name of the first file;
and the processing unit is used for processing the content of the first file, generating and storing a second file, wherein the first file is generated and stored after the second application module processes the third file.
The beneficial technical effects of the above scheme are that the reading unit reads the first queue module, judges whether the first queue module is empty at the moment, and if the first queue module is empty, the processing unit controls the first application module to enter a blocking state. And when the first queue module is not empty, the first application module is switched from the blocking state to the running state. The reading unit continues to read the first file name in the first queue module and reads the content of the first file from the memory according to the first file name. The processing unit performs corresponding processing on the content of the first file. Therefore, after the second application module is determined to process the third file, the processing unit immediately performs corresponding processing on the first file. Therefore, unnecessary time delay can be reduced, and the system efficiency is improved. Only the file name is added into the message queue, the circulation speed between the modules can be increased, and the consumption of the message queue on the memory can be reduced.
Further, the processing unit is further configured to add the name of the second file to a third queue module, where the third queue module is a queue module corresponding to an application module that is behind the first application module and that executes an action next to the first application module.
The beneficial technical effect of adopting the above further scheme is that only after the name of the second file is added into the third queue module, the name of the second file can be read from the third queue after the first application module and the application module next to the first application module, for example, the third application module, and then the blocking state is switched to the running state. And the second file is processed at the first time by the third application module, so that the time delay is reduced.
Further, the second application module transmits the first file name to the first application module in a pushing mode through the first queue module.
The beneficial technical effect of adopting the further technical scheme is that the first file name is transmitted between the second application module and the first application module in a pushing mode through the message queue, and the one-to-one correspondence between the transmitted file name and the file content can be realized. The first application module can conveniently process the files in order. Meanwhile, the data balance auditing and regular backup capabilities in the traditional file processing system are also reserved.
Furthermore, the third file processing process of the second application module is the same as the first file processing process of the first application module.
The beneficial technical effect of adopting the above further technical scheme is that when the second application module processes the third file, the process is actually the same as or similar to the process when the first application module processes the first file. The method aims to generate and store a first file for the first application module to process the first file.
In a third aspect, an embodiment of the present invention further provides a file processing system, where the file processing system at least includes: the device comprises a first application module, a first queue module, a second application module and a memory, wherein the first queue module is used for storing file names; the second application module is used for processing the third file, generating and storing the first file, and adding the name of the first file into the first queue module; the memory is used for respectively storing one or more programs executed by the first application module, one or more programs executed by the second application module, and the content of the first file, the content of the second file and the content of the third file.
The invention has the beneficial effects that: when the first queue module is empty, the first application module enters a blocking state. When the first queue module is not empty, the first application module switches from the blocking state to the running state. And acquiring a first file name in the first queue module at the first time, reading the content of the first file from the memory according to the first file name, and carrying out corresponding processing on the content of the first file. Therefore, after the second application module is determined to process the third file, the first application module can immediately perform corresponding processing on the newly generated first file. Therefore, unnecessary time delay can be reduced, and the system efficiency is improved. Only the file name is added into the message queue, the circulation speed between the modules can be increased, and the consumption of the message queue on the memory can be reduced.
Drawings
Fig. 1 is a schematic flow chart of a file processing method according to an embodiment of the present invention;
FIG. 2 is a schematic structural diagram of a file processing apparatus according to a second embodiment of the present invention;
fig. 3 is a schematic structural diagram of a file processing system according to a third embodiment of the present invention.
Detailed Description
The principles and features of this invention are described below in conjunction with the following drawings, which are set forth by way of illustration only and are not intended to limit the scope of the invention.
Fig. 1 is a schematic flowchart of a file processing method according to an embodiment of the present invention. The file processing system is mainly applied to a file processing system and comprises a first application module, a second application module and a first queue module. Specifically, the method steps executed by the first application module are as shown in fig. 1:
at step 110, the first queue module is read for determining whether the first queue module is empty.
Step 120a, entering a blocking state when the first queue module is determined to be empty.
Specifically, only when the first queue module is not empty, the first application module will switch from the blocking state to the working mode, and continue to read the first file name in the first queue module. And then perform the subsequent action. The specific steps are as described in step 130-150 below.
Alternatively, 120A reads the name of the first file in the first queue module when it is determined that the first queue module is non-empty.
Step 130, reading the content of the first file according to the name of the first file.
Step 140, the content of the first file is processed, and a second file is generated and stored.
Specifically, the first file is obtained after the second application module processes the third file.
It should be understood that the contents of the first file, the second file, and the third file are stored for the convenience of processing them by the module corresponding to the file contents; and simultaneously, the storage device is convenient to read directly from the storage device during subsequent use. For example, the first application module may read the first file content directly from the memory according to the first file name. Or, in the subsequent processing, if other modules need to read the content of the first file, the other modules can also directly read the content from the memory.
Preferably, after step 140, the method further comprises step 150 of adding the name of the second file to a third queue module, wherein the third queue module is a queue module corresponding to an application module that is behind the first application module and that performs an action next to the first application module. Only after the name of the second file is added to the third queue module, the application module next to the first application module, for example, the third application module, can be switched from the blocking state to the running state, and then the name of the second file is read from the second queue. And the second file is processed at the first time by the third application module, so that the time delay is reduced.
Preferably, the process of processing the third file by the second application module is the same as or similar to the process of processing the first file by the first application module. As described in detail in steps 120A-150. And will not be described in detail herein.
And the second application module processes the third file, generates and stores the first file, and then adds the name of the first file into the first queue module, so that the first application module can read the name of the first file. Further preferably, when the file name is transferred between the first application module and the second application module, the file name is transmitted in a push manner through the first queue module. That is, a separate file name is transmitted when transmitting, and the file content corresponding to the file name is stored in the memory. Therefore, the one-to-one correspondence between the transferred file names and the file contents can be realized. Meanwhile, just as the file names can be in one-to-one correspondence with the file contents, for example, the first file names are in one-to-one correspondence with the first file contents, the method also reserves the capabilities of data balance audit, regular backup and the like in the traditional file processing system.
In a specific example, the processing system is a telecommunication billing system, the second application module is a duplication checking module, and the first application module is a rating module.
The duplication checking module is used for checking the duplicated call ticket file K1Name "K" of (first file)1' Add to queue Module Q corresponding to rating Module1(first queue module). Wherein, the ticket file K after the duplication checking1The duplication checking module checks a duplicate prefix document K0(third file) the file generated after the processing. When the weight checking module holds K1Adding the queue module Q corresponding to the rating module1The rating module may determine the queue module Q1If not, the pricing module will read the queue module Q1File name "K" in (1)1Reading the stored ticket file K after repeated check1Content, then to the ticket file K after checking the duplication1Corresponding processing is carried out to generate a priced ticket file K2(third file).
It should be understood that the above-mentioned ticket file K0And the ticket file K after the duplication checking1And the priced ticket file K2All stored in the memory for processing by the corresponding module, or directly read from the memory when the file content needs to be read by other modules subsequently. The file name is transmitted between the duplication checking module and the pricing module through the queue moduleBlock Q1Delivered in a push manner.
Of course, the reader should also understand that, because in the above specific embodiments, only the system is illustrated as including the first application module and the second application module. Therefore, when the first application module is switched from the blocking state to the running state, the first file is processed, and the third file is acquired, so that the processing is finished. However, the above embodiments have been summarized only in the case where the system includes the first application module and the second application module during a certain period of time. In practice, the system may comprise at least two application modules. Similarly, at least two queue modules may be included in the system. The number of the queue modules is the same as that of the application modules, and the queue modules correspond to the application modules one to one. For example comprising n modules and n module queues. Then the above steps are repeated. The first application module and the second application module are not actually the first application module and the second application module, but in terms of the execution sequence, the module that performs the action first is the second application module, and the module that performs the action later is the first application module. The third file described herein may be understood as a file content obtained by the second application module according to the name of the third file, and the third file is obtained by processing a file according to an application module before the second application module. Alternatively, the third file may be the most initial file. For example, the file processing system includes three application modules. In a certain period of time, module 1 is the second application module and module 2 is the first application module. After the module 1 processes the file F, a file F' is generated. The processor in the system would then add the name "F '" of the file F' to the queue module Q corresponding to module 22In (1). Then, block 2, determine queue block Q2When the current state is not empty, the module 2 is switched from the blocking state to the running state, and the slave queue module Q2After the file name "F '" is read, the file content corresponding to the file name "F'" is read in the memory, and then the file content is correspondingly processed to generate a file F ". In the next time period, the module 2 is a second application module, the moduleAnd 3 is a first application module. When the module 2 processes the file F ', a file F' is generated. The processor in the system will add the name "F" of file F "to the queue module Q corresponding to module 33In (1). Then, module 3 determines a queue module Q3Now non-empty, will switch from blocking state to running state and from queue module Q3After the file name "F" is read, the file content corresponding to the file name "F" is read in the memory, and then the file content is processed correspondingly to generate a file F' ". Of course, all the cases listed above are the cases where the queue module is not empty, and when the queue module is empty, the application module corresponding to the queue module is in the blocking state, which is not described herein again.
In the file processing method provided by the first embodiment of the present invention, when the first queue module is empty, the first application module enters a blocking state. When the first queue module is not empty, the first application module switches from a blocking state to a running state, acquires a first file name in the first queue module at the first time, reads the content of the first file from the memory according to the first file name, and performs corresponding processing on the content of the first file. Therefore, after the second application module is determined to process the third file, the first application module can immediately perform corresponding processing on the newly generated first file. Therefore, unnecessary time delay can be reduced, and the system efficiency is improved. Only the file name is added into the message queue, the circulation speed between the modules can be increased, and the consumption of the message queue on the memory can be reduced. Meanwhile, the data balance auditing and regular backup capabilities in the traditional file processing system are also reserved.
Corresponding to the above file processing method embodiment, the second embodiment of the present invention provides a file processing apparatus. As shown in fig. 2, the document processing apparatus includes: reading unit 201, processing unit 202.
The reading unit 201 reads the first queue module for determining whether the first queue module is empty. And when the first queue module is determined to be empty, controlling the first application module to enter a blocking state. Or, the reading unit 201 is configured to, when it is determined that the first queue module is non-empty, read a name of a first file in the first queue module; and reading the content of the first file according to the name of the first file. The processing unit 202 is configured to process the content of the first file, generate a second file, and store the second file, where the first file is a file generated and stored after the second application module processes the third file. Here, the process of processing the third file by the second application module is similar to the process of processing the first file by the first application module.
Preferably, the processing unit is further configured to add the name of the second file to a third queue module, where the third queue module is a queue module corresponding to an application module that is behind the first application module and that executes an action next to the first application module. Only after the name of the second file is added to the third queue module, the application module next to the first application module, for example, the third application module, can be switched from the blocking state to the running state, and then the name of the second file is read from the second queue. And the second file is processed at the first time by the third application module, so that the time delay is reduced.
Further preferably, the second application module transmits the first file name to the first application module in a pushing manner through the first queue module.
Specifically, the first file name is transmitted between the first and second application modules in a push manner through the message queue, so that the transmitted file name and the file content can be in one-to-one correspondence. The first application module can conveniently process the files in order. Meanwhile, the data balance auditing and regular backup capabilities in the traditional file processing system are also reserved.
The functions performed by the components in the file processing apparatus have been described in detail in the file processing method in the above embodiment, and are not described again here.
In addition, it should be understood by those skilled in the art that in the present embodiment, only the device components corresponding to the first application module are described. However, the second application module or the other application modules have the same or similar device components as the first application module, and are not described in detail here.
In the file processing apparatus according to the second embodiment of the present invention, only when the first queue module of the first queue module is not empty, the first application module may switch from the blocking state to the running state. And then acquiring a first file name in the first queue module, reading the content of the first file from the memory according to the first file name, and carrying out corresponding processing on the content of the first file. Therefore, after the second application module is determined to process the third file, the first application module immediately performs corresponding processing on the first file. Therefore, unnecessary time delay can be reduced, and the system efficiency is improved. Moreover, only the file name is added into the queue module, the circulation speed among the modules can be increased, and the consumption of the queue module on the memory can be reduced. Meanwhile, the data balance auditing and regular backup capabilities in the traditional file processing system are also reserved.
Corresponding to the first embodiment, the third embodiment of the present invention provides a file processing system. The system at least comprises: a first application module 301, a first queue module 302, a second application module 303, and a memory 304, wherein the first queue module 302 is configured to store a file name; the second application module 303 is configured to process the third file, generate and store the first file; and adding the name of the first file to the first queue module. The memory 304 is used for storing one or more programs executed by the first application module, one or more programs executed by the second application module, and the contents of the first file, the second file, and the third file, respectively. The functions performed by the components in the system have been described in detail in the above two embodiments, and are not described again here.
The reader should understand that in the description of this specification, reference to the description of the terms "one embodiment," "some embodiments," "an example," "a specific example," or "some examples," etc., means that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, the schematic representations of the terms used above are not necessarily intended to refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, various embodiments or examples and features of different embodiments or examples described in this specification can be combined and combined by one skilled in the art without contradiction.
Although embodiments of the present invention have been shown and described above, it is understood that the above embodiments are exemplary and should not be construed as limiting the present invention, and that variations, modifications, substitutions and alterations can be made to the above embodiments by those of ordinary skill in the art within the scope of the present invention.
Claims (9)
1. A file processing method applied to a file processing system, the file processing system at least comprising a first application module, a second application module and a first queue module, wherein the method performed by the first application module comprises:
reading the first queue module for determining whether the first queue module is empty;
entering a blocking state when the first queue module is determined to be empty;
or,
when the first queue module is determined to be non-empty, reading the name of a first file in the first queue module;
reading the content of the first file according to the name of the first file;
and processing the content of the first file to generate and store a second file, wherein the first file is generated and stored after the second application module processes a third file.
2. The method of claim 1, wherein after processing the content of the first file, generating a second file, and storing, the method further comprises:
and adding the name of the second file into a third queue module, wherein the third queue module is a queue module corresponding to an application module which is behind the first application module and is next to the first application module to execute actions.
3. The method according to claim 1 or 2, characterized in that the method further comprises: and the second application module transmits the first file name to the first application module in a pushing mode through the first queue module.
4. The method according to claim 1 or 2, wherein the third file processing procedure performed by the second application module is the same as the first file processing procedure performed by the first application module.
5. A document processing apparatus, the apparatus corresponding to a first application module in the document processing system, wherein the apparatus comprises:
a reading unit configured to read the first queue module for determining whether the first queue module is empty; when the first queue module is determined to be empty, controlling the first application module to enter a blocking state;
or,
the reading unit is used for reading the name of a first file in the first queue module when the first queue module is determined to be non-empty; reading the content of the first file according to the name of the first file;
and the processing unit is used for processing the content of the first file, generating a second file and storing the second file, wherein the first file is generated and stored after the second application module processes a third file.
6. The apparatus of claim 5, wherein the processing unit is further configured to:
and adding the name of the second file into a third queue module, wherein the third queue module is a queue module corresponding to an application module which is behind the first application module and is next to the first application module to execute actions.
7. The apparatus according to claim 5 or 6, wherein the second application module transfers the first file name to the first application module in a push manner through the first queue module.
8. The apparatus according to claim 5 or 6, wherein the third file processing procedure performed by the second application module is the same as the first file processing procedure performed by the first application module.
9. A document processing system, characterized in that the document processing system comprises at least: the device comprises a first application module, a first queue module, a second application module and a memory, wherein the first queue module is used for storing file names; the second application module is used for processing a third file, generating and storing a first file, and adding the name of the first file into the first queue module; the memory is used for respectively storing one or more programs executed by the first application module, one or more programs executed by the second application module, and the content of the first file, the content of the second file and the content of the third file.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710050027.5A CN106897160A (en) | 2017-01-23 | 2017-01-23 | A kind of document handling method, apparatus and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710050027.5A CN106897160A (en) | 2017-01-23 | 2017-01-23 | A kind of document handling method, apparatus and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106897160A true CN106897160A (en) | 2017-06-27 |
Family
ID=59198707
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710050027.5A Pending CN106897160A (en) | 2017-01-23 | 2017-01-23 | A kind of document handling method, apparatus and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106897160A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112084297A (en) * | 2019-06-14 | 2020-12-15 | 百度(中国)有限公司 | Data processing method and device, electronic equipment and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101079834A (en) * | 2006-12-21 | 2007-11-28 | 腾讯科技（深圳）有限公司 | An Email forwarding method, system and device based on distributed IDC |
| EP2549377A2 (en) * | 2011-07-18 | 2013-01-23 | Telefonaktiebolaget L M Ericsson (publ) | A scalable hardware mechanism to implement time outs for pending pop requests to blocking work queues |
| CN106130868A (en) * | 2016-06-02 | 2016-11-16 | 腾讯科技（深圳）有限公司 | A kind of processing method adjusting back message and queue management system |
-
2017
- 2017-01-23 CN CN201710050027.5A patent/CN106897160A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101079834A (en) * | 2006-12-21 | 2007-11-28 | 腾讯科技（深圳）有限公司 | An Email forwarding method, system and device based on distributed IDC |
| EP2549377A2 (en) * | 2011-07-18 | 2013-01-23 | Telefonaktiebolaget L M Ericsson (publ) | A scalable hardware mechanism to implement time outs for pending pop requests to blocking work queues |
| CN106130868A (en) * | 2016-06-02 | 2016-11-16 | 腾讯科技（深圳）有限公司 | A kind of processing method adjusting back message and queue management system |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112084297A (en) * | 2019-06-14 | 2020-12-15 | 百度(中国)有限公司 | Data processing method and device, electronic equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105450785B (en) | File transmission method and device | |
| CN102238201A (en) | Internet of things application module and communication method for Internet of things application and Internet of things terminal | |
| CN112104568B (en) | Data transmission control method and gateway | |
| CN101540969B (en) | Method for realizing number carried in short message system and device thereof | |
| CN115002016B (en) | Message processing system, method, device and storage medium | |
| CN113261249A (en) | Data transmission method, related equipment and computer storage medium | |
| US9913010B2 (en) | Data processing method and apparatus | |
| CN108023938B (en) | Message sending method and server | |
| CN109150720B (en) | Service chain message forwarding method, device, equipment and computer readable storage medium | |
| CN106897160A (en) | A kind of document handling method, apparatus and system | |
| CN107426109B (en) | Traffic scheduling method, VNF module and traffic scheduling server | |
| CN106059956A (en) | Time queue processing method and device for session of network equipment | |
| CN101145843A (en) | A download method for Gbit passive optical network terminal software | |
| EP2437447A1 (en) | Multimedia message forwarding method, device and system thereof | |
| RU2752660C1 (en) | Method for assigning identifier of data radio bearer, network node and computer data storage medium | |
| CN112752352A (en) | Method and equipment for determining intermediate session management function I-SMF | |
| CN103138894A (en) | Method and nodes and data network of data transmission | |
| CN109120502B (en) | Communication method, device, system and storage medium for multi-service convergence platform | |
| CN111279729A (en) | Data transmission method and BLE equipment | |
| CN105025042B (en) | A kind of method and system of determining data information, proxy server | |
| US11575601B2 (en) | Network device and packet processing method using same | |
| DE60218389D1 (en) | participants deflection | |
| CN101969437B (en) | IP fax method and gateway device | |
| CN110198312B (en) | Message processing method and device | |
| CN104967967B (en) | Method and device for multi-hop resource discovery |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20170627 |