CN113645008A - Message protocol overtime retransmission method and system based on linked list - Google Patents
Message protocol overtime retransmission method and system based on linked list Download PDFInfo
- Publication number
- CN113645008A CN113645008A CN202110678597.5A CN202110678597A CN113645008A CN 113645008 A CN113645008 A CN 113645008A CN 202110678597 A CN202110678597 A CN 202110678597A CN 113645008 A CN113645008 A CN 113645008A
- Authority
- CN
- China
- Prior art keywords
- message
- node
- retransmission
- linked list
- link
- 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
- 238000000034 method Methods 0.000 title claims abstract description 40
- 230000004044 response Effects 0.000 claims abstract description 15
- 238000012790 confirmation Methods 0.000 claims abstract description 12
- 238000012545 processing Methods 0.000 claims abstract description 10
- 230000006870 function Effects 0.000 claims description 19
- 230000005540 biological transmission Effects 0.000 claims description 9
- 238000012217 deletion Methods 0.000 claims description 3
- 230000037430 deletion Effects 0.000 claims description 3
- 238000000547 structure data Methods 0.000 claims description 3
- 238000003780 insertion Methods 0.000 claims description 2
- 230000037431 insertion Effects 0.000 claims description 2
- 238000007726 management method Methods 0.000 description 46
- 230000003993 interaction Effects 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/1607—Details of the supervisory signal
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/1607—Details of the supervisory signal
- H04L1/1671—Details of the supervisory signal the supervisory signal being transmitted together with control information
- H04L1/1678—Details of the supervisory signal the supervisory signal being transmitted together with control information where the control information is for timing, e.g. time stamps
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1867—Arrangements specially adapted for the transmitter end
- H04L1/188—Time-out mechanisms
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Communication Control (AREA)
Abstract
A message protocol overtime retransmission method based on a linked list comprises the following steps: designing a linked list Link for message protocol overtime retransmission management; initializing the Link of the Link table, initializing the Link of the Link table into a null node Link table, and pointing the head pointer and the tail pointer to the same node; inserting a node in the initialized linked list Link, wherein the parameter of the node is a message retransmission management structure variable; when a message is to be sent, managing the sending content by using a message retransmission management structure; processing the receiving confirmation message in a message receiving function; setting and starting an invalid node query timer, and performing invalid node query; and performing retransmission operation in the query invalid node timer. The invention records the process information of message retransmission into the linked list based on the linked list data structure, only needs to continuously inquire the message response state in the associated container in the timer for managing the overtime retransmission, and retransmits the message which does not receive response after overtime, thus efficiently finishing the overtime response management.
Description
Technical Field
The invention relates to a message protocol overtime retransmission method based on a linked list, belonging to the field of computer control.
Background
In a large system with a plurality of interconnected subsystems, data between the systems are interacted through a bus. In the interaction process, due to interference or faults and other reasons, frame error, frame disordering, frame loss and the like are caused, so that data interaction between systems fails, and the failure of some important data interaction easily causes the failure of the whole system task. Therefore, the inter-system communication usually requires the receiver to respond to important message data, and the conventional response management method usually adopts a linear table mode to manage, for example, mark which messages have been successfully sent but have not received responses in an array, and count over time through a counter, and perform retransmission operation according to the message content recorded by the global variable after the over time occurs. However, for different message types, after the message is sent, whether the message needs to be responded is marked in the array, for the number of the messages which need to be responded and are continuously increased in the system, the length of the array needs to be continuously increased, the variables which participate in the marking also continuously increase, the frame of the code also needs to be continuously modified, meanwhile, the overtime management is performed by counting in the program through a timer, and a plurality of messages which need to be responded are managed.
Disclosure of Invention
The technical problem to be solved by the invention is as follows: the method overcomes the defects of the prior art and provides a message protocol overtime retransmission method based on a linked list.
The technical solution of the invention is as follows:
a message protocol overtime retransmission method based on a linked list comprises the following steps:
(1) designing a linked list Link for message protocol overtime retransmission management;
(2) initializing the Link of the Link table, initializing the Link of the Link table into a null node Link table, and pointing the head pointer and the tail pointer to the same node;
(3) inserting a node in the initialized linked list Link, wherein the parameter of the node is a message retransmission management structure variable;
(4) when the message is sent, the message retransmission management structure is used for managing the sending content;
(5) processing the receiving confirmation message in a message receiving function;
(6) setting and starting an invalid node query timer, and performing invalid node query;
(7) and performing retransmission operation in the query invalid node timer.
Further, the data elements stored in the data field of the linked list Link are in a message retransmission management structure, and the pointer field is an address pointing to the next node.
Further, the message retransmission management structure includes a destination address of message transmission, a message sequence number, a data pointer to be transmitted, a data length to be transmitted, whether a flag is received, a retransmission counter, and the number of times of retransmission.
Further, initializing the Link table Link specifically includes:
(2.1) defining a linked list Link type variable: the method comprises a head node pointer head, a common node pointer node and a tail node pointer tail;
(2.2) applying for a memory pLink with a linked list Link structure length by using a dynamic memory application method, and assigning a head address of the applied memory to a head node pointer head;
(2.3) assigning the value of head node pointer head to tail node pointer tail;
(2.4) the initial state of the linked list Link is empty node, and the head and tail pointers all point to the same position pLink.
Further, a node is inserted into the initialized linked list Link in the step (3), specifically, the parameter is a message retransmission management structure FrmMani type variable nodeAdd;
(3.1) defining linked list Link pointer variables node1 and node2 of retransmission management, applying for the memory with the length occupied by the linked list Link of retransmission management by using a dynamic memory application method, and assigning the initial address of the applied memory space to node 1;
(3.2) assigning the value of the function parameter node to a message retransmission management structure data member of the node1 node;
(3.3) judging whether the head pointer head is empty, if so, assigning the value of the node1 to the head, and if not, assigning the head pointer to the node 2;
(3.4) circularly judging whether the content pointed by the next element in the node2 is empty, if not, assigning the content pointed by the next element in the node2 to the node2, if so, assigning the value of the node1 to the position pointed by the next element in the node2, and simultaneously setting the position pointed by the next element in the node1 as an empty pointer NULL.
Further, the step (4) manages the transmission content by using a message retransmission management structure, specifically:
(4.1) defining a message retransmission management structure FrmmMani variable gMani;
(4.2) after calling a message sending function, respectively assigning a destination address Frmdst, a message serial number FrmSeq, a data pointer FrmPtr for sending the message and a data length FrmLen for sending the message to corresponding members in a message retransmission management structure FrmMani variable gMani;
(4.3) clearing the retransmission counter SndCnt in the variable gMani, setting the number SndTimes of times needing retransmission, and setting whether the receiving flag IsRecvd is set to be negative.
Further, the step (5) of processing the reception confirmation message in the message reception function specifically includes:
(5.1) extracting the message serial number SeqNum of the receiving confirmation message; searching a linked list node according to the message serial number SeqNum;
(5.2) defining a Link pointer variable node of the linked list, and assigning a head pointer head of the linked list to the node;
(5.3) circularly judging whether the message sequence number SeqNum exists in the chain table message retransmission management structure FrmmMani, if the message sequence number SeqNum is found, setting whether the response message receives the mark IsRecvd as yes, and finishing the circulation at the moment;
and (5.4) if the traversal to the tail node does not match, prompting an error.
Further, the step (6) sets and starts a query invalid node timer, and performs invalid node query, specifically:
(6.1) setting the query invalid node timer calling PERIOD as PERIOD;
(6.2) judging whether the linked list is empty or not through the linked list head pointer initialized in the step (2), and if the linked list is empty, directly returning; if not, traversing the nodes which meet the conditions in the deletion linked list, wherein the nodes comprise nodes which have the retransmission counter SndCnt more than or equal to the number SndTimes which needs to be retransmitted or whether a mark IsRecvd is received;
(6.3) defining a Link pointer LinkPtr of the node, and assigning a head pointer head to the LinkPtr;
(6.4) circularly judging whether LinkPtr is empty, if not, judging whether the value of the received mark IsRecvd is yes or the retransmission counter value is greater than or equal to SndTimes, and if so, assigning the next value in LinkPtr to LinkPtr; otherwise, judging whether the LinkPtr is the head node or not, if so, assigning the next value in the LinkPtr to the head node, releasing the space of the original head node, and assigning the next value in the LinkPtr to the LinkPtr.
Further, the step (7) performs a retransmission operation in the query invalid node timer, specifically:
(7.1) setting a time base gMulti as a global variable to calculate time, adding one operation each time the timer callback function is called, and entering the step (7.2) when the value of the calculated time base gMulti after the retransmission frequency base ReSnd is 0;
(7.2) defining a Link pointer variable node of a linked list for retransmission management, assigning a head pointer head of the linked list to the node, circularly judging whether the value of a retransmission mark IsRecvd in a message retransmission management structure FrmMani in the linked list is negative, and simultaneously, the number of times SndTimes which need to be retransmitted is inconsistent with the value of a retransmission counter SndCnt, and then, entering the step (7.3) to retransmit the message data;
(7.3) transmitting the destination address Frmdst, the data pointer FrmPtr for sending the message and the data length FrmLen for sending the message in the message retransmission management structure FrmMani into a message sending function, and finishing retransmission operation.
Further, the present invention also provides a message protocol timeout retransmission system based on a linked list, which includes:
a linked list setting module: designing a linked list Link for message protocol overtime retransmission management;
an initialization module: initializing the Link of the Link table, initializing the Link of the Link table into a null node Link table, and pointing the head pointer and the tail pointer to the same node;
a node insertion module: inserting a node in the initialized linked list Link, wherein the parameter of the node is a message retransmission management structure variable;
a receiving confirmation message processing module: when a message is to be sent, managing the sending content by using a message retransmission management structure; processing the receiving confirmation message in a message receiving function;
invalid node inquiry module: setting and starting an invalid node query timer, and performing invalid node query;
a retransmission operation module: and performing retransmission operation in the query invalid node timer.
Compared with the prior art, the invention has the beneficial effects that:
the invention is based on the linked list data structure, through a novel message retransmission management structure, records the process information of message retransmission into the linked list, only needs to continuously inquire the message response state in the message retransmission management structure in the linked list in a timer for the management of overtime retransmission, and retransmits the message which does not receive response after overtime, thus efficiently finishing the management of overtime response.
Drawings
FIG. 1 is a flow chart of a message protocol timeout retransmission method based on a linked list;
FIG. 2 is a linked list structure diagram.
Detailed Description
The following describes embodiments of the present invention in further detail with reference to the accompanying drawings.
The traditional management method for message overtime retransmission among systems usually adopts a mode of group marking in a linear table to manage, whether the message needs to be responded or not is marked in a plurality of groups after the message is sent for different message types, the length of the groups needs to be continuously increased for the continuously increased number of the messages needing to be responded in the system, the variables participating in marking also continuously increase, the frame of the code also needs to be continuously modified, meanwhile, the overtime management is counted by a timer in a program, a plurality of messages needing to be responded are managed, the management mode is very easy to make mistakes, when the message is retransmitted, the information of the address, the content, the length and the like of the message needing to be retransmitted needs to be confirmed, generally is a global common variable, the value of the data during the period from the first transmission of the message to the overtime non-response period can be tampered, and the contents of the data transmitted twice are not completely consistent, affecting the normal operation of the system.
As shown in fig. 1, the present invention provides a message protocol timeout retransmission method based on a linked list, which includes the following steps:
s1, designing linked list Link for message protocol overtime retransmission management.
(1) The data element stored in the Link data field of the retransmission management linked list is a message retransmission management structure FrmMani, and the pointer field is an address next pointing to the next node.
(2) As shown in fig. 2, the message retransmission management structure FrmMani includes a destination address FrmDst (type is set to be unsigned integer) for message transmission, a message sequence number FrmSeq (type is unsigned integer), a data pointer FrmPtr (type is unsigned character pointer) for message transmission, and a data length FrmLen for message transmission. Whether a flag IsRecvd (type unsigned character type) is received, a retransmission counter SndCnt (type unsigned integer type), and the number of times SndTimes that retransmission is required (type unsigned short integer type, if set to 0, it means that retransmission is not required).
And S2, initializing the linked list by taking the linked list designed by the S1 as a structure, and only one empty node is left after the linked list is successfully initialized.
(1) Define Link finger variables: the method comprises a head node pointer head, a common node pointer node and a tail node pointer tail.
(2) And (3) applying a memory pLink (length is calculated by using sizeof (Link)) with the Link structure length by using a dynamic memory application method malloc () in the C standard library, and assigning the initial address of the applied memory to a head node pointer head.
(3) The value of head node pointer head is assigned to tail node pointer tail.
(4) The initial state of the linked list is empty nodes, and the head and tail pointers all point to the same position pLink.
S3, a node is inserted in the initialized linked list in S2, and the parameter is the message retransmission management structure FrmmMani type variable nodeAdd.
(1) Defining linked list Link pointer variables node1 and node2 for retransmission management, applying for the memory with the length occupied by the linked list Link for retransmission management by using a dynamic memory application method malloc (), and assigning the initial address of the applied memory space to node 1.
(2) And assigning the value of the function parameter node added to the message retransmission management structure data member of the node1 node.
(3) And judging whether the head pointer head is null, if so, assigning the value of the node1 to the head, and if not, assigning the head pointer to the node 2.
(4) And circularly judging whether the content pointed by the next element in the node2 is empty, if not, assigning the content pointed by the next element in the node2 to the node2, if so, assigning the value of the node1 to the position pointed by the next element in the node2, and simultaneously setting the position pointed by the next element in the node1 as an empty pointer NULL.
S4, when transmitting the message protocol designed in S1, using the retransmission management structure Frmmani to manage the transmission content
(1) And defining a message retransmission management structure FrmmMani variable gMani.
(2) After a message sending function is called, a destination address Frmdst and a message serial number FrmSeq of message sending, a data pointer FrmPtr of the message sending and a data length FrmLen of the message sending are set. And respectively assigning values to corresponding members in a message retransmission management structure FrmmMani variable gMani.
(3) In the variable gMani, the retransmission counter SndCnt is cleared, the number of TIMES SndTimes that needs to be retransmitted is set as TIMES, whether the flag IsRecvd is received or not is set as a negative value.
S5, processing the ACK message in the message receiving function
(1) Extracting a message serial number SeqNum of a receiving confirmation message; and searching a linked list node according to the message sequence number SeqNum.
(2) Defining a Link pointer variable node, and assigning a head pointer head of the linked list to the node.
(3) And circularly judging whether the message sequence number SeqNum exists in the chain table message retransmission management structure FrmmMani, if the message sequence number SeqNum is found, setting whether the response message receives the mark IsRecvd as yes, and finishing the circulation at the moment.
(4) And if the traversal to the tail node is not matched, prompting an error.
And S6, setting and starting a query invalid node timer, and performing invalid node query.
(1) And setting the calling PERIOD of the query invalid node timer to be equal to PERIOD.
(2) And judging whether the linked list is empty or not through the linked list head pointer initialized in the S2, and if the linked list is empty, directly returning. If not, the nodes which have satisfied the condition in the deletion linked list are traversed, including the nodes which have the retransmission counter SndCnt greater than or equal to the number SndTimes of retransmission or whether the flag IsRecvd is received as yes.
(3) A node Link pointer LinkPtr is defined, and head is assigned to LinkPtr.
(4) And circularly judging whether LinkPtr is empty, if not, judging whether the value of the received mark IsRecvd is yes or the retransmission counter value is larger than or equal to SndTimes, and if the condition is met, assigning the next value in LinkPtr to LinkPtr. Otherwise, judging whether the node is the head node or not, and if the node is the head node, assigning a next value in LinkPtr to the head node. And releasing the space of the original head node. The value of next in LinkPtr is assigned to LinkPtr.
A retransmission operation is performed in the query invalid node timer S7.
(1) Setting a time base gMulti as a global variable to calculate time, adding one operation each time a timer callback function is called, and entering the next step when the calculated time base gMulti takes a surplus value of a retransmission frequency base ReSnd (the value is adjusted by a user according to a system) as 0;
(2) defining a Link pointer variable node of a linked list for retransmission management, assigning a head pointer head of the linked list to the node, circularly judging whether the value of a retransmission mark IsRecvd in a message retransmission management structure FrmMani in the linked list is inconsistent with the value of a retransmission counter SndTimes and the number of times SndTimes of whether retransmission is needed at the same time, and then entering the next step to retransmit the message data.
(3) And transmitting a destination address Frmdst in a message retransmission management structure FrmmMani, a data pointer Frmptr of a sending message and a data length Frmlen sent to the message into a message sending function to finish retransmission operation.
The invention is based on the chain table data structure, through a novel message retransmission management structure, records the process information of message retransmission into the chain table, only needs to continuously inquire the message response state in the associated container in the timer for the management of overtime retransmission, retransmits the message which does not receive response after overtime, and can efficiently finish the management of overtime response.
Those matters not described in detail in the present specification are well known in the art.
Claims (10)
1. A message protocol overtime retransmission method based on a linked list is characterized by comprising the following steps:
(1) designing a linked list Link for message protocol overtime retransmission management;
(2) initializing the linked list Link to be a null node linked list, wherein head and tail pointers point to the same nodes;
(3) inserting a node in the initialized linked list Link, wherein the parameter of the node is a message retransmission management structure variable;
(4) when the message is sent, the message retransmission management structure is used for managing the sending content;
(5) processing the receiving confirmation message in a message receiving function;
(6) setting and starting an invalid node query timer, and performing invalid node query;
(7) and performing retransmission operation in the query invalid node timer.
2. The method according to claim 1, wherein the message protocol timeout retransmission method based on the linked list comprises: the data elements stored in the data field of the linked list Link are message retransmission management structures, and the pointer field is an address pointing to the next node.
3. The method according to claim 2, wherein the message protocol timeout retransmission method based on the linked list is characterized in that: the message retransmission management structure comprises a destination address of message transmission, a message serial number, a data pointer to be transmitted, a data length to be transmitted, whether a mark is received or not, a retransmission counter and the number of times of retransmission.
4. The method according to claim 2, wherein the message protocol timeout retransmission method based on the linked list is characterized in that: initializing the Link of the Link table, specifically:
(2.1) defining a linked list Link type variable: the method comprises a head node pointer head, a common node pointer node and a tail node pointer tail;
(2.2) applying for a memory pLink with a linked list Link structure length by using a dynamic memory application method, and assigning a head address of the applied memory to a head node pointer head;
(2.3) assigning the value of head node pointer head to tail node pointer tail;
(2.4) the initial state of the linked list Link is empty node, and the head and tail pointers all point to the same position pLink.
5. The method according to claim 4, wherein the message protocol timeout retransmission method based on the linked list comprises: inserting a node in the initialized linked list Link in the step (3), wherein the parameter is a message retransmission management structure FrmMani type variable nodeAdd;
(3.1) defining linked list Link pointer variables node1 and node2 of retransmission management, applying for the memory with the length occupied by the linked list Link of retransmission management by using a dynamic memory application method, and assigning the initial address of the applied memory space to node 1;
(3.2) assigning the value of the function parameter node to a message retransmission management structure data member of the node1 node;
(3.3) judging whether the head pointer head is empty, if so, assigning the value of the node1 to the head, and if not, assigning the head pointer to the node 2;
(3.4) circularly judging whether the content pointed by the next element in the node2 is empty, if not, assigning the content pointed by the next element in the node2 to the node2, if so, assigning the value of the node1 to the position pointed by the next element in the node2, and simultaneously setting the position pointed by the next element in the node1 as an empty pointer NULL.
6. The method according to claim 5, wherein the message protocol timeout retransmission method based on the linked list comprises: the step (4) uses a message retransmission management structure to manage the transmission content, which specifically comprises the following steps:
(4.1) defining a message retransmission management structure FrmmMani variable gMani;
(4.2) after calling a message sending function, respectively assigning a destination address Frmdst, a message serial number FrmSeq, a data pointer FrmPtr for sending the message and a data length FrmLen for sending the message to corresponding members in a message retransmission management structure FrmMani variable gMani;
(4.3) clearing the retransmission counter SndCnt in the variable gMani, setting the number SndTimes of times needing retransmission, and setting whether the receiving flag IsRecvd is set to be negative.
7. The method according to claim 5, wherein the message protocol timeout retransmission method based on the linked list comprises: the step (5) of processing the reception confirmation message in the message reception function specifically includes:
(5.1) extracting the message serial number SeqNum of the receiving confirmation message; searching a linked list node according to the message serial number SeqNum;
(5.2) defining a Link pointer variable node of the linked list, and assigning a head pointer head of the linked list to the node;
(5.3) circularly judging whether the message sequence number SeqNum exists in the chain table message retransmission management structure FrmmMani, if the message sequence number SeqNum is found, setting whether the response message receives the mark IsRecvd as yes, and finishing the circulation at the moment;
and (5.4) if the traversal to the tail node does not match, prompting an error.
8. The method according to claim 5, wherein the message protocol timeout retransmission method based on the linked list comprises: the step (6) sets and starts an invalid node query timer, and performs invalid node query, specifically:
(6.1) setting the query invalid node timer calling PERIOD as PERIOD;
(6.2) judging whether the linked list is empty or not through the linked list head pointer initialized in the step (2), and if the linked list is empty, directly returning; if not, traversing the nodes which meet the conditions in the deletion linked list, wherein the nodes comprise nodes which have the retransmission counter SndCnt more than or equal to the number SndTimes which needs to be retransmitted or whether a mark IsRecvd is received;
(6.3) defining a Link pointer LinkPtr of the node, and assigning a head pointer head to the LinkPtr;
(6.4) circularly judging whether LinkPtr is empty, if not, judging whether the value of the received mark IsRecvd is yes or the retransmission counter value is greater than or equal to SndTimes, and if so, assigning the next value in LinkPtr to LinkPtr; otherwise, judging whether the LinkPtr is the head node or not, if so, assigning the next value in the LinkPtr to the head node, releasing the space of the original head node, and assigning the next value in the LinkPtr to the LinkPtr.
9. The method according to claim 5, wherein the message protocol timeout retransmission method based on the linked list comprises: the step (7) of performing retransmission operation in the invalid node query timer specifically includes:
(7.1) setting a time base gMulti as a global variable to calculate time, adding one operation each time the timer callback function is called, and entering the step (7.2) when the value of the calculated time base gMulti after the retransmission frequency base ReSnd is 0;
(7.2) defining a Link pointer variable node of a linked list for retransmission management, assigning a head pointer head of the linked list to the node, circularly judging whether the value of a retransmission mark IsRecvd in a message retransmission management structure FrmMani in the linked list is negative, and simultaneously, the number of times SndTimes which need to be retransmitted is inconsistent with the value of a retransmission counter SndCnt, and then, entering the step (7.3) to retransmit the message data;
(7.3) transmitting the destination address Frmdst, the data pointer FrmPtr for sending the message and the data length FrmLen for sending the message in the message retransmission management structure FrmMani into a message sending function, and finishing retransmission operation.
10. A linked list based message protocol timeout retransmission system implemented according to the linked list based message protocol timeout retransmission method of any one of claims 1 to 9, comprising:
a linked list setting module: designing a linked list Link for message protocol overtime retransmission management;
an initialization module: initializing the Link of the Link table, initializing the Link of the Link table into a null node Link table, and pointing the head pointer and the tail pointer to the same node;
a node insertion module: inserting a node in the initialized linked list Link, wherein the parameter of the node is a message retransmission management structure variable;
a receiving confirmation message processing module: when a message is to be sent, managing the sending content by using a message retransmission management structure; processing the receiving confirmation message in a message receiving function;
invalid node inquiry module: setting and starting an invalid node query timer, and performing invalid node query;
a retransmission operation module: and performing retransmission operation in the query invalid node timer.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110678597.5A CN113645008B (en) | 2021-06-18 | 2021-06-18 | Message protocol timeout retransmission method and system based on linked list |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110678597.5A CN113645008B (en) | 2021-06-18 | 2021-06-18 | Message protocol timeout retransmission method and system based on linked list |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113645008A true CN113645008A (en) | 2021-11-12 |
| CN113645008B CN113645008B (en) | 2024-03-22 |
Family
ID=78415994
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110678597.5A Active CN113645008B (en) | 2021-06-18 | 2021-06-18 | Message protocol timeout retransmission method and system based on linked list |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113645008B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115941128A (en) * | 2022-11-07 | 2023-04-07 | 天津津航计算技术研究所 | Message protocol overtime retransmission management method based on QCache |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8199646B1 (en) * | 1999-12-07 | 2012-06-12 | Nortel Networks Limited | System, device, and method for distributing link state information in a communication network |
| US20120158729A1 (en) * | 2010-05-18 | 2012-06-21 | Lsi Corporation | Concurrent linked-list traversal for real-time hash processing in multi-core, multi-thread network processors |
| US20130003751A1 (en) * | 2011-06-30 | 2013-01-03 | Oracle International Corporation | Method and system for exponential back-off on retransmission |
| CN103546250A (en) * | 2013-09-18 | 2014-01-29 | 中标软件有限公司 | Communication method and communication system for vehicular terminal |
-
2021
- 2021-06-18 CN CN202110678597.5A patent/CN113645008B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8199646B1 (en) * | 1999-12-07 | 2012-06-12 | Nortel Networks Limited | System, device, and method for distributing link state information in a communication network |
| US20120158729A1 (en) * | 2010-05-18 | 2012-06-21 | Lsi Corporation | Concurrent linked-list traversal for real-time hash processing in multi-core, multi-thread network processors |
| US20130003751A1 (en) * | 2011-06-30 | 2013-01-03 | Oracle International Corporation | Method and system for exponential back-off on retransmission |
| CN103546250A (en) * | 2013-09-18 | 2014-01-29 | 中标软件有限公司 | Communication method and communication system for vehicular terminal |
Non-Patent Citations (2)
| Title |
|---|
| XIA LI: "TCP performance in IEEE 802.11-based Ad Hoc networks with multiple wireless lossy links", 《IEEE TRANSACTIONS ON MOBILE COMPUTING》 * |
| 梁茂盛;: "可靠通信协议中多定时器的实现方案", 计算机与现代化, no. 12 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115941128A (en) * | 2022-11-07 | 2023-04-07 | 天津津航计算技术研究所 | Message protocol overtime retransmission management method based on QCache |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113645008B (en) | 2024-03-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA2100533C (en) | Method and system for synchronizing computer mail user directories | |
| US5856972A (en) | Duplicate message detection method and apparatus | |
| EP0074864B1 (en) | System and method for name-lookup in a local area network data communication system | |
| Mills | Exterior gateway protocol formal specification | |
| US5058108A (en) | Local area network for digital data processing system | |
| CN101217429B (en) | A determination method of the initiation relationship within TCP messages based on TCP timestamp options | |
| US20060013169A2 (en) | Reliable message distribution in an ad hoc mesh network | |
| US20090049172A1 (en) | Concurrent Node Self-Start in a Peer Cluster | |
| EP0961453B1 (en) | Method and device for identifying devices in a communication network | |
| US20130139178A1 (en) | Cluster management system and method | |
| CN112559219A (en) | Internet of things offline message management method, device, equipment and storage medium | |
| CN113645008A (en) | Message protocol overtime retransmission method and system based on linked list | |
| CN113852445B (en) | Method, system, equipment and storage medium for improving data transmission reliability | |
| CN103731424B (en) | A kind of transmission method of network data, apparatus and system | |
| US20080212505A1 (en) | Method and receiving apparatus for processing arq block in wibro system | |
| CN110162511B (en) | Log transmission method and related equipment | |
| Kamal et al. | Utilizing bandwidth sharing in the slotted ring | |
| CN101989896B (en) | Feedback method and device for ARQ connection | |
| CN113609518A (en) | Message protocol overtime retransmission method and system based on associated container map | |
| JPH0591108A (en) | Message communication control method and communication system | |
| CN113949658A (en) | Table item processing method, system, device, electronic equipment and storage medium | |
| WO2016165289A1 (en) | Inter-board data processing method and device | |
| CN106385322A (en) | Data group calling method, device and system | |
| Mills | RFC0904: Exterior Gateway Protocol formal specification | |
| CN101515362A (en) | Method for transmitting data of an overall snapshot of a securities quotation order |
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 |