CN112511463A - Message sending method and device - Google Patents
Message sending method and device Download PDFInfo
- Publication number
- CN112511463A CN112511463A CN202011295293.2A CN202011295293A CN112511463A CN 112511463 A CN112511463 A CN 112511463A CN 202011295293 A CN202011295293 A CN 202011295293A CN 112511463 A CN112511463 A CN 112511463A
- Authority
- CN
- China
- Prior art keywords
- sending
- message
- sent
- linked list
- period
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The application provides a message sending method and a device, wherein the method comprises the following steps: acquiring a sending linked list of a message, wherein the sending linked list of the message comprises a plurality of first message chains, the plurality of first message chains correspond to a plurality of sending points in a sending period of a sending terminal, and nodes in the first message chains comprise messages to be sent by the sending points corresponding to the first message chains; determining a message to be sent from a sending linked list according to the sending time of a sending terminal; and sending the message to be sent to a receiving terminal. Compared with the prior art, the method has the advantages that the message is sent according to the sending period of the message in the message linked list by establishing the message sending linked list, so that the searching time of the message to be sent can be shortened, the operation amount is reduced, and the message sending efficiency is improved.
Description
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a method and an apparatus for sending a packet.
Background
A message is a data unit exchanged and transmitted in a network, i.e. a data block to be sent by a station at one time. In the exchange and transmission of the messages, more than one message needs to be sent, the sending periods of different messages are different, and when the messages are sent, the messages to be sent need to be searched.
In the prior art, there are two main ways to search for and send messages, the first is to loop through and judge whether each message needs to be sent one by one, and the second is to classify messages with different periods and place the messages in different function pointer arrays respectively, or place a function in a unified way.
However, through a circular traversal mode, although any period of messages is supported, codes are easy to write, the searching speed is slow, and the computation amount of a Central Processing Unit (CPU) is large; in the second method, messages in different periods are classified and respectively placed in different function pointer arrays, and although the method is faster to execute, when the number of types of processing periods is large, a plurality of pointer arrays large enough are needed, and a large memory space is occupied. Therefore, in the prior art, the search time is long or the memory space is occupied when the message is transmitted, so that the transmission efficiency of the message is low or a large amount of memory space is wasted.
Disclosure of Invention
The embodiment of the application provides a message sending method and device, and aims to solve the problem of low Chinese sending efficiency in the prior art.
A first aspect of the present application provides a method for sending a packet, where the method includes:
acquiring a sending linked list of a message, wherein the sending linked list of the message comprises a plurality of first message chains, the plurality of first message chains correspond to a plurality of sending points in a sending period of a sending terminal, and nodes in the first message chains comprise messages to be sent by the sending points corresponding to the first message chains;
determining a message to be sent from the sending linked list according to the sending time of the sending terminal;
and sending the message to be sent to a receiving terminal.
In an optional implementation manner, the transmission chain table of the packet further includes at least one second packet chain, and a node of the second packet chain includes a packet in a non-transmission period.
In an optional embodiment, the method further comprises:
and moving the messages contained in the link points of the second message chain to the plurality of first message chains according to the timing period of the second message chain.
In an optional implementation manner, after the sending the message to be sent to the receiving terminal, the method further includes:
and moving the message sent to the receiving terminal to the at least one second message chain according to the sending period of the message sent to the receiving terminal.
In an optional implementation manner, the determining, according to the sending time of the sending terminal, a message to be sent from the sending linked list includes:
determining a corresponding sending point of the sending time of the sending terminal in the period to be sent;
and determining a message to be sent from the sending linked list according to a sending point corresponding to the sending time of the sending terminal in the sending period.
A second aspect of the present application provides a message sending apparatus, where the apparatus includes:
the system comprises an acquisition module, a sending module and a sending module, wherein the acquisition module is used for acquiring a sending linked list of a message, the sending linked list of the message comprises a plurality of first message chains, the plurality of first message chains correspond to a plurality of sending points in a sending period of a sending terminal, and nodes in the first message chains comprise messages which need to be sent by the sending points corresponding to the first message chains;
the processing module is used for determining a message to be sent from the sending linked list according to the sending time of the sending terminal; and sending the message to be sent to a receiving terminal.
In an optional implementation manner, the transmission chain table of the packet further includes at least one second packet chain, and a node of the second packet chain includes a packet in a non-transmission period.
In an alternative embodiment, the apparatus further comprises:
and the control module is used for moving the messages contained in the link points of the second message chain to the plurality of first message chains according to the timing period of the second message chain.
In an optional implementation manner, the control module is further configured to move the packet sent to the receiving terminal to the at least one second packet chain according to a sending period of the packet sent to the receiving terminal.
In an optional implementation manner, the root processing module is further configured to determine a sending point corresponding to the sending time of the sending terminal in the to-be-sent period; and determining a message to be sent from the sending linked list according to a sending point corresponding to the sending time of the sending terminal in the sending period.
A third aspect of the present application provides an electronic device, comprising:
a memory and a processor;
the memory for storing executable instructions of the processor;
the processor is configured to perform the method of any of claims 1-5 via execution of the executable instructions.
A fourth aspect of the application provides a non-transitory computer readable storage medium having stored thereon computer instructions for causing the computer to perform the method of any one of claims 1-5.
The method and the device for sending the message provided by the embodiment of the application firstly obtain a sending linked list of the message, the sending linked list of the message comprises a plurality of first message chains, the plurality of first message chains correspond to a plurality of sending points in a sending period of a sending terminal, nodes in the first message chains comprise messages which are needed to be sent by the sending points corresponding to the first message chains, then the message to be sent is determined from the sending linked list according to the sending time of the sending terminal, and finally the message to be sent is sent to a receiving terminal. Compared with the prior art, the method has the advantages that the message is sent according to the sending period of the message in the sending linked list by establishing the sending linked list of the message, so that the searching time of the message to be sent can be shortened, the operation amount is reduced, and the sending efficiency of the message is improved.
Drawings
In order to more clearly illustrate the technical solutions of the present invention or the prior art, the following briefly introduces the drawings needed to be used in the description of the embodiments or the prior art, and obviously, the drawings in the following description are some embodiments of the present invention, and those skilled in the art can obtain other drawings according to the drawings without inventive labor.
Fig. 1 is a schematic view of an application scenario of a message sending method according to an embodiment of the present application;
fig. 2 is a schematic flowchart of a method for sending a message according to an embodiment of the present application;
fig. 3 is a schematic structural diagram of a linked list provided in an embodiment of the present application;
fig. 4 is a comparison diagram of effects before and after an improvement of a message sending method according to an embodiment of the present application;
fig. 5 is a schematic flowchart of another message sending method according to an embodiment of the present application;
fig. 6 is a schematic flowchart of another method for sending a message according to an embodiment of the present application;
fig. 7 is a schematic structural diagram of a message sending apparatus according to an embodiment of the present application;
fig. 8 is a schematic structural diagram of an electronic device according to an embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are some embodiments of the present application, but not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
A message is a data unit exchanged and transmitted in a network, i.e. a data block to be sent by a station at one time. In the exchange and transmission of the messages, more than one message needs to be sent, the sending periods of different messages are different, and when the messages are sent, the messages to be sent need to be searched.
In the prior art, there are two main transmission modes, the first is to cycle through and judge whether each message is to be transmitted one by one, and the second is to classify the messages of different periods and place them in different function pointer arrays respectively or put them into a function uniformly.
However, through a circular traversal mode, although any period of messages is supported, codes are easy to write, the speed is slow, and the computation amount of a Central Processing Unit (CPU) is large; in the second method, messages in different periods are classified and respectively placed in different function pointer arrays, and although the method is faster to execute, when the number of types of processing periods is large, a plurality of pointer arrays large enough are needed, and a large memory space is occupied. Therefore, in the prior art, the search time is long or the memory space is occupied when the message is transmitted, so that the transmission efficiency of the message is low or a large amount of memory space is wasted.
In order to solve the above problems, the present application provides a method and an apparatus for sending a message, where a linked list is established, and a message is sent according to a sending period of the message in the linked list, so as to reduce a searching time of the message to be sent, reduce an amount of computation, and further improve a sending efficiency of the message.
The following explains an application scenario of the present application.
Fig. 1 is a schematic view of an application scenario of a message sending method according to an embodiment of the present application. As shown in fig. 1, a transmitting end 101 and a receiving end 102. The sending end 101 sends a message to the receiving end 102, and the receiving end 102 receives the message sent by the sending end 101.
The sending end 101 and the receiving end 102 may be a mobile phone (mobile phone), a tablet computer (pad), a computer with a wireless transceiving function, a Virtual Reality (VR) terminal device, an Augmented Reality (AR) terminal device, a wireless terminal in industrial control (industrial control), a wireless terminal in remote surgery (remote medical supply), a wireless terminal in smart grid (smart grid), a wireless terminal in smart home (smart home), and the like. In this embodiment of the present application, the apparatus for implementing the function of the sending end may be sending end equipment, or may also be an apparatus capable of supporting the sending end to implement the function, for example, a chip system, and the apparatus may be installed in the sending end equipment. In the embodiment of the present application, the chip system may be composed of a chip, and may also include a chip and other discrete devices.
It should be noted that the application scenario of the technical solution of the present application may be the scenario in fig. 1, but is not limited to this, and may also be applied to other scenarios that need to send a message.
It can be understood that the sending method of the message may be implemented by the sending apparatus of the message provided in this embodiment, and the sending apparatus of the message may be part or all of a certain device, for example, a chip of the sending end device or the sending end device.
The following describes the technical solution of the embodiment in detail with specific embodiments, taking a sending apparatus of a message integrated or installed with a relevant execution code as an example. The following several specific embodiments may be combined with each other, and details of the same or similar concepts or processes may not be repeated in some embodiments.
Fig. 2 is a schematic flow chart of a message sending method according to an embodiment of the present application, which relates to a specific process of how to send a message through a message sending linked list. The execution main body of the application is sending end equipment. As shown in fig. 2, the method includes:
s201, a sending end obtains a sending linked list of the message. The linked list is a non-continuous and non-sequential storage structure on the physical storage unit, and the logical sequence of the data elements is realized by the link order of the pointers in the linked list. A linked list is composed of a series of nodes (each element in the linked list is called a node), which can be dynamically generated at runtime. Each node comprises two parts: one is a data field that stores the data element and the other is a pointer field that stores the address of the next node.
The array subscript is used for replacing the original pointer element of the linked list, the original pointer element of the linked list is composed of the base address and the offset address, and therefore space occupation is saved to a great extent.
In the embodiment of the present application, the size of the linked list is not limited, for example, 13 linked lists may be selected according to the number n of messages to be sent, and the space of the corresponding linked list occupies n +13 bytes.
S202, determining a message to be sent from the sending linked list according to the sending time of the sending terminal.
In this step, after the sending end obtains the sending linked list of the message, the message to be sent is determined from the sending linked list according to the sending time of the sending terminal.
The sending time of the sending terminal is not limited, and can be specifically set according to actual conditions.
The method for determining the message to be sent from the sending linked list according to the sending time of the sending terminal comprises the following steps: determining a corresponding sending point of sending time of a sending terminal in a period to be sent; and determining a message to be sent from the sending linked list according to the sending point corresponding to the sending time of the sending terminal in the sending period.
In some optional embodiments, the transmission chain table of the packet further includes at least one second packet chain, and nodes of the second packet chain include a packet in a non-transmission period.
And moving the messages contained in the link points of the second message chain into a plurality of first message chains according to the timing period of the second message chain.
S203, sending the message to be sent to a receiving terminal.
In this step, after determining the message to be sent from the sending linked list according to the sending time of the sending terminal, the message to be sent is sent to the receiving terminal.
After the sending end sends the message to be sent to the receiving terminal, the message sent to the receiving terminal is moved to at least one second message chain according to the sending period of the message sent to the receiving terminal.
Exemplarily, fig. 3 is a schematic structural diagram of a linked list provided in the embodiment of the present application, as shown in fig. 3, there are 12 linked lists in total, and a square in the first column represents each millisecond node; the rightmost ellipse represents a null node, which represents the last bit of the linked list, which is not physically present. The middle squares represent each element in the linked list, the value is the subscript of the message array, and the total number of the squares is the number of the messages to be sent. Each row of squares represents a message to be sent in this millisecond, S1 and S2 represent messages that are not to be sent for a while, for example, S1 represents messages sent within 10-50 milliseconds, and S2 represents messages sent 50 milliseconds later. And sending the message on one of the 0-9 chains in any millisecond, and placing the message on the S1 or S2 chain according to the period, wherein the time count of all messages on the S1 chain is reduced by 10 in the 10 th millisecond, if the result is less than 10, the message is moved to the 0-9 chain, and if the result is less than 50 in the 50 th millisecond, the time count of all messages on the S2 chain is reduced by 50, and if the result is less than 50, the message is moved to a new proper chain. The message can be sent periodically and repeatedly.
By using the message linked list mode provided by the application, the time for searching the message to be sent can be shortened, and the sending efficiency of the message is improved. Fig. 4 is a comparison diagram of effects before and after an improvement of a message sending method according to an embodiment of the present application, and as shown in fig. 4, by using the method provided by the present application, a time for searching for a message when sending the message in a message exchange and transmission process can be reduced, thereby improving a message sending efficiency.
The method for sending the message, provided by the embodiment of the application, includes obtaining a sending linked list of the message, where the sending linked list of the message includes a plurality of first message chains, the plurality of first message chains correspond to a plurality of sending points in a sending period of a sending terminal, and nodes in the first message chains include messages to be sent by the sending points corresponding to the first message chains; determining a message to be sent from a sending linked list according to the sending time of a sending terminal; and sending the message to be sent to a receiving terminal. Compared with the prior art, the message is sent according to the sending period of the message in the sending linked list in the linked list mode, the message searching time is shortened, the operation amount is reduced, and therefore the message sending efficiency is improved.
On the basis of the above embodiment, a description is given below of how to determine a message to be sent from a sending linked list. Fig. 5 is a schematic flow chart of another method for sending a packet according to an embodiment of the present application, and as shown in fig. 5, the method includes:
s301, the sending end obtains a sending linked list of the message.
S302, determining a corresponding sending point of the sending time of the sending terminal in a sending period.
And S303, determining a message to be sent from the sending linked list according to the sending point corresponding to the sending time of the sending terminal in the sending period.
S304, sending the message to be sent to a receiving terminal.
The technical terms, technical effects, technical features and alternative embodiments of S301 to S304 can be understood by referring to S201 to S203 shown in fig. 2, and repeated descriptions thereof will not be repeated here.
On the basis of the above embodiments, after a message is sent to a receiving terminal, the message is stored in a corresponding linked list according to the sending period of the message, and how to store the message according to the sending period of the message is described below. Fig. 6 is a schematic flow chart of another method for sending a message according to an embodiment of the present application, where as shown in fig. 6, the method includes:
s401, obtaining a sending linked list of the message.
S402, determining the message to be sent from the sending linked list according to the sending time of the sending terminal.
And S403, sending the message to be sent to a receiving terminal.
S404, moving the message sent to the receiving terminal to at least one second message chain according to the sending period of the message sent to the receiving terminal.
S405, moving the messages contained in the link points of the second message chain into a plurality of first message chains according to the timing period of the second message chain.
The technical terms, technical effects, technical features, and alternative embodiments of S401 to S405 can be understood with reference to S201 to S203 shown in fig. 2, and repeated descriptions thereof will not be repeated here.
The method for sending the message includes the steps of firstly obtaining a sending linked list of the message, wherein the sending linked list of the message includes a plurality of first message chains, the plurality of first message chains correspond to a plurality of sending points in a sending period of a sending terminal, nodes in the first message chains include messages to be sent by the sending points corresponding to the first message chains, then determining the messages to be sent from the sending linked list according to sending time of the sending terminal, and finally sending the messages to be sent to a receiving terminal. Compared with the prior art, the method has the advantages that the message is sent according to the sending period of the message in the sending linked list by establishing the sending linked list of the message, so that the searching time of the message to be sent can be shortened, the operation amount is reduced, and the sending efficiency of the message is improved.
Those of ordinary skill in the art will understand that: all or part of the steps for implementing the method embodiments may be implemented by hardware related to program instructions, and the program may be stored in a computer readable storage medium, and when executed, the program performs the steps including the method embodiments; and the aforementioned storage medium includes: various media that can store program codes, such as ROM, RAM, magnetic or optical disks.
The embodiment of the present application further provides a message sending apparatus, which may be implemented by software, hardware, or a combination of the two, so as to execute the message sending method in the foregoing embodiment. Fig. 7 is a schematic structural diagram of a message sending apparatus according to an embodiment of the present application. As shown in fig. 7, the message sending apparatus 500 includes:
an obtaining module 501, configured to obtain a sending linked list of a message, where the sending linked list of the message includes a plurality of first message chains, the plurality of first message chains correspond to a plurality of sending points in a sending period of a sending terminal, and a node in the first message chain includes a message to be sent by the sending point corresponding to the first message chain;
a processing module 502, configured to determine, according to the sending time of the sending terminal, a message to be sent from the sending linked list; and sending the message to be sent to a receiving terminal.
In an optional implementation manner, the transmission chain table of the packet further includes at least one second packet chain, and nodes of the second packet chain include the packet in the period of non-transmission.
In an optional embodiment, the system further includes a control module 503, configured to move the packet included in the second packet link point to multiple first packet chains according to the timing period of the second packet chain.
In an optional implementation manner, the control module 503 is further configured to move the message sent to the receiving terminal to at least one second message chain according to a sending period of the message sent to the receiving terminal.
In an optional implementation manner, the processing module 501 is further configured to determine a sending point corresponding to the sending time of the sending terminal in a sending period; and determining a message to be sent from the sending linked list according to the sending point corresponding to the sending time of the sending terminal in the sending period.
It should be noted that the message sending apparatus provided in this embodiment of the present application may be configured to execute the method provided in any of the above embodiments, and the specific implementation manner and the technical effect are similar, and are not described herein again.
Fig. 8 is a schematic structural diagram of an electronic device according to an embodiment of the present application. As shown in fig. 8, the electronic device may include: at least one processor 601 and memory 602. Fig. 8 shows an electronic device as an example of a processor.
A memory 602 for storing programs. In particular, the program may include program code including computer operating instructions.
The memory 602 may comprise high-speed RAM memory, and may also include non-volatile memory (non-volatile memory), such as at least one disk memory.
The processor 601 is configured to execute computer execution instructions stored in the memory 602 to implement the message sending method;
the processor 601 may be a Central Processing Unit (CPU), an Application Specific Integrated Circuit (ASIC), or one or more Integrated circuits configured to implement the embodiments of the present Application.
Alternatively, in a specific implementation, if the communication interface, the memory 602 and the processor 601 are implemented independently, the communication interface, the memory 602 and the processor 601 may be connected to each other through a bus and perform communication with each other. The bus may be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, an Extended ISA (EISA) bus, or the like. Buses may be classified as address buses, data buses, control buses, etc., but do not represent only one bus or type of bus.
Alternatively, in a specific implementation, if the communication interface, the memory 602 and the processor 601 are integrated into a chip, the communication interface, the memory 602 and the processor 601 may complete communication through an internal interface.
The embodiment of the application also provides a chip which comprises a processor and an interface. Wherein the interface is used for inputting and outputting data or instructions processed by the processor. The processor is configured to perform the methods provided in the above method embodiments. The chip can be applied to a message sending device.
The present application also provides a computer-readable storage medium, which may include: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, are specifically, the computer-readable storage medium stores program information, and the program information is used for the message sending method.
The embodiment of the present application further provides a program, and the program is configured to, when executed by a processor, execute the message sending method provided in the foregoing method embodiment.
The present application further provides a program product, for example, a computer-readable storage medium, where instructions are stored in the program product, and when the program product runs on a computer, the program product causes the computer to execute the method for sending a message provided in the foregoing method embodiment.
In the above embodiments, the implementation may be wholly or partially realized by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. The procedures or functions according to the embodiments of the invention are brought about in whole or in part when the computer program instructions are loaded and executed on a computer. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored in a computer readable storage medium or transmitted from one computer readable storage medium to another, for example, the computer instructions may be transmitted from one website, computer, server, or data center to another website, computer, server, or data center by wire (e.g., coaxial cable, fiber optic, Digital Subscriber Line (DSL)) or wirelessly (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device, such as a server, a data center, etc., that incorporates one or more of the available media. The usable medium may be a magnetic medium (e.g., floppy Disk, hard Disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., Solid State Disk (SSD)), among others.
Finally, it should be noted that: the above embodiments are only used to illustrate the technical solution of the present invention, and not to limit the same; while the invention has been described in detail and with reference to the foregoing embodiments, it will be understood by those skilled in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; and the modifications or the substitutions do not make the essence of the corresponding technical solutions depart from the scope of the technical solutions of the embodiments of the present invention.
Claims (12)
1. A method for sending a message is characterized in that the method comprises the following steps:
acquiring a sending linked list of a message, wherein the sending linked list of the message comprises a plurality of first message chains, the plurality of first message chains correspond to a plurality of sending points in a sending period of a sending terminal, and nodes in the first message chains comprise messages to be sent by the sending points corresponding to the first message chains;
determining a message to be sent from the sending linked list according to the sending time of the sending terminal;
and sending the message to be sent to a receiving terminal.
2. The method according to claim 1, wherein the transmission chain table of the packets further includes at least one second packet chain, and nodes of the second packet chain include packets in a period of non-transmission.
3. The method of claim 2, further comprising:
and moving the messages contained in the link points of the second message chain to the plurality of first message chains according to the timing period of the second message chain.
4. The method according to claim 2, wherein after the sending the message to be sent to a receiving terminal, the method further comprises:
and moving the message sent to the receiving terminal to the at least one second message chain according to the sending period of the message sent to the receiving terminal.
5. The method according to any one of claims 1 to 4, wherein the determining, from the transmission chain table, the message to be transmitted according to the transmission time of the transmission terminal includes:
determining a corresponding sending point of the sending time of the sending terminal in the period to be sent;
and determining a message to be sent from the sending linked list according to a sending point corresponding to the sending time of the sending terminal in the sending period.
6. An apparatus for transmitting a message, the apparatus comprising:
the system comprises an acquisition module, a sending module and a sending module, wherein the acquisition module is used for acquiring a sending linked list of a message, the sending linked list of the message comprises a plurality of first message chains, the plurality of first message chains correspond to a plurality of sending points in a sending period of a sending terminal, and nodes in the first message chains comprise messages which need to be sent by the sending points corresponding to the first message chains;
the processing module is used for determining a message to be sent from the sending linked list according to the sending time of the sending terminal; and sending the message to be sent to a receiving terminal.
7. The apparatus according to claim 6, wherein the transmission chain table of the packets further includes at least one second packet chain, and nodes of the second packet chain include packets in a period of non-transmission.
8. The apparatus of claim 7, further comprising:
and the control module is used for moving the messages contained in the link points of the second message chain to the plurality of first message chains according to the timing period of the second message chain.
9. The apparatus according to claim 8, wherein the control module is further configured to move the packet sent to the receiving terminal into the at least one second packet chain according to a sending period of the packet sent to the receiving terminal.
10. The apparatus according to any one of claims 6 to 9, wherein the processing module is further configured to determine a corresponding transmission point of the transmission time of the transmitting terminal in the period to be transmitted; and determining a message to be sent from the sending linked list according to a sending point corresponding to the sending time of the sending terminal in the sending period.
11. An electronic device, comprising:
a memory and a processor;
the memory for storing executable instructions of the processor;
the processor is configured to perform the method of any of claims 1-5 via execution of the executable instructions.
12. A non-transitory computer readable storage medium having stored thereon computer instructions for causing the computer to perform the method of any one of claims 1-5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011295293.2A CN112511463B (en) | 2020-11-18 | 2020-11-18 | Message sending method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011295293.2A CN112511463B (en) | 2020-11-18 | 2020-11-18 | Message sending method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112511463A true CN112511463A (en) | 2021-03-16 |
| CN112511463B CN112511463B (en) | 2022-04-05 |
Family
ID=74956859
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011295293.2A Active CN112511463B (en) | 2020-11-18 | 2020-11-18 | Message sending method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112511463B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1913483A (en) * | 2005-08-10 | 2007-02-14 | 中兴通讯股份有限公司 | Deficit polling method of low delay boume small burst |
| CN101567853A (en) * | 2009-05-13 | 2009-10-28 | 中兴通讯股份有限公司 | Audio frequency media package-transmitting controller, method and audio frequency media server |
| CN102833168A (en) * | 2012-08-31 | 2012-12-19 | 北京东土科技股份有限公司 | Data transmission method and device based on time triggering mechanism |
| WO2017219984A1 (en) * | 2016-06-23 | 2017-12-28 | 中兴通讯股份有限公司 | Link state detection method and system |
-
2020
- 2020-11-18 CN CN202011295293.2A patent/CN112511463B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1913483A (en) * | 2005-08-10 | 2007-02-14 | 中兴通讯股份有限公司 | Deficit polling method of low delay boume small burst |
| CN101567853A (en) * | 2009-05-13 | 2009-10-28 | 中兴通讯股份有限公司 | Audio frequency media package-transmitting controller, method and audio frequency media server |
| CN102833168A (en) * | 2012-08-31 | 2012-12-19 | 北京东土科技股份有限公司 | Data transmission method and device based on time triggering mechanism |
| WO2017219984A1 (en) * | 2016-06-23 | 2017-12-28 | 中兴通讯股份有限公司 | Link state detection method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112511463B (en) | 2022-04-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11398981B2 (en) | Path creation method and device for network on chip and electronic apparatus | |
| CN109831746B (en) | Method and device for data transmission based on Bluetooth broadcast and Bluetooth equipment | |
| CN110750341A (en) | Task scheduling method, device, system, terminal equipment and storage medium | |
| CN108304272B (en) | Data IO request processing method and device | |
| CN108875035B (en) | Data storage method of distributed file system and related equipment | |
| CN112422485B (en) | Communication method and device of transmission control protocol | |
| CN112511463B (en) | Message sending method and device | |
| CN114064308A (en) | Multi-data sending and receiving method, device and equipment based on column type data scanning | |
| CN112511441A (en) | Message processing method and device | |
| US20240340189A1 (en) | Information processing apparatus, node selection method, and program | |
| CN111200608B (en) | Link information processing method and device | |
| CN111917656A (en) | Method and device for transmitting data | |
| CN109491830A (en) | The method and system in switch data source | |
| CN108293006A (en) | Technology for tracking disordered networks grouping | |
| CN102891888B (en) | Data access method and related equipment and system | |
| CN111092817A (en) | Data transmission method and device | |
| CN113157610B (en) | Data storage method and device, storage medium and electronic device | |
| US20150052263A1 (en) | Information processing system and control method of information processing system | |
| CN111614794B (en) | Message transmission method and device, electronic equipment and storage medium | |
| CN116360708B (en) | Data writing method and device, electronic equipment and storage medium | |
| CN110290482B (en) | Multimedia message processing method, system and terminal equipment | |
| CN113868231B (en) | Data structure updating method and device | |
| CN114442951B (en) | Method, device, storage medium and electronic equipment for transmitting multipath data | |
| CN112218274B (en) | Exception handling method and device | |
| CN118301558A (en) | Message sending method, device, communication equipment and storage medium |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |