CN115633005A - Real-time high-concurrency connection processing method and processing system thereof - Google Patents
Real-time high-concurrency connection processing method and processing system thereof Download PDFInfo
- Publication number
- CN115633005A CN115633005A CN202211316616.0A CN202211316616A CN115633005A CN 115633005 A CN115633005 A CN 115633005A CN 202211316616 A CN202211316616 A CN 202211316616A CN 115633005 A CN115633005 A CN 115633005A
- Authority
- CN
- China
- Prior art keywords
- list
- time
- linked list
- real
- vehicle
- 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
- 238000012545 processing Methods 0.000 title claims abstract description 21
- 238000003672 processing method Methods 0.000 title claims abstract description 16
- 238000013507 mapping Methods 0.000 claims abstract description 17
- 230000001186 cumulative effect Effects 0.000 claims description 4
- 230000003139 buffering effect Effects 0.000 claims description 3
- 238000000034 method Methods 0.000 abstract description 5
- 230000000694 effects Effects 0.000 abstract description 4
- 238000004891 communication Methods 0.000 description 12
- 206010048669 Terminal state Diseases 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 125000004122 cyclic group Chemical group 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/90—Buffering arrangements
- H04L49/9015—Buffering arrangements for supporting a linked list
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/90—Buffering arrangements
- H04L49/9031—Wraparound memory, e.g. overrun or underrun detection
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
Abstract
The invention discloses a real-time high-concurrency connection processing method and a processing system thereof, wherein the method comprises the steps of establishing an annular circulation list and a data chain table, establishing a mapping relation between the annular circulation list and the data chain table, and setting a cache rule of the vertical annular circulation list; receiving heartbeat packets sent by terminal vehicles at regular time, sequentially writing unique identification codes of the vehicles into an annular circulating list according to a set caching rule, and caching corresponding sending time into a data linked list; and starting a timing thread, sequentially updating the sending time information of the data linked list according to the timing information and a set caching rule so as to delete the unique vehicle identification code pointed by the corresponding sending time in the annular circulating list, and disconnecting the link corresponding to the unique vehicle identification code. The invention creates the annular circulation list to reduce the memory, creates the data chain table to conveniently manage the annular circulation list, adopts the timing thread, does not need to adopt the polling with large data volume, avoids consuming a large amount of resources and achieves the effect of real-time, high efficiency and accuracy.
Description
Technical Field
The invention relates to the technical field of communication, in particular to a real-time high-concurrency connection processing method and a processing system thereof.
Background
In the internet of vehicles industry, a communication link with long connection of a TCP is adopted for communication between a terminal vehicle and a server, the real-time requirement of data is very high, after the number of vehicles reaches hundreds of thousands, the resource requirement of a server maintenance link is higher and higher, under the state of vehicle shutdown, according to the design modes of self protection, resource saving and the like, the terminal vehicle can enter a dormant state, the requirement of link disconnection can be generated at the moment, and after the link is disconnected, how to release resources efficiently and accurately by the server in real time is also an important influence factor for improving the concurrent access amount of the terminal. At present, a common method is to store a unique vehicle identifier, a link id and the last reported data time in a Map, start an independent thread, and judge whether a link is overtime and needs to disconnect a recovered resource by periodically polling the Map and comparing whether the time exceeds an overtime threshold value. When the data reaches a certain amount, the traversal time period is long, and the real-time, efficient and accurate effect cannot be achieved.
Disclosure of Invention
The present invention is directed to a real-time high-concurrency connection processing method and a processing system thereof, so as to solve the problems in the background art.
In order to achieve the purpose, the invention provides the following technical scheme: a real-time high concurrency connection processing method, the method comprising:
creating a circular circulation list and a data linked list, creating a mapping relation between the circular circulation list and the data linked list, and setting a caching rule for setting up the circular circulation list;
receiving heartbeat packets sent by a terminal vehicle at regular time, sequentially writing unique identification codes of the vehicle into an annular circular list according to a set caching rule, and caching corresponding sending time into a data linked list;
and starting a timing thread, sequentially updating the sending time information of the data linked list according to the timing information and a set caching rule so as to delete the unique vehicle identification code corresponding to the sending time in the annular circulating list, and disconnecting the link corresponding to the unique vehicle identification code.
Further, a global pointer is defined, and the global pointer traverses the circular loop list according to the timing signal of the timing thread.
Further, a buffer chain table is created, a mapping relation between the buffer chain table and the annular circulation list and between the buffer chain table and the data chain table is established, when the heartbeat packet sent by the terminal vehicle at regular time is received, the sending times are buffered in the buffer chain table, and when the sending times are larger than a preset threshold value, the link corresponding to the unique identification code of the vehicle is suspended to be disconnected.
Further, when the cumulative sending time exceeds a preset threshold, the link is disconnected.
Further, the caching rule includes setting a maximum storage amount of the annular circulation list, and suspending writing when the maximum storage amount is exceeded.
Furthermore, the timing thread is a timing task thread with a time interval of 1s and a cycle time of 120 s.
A real-time high-concurrency connection processing system is applied to a server side and comprises:
the creating module is used for creating an annular circulation list and a data linked list, creating a mapping relation between the annular circulation list and the data linked list, and setting a caching rule of the annular circulation list;
the buffer module is used for receiving heartbeat packets sent by the terminal vehicle at regular time, sequentially writing the unique identification codes of the vehicle into the annular circular list according to a set buffer rule, and buffering the corresponding sending time into the data linked list;
and the processing module is used for starting a timing thread, sequentially updating the sending time information of the data linked list according to the timing information and a set caching rule so as to delete the unique vehicle identification code corresponding to the sending time in the annular circulating list and disconnect the link corresponding to the unique vehicle identification code.
Further, the creating module is further configured to create a cache linked list, and establish a mapping relationship between the cache linked list and the annular circulation list and the data linked list, the cache module is further configured to cache the sending times into the cache linked list when receiving the heartbeat packet sent by the terminal vehicle at regular time, and the processing module is further configured to suspend disconnection of the link corresponding to the unique identifier of the vehicle when the sending times is greater than a preset threshold value.
Further, the processing module is further configured to disconnect the link when the cumulative transmission time exceeds a preset threshold.
Compared with the prior art, the invention has the beneficial effects that: the method has the advantages that the memory is effectively reduced by creating the annular circulation list, the unique vehicle identification code can be safely and stably cached, more memory space is made available for other threads with needs, the annular circulation list is conveniently managed by creating the data chain list, the sending time information of the data chain list is sequentially updated by the timing thread according to the timing information and the set caching rule, the unique vehicle identification code corresponding to the sending time direction in the annular circulation list is deleted, the link corresponding to the unique vehicle identification code is disconnected, large-data-volume polling is not needed, the consumption of a large number of resources is avoided, the traversal period is short, and the real-time, efficient and accurate effect is achieved;
and creating a cache linked list, caching the sending times, and temporarily disconnecting the link corresponding to the unique identification code of the vehicle when the sending times is greater than a preset threshold value, so as to prevent mistakenly disconnecting the communication link, maintain the long connection of the communication link and improve the operating efficiency of the communication system.
Drawings
FIG. 1 is a flow chart of a real-time high concurrency connection processing method according to an embodiment of the invention;
FIG. 2 is a block diagram of a real-time high concurrency connection handling system of the present invention;
fig. 3 is a flowchart of a real-time high-concurrency connection processing method according to a second embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be obtained by a person skilled in the art without making any creative effort based on the embodiments in the present invention, belong to the protection scope of the present invention.
The first embodiment is as follows:
as shown in fig. 1, this embodiment provides a real-time high-concurrency connection processing method, which includes the following steps:
s101: creating a circular circulation list and a data linked list, establishing a mapping relation between the circular circulation list and the data linked list, and setting a caching rule of the vertical circular circulation list;
s102: receiving heartbeat packets sent by a terminal vehicle at regular time, sequentially writing unique identification codes of the vehicle into an annular circular list according to a set caching rule, and caching corresponding sending time into a data linked list;
s103: and starting a timing thread, sequentially updating the sending time information of the data linked list according to the timing information and a set caching rule so as to delete the unique vehicle identification code corresponding to the sending time in the annular circulating list, and disconnecting the link corresponding to the unique vehicle identification code.
The specific implementation mode is as follows: the vehicle-mounted terminal connection platform adopts TCP long connection, ensures that the terminal state is online and active through a heartbeat mode, creates a circular circulation List and a data linked List, establishes a mapping relation between the circular circulation List and the data linked List, sets a caching rule for setting up the circular circulation List, the caching rule comprises setting the maximum storage amount of the circular circulation List, and stops writing when the maximum storage amount is exceeded, for example, the maximum storage amount is set to 120, each value in the circular circulation List is a List < vin > List, vin is a unique identifier of a vehicle-mounted terminal, the data linked List is represented as Map < vin, index >, index is a linked List subscript value, information representing the latest reporting time of the vin is stored in an index position of the linked List, receives heartbeat packets sent by a terminal vehicle at regular time, and sequentially writes the unique identifier of the vehicle into the circular circulation List according to the set caching rule, caching the corresponding sending time into a data link List, setting a timing task thread with a time interval of 1s and a cycle time of 120s, defining a global pointer, setting initial values of minutes and seconds (converted into seconds) of the current time and surplus of 120, starting the timing thread, sequentially updating the sending time information of the data link List according to the timing information and set caching rules, for example, initializing the global pointer, adding 1 to the pointer value every 1 second, setting the value to be 0 if the value is 120, when a service end receives a heartbeat packet reported by a vehicle-mounted terminal, firstly taking out a corresponding index from Map < vin, index > of the cache, writing the current pointer value into the cache, simultaneously finding the value of an index subscript in the data, clearing the vin codes stored in List < vin >, and deleting the unique identification code of the vehicle corresponding to the sending time in an annular cycle List, because the partial value represents that the vehicle-mounted terminal does not receive data within 120 seconds, the link corresponding to the unique identification code of the vehicle is disconnected, and resources are recycled.
As shown in fig. 2, this embodiment further provides a real-time high-concurrency connection processing system, which is applied to a server side, and the system includes a creating module 1, a caching module 2, and a processing module 3, where the creating module 1 is configured to create a circular loop List and a data linked List, establish a mapping relationship between the circular loop List and the data linked List, and set a caching rule of the circular loop List, the caching rule includes setting a maximum storage of the circular loop List, and when the maximum storage is exceeded, the caching rule suspends writing, for example, setting a maximum storage amount to 120, each value in the circular loop List is a List < vin > List, vin is a unique identifier of a vehicle-mounted terminal, the data linked List is represented by Map < vin, index >, and index is a linked List subscript value, which represents that information about a latest reporting time of the vin is stored at an index position of the linked List, the caching module 2 is configured to receive heartbeat packets sent by a terminal vehicle at a fixed time, write the unique vehicle into the circular loop List in sequence according to a caching rule of the set caching rule of the linked List, and cache a corresponding sending time into the data linked List, and the processing module 3 is configured to start a timed thread, update the heartbeat packets sent by the unique identifier in sequence according to the caching rule of the cached information and the linked List according to the set caching rule of the timed link List, and the unique heartbeat information, and delete the unique heartbeat packet, and delete the unique identifier of the unique heartbeat packet, and the unique identifier of the unique heartbeat packet, and the unique link List, and the unique heartbeat packet.
The second embodiment is as follows:
as shown in fig. 3, this embodiment provides a real-time high-concurrency connection processing method, which includes the following steps:
s201: creating a circular circulation list, a data linked list and a cache linked list, creating a mapping relation between the circular circulation list and the data linked list, creating a mapping relation between the cache linked list and the circular circulation list and the data linked list, and setting a cache rule of the vertical circular circulation list;
s102: receiving heartbeat packets sent by terminal vehicles at regular time, sequentially writing unique identification codes of the vehicles into an annular circulation list according to a set caching rule, caching corresponding sending time into a data linked list, and caching sending times into a caching linked list;
s103: and starting a timing thread, sequentially updating the sending time information of the data linked list according to the sending times, the timing information and a set caching rule so as to delete the unique vehicle identification code pointed by the corresponding sending time in the annular circulating list, disconnecting the link corresponding to the unique vehicle identification code, and when the sending times is greater than a preset threshold value, suspending disconnection of the link corresponding to the unique vehicle identification code.
The specific implementation mode is as follows: the vehicular terminal connection platform adopts TCP long connection, ensures that the terminal state is online and active through a heartbeat mode, creates a ring circulation List and a data linked List, establishes a mapping relation between the ring circulation List and the data linked List, sets a caching rule of the vertical ring circulation List, wherein the caching rule comprises setting the maximum storage capacity of the ring circulation List, and suspends writing when the maximum storage capacity is exceeded, for example, the maximum storage capacity is set to be 120, the content of each value in the ring circulation List is a List < vin > List, vin is a vehicular terminal unique identifier, the data linked List is represented by Map < vin, index >, index is a linked List subscript value, the reporting time information representing the last time of vin is stored in an index position of the linked List, the caching linked List is represented by Map < (vin, index), num >, num represents the total times of sending heartbeat packets to the service terminal by the vin, receiving a heartbeat packet sent by a terminal vehicle at regular time, writing a unique identification code of the vehicle into an annular circulation List in sequence according to a set caching rule, caching corresponding sending time into a data chain List, caching sending times into the caching chain List, setting a timing task thread with a time interval of 1s and a cycle time of 120s, defining a global pointer, setting initial values to be the remainder of the current time in minutes and seconds, starting the timing thread, updating the sending time information of the data chain List in sequence according to the timing information and the set caching rule, for example, initializing the global pointer, adding 1 to the pointer value every 1 second, setting the value to be 0 if the value is 120, reading the sending times in the caching chain List firstly when a server receives the heartbeat packet reported by a vehicle-mounted terminal, and when the sending times are less than a preset threshold value, taking out the corresponding index from the Map < vin, index > of the cache, writing the current pointer value into the cache, finding out the index subscript value in the data, clearing the vin code stored in the List < vin >, deleting the unique identification code of the vehicle corresponding to the sending time direction in the annular circulation List, disconnecting the link corresponding to the unique identification code of the vehicle when the sending times is more than the preset threshold value, and disconnecting the link until the accumulated sending time exceeds the preset threshold value, wherein the preset threshold value is more than 120s, and can be set to 150s, thereby preventing mistaken disconnection of the communication link, maintaining the long connection of the communication link, and improving the operation efficiency of the communication system.
As shown in fig. 2, the embodiment provides a real-time high-concurrency connection processing system, which is applied to a server side, the system comprises a creating module 1, a caching module 2 and a processing module 3, wherein the creating module 1 is used for creating a circular circulation list, a data chain table and a caching chain table, creating a mapping relation between the circular circulation list and the data chain table, creating a mapping relation between the caching chain table and the circular circulation list and the data chain table, setting a caching rule for erecting the circular circulation list, the caching rule comprises setting the maximum storage capacity of the circular circulation list, and when the maximum storage capacity is exceeded, the writing is suspended, for example, the maximum storage amount is set to 120, each value content in the circular cyclic List is a List < vin > List, vin is a unique identifier of the vehicle-mounted terminal, the data linked List is denoted by Map < vin, index >, and index is a linked List subscript value, which indicates that the last reporting time information of vin is stored at the index position of the linked List, the buffer linked List is denoted by Map < (vin, index), num, and num indicate the total number of times that vin sends heartbeat packets to the service terminal, the buffer module 2 is configured to receive heartbeat packets sent by the terminal vehicle at regular time, sequentially writing the unique vehicle identification codes into the annular circular list according to a set caching rule, caching the corresponding sending time into the data linked list, caching the sending times into the caching linked list, starting a timing thread by the processing module 3, updating the sending time information of the data linked list in turn according to the sending times, the timing information and the set caching rule, the unique identification code of the vehicle pointed by the corresponding sending time in the circular circulating list is deleted, the link corresponding to the unique identification code of the vehicle is disconnected, and when the sending times are greater than a preset threshold value, the link corresponding to the unique identification code of the vehicle is suspended to be disconnected.
The method has the advantages that the memory is effectively reduced by creating the annular circulation list, the unique identification code of the vehicle can be cached safely and stably, more memory space is saved for other threads with needs, the annular circulation list can be conveniently managed by creating the data chain table, the sending time information of the data chain table is sequentially updated by adopting the timing thread according to the timing information and the set caching rule, the unique identification code of the vehicle corresponding to the sending time direction in the annular circulation list is deleted, the link corresponding to the unique identification code of the vehicle is disconnected, large-data-volume polling is not needed, the consumption of a large number of resources is avoided, the traversal period is short, and the real-time, efficient and accurate effect is achieved; and creating a cache linked list, caching the sending times, and when the sending times are greater than a preset threshold value, temporarily disconnecting the link corresponding to the unique identification code of the vehicle, so as to prevent the communication link from being disconnected by mistake, maintain the long connection of the communication link and improve the operating efficiency of the communication system.
Although the present invention has been described in detail with reference to the foregoing embodiments, it will be apparent to those skilled in the art that various changes in the embodiments and/or modifications of the invention can be made, and equivalents and modifications of some features of the invention can be made without departing from the spirit and scope of the invention.
Claims (9)
1. A real-time high-concurrency connection processing method is characterized by comprising the following steps:
creating a circular circulation list and a data linked list, establishing a mapping relation between the circular circulation list and the data linked list, and setting a caching rule of the vertical circular circulation list;
receiving heartbeat packets sent by terminal vehicles at regular time, sequentially writing unique identification codes of the vehicles into an annular circulating list according to a set caching rule, and caching corresponding sending time into a data linked list;
and starting a timing thread, sequentially updating the sending time information of the data linked list according to the timing information and a set caching rule so as to delete the unique vehicle identification code pointed by the corresponding sending time in the annular circulating list, and disconnecting the link corresponding to the unique vehicle identification code.
2. The real-time high-concurrency connection processing method according to claim 1, wherein: a global pointer is defined that traverses the circular list according to the timing signals of the timing threads.
3. The real-time high-concurrency connection processing method according to claim 1, wherein: creating a buffer linked list, creating a mapping relation between the buffer linked list and the annular circulating list and the data linked list, buffering the sending times into the buffer linked list when receiving the heartbeat packet sent by the terminal vehicle at regular time, and suspending disconnection of the link corresponding to the unique identification code of the vehicle when the sending times is greater than a preset threshold value.
4. The real-time highly concurrent connection processing method according to claim 3, wherein: and when the cumulative sending time exceeds a preset threshold value, disconnecting the link.
5. The real-time high-concurrency connection processing method according to claim 1, wherein: the caching rule comprises setting the maximum storage capacity of the annular circular list, and suspending writing when the maximum storage capacity is exceeded.
6. The real-time high-concurrency connection processing method according to claim 1 or 5, wherein: the timing thread is a timing task thread with the time interval of 1s and the cycle time of 120 s.
7. A real-time high-concurrency connection processing system is applied to a server side, and comprises:
the creating module is used for creating a circular circulation list and a data linked list, creating a mapping relation between the circular circulation list and the data linked list, and setting a caching rule for setting up the circular circulation list;
the buffer module is used for receiving heartbeat packets sent by the terminal vehicle at regular time, sequentially writing the unique identification codes of the vehicle into the annular circulating list according to a set buffer rule, and buffering the corresponding sending time into the data linked list;
and the processing module is used for starting a timing thread, sequentially updating the sending time information of the data linked list according to the timing information and a set caching rule so as to delete the unique vehicle identification code corresponding to the sending time in the annular circulating list and disconnect the link corresponding to the unique vehicle identification code.
8. The real-time highly concurrent connection processing system according to claim 7, wherein: the creating module is further used for creating a cache linked list and creating a mapping relation between the cache linked list and the annular circulation list and between the cache linked list and the data linked list, the cache module is further used for caching the sending times into the cache linked list when receiving heartbeat packets sent by the terminal vehicle at regular time, and the processing module is further used for temporarily disconnecting the link corresponding to the unique identification code of the vehicle when the sending times are larger than a preset threshold value.
9. The real-time highly concurrent connections processing system according to claim 8 further comprising: the processing module is further configured to disconnect the link when the cumulative sending time exceeds a preset threshold.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211316616.0A CN115633005A (en) | 2022-10-26 | 2022-10-26 | Real-time high-concurrency connection processing method and processing system thereof |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211316616.0A CN115633005A (en) | 2022-10-26 | 2022-10-26 | Real-time high-concurrency connection processing method and processing system thereof |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115633005A true CN115633005A (en) | 2023-01-20 |
Family
ID=84906557
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211316616.0A Pending CN115633005A (en) | 2022-10-26 | 2022-10-26 | Real-time high-concurrency connection processing method and processing system thereof |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115633005A (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2012139328A1 (en) * | 2011-04-14 | 2012-10-18 | 中兴通讯股份有限公司 | Cache server system and application method thereof, cache client, and cache server |
| CN110943878A (en) * | 2018-09-25 | 2020-03-31 | 海能达通信股份有限公司 | Heartbeat packet transmission method, terminal and device with storage function |
| CN110995857A (en) * | 2019-12-17 | 2020-04-10 | 福建省汽车工业集团云度新能源汽车股份有限公司 | Real-time high-concurrency long-connection timeout fast processing method |
-
2022
- 2022-10-26 CN CN202211316616.0A patent/CN115633005A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2012139328A1 (en) * | 2011-04-14 | 2012-10-18 | 中兴通讯股份有限公司 | Cache server system and application method thereof, cache client, and cache server |
| CN110943878A (en) * | 2018-09-25 | 2020-03-31 | 海能达通信股份有限公司 | Heartbeat packet transmission method, terminal and device with storage function |
| CN110995857A (en) * | 2019-12-17 | 2020-04-10 | 福建省汽车工业集团云度新能源汽车股份有限公司 | Real-time high-concurrency long-connection timeout fast processing method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9832275B2 (en) | Message processing method, device and system for internet of things | |
| CN101686209B (en) | Method and device for storing message in message retransmission system | |
| CN103546467B (en) | The method applying Modbus rtu protocol on TCP/IP network | |
| CN105227662A (en) | Message treatment method, device and system | |
| CN105763595A (en) | Method of improving data processing efficiency and server | |
| CN106528649A (en) | Massive data storage and retrieval system and massive data storage and retrieval methods for new energy vehicles | |
| CN112559219A (en) | Internet of things offline message management method, device, equipment and storage medium | |
| CN111064789A (en) | Data migration method and system | |
| CN113364877A (en) | Data processing method, device, electronic equipment and medium | |
| WO2022078268A1 (en) | Data decoding method, data encoding method, apparatus, and terminal device | |
| CN115633005A (en) | Real-time high-concurrency connection processing method and processing system thereof | |
| CN111858393B (en) | Memory page management method, memory page management device, medium and electronic equipment | |
| CN105786723A (en) | Application cache management method and device based on linked list | |
| CN112492037A (en) | Data processing system and method | |
| CN106874124B (en) | SQLite rapid loading technology-based object-oriented electricity utilization information acquisition terminal | |
| CN103714059A (en) | Data updating method and device | |
| CN110995857B (en) | Real-time high-concurrency long-connection timeout fast processing method | |
| CN115774837A (en) | Signal verification method, device, equipment, medium, program product and vehicle | |
| CN113239061B (en) | Intelligent court data updating method and system | |
| CN113835728A (en) | Data updating method and device, electronic equipment and storage medium | |
| CN108683612B (en) | Message acquisition method and device | |
| CN112135286A (en) | Method and device for improving transmission efficiency based on Bluetooth firmware upgrading | |
| CN115080504A (en) | File management method, terminal and storage medium | |
| CN109981660B (en) | Information processing method and electronic equipment | |
| CN112948461B (en) | Method, apparatus, storage medium and program product for calendar data processing |
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 |