CN114416756A - Decentralized telephone traffic data interaction method and system - Google Patents
Decentralized telephone traffic data interaction method and system Download PDFInfo
- Publication number
- CN114416756A CN114416756A CN202111518266.1A CN202111518266A CN114416756A CN 114416756 A CN114416756 A CN 114416756A CN 202111518266 A CN202111518266 A CN 202111518266A CN 114416756 A CN114416756 A CN 114416756A
- Authority
- CN
- China
- Prior art keywords
- attendant
- data
- attendant console
- data interaction
- console
- 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
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/23—Updating
- G06F16/2308—Concurrency control
- G06F16/2315—Optimistic concurrency control
- G06F16/2322—Optimistic concurrency control using timestamps
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computing Systems (AREA)
- Telephonic Communication Services (AREA)
Abstract
The invention discloses a decentralized telephone traffic data interaction method and system. The telephone traffic data interaction method comprises the following steps: acquiring the maximum synchronization timestamp of the last synchronization target attendant console of the attendant console, wherein a plurality of attendant consoles are connected with each other, and any two attendant consoles in the plurality of attendant consoles are the attendant console and the target attendant console; sending a data interaction request to a target attendant console based on the maximum synchronization timestamp; acquiring a data interaction result returned to the attendant console by the target attendant console based on a data change record of the target attendant console after the maximum synchronization timestamp; the data change records only comprise data change records generated by data change of the attendant console and do not comprise data change records generated by data interaction between the attendant consoles; and updating the data interaction result into local data of the attendant console, and updating the maximum synchronization timestamp of the last synchronization target attendant console of the attendant console. The interactive method can eliminate the dependence of each attendant console on the core node.
Description
Technical Field
The invention relates to a decentralized telephone traffic data interaction method and a corresponding telephone traffic data interaction system, belonging to the technical field of dispatching communication.
Background
At present, data storage of the manual attendant console adopts centralized storage, and all data reading depends on a core node (a server or a desk). When the core node fails or the core node network is abnormal, normal data reading and writing of other attendant consoles are affected, and normal continuous services of the attendant consoles are affected in serious cases. And even partial data loss can be caused if the data cannot be recovered in time. As the system operating life increases, the traffic data also increases exponentially with the number of the attendant consoles, and the difficulty and time for data recovery after the core node recovers from a failure state are also seriously affected. Although the distributed server storage mode can solve the problem of single node server failure, the operator console still cannot be made to depend on the core nodes, and meanwhile, the cost of construction and maintenance of a manual telephone traffic system is increased.
In chinese patent application No. 201410167192.5, a method for implementing data synchronization in a man-made telephone traffic system is disclosed. The method realizes the relative isolation of foreground service processing and data synchronization. Foreground business processing only accesses local database; and the data synchronization module is responsible for processing data synchronization between the database of the executive desk and the data of the attendant console. When the telephone console and the class station call ticket are synchronous and abnormal, the call ticket data transmitted to the class station can be stored in the local database, and after the call ticket data is recovered to be normal, the call ticket data can be synchronized to the class station again. When the data configuration process is abnormal, the related configuration data is still stored in the database of the desk, and after the data configuration process is recovered to be normal, the attendant console resynchronizes the configuration data of the desk, and the data synchronization process does not influence the service processing of the attendant console.
Disclosure of Invention
The invention provides a decentralized traffic data interaction method to eliminate the dependence of each attendant console on a core node.
Another technical problem to be solved by the present invention is to provide a decentralized traffic data interaction system.
In order to achieve the technical purpose, the invention adopts the following technical scheme:
according to a first aspect of the embodiments of the present invention, a decentralized traffic data interaction method is provided, which includes the following steps:
acquiring the maximum synchronization timestamp of the last synchronization target attendant console of the attendant console, wherein a plurality of attendant consoles are connected with each other, and any two attendant consoles in the plurality of attendant consoles are the attendant console and the target attendant console mutually;
sending a data interaction request to the target attendant console based on the maximum synchronization timestamp;
acquiring a data interaction result returned to the current attendant console by the target attendant console based on the data change record of the target attendant console after the maximum synchronization timestamp; the data change records only comprise data change records generated by data change of the attendant console and do not comprise data change records generated by data interaction between the attendant consoles;
and updating the data interaction result into local data of the attendant console, and updating the maximum synchronization timestamp of the last time that the target attendant console is synchronized by the attendant console.
Preferably, the data interaction request at least includes a data limit amount for data interaction between the local attendant console and the target attendant console, and the data limit amount is inversely proportional to the interaction efficiency between the local attendant console and the target attendant console.
Preferably, if the changed data amount in the data change record is less than or equal to the data limit amount, all changed data in the data change record are obtained;
and if the changed data amount in the data change record is larger than the data limit amount, sequentially acquiring the changed data of the data limit amount according to the time sequence by taking the maximum synchronous timestamp as a starting point.
Preferably, the obtaining of the maximum synchronization timestamp of the last synchronization target attendant console of the attendant console specifically includes:
determining a target attendant console needing data interaction at this time according to attendant console information of the target attendant console;
searching the maximum synchronization timestamp for synchronizing the target attendant console for the last time from the data interaction state table of the attendant console;
each attendant console maintains a data interaction state table, and the data interaction state table comprises the maximum synchronization timestamp of the last time that the attendant console synchronizes any target attendant console.
Preferably, the attendant console sends data interaction requests to the target attendant consoles in sequence at intervals of set time according to attendant console information of the target attendant consoles until a whole round of data interaction is completed.
Preferably, if the data interaction of the current round is not completed within the set time length, skipping the data interaction of the next round until the data interaction of the current round is completed.
Preferably, the attendant console information at least comprises: the operator group of the target attendant console, the operator number of the target attendant console and the IP address of the target attendant console.
Preferably, the updating the data interaction result into the local data of the attendant console and the updating the maximum synchronization timestamp of the last synchronization of the target attendant console by the attendant console includes:
judging the data interaction result, and if the data interaction result is an empty set, not needing to be updated;
and if the data interaction result is a non-empty set, updating the data information contained in the non-empty set into the local data of the attendant console, and finding out the maximum synchronization timestamp from the data information contained in the non-empty set for data interaction with the target attendant console next time.
Preferably, each of the attendant stations further maintains a data change record table, wherein the data change record table only includes data change records generated by data changes of the attendant stations, and does not include data change records generated by data interaction between the attendant stations.
According to a second aspect of the embodiments of the present invention, there is provided a decentralized traffic data interaction system, comprising a processor and a memory, the processor reading a computer program in the memory for performing the following operations:
acquiring the maximum synchronization timestamp of the last synchronization target attendant console of the attendant console, wherein a plurality of attendant consoles are connected with each other, and any two attendant consoles in the plurality of attendant consoles are the attendant console and the target attendant console mutually;
sending a data interaction request to the target attendant console based on the maximum synchronization timestamp;
acquiring a data interaction result returned to the current attendant console by the target attendant console based on the data change record of the target attendant console after the maximum synchronization timestamp; the data change records only comprise data change records generated by data change of the attendant console and do not comprise data change records generated by data interaction between the attendant consoles;
and updating the data interaction result into local data of the attendant console, and updating the maximum synchronization timestamp of the last time that the target attendant console is synchronized by the attendant console.
The invention has the following technical effects:
the decentralized telephone traffic data interaction method and system provided by the embodiment of the invention fully excavate the characteristics of time uniqueness, accuracy and the like of a computer, and each attendant console eliminates the dependence on a core node while ensuring the integrity of data in a more economic and simple manner through a data change record table and a data interaction state table maintained by each attendant console. And carrying out a regular data change request on the whole network attendant console in the operation process, and carrying out data synchronization processing according to the data type. Even if a certain attendant console has a fault, when the data of the fault node is recovered, the continuous service of any attendant console can not be influenced.
Drawings
Fig. 1 is a schematic flow chart of a decentralized traffic data interaction method according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a data flow of the attendant console performing data interaction with a target attendant console in the embodiment of the present invention;
FIG. 3 is a specific flowchart of the data interaction between the console and the target console according to the embodiment of the present invention;
fig. 4 is a schematic structural diagram of a decentralized traffic data interaction system according to an embodiment of the present invention.
Detailed Description
The technical contents of the invention are described in detail below with reference to the accompanying drawings and specific embodiments.
The decentralized traffic data interaction method provided by the embodiment of the invention realizes data synchronization independent of a core node through data interaction among a plurality of attendant consoles. Each attendant console can be used as the own attendant console, other attendant consoles are target attendant consoles relative to the own attendant console, and the data interaction between the own attendant console and each target attendant console is utilized, so that the attendant consoles can get rid of the dependence on core nodes.
Each attendant maintains a data change record table and a data interaction state table. The "data change record table" is used for recording data changes of the operator station, and only includes data change records (such as incoming calls of clients of the operator station, conversation contents with the clients, and the like) generated by data changes of the operator station, and does not include data change records generated by data interaction between the operator stations. The data interaction state table is used for recording the data synchronization condition of the current attendant console relative to other target attendant consoles, and the data content at least comprises attendant console group information, a seat number and a synchronization time stamp (microsecond level).
The following describes the decentralized traffic data interaction method in detail:
as shown in fig. 1 to fig. 3, a decentralized traffic data interaction method provided in an embodiment of the present invention specifically includes the following steps:
s1: and acquiring the maximum synchronization timestamp of the last synchronization target attendant console of the attendant console.
In this embodiment, there are multiple attendant stations, and the multiple attendant stations are connected to each other for data interaction. Any two attendant consoles in the plurality of attendant consoles are the own attendant console and the target attendant console. For example: the number of the total 10 online attendant consoles is 1-10, and when the number 1 attendant console is used as the current attendant console, the number 2-10 attendant consoles are all target attendant consoles which need to perform data interaction; when the attendant console No. 2 is used as the attendant console, the attendant console No. 1 and the attendant consoles No. 3-10 are target attendant consoles which need to perform data interaction, and so on.
When the attendant console needs to perform data interaction with other target attendant consoles, firstly, determining the target attendant console needing data interaction at this time according to attendant console information of the target attendant console (specifically: a seat group of the target attendant console, a seat number of the target attendant console and an IP address of the target attendant console); then, the maximum synchronization timestamp for synchronizing the target attendant at the last time is searched from the data interaction state table of the attendant. The data interaction state table maintained by each attendant console comprises the maximum synchronization timestamp of the last time that the attendant console synchronizes any target attendant console.
The specific process of this step is illustrated below: for example: the number 1 attendant console is used as the attendant console, and the number 1 attendant console needs to perform data interaction with the number 2-10 attendant consoles in sequence. When the number 1 attendant console needs to perform data interaction with the number 2 attendant console, information of a seat group, a seat number and an IP address of the number 2 attendant console is firstly acquired, so that the position of the number 2 attendant console is determined. After the operator station (i.e., operator station No. 2) needing data interaction is determined, the maximum synchronization timestamp of synchronizing the operator station No. 2 for the last time, i.e., the time of performing data interaction with the operator station No. 2 for the last time, needs to be found from the data interaction state table maintained by the operator station No. 1. The data interaction state table maintained by the attendant console No. 1 not only includes the maximum synchronization timestamp of the last synchronization of the attendant console No. 2, but also includes the maximum synchronization timestamps of the last synchronization of the attendant consoles No. 3-10.
It should be understood that, when the attendant console No. 1 performs data interaction with the attendant console No. 2 for the last time, multiple data may be interacted at the same time, each data corresponds to a unique and accurate synchronization timestamp, a maximum synchronization timestamp needs to be found from the synchronization timestamps, the data corresponding to the maximum synchronization timestamp is the end data of the data interaction, and the next data interaction needs to start from the end data. Meanwhile, in this embodiment, all the attendant consoles 1 to 10 are in an online state, and if some of the attendant consoles are not online, the offline attendant consoles need to be skipped during data interaction. For example: and if the No. 3 attendant console is not on line, the No. 1 attendant console and the No. 2 attendant console complete data interaction, and then the No. 3 attendant console is skipped over, and data interaction with the No. 4 attendant console is continued.
S2: and sending a data interaction request to the target attendant console based on the maximum synchronization timestamp.
After the maximum synchronization timestamp of the target attendant console is determined (namely, after the ending data of the last data interaction is determined), the attendant console sends a data interaction request to the target attendant console according to the IP information of the target attendant console.
In this embodiment, the attendant console sends data interaction requests to each target attendant console in sequence every set time (for example, 10s, or 15s) according to the attendant console information of each target attendant console until a whole round of data interaction is completed. For example: the number 1 attendant console will send the data interaction request to the number 2 attendant console first, after the data interaction is finished, the number 1 attendant console will continue to send the data interaction request to the number 3 attendant console until the number 1 attendant console sends the data interaction request to the number 10 attendant console and completes the data interaction, thereby completing a whole round of data interaction.
It will be appreciated that normally a full round of data interaction needs to be completed within a set duration (i.e. 10 s). Namely: starting from the transmission of a data interaction request from the No. 1 attendant console to the No. 2 attendant console, the No. 1 attendant console needs to complete data interaction with the No. 2 to No. 10 attendant consoles in sequence within 10 s. Then, after 10s, the attendant console # 1 sends a data interaction request to the attendant console # 2 again, and starts a new round of data interaction, thereby circulating.
In order to ensure that a whole round of data interaction can be completed within a set time duration, in this embodiment, a limited data access manner is adopted to access the target attendant console, so that the data interaction request includes a data limitation amount for data interaction between the target attendant console and the local attendant console. For example: the data limit amount of the current data interaction between the attendant console and the target attendant console is 100, or 80, 85 and the like, and the data limit amount can be adaptively adjusted according to needs. It is easy to understand that the data limitation amount is inversely proportional to the interaction efficiency of the current attendant console and the target attendant console, the greater the data limitation amount is, the lower the interaction efficiency is, and the smaller the data limitation amount is, the higher the interaction efficiency is. Therefore, the size of the data limit quantity can be reasonably determined according to the size of the set time length, so that the attendant console can complete a whole round of data interaction within the set time length.
If the accident happens, the data interaction of the current round is not finished within the set time length, the data interaction of the next round is skipped until the data interaction of the current round is finished. For example: in 10s, the attendant console 1 should complete data interaction with the attendant consoles 2-10, however, when 10s is reached, data interaction is completed only with the attendant console 6, and then the attendant console 1 skips the next round of data interaction and continues to send data interaction requests to the attendant console 7 until a whole round of data interaction is completed.
S3: and acquiring a data interaction result returned to the operator console by the target operator console based on the data change record of the target operator console after the maximum synchronization timestamp.
Specifically, after the console sends a data interaction request to the target console, the target console receives the data interaction request and performs data query according to a data change record table maintained by the console, so as to determine whether data change exists after the maximum synchronization timestamp. And after the query is finished, the target attendant console returns a data interaction result to the attendant console.
It is understood that, since the data change record table only includes data change records generated by data changes of the attendant console (for example, incoming calls of clients of the attendant console, conversation contents with the clients, and the like), the data change records generated by data interaction between the attendant consoles are not included. Therefore, the data change is only related to the current attendant console and is not influenced by the data of other attendant consoles, and the authenticity and uniqueness of the data change are ensured.
If the amount of changed data in the data change log is less than or equal to the data limit amount in step S2 (for example, the amount of changed data in the data change log is 50, and the data limit amount is 100), all the changed data in the data change log is acquired (that is, all 50 pieces of changed data are acquired). If the changed data amount in the data change record is greater than the data limit amount (for example, the changed data amount in the data change record is 120, and the data limit amount is 100), the changed data of the data limit amount (namely 100) is sequentially acquired according to the time sequence with the maximum synchronization timestamp as the starting point.
S4: and updating the data interaction result into local data of the attendant console, and updating the maximum synchronization timestamp of the last synchronization target attendant console of the attendant console.
After receiving the data interaction result returned by the target attendant console, the local attendant console needs to judge the data interaction result so as to determine whether to update the local data of the local attendant console.
If the data interaction result is an empty set, the target attendant console has no data transformation, and therefore updating is not needed. If the data interaction result is a non-empty set { R | R1,……,rn}(
And n is less than or equal to Clim) Then, updating the data information contained in the non-empty set into the local data of the attendant console, namely r1,……,rnAnd n data are synchronized into the local data of the attendant console. Wherein R represents a set comprising R1,……,rnN total data, ClimLimiting the amount of data in step S2, i.e. not including C at most in the empty set RlimAnd (4) data.
At the same time, r1,……,rnN total data, each numberEach synchronization timestamp corresponds to one synchronization timestamp, and therefore, the maximum synchronization timestamp needs to be found from the n synchronization timestamps for the next data interaction with the target attendant console.
As shown in fig. 4, the present invention further provides a decentralized traffic data interaction system based on the decentralized traffic data interaction method. As shown in fig. 4, the interactive system includes one or more processors 21 and a memory 22. Wherein the memory 22 is coupled to the processor 21 for storing one or more programs which, when executed by the one or more processors 21, cause the one or more processors 21 to implement the decentralized traffic data interaction method as in the above embodiments.
The processor 21 is used for controlling the overall operation of the interactive system to complete all or part of the steps of the decentralized traffic data interaction method. The processor 21 may be a Central Processing Unit (CPU), a Graphics Processing Unit (GPU), a Field Programmable Gate Array (FPGA), an Application Specific Integrated Circuit (ASIC), a Digital Signal Processing (DSP) chip, or the like. The memory 22 is used to store various types of data to support operation of the interactive system, and these data may include, for example, instructions for any application or method operating on the interactive system, as well as application-related data. The memory 22 may be implemented by any type or combination of volatile or non-volatile memory devices, such as Static Random Access Memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic memory, flash memory, and the like.
In an exemplary embodiment, the interactive system may be implemented by a computer chip or an entity, or by a product with certain functions, for performing the decentralized traffic data interaction method described above, and achieving the technical effects consistent with the method described above. One typical embodiment is a computer. In particular, the computer may be, for example, a personal computer, a laptop computer, a vehicle-mounted human-computer interaction device, a cellular telephone, a camera phone, a smart phone, a personal digital assistant, a media player, a navigation device, an email device, a game console, a tablet computer, a wearable device, or a combination of any of these devices.
In another exemplary embodiment, the present invention also provides a computer readable storage medium comprising program instructions which, when executed by a processor, implement the steps of the decentralized traffic data interaction method in any of the above-described embodiments. For example, the computer readable storage medium may be the above-mentioned memory including program instructions executable by the processor of the interactive system to perform the above-mentioned decentralized traffic data interaction method, and to achieve the technical effects consistent with the above-mentioned method.
In summary, the decentralized traffic data interaction method and system provided by the embodiments of the present invention fully exploit the characteristics of computer, such as time uniqueness and accuracy, and each attendant console eliminates the dependency on the core node while ensuring data integrity in a more economical and simple manner through the "data change record table" and the "data interaction state table" maintained by each attendant console. And carrying out a regular data change request on the whole network attendant console in the operation process, and carrying out data synchronization processing according to the data type. Even if a certain attendant console has a fault, when the data of the fault node is recovered, the continuous service of any attendant console can not be influenced.
The foregoing describes the decentralized traffic data interaction method and system provided by the present invention in detail. It will be apparent to those skilled in the art that any obvious modifications thereof can be made without departing from the spirit of the invention, which infringes the patent right of the invention and bears the corresponding legal responsibility.
Claims (10)
1. A decentralized traffic data interaction method, comprising the steps of:
acquiring the maximum synchronization timestamp of the last synchronization target attendant console of the attendant console, wherein a plurality of attendant consoles are connected with each other, and any two attendant consoles in the plurality of attendant consoles are the attendant console and the target attendant console mutually;
sending a data interaction request to the target attendant console based on the maximum synchronization timestamp;
acquiring a data interaction result returned to the current attendant console by the target attendant console based on the data change record of the target attendant console after the maximum synchronization timestamp; the data change records only comprise data change records generated by data change of the attendant console and do not comprise data change records generated by data interaction between the attendant consoles;
and updating the data interaction result into local data of the attendant console, and updating the maximum synchronization timestamp of the last time that the target attendant console is synchronized by the attendant console.
2. The traffic data interaction method of claim 1, wherein the data interaction request at least includes a data limitation amount of data interaction between the local attendant station and the target attendant station, and the data limitation amount is inversely proportional to the interaction efficiency between the local attendant station and the target attendant station.
3. The traffic data interaction method of claim 2,
if the changed data amount in the data change record is less than or equal to the data limit amount, acquiring all changed data in the data change record;
and if the changed data amount in the data change record is larger than the data limit amount, sequentially acquiring the changed data of the data limit amount according to the time sequence by taking the maximum synchronous timestamp as a starting point.
4. The traffic data interaction method of claim 1, wherein said obtaining the maximum synchronization timestamp of the last synchronization target attendant of the present attendant specifically comprises:
determining a target attendant console needing data interaction at this time according to attendant console information of the target attendant console;
searching the maximum synchronization timestamp for synchronizing the target attendant console for the last time from the data interaction state table of the attendant console;
each attendant console maintains a data interaction state table, and the data interaction state table comprises the maximum synchronization timestamp of the last time that the attendant console synchronizes any target attendant console.
5. The traffic data interaction method of claim 4, wherein the local attendant console sends data interaction requests to each target attendant console in sequence at intervals of a set time according to the attendant console information of each target attendant console until a complete round of data interaction is completed.
6. The traffic data interaction method of claim 5, wherein if the current round of data interaction is not completed within the set time duration, skipping the next round of data interaction until the current round of data interaction is completed.
7. The traffic data interaction method of claim 4, wherein said attendant information comprises at least: the operator group of the target attendant console, the operator number of the target attendant console and the IP address of the target attendant console.
8. The traffic data interaction method of claim 1, wherein the updating the data interaction result into the local data of the local attendant station and the updating the maximum synchronization timestamp of the last synchronization of the local attendant station with the target attendant station specifically comprises:
judging the data interaction result, and if the data interaction result is an empty set, not needing to be updated;
and if the data interaction result is a non-empty set, updating the data information contained in the non-empty set into the local data of the attendant console, and finding out the maximum synchronization timestamp from the data information contained in the non-empty set for data interaction with the target attendant console next time.
9. The traffic data interaction method of claim 4, wherein each of said local attendant stations further maintains a data change record table; the data change record table includes only data change records generated by data change of the attendant stations, and does not include data change records generated by data interaction between the attendant stations.
10. A decentralized traffic data interaction system, comprising a processor and a memory, said processor reading a computer program in said memory for performing the following operations:
acquiring the maximum synchronization timestamp of the last synchronization target attendant console of the attendant console, wherein a plurality of attendant consoles are connected with each other, and any two attendant consoles in the plurality of attendant consoles are the attendant console and the target attendant console mutually;
sending a data interaction request to the target attendant console based on the maximum synchronization timestamp;
acquiring a data interaction result returned to the current attendant console by the target attendant console based on the data change record of the target attendant console after the maximum synchronization timestamp; the data change records only comprise data change records generated by data change of the attendant console and do not comprise data change records generated by data interaction between the attendant consoles;
and updating the data interaction result into local data of the attendant console, and updating the maximum synchronization timestamp of the last time that the target attendant console is synchronized by the attendant console.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111518266.1A CN114416756A (en) | 2021-12-13 | 2021-12-13 | Decentralized telephone traffic data interaction method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111518266.1A CN114416756A (en) | 2021-12-13 | 2021-12-13 | Decentralized telephone traffic data interaction method and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114416756A true CN114416756A (en) | 2022-04-29 |
Family
ID=81264910
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111518266.1A Pending CN114416756A (en) | 2021-12-13 | 2021-12-13 | Decentralized telephone traffic data interaction method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114416756A (en) |
-
2021
- 2021-12-13 CN CN202111518266.1A patent/CN114416756A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110321387B (en) | Data synchronization method, equipment and terminal equipment | |
| CN108121782B (en) | Distribution method of query request, database middleware system and electronic equipment | |
| CN102333029B (en) | Routing method in server cluster system | |
| CN109407977B (en) | Big data distributed storage management method and system | |
| CN103714097A (en) | Method and device for accessing database | |
| CN106997557B (en) | Order information acquisition method and device | |
| CN110784498B (en) | Personalized data disaster tolerance method and device | |
| CN104750757B (en) | A kind of date storage method and equipment based on HBase | |
| CN107040576A (en) | Information-pushing method and device, communication system | |
| CN107179940A (en) | A kind of method and device of tasks carrying | |
| CN114827145A (en) | Server cluster system, and metadata access method and device | |
| CN108566291A (en) | A kind of method of event handling, server and system | |
| CN113010549A (en) | Data processing method based on remote multi-active system, related equipment and storage medium | |
| CN105069152A (en) | Data processing method and apparatus | |
| CN112000850B (en) | Method, device, system and equipment for processing data | |
| CN112363980A (en) | Data processing method and device for distributed system | |
| US9870402B2 (en) | Distributed storage device, storage node, data providing method, and medium | |
| CN117520278A (en) | Multi-client high-precision directory quota control method for distributed file system | |
| CN114416756A (en) | Decentralized telephone traffic data interaction method and system | |
| CN109165259B (en) | Index table updating method based on network attached storage, processor and storage device | |
| CN111131497B (en) | File transmission method and device, electronic equipment and storage medium | |
| CN111586438A (en) | Method, device and system for processing service data | |
| CN110569231B (en) | Data migration method, device, equipment and medium | |
| CN112860494A (en) | Data center switching method and related equipment thereof | |
| CN111291296B (en) | Content issuing method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |