Packet fault-tolerant delimiting method based on protocol natural redundancy
Through the packet fault-tolerant delimiting method based on protocol natural redundancy, using path search and repeated field judgment feedback technology, the problem of insufficient packet delimiting performance under low signal-to-noise ratio is solved, and efficient packet boundary delimiting and system throughput are achieved. promote.
Patent Information
- Application Number
- CN202410389740.2
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-03-30
- Publication Date
- 2024-12-06
- Estimated Expiration
- 2044-03-30
AI Technical Summary
Under low signal-to-noise ratio conditions, existing packet delimiting methods are sensitive to transmission errors, resulting in missed detection or false alarms in packet boundaries, thereby reducing system throughput, especially in services with high real-time requirements. boundary.
Using a packet fault-tolerant delimiting method based on protocol natural redundancy, through similar matching and path search technology, combining the redundant information of fixed fields, length fields and repeated fields, path accumulation metrics are calculated to determine the packet boundary and repeat them if necessary. Field judgment feedback to improve delimited performance.
It significantly improves the packet delimiting performance, approximates the upper limit of theoretical performance, reduces the packet delimiting error rate, and improves the system's throughput and real-time performance under low signal-to-noise ratio conditions.
Smart Images

Figure CN119094426A_ABST
Abstract
Description
Technical Field
[0001] The invention relates to the technical field of wireless communications, and in particular to a packet fault-tolerant delimitation method based on protocol natural redundancy. Background Art
[0002] In many communication systems, the transmitter aggregates short packets (or data packets) of a specific protocol layer into long packets (or bursts) before passing them downward, while the receiver performs reverse processing at the corresponding protocol layer to find the starting boundaries of multiple consecutive short packets, that is, to complete the packet delimitation (or burst segmentation). The advantage of this is that it reduces the header encapsulation overhead of the lower layer protocol and thus improves the throughput. However, the introduction of the packet delimitation process also makes the system more sensitive to transmission errors. Usually, the starting boundary of the packet is determined by sliding a search for a synchronization marker on the hard decision result sequence of the received data, such as the 0x7E boundary marker used by the High-level Data Link Control (HDLC) and Point to Point (PPP) protocols. When there are errors in the received data, it may cause missed detection or false alarms at the packet boundary, which in turn causes the aggregated packet to be incorrectly delimited and segmented. Therefore, an error check field is usually introduced in the packet. When the segmentation error causes the check to fail, the corresponding packet will be required to be retransmitted. Under low signal-to-noise ratio, the frequency of error retransmission mechanism being triggered increases significantly, which greatly reduces the system throughput. In some services with high real-time requirements and one-way broadcast services, this mechanism will become very difficult or even impossible to implement.
[0003] In order to deal with this situation, we can only continue to mine other available natural redundant information from the protocol. Reference [1] (Ali U, Kieffer M, Duhamel P. Joint protocol-channel decoding for robust aggregated packet recovery at wimax MAC layer [C]. IEEE 10th Workshop on Signal Processing Advances in Wireless Communications, 2009: 672-676) and reference [2] (Fan Liang, Wang Xiaomei, Yang Dongyu. A PDU fault-tolerant delimitation algorithm using optimal path search [J]. Journal of Xidian University, 2016, 43 (5): 160-166) understand packet delimitation from the perspective of channel decoding, and give specific algorithms from the perspectives of symbol-by-symbol decoding and sequence decoding. Reference [1] regards the frame aggregation process as a Markov process and constructs a Trellis diagram with an indefinite number of steps that can represent all possible aggregation schemes. Finally, the BCJR algorithm is used to estimate the number of packets and the boundary, and an 8dB gain is achieved in the MAC packet delimitation of the Wimax protocol compared with the traditional hard segmentation method. Although this method has achieved the approximate optimality in theory, the BCJR algorithm uses normalization processing at each moment in the actual forward and backward recursion to prevent precision overflow, which makes the given packet number estimation criterion difficult to implement. Reference [2] starts from the perspective of sequence decoding and regards the delimitation problem of the protocol data unit as a path search problem. It first performs rough delimitation based on the Hamming distance, and then performs the best path search on the rough delimitation result to obtain the final boundary judgment result. The rough delimitation step adopted by this method can effectively reduce the subsequent search space, but the path metric criterion given is an empirical approach, which is bound to be different from the theoretical performance. At the same time, both of the above methods divide the protocol fields, including fixed fields, length fields, data fields, check fields and other fields, and focus on using the redundancy in fixed fields, length fields and check fields to complete packet delimitation. However, cross-layer considerations of redundant fields are relatively rare, and natural redundancy of other types of protocols, such as repeated field redundancy and packet length distribution redundancy, has not yet been taken into consideration. Summary of the invention
[0004] Aiming at the problem of insufficient performance of packet delimitation under low signal-to-noise ratio, the present invention provides a packet fault-tolerant delimitation method based on natural redundancy of protocol.
[0005] The present invention provides a packet fault-tolerant delimitation method based on protocol natural redundancy, comprising:
[0006] Step 1: Receive an aggregated packet sequence;
[0007] Step 2: performing similarity matching on the fixed field and all fixed field observation vectors on the aggregated packet sequence to obtain a rough delimitation result sequence, wherein the rough delimitation result sequence includes a plurality of suspected start boundaries arranged in chronological order;
[0008] Step 3: Take each suspected starting boundary as a node on the path, start from the first suspected starting boundary, and use the natural redundancy of the protocol to construct a path metric for path search; the path search process includes:
[0009] For the current suspected starting boundary g b , g b Set as the downstream node, which will satisfy the packet length constraint and be located at g b All previous suspected starting boundaries are taken as g b The upstream node g a ;
[0010] For each upstream node g a , assuming g a tog b There is only g between a is the starting boundary of the group, and the calculation is from g1 to g a Then to g b The path accumulation metric of the constructed paths based on the natural redundancy of the protocol;
[0011] The path with the largest cumulative path metric is taken as the current best path, and the search continues for the next suspected starting boundary until the search is completed for the last suspected starting boundary, and the search ends;
[0012] Step 4: After the search is completed, the current best path is output as the final group boundary sequence.
[0013] Furthermore, step 2 specifically includes:
[0014] The correlation coefficient between the fixed field and the current fixed field observation vector is calculated. When the correlation coefficient is greater than the set threshold, the position of the last bit of the current fixed field observation vector is taken as a suspected starting boundary and added to the rough delimitation result sequence.
[0015] Further, calculate from g1 to g a Then to g b The path accumulation metrics based on the natural redundancy of the protocol for the constructed path specifically include:
[0016]
[0017]
[0018] in, k is a fixed field, u a For group Pkt a→b The inferred length field is taken from g b -g a Size determination, R k and R u The fixed field k and the length field u are a A 0 / 1 random field with the same dimension. is a single-step metric, M 1→a From node g1 to node g a The cumulative metric of the path.
[0019] Furthermore, it also includes:
[0020] If the redundant field type existing in the protocol stack used by the transmitting and receiving ends for communication includes a repeated field, then according to the packet boundary sequence output in step 4, the repeated field observation vector of each packet is extracted to form a repeated field observation vector sequence;
[0021] Estimating a hard decision result of the repeated field according to the repeated field observation vector sequence;
[0022] Add the hard decision result of the repeated field to the original fixed field sequence to obtain a new fixed field sequence;
[0023] The path search is performed again according to the new fixed field sequence, and the group boundary sequence obtained by this path search is used as the final group boundary sequence.
[0024] Beneficial effects of the present invention:
[0025] (1) For downstream node g b , by the upstream node g a Jump to it and determine the packet Pkt a→b In this event, the existing path search method only uses the “identification node g a is the starting boundary of a potential grouping", while ignoring the "g a tog b The other nodes between them are not the starting boundaries” is another hidden information, which causes the path measurement in the existing path search method to be inaccurate. To address this problem, the present invention considers the above two pieces of information at the same time, that is, in “g a tog b There is only g between a The calculation from g1 to g is based on the condition of "starting boundary of grouping" a Then to g b The path cumulative metric of the constructed paths can significantly improve the group delimitation performance.
[0026] (2) In order to address the shortcoming of the existing methods that the protocol field redundancy is not fully utilized, the present invention further introduces a decision feedback algorithm for repeated fields. That is, when there are repeated fields available in the protocol stack, the estimated repeated fields are added to the original fixed fields, and the path search is performed again, which can further improve the packet delimitation performance.
[0027] (3) The test results on the IPv4 / MAC / HDLC protocol stack show that the method of the present invention has greatly improved performance compared with the existing path search method and is close to the theoretical performance upper limit. At the same time, it can be extended and applied to other different protocol standards. BRIEF DESCRIPTION OF THE DRAWINGS
[0028] Figure 1 It is a group aggregation model;
[0029] Figure 2 A schematic flow chart of a packet fault-tolerant delimitation method based on protocol natural redundancy provided in an embodiment of the present invention;
[0030] Figure 3 A schematic diagram of an improved path search process provided by an embodiment of the present invention;
[0031] Figure 4 The following is a comparison of the grouping delimitation performance under different methods provided in the embodiments of the present invention. DETAILED DESCRIPTION
[0032] In order to make the purpose, technical solution and advantages of the present invention clearer, the technical solution in the embodiment of the present invention will be clearly described below in conjunction with the drawings in the embodiment of the present invention. Obviously, the described embodiment is a part of the embodiment of the present invention, not all the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.
[0033] Before introducing the technical solution of the present invention, in order to facilitate understanding of the technical solution of the present invention, a brief introduction to the aggregation grouping sequence and grouping delimitation is first given. Figure 1 As shown, n packets are sequentially spliced into a sequence v, and the header of the lower layer is added in front of the sequence v to form a complete aggregate packet sequence.
[0034] For each packet, it is composed of the payload source data and the header and tail of the multi-layer protocol. According to the role played in packet delimitation, these fields can be roughly divided into fixed field k, length field u, repeated field r, header check field c1, other header fields o, payload data field b and check field c2 covering the entire packet, etc. The corresponding observation information is represented as y k ,y u ,y r ,yo , y b and
[0035] Since the length of the lower layer header is usually fixed, the receiving end only needs to consider the receiving sequence v corresponding to n packets separately when separating the packets. Therefore, the lower layer header part is no longer taken into consideration in the aggregation and segmentation of data involved below. Assume that the length of the i-th packet is ξ i bits, the total length of n packets is bits, then the real starting boundaries of n packets ζ1, ζ2, ..., ζ η They are Packet delimitation is to find these boundaries based on the received sequence y and the known natural redundant information of the protocol when the number of packets η is unknown.
[0036] Example 1
[0037] like Figure 2 As shown, the embodiment of the present invention provides a packet fault tolerance delimiting method based on protocol natural redundancy, comprising the following steps:
[0038] S101: receiving an aggregated packet sequence;
[0039] S102: performing similarity matching on the fixed field and all fixed field observation vectors on the aggregated packet sequence to obtain a rough delimitation result sequence, wherein the rough delimitation result sequence includes a plurality of suspected start boundaries arranged in a chronological order;
[0040] S103: taking each suspected starting boundary as a node on the path, starting from the first suspected starting boundary, using the natural redundancy of the protocol to construct a path metric for path search; Figure 3 As shown, the path search process includes:
[0041] For the current suspected starting boundary g b , g b Set as the downstream node, which will satisfy the packet length constraint and be located at g b All previous suspected starting boundaries are taken as g b The upstream node g a ;
[0042] For each upstream node g a , assuming g a tog b There is only g between a is the starting boundary of the group, and the calculation is from g1 to g a Then to g b The path accumulation metric of the constructed paths based on the natural redundancy of the protocol;
[0043] The path with the largest cumulative path metric is taken as the current best path, and the search continues for the next suspected starting boundary until the search is completed for the last suspected starting boundary, and the search ends;
[0044] S104: After the search is completed, the current best path is output, and the sequence formed by all the nodes on the current best path arranged in order is the final group boundary sequence.
[0045] Specifically, for the downstream node g b , by the upstream node g a Jump to it and determine the packet Pkt a→b This event is equivalent to identifying node g a is the starting boundary of a potential group, and g a tog b The other nodes between are not the starting boundaries. The branch metric defined in the document [2] only uses the former information and ignores the latter, which results in the segmentation performance under the path metric criterion not being able to achieve the expected effect. In order to improve the segmentation performance, the embodiment of the present invention considers the above two pieces of information at the same time when calculating the path cumulative metric, that is, in "g a tog b There is only g between a The calculation from g1 to g is based on the condition of "starting boundary of grouping" a Then to g b The path cumulative metric of the constructed paths.
[0046] Further, as an implementable method, in the embodiment of the present invention, when performing rough delimitation, the correlation coefficient between the fixed field and the fixed field observation vector is used as a similarity measurement indicator between the two. Correspondingly, the above step S102 specifically includes: calculating the correlation coefficient between the fixed field and the current fixed field observation vector, as shown in formula (1); when the correlation coefficient is greater than a set threshold, the position of the last bit of the current fixed field observation vector is taken as a suspected starting boundary and added to the rough delimitation result sequence.
[0047]
[0048] Among them, k represents a fixed field, Represents the current fixed field observation vector, the numerator represents the inner product of two vectors, and the denominator represents the product of their respective bi-norms.
[0049] Specifically, because the length of each packet is an integer multiple of the byte size, that is, the actual packet boundary is at an integer multiple of the byte position, when estimating the packet boundary, starting from the first bit, it is only necessary to slide the relevant matching pointer on the received sequence y in units of bytes to obtain the current fixed field observation vector
[0050] Assume that through the above similar matching process, a total of m possible starting boundaries {g1,g2,...,g m}, on this basis, add the termination boundary g of the aggregation group sequence m+1 = l v +1, and finally obtain the rough delimited result sequence g = {g1,g2,...,g m ,g m+1}.
[0051] Example 2
[0052] Based on the above embodiment 1, as an implementable method, the embodiment of the present invention uses the likelihood of the node to calculate the path cumulative metric. On this basis, for each upstream node g a , assuming g a tog b There is only g between a is the starting boundary of the group, and the calculation is from g1 to g a Then to g b The cumulative path metrics of the constructed paths based on the natural redundancy of the protocol include:
[0053] Using g a tog b All nodes between (except g b The single-step metric is defined by the likelihood of the protocol being used as an upstream node. In other words, the present invention no longer calculates the likelihood in units of packets but in units of nodes. The new single-step metric based on the natural redundancy of the protocol is defined as follows:
[0054]
[0055] in, k is a fixed field, u a For group Pkt a→b The inferred length field is taken from g b -g a Size determination, R k and R u The fixed field k and the length field u are a A 0 / 1 equally probable random field of the same dimension.
[0056] From the above formula (2), it can be seen that when g aWhen it is regarded as the starting boundary, the likelihood calculation is the same as that in reference [2]. When other nodes are regarded as non-starting boundaries, the data sent at the corresponding positions are treated as random fields with equal probability of 0 / 1.
[0057] by Taking the likelihood at the field as an example, we have:
[0058]
[0059] Among them, l k is a fixed field length. For the bit-level likelihood information within the field,
[0060]
[0061] Among them, “≡” means normalizing each likelihood on the right side of the above formula, that is, uniformly subtracting After that, it does not affect the ratio and measurement properties between each other.
[0062] Similarly, the length field metric can be calculated and the complete single-step metric Furthermore, since the single-step metric proposed in this paper takes into account the upstream node g a To downstream node g b The likelihood information corresponding to all the roughly delimited node positions between , so the cumulative metric of the path can be defined as the sum of all single-step metrics on the path. Then the new cumulative metric satisfies the following recursive equation:
[0063]
[0064] Among them, M 1→a From node g1 to node g a The path cumulative metric is The path continues to the node g b The cumulative metric of the new paths formed.
[0065] In this way, when measuring the quality of different paths between any two nodes, even if the number of steps is different, they can still be directly compared because the number of field likelihoods calculated is the same. Find the path to node g according to the following formula b The path with the largest cumulative metric among all the paths is recorded as the node reaching g. b The best path can be used to complete the delimitation and segmentation of the grouping
[0066]
[0067] Based on the above calculation method and embodiments, the specific details of the packet fault tolerance delimitation method based on protocol natural redundancy provided by the embodiment of the present invention are shown in the following Algorithm 1.
[0068]
[0069]
[0070] Example 3
[0071] Although the repeated fields r of different groups are unknown, they have the same value. If the repeated fields of N frames can be jointly demodulated, it is equivalent to improving the signal-to-noise ratio by 10lg(N)dB, and the field demodulation error rate will be greatly reduced. In the packet delimitation problem, since the packet boundary has not yet been determined, the repeated fields of different groups are difficult to be accurately extracted and directly used or added to the path search metric. Therefore, when there is a repeated field r in the protocol stack, the embodiment of the present invention proposes a repeated field decision feedback mechanism to improve the performance of packet delimitation, considering first using path search to complete the first round of delimitation, and then extracting the repeated field for use. When the accuracy of the first round of delimitation is high and the number of packets is large enough, the demodulation error rate of the repeated field will be low enough, and then the hard decision result of the repeated field will be fed back to the packet delimitation task, added to the fixed field sequence and the path search is performed here to complete the second delimitation round, in order to improve the final delimitation performance. That is, on the basis of the above embodiments, the embodiment of the present invention also includes the following steps:
[0072] If the redundant field type existing in the protocol stack used by the transmitting and receiving ends for communication includes a repeated field, then according to the packet boundary sequence output in step S104, the repeated field observation vector of each packet is extracted to form a repeated field observation vector sequence;
[0073] Estimating a hard decision result of the repeated field according to the repeated field observation vector sequence;
[0074] Add the hard decision result of the repeated field to the original fixed field sequence to obtain a new fixed field sequence;
[0075] The path search is performed again according to the new fixed field sequence, and the group boundary sequence obtained by this path search is used as the final group boundary sequence.
[0076] The specific details of the packet fault-tolerant delimitation method based on protocol natural redundancy in an embodiment of the present invention are shown in Algorithm 2.
[0077]
[0078]
[0079] Example 4
[0080] The embodiment of the present invention takes the frame aggregation and segmentation involved in the HDLC protocol widely used in the field of satellite communications as an example to further illustrate the technical solution of the present invention and verify its effectiveness. The embodiment of the present invention simplifies the receiving condition and considers it as a one-way transmission scenario between two satellite transponders. Because it is impossible to distinguish the upper layer protocol type in each packet before the packet delimitation is completed, the IPv4 / MAC / HDLC protocol stack format is used to generate data in this experiment, that is, only HDLC continues to encapsulate the MAC header and the variable-length IPv4 protocol packet upward. At the same time, it is assumed that the IP layer does not fragment, does not use differentiated services, and the IP header length is fixed to 20 bytes. The IPv4 packet length is assumed to obey a bimodal distribution model, with the maximum and minimum values set to 1500 and 40 bytes respectively. At the same time, the number of packets η in a single aggregated packet is taken as 20, and the relevant threshold is set to ρ th =0.3. Based on the above assumptions, the three types of redundant protocol fields available are summarized as follows:
[0081] Fixed field k (61 bits in total): IPv4 version number, header length and differentiated service field (0x4500), flag and fragment offset field (0x4000), MAC protocol number field (0x0800), HDLC flag field (0x7E), and the upper 5 bits of the IP packet total length field (0b00000);
[0082] Length field u (11 bits in total): the lower 11 bits of the total length field of the IP packet;
[0083] Repeating field r (104 bits in total): HDLC address field (8 bits), MAC address field (96 bits).
[0084] In order to verify the good performance of the technical solution of the present invention, the packet delimitation error rates of different algorithms are compared. The correct definition of packet delimitation in the present invention requires that its starting and ending boundaries are accurately found, that is, for any sent data packet in the aggregated packet, if its starting and ending positions cannot be uniquely determined by two adjacent elements in the predicted boundary sequence, the data packet delimitation error is determined.
[0085] Figure 4 The comparison algorithms include: the path search algorithm in reference [2] (the Hamming distance threshold is set to 20), the BCJR method in reference [1] with the related rough delimiter and assuming that the number of packets in a single aggregated group is known, the BCJR algorithm further takes into account the prior information of packet length distribution, the method of the present invention (without repeated field decision feedback), the method of the present invention (with repeated field decision feedback) and the method of the present invention (assuming that the repeated field is known, that is, directly treating the repeated field as a fixed field).
[0086] from Figure 4It can be seen that the method of the present invention has significantly improved the performance compared with the original path search method in the literature [2] due to the improved path metric. At the same time, it can approach the BCJR algorithm under the condition that the number of data packets (or groups) is known. The gap with the BCJR algorithm that further utilizes the prior information of the data packet length distribution is also small, only about 0.4dB. When there is redundant repeated field available in the considered protocol stack, the decision feedback mechanism makes the algorithm performance further significantly improved, approaching the algorithm performance under the condition that the repeated field is known.
[0087] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit it. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present invention.
Claims
1. A packet fault-tolerant delimitation method based on natural redundancy of a protocol, characterized in that: include: Step 1: Receive an aggregated packet sequence; Step 2: performing similarity matching on the fixed field and all fixed field observation vectors on the aggregated packet sequence to obtain a rough delimitation result sequence, wherein the rough delimitation result sequence includes a plurality of suspected start boundaries arranged in chronological order; Step 3: Take each suspected starting boundary as a node on the path, start from the first suspected starting boundary, and use the natural redundancy of the protocol to construct a path metric for path search; the path search process includes: For the current suspected starting boundary g b , g b Set as the downstream node, which will satisfy the packet length constraint and be located at g b All previous suspected starting boundaries are taken as g b The upstream node g a ; For each upstream node g a , assuming g a tog b There is only g between a is the starting boundary of the group, and the calculation is from g1 to g a Then to g b The path accumulation metric of the constructed paths based on the natural redundancy of the protocol; The path with the largest cumulative path metric is taken as the current best path, and the search continues for the next suspected starting boundary until the search is completed for the last suspected starting boundary, and the search ends; Step 4: After the search is completed, the current best path is output as the final group boundary sequence.
2. A method for packet fault tolerance delimitation based on protocol natural redundancy according to claim 1, characterized in that: Step 2 specifically includes: The correlation coefficient between the fixed field and the current fixed field observation vector is calculated. When the correlation coefficient is greater than the set threshold, the position of the last bit of the current fixed field observation vector is taken as a suspected starting boundary and added to the rough delimitation result sequence.
3. A method for packet fault tolerance delimitation based on protocol natural redundancy according to claim 1, characterized in that: Calculate from g1 to g a Then to g b The path accumulation metrics based on the natural redundancy of the protocol for the constructed path specifically include: in, k is a fixed field, u a For group Pkt a→b The inferred length field is taken from g b -g a Size determination, R k and R u The fixed field k and the length field u are a A 0 / 1 random field with the same dimension. is a single-step metric, M 1→a From node g1 to node g a The cumulative metric of the path.
4. The method for packet fault tolerance delimitation based on protocol natural redundancy according to claim 1, characterized in that: Also includes: If the redundant field type existing in the protocol stack used by the transmitting and receiving ends for communication includes a repeated field, then according to the packet boundary sequence output in step 4, the repeated field observation vector of each packet is extracted to form a repeated field observation vector sequence; Estimating a hard decision result of the repeated field according to the repeated field observation vector sequence; Add the hard decision result of the repeated field to the original fixed field sequence to obtain a new fixed field sequence; The path search is performed again according to the new fixed field sequence, and the group boundary sequence obtained by this path search is used as the final group boundary sequence.
Citation Information
Patent Citations
Low-complexity QAM-MIMO detection method based on differential degree
CN108449120A
Binary protocol message boundary division method in cloud environment
CN117459438A
