KR20230047926A - Method and apparatus for managing data information for fast data retransmission - Google Patents

Abstract

Provided are a method and a device for managing data information for fast data retransmission. If a packet to be transmitted arrives, the device stores the information of the packet in a data buffer, wherein the data buffer includes at least one packet block information unit and is composed in the form of a linked list having the packet block information unit as a node, and the packet block information unit includes a plurality of elements. If a feedback message is received from a receiver after the transmission of the packet, the device checks, from the feedback message, whether the transmission of the packet is successful, and updates the information of the packet stored in the data buffer for the packet of which the transmission is confirmed to be successful.

Description

Method and apparatus for managing data information for fast data retransmission

The present disclosure relates to a data information management method, and more particularly, to a data information management method and apparatus for high-speed data retransmission.

In order to overcome a transmission error of a radio section channel in a wireless access system, not only HARQ (Hybrid Automatic Repeat and Request) is used, but also an ARQ function in units of packets is supported through a radio link protocol. In the ARQ scheme, the transmitting side assigns a sequence number (SN) to each packet and transmits them, and the receiving side feeds back SN information of successfully received packets and SN information of unsuccessfully received packets to the transmitting side. The sending side must store the packet in the buffer until the successful reception of the transmitted packet is confirmed, and based on the SN information of the successfully received packet and the SN information of the unsuccessfully received packet, which are fed back from the receiving side, it is determined whether or not to retransmit the packet. As a result of the judgment, packets that have been successfully transmitted are deleted from the buffer and packets that have failed are retransmitted.

In this ARQ transmission, an RLC Status (Status) PDU is used as a feedback message in the 3GPP 5G new radio (NR) radio link control (RLC) protocol. In an environment that provides a giga-class data transmission speed, thousands or tens of thousands of packets may occur in the sending side when a Status PDU is received. Processing thousands or tens of thousands of packets within a limited time is difficult with conventional methods. In reality, the channel state is variable, and the status PDU transmission interval may be hundreds of ms in some cases. As the status PDU transmission interval becomes longer, the number of packets to be processed may increase by a factor of that.

An object of the present disclosure is to provide a method and apparatus for managing packet information capable of performing data transmission at high speed by reducing the time required for processing packet information.

According to an embodiment, a data information management method is provided. The method includes, by a management device, storing information of the packet in a data buffer when a packet to be transmitted arrives, wherein the data buffer includes at least one packet block information unit, and the packet block information unit is stored as a node. It is made in the form of a linked list having, wherein the packet block information unit includes a plurality of elements; checking, by the management device, whether packet transmission is successful from the feedback message when a feedback message is received from a receiving side after the packet is transmitted; and updating information of the packet stored in the data buffer for the packet confirmed to be transmitted successfully.

In one implementation, the storing in the data buffer may include: checking the number of empty elements of the last packet block information unit of the data buffer; and if the number of empty elements is not 0, storing the information of the packet in an element having the lowest index among empty elements of the last packet block information unit.

In one implementation, the storing in the data buffer includes generating a new packet block information unit when the number of empty elements is 0, and linking the new packet block information unit to the last packet block information unit. step; and storing the information of the packet in an element having the lowest index among elements of the new packet block information unit.

In one implementation, the data buffer may include a mask field including a plurality of bits, and each bit of the mask field may indicate transmission status information indicating success or failure of transmission of a packet in which information is stored in a corresponding location.

In one implementation, updating the information of the packet may include updating a value of a bit corresponding to the packet confirmed to have been transmitted successfully in a mask field of the data buffer.

In one implementation, in the step of updating the value of the bit corresponding to the packet identified as successful transmission, if the packet identified as successful transmission is two or more consecutive packets, the sequence identified as successful transmission in the mask field. Through the process of updating the value of bits corresponding to the packets, the information of the consecutive packets can be updated at once without a separate search process.

In one implementation, each bit of the mask field of the data buffer may be basically recorded as a first value indicating transmission failure of the corresponding packet. In this case, the step of updating the value of the bit corresponding to the packet identified as successful transmission may include, in the mask field, a first value of a bit corresponding to the packet identified as successful transmission, indicating that the corresponding packet has been successfully transmitted. It may include updating to the second value indicated.

In one implementation, after the step of checking whether the transmission of the packet is successful, for the packet confirmed to be transmission failure, calculating a reference index; The method may further include acquiring information of the packet identified as the transmission failure by searching for an element having the reference index among elements of the packet block information unit of the data buffer.

In one implementation, the data buffer includes an initial transmission information field including information on a first transmitted packet and a last transmission information field including information on a last transmitted packet, wherein the first transmission information field includes the first transmission information field. It includes a start index, which is an index of an element in which the first transmitted packet is stored, and a start sequence number, which is a sequence number of the first transmitted packet, and the last information transmission field is an index of an element in which the last transmitted packet is stored. It may include an index and an end sequence number, which is the sequence number of the last transmitted packet.

In one implementation, the reference index may be a value obtained by subtracting the starting sequence number from the sequence number of the packet identified as the transmission failure.

In one implementation, the calculating of the reference index may include calculating the reference index when the sequence number of the packet identified as the transmission failure is between the start index and the end sequence number.

In one implementation, the method may further include performing retransmission of the packet identified as transmission failure based on information on the packet identified as transmission failure. Here, the information of the packet includes a memory address where the packet is stored and a memory address where the packet information is stored, and the information of the packet optionally includes the arrival time of the packet, the length of the packet, and the sequence number of the packet. , packet transmission status information, and an index of an element in which information is stored.

According to another embodiment, a data information management device is provided. The apparatus includes a packet buffer in which packets to be transmitted are stored; A data buffer for storing packet information - the data buffer includes at least one packet block information unit and is formed in the form of a linked list having the packet block information unit as a node, wherein the packet block information unit includes a plurality of elements contains -; a feedback receiving processing unit configured to receive a feedback message from a receiving side for the transmitted packet; and when a packet to be transmitted arrives in the packet buffer, the information of the packet is stored in the data buffer, whether the transmission of the packet is successful or not is checked from the feedback message, and for the packet confirmed as transmission success, the data buffer and an information processing unit configured to update information of the stored packet.

In one implementation, the information processing unit specifically checks the number of empty elements of the last packet block information unit of the data buffer when performing an operation of storing the information of the packet in the data buffer; if the number of empty elements is not 0, store information of the packet in an element having the lowest index among empty elements of the last packet block information unit; if the number of empty elements is 0, create a new packet block information unit, and link the new packet block information unit to the last packet block information unit in the data buffer; And it may be configured to store the information of the packet in an element having the lowest index among elements of the new packet block information unit.

In one implementation, the data buffer may include a mask field including a plurality of bits, and each bit of the mask field may indicate transmission status information indicating success or failure of transmission of a packet in which information is stored in a corresponding location.

In one implementation, the data buffer includes an initial transmission information field including information on a first transmitted packet and a last transmission information field including information on a last transmitted packet, wherein the first transmission information field includes the first transmission information field. It includes a start index, which is an index of an element in which the first transmitted packet is stored, and a start sequence number, which is a sequence number of the first transmitted packet, and the last information transmission field is an index of an element in which the last transmitted packet is stored. It may include an index and an end sequence number, which is the sequence number of the last transmitted packet.

In one implementation, the data buffer may further include an empty index field including the smallest index of empty elements among elements of the packet block information unit and an empty number field including the number of empty elements. .

In one implementation, when the information processing unit performs the operation of updating the information of the packet, in the mask field of the data buffer, the value of the bit corresponding to the packet confirmed as successful transmission is set to a first value, and the corresponding packet is transmitted. It may be configured to update to a second value indicating success. Here, when the packets identified as successful transmission are two or more consecutive packets, through a process of updating the values of bits corresponding to the consecutive packets identified as successful transmission in the mask field, Information can be updated at once without a separate search process.

In one implementation, the information processing unit further calculates a reference index for a packet identified as transmission failure, and searches from among elements having the reference index among elements of a packet block information unit of the data buffer, It may be configured to obtain information of packets identified as transmission failures.

In one implementation, the apparatus may further include a transmission processing unit configured to perform retransmission of the packet identified as transmission failure based on information on the packet identified as transmission failure, wherein the reference index is the transmission failure. It may be a value obtained by subtracting the starting sequence number from the sequence number of a packet identified as failure.

According to embodiments, in an environment of transmitting a high-speed data stream, high-speed data retransmission processing is performed by providing a data buffer that efficiently stores information of transmitted packets and storing and managing the transmitted information based on the data buffer. possible.

In particular, since information update processing is performed at one time for successive packets identified as ACK based on the mask field of the data buffer, processing time can be reduced. In addition, since information of a packet identified by NACK can be found more quickly, high-speed data retransmission can be performed.

1 is a diagram illustrating a format of a feedback message.
2 is a diagram showing the structure of a data buffer for data information management according to an embodiment of the present disclosure.
3 is a diagram showing the structure of a data information management device according to an embodiment of the present disclosure.
4 is a flowchart of a data information management method according to an embodiment of the present disclosure.
5A and 5B are other flowcharts of a data information management method according to an embodiment of the present disclosure.
6 is an exemplary view illustrating information update of a packet of a data buffer according to an embodiment of the present disclosure.
7 is an exemplary diagram illustrating a process of deleting a data buffer according to an embodiment of the present disclosure.
8 is a structural diagram illustrating a computing device for implementing a method according to an embodiment of the present disclosure.

Hereinafter, with reference to the accompanying drawings, embodiments of the present disclosure will be described in detail so that those skilled in the art can easily carry out the present disclosure. However, the present disclosure may be implemented in many different forms and is not limited to the embodiments described herein. And in order to clearly describe the present disclosure in the drawings, parts irrelevant to the description are omitted, and similar reference numerals are attached to similar parts throughout the specification.

Throughout the specification, when a certain component is said to "include", it means that it may further include other components without excluding other components unless otherwise stated.

Expressions written in the singular in this specification may be interpreted in the singular or plural unless an explicit expression such as “one” or “single” is used.

Also, terms including ordinal numbers such as first and second used in the embodiments of the present disclosure may be used to describe components, but components should not be limited by the terms. Terms are used only to distinguish one component from another. For example, a first element may be termed a second element, and similarly, a second element may be termed a first element, without departing from the scope of the present disclosure.

Also in the present specification, "A or B", "at least one of A and B", "at least one of A or B", "A, B or C", "at least one of A, B and C", and " Each of the phrases such as “at least one of A, B, or C” may include any one of the items listed together in that phrase, or all possible combinations thereof.

Hereinafter, a data information management method and apparatus for data retransmission according to an embodiment of the present disclosure will be described with reference to the drawings.

1 is a diagram illustrating a format of a feedback message.

In ARQ Automatic Repeat and request) transmission, an RLC Status PDU is used as a feedback message in the 3GPP 5G new radio (NR) radio link control (RLC) protocol. 1 shows a format of a Status PDU in the case of using an 18-bit sequence number (SN).

In the Status PDU of FIG. 1, ACK_SN represents the largest SN including acknowledgment (ACK) or negative acknowledgment (NACK) information. The transmitting side recognizes that the status PDU includes feedback information about packets with SN smaller than ACK_SN. That is, it recognizes that the received Status PDU is feedback information for packets prior to ACK_SN. Subsequently, NACK_SN information may be included, and among packets having an SN smaller than ACK_SN, only NACK packet information is delivered. NACK information can be represented by NACK_range so that consecutive NACK_SNs can be expressed at once. SOstart and SOend fields may be used to include NACK information of a segmented packet, that is, an SDU segment.

Based on the information included in the Status PDU, the sender processes the information of the failed packet and regards all remaining packets (packets with SN smaller than ACK_SN) as ACK-received packets. In FIG. 1 , when the E1 field is 1, it indicates that the next NACK information (including NACK_SN, E1, E2, and E3) is subsequently included. If the E1 field is 0, it means the end of the Status PDU without any more NACK information. The E2 field and the E3 field respectively indicate whether the SOstart/SOend field and the NACK range field are subsequently included. As NACK information at the receiving side, NACK_SN and SOstart/SOend should be sequentially inserted.

For high-speed data transmission, the size of a transport block (TB) (or medium access control (MAC) packet data unit (PDU)) increases and the number of packets (RLC PDUs) that can be transmitted in one TB increases. Accordingly, the number of packets for which ACK or NACK must be processed when a Status PDU is received has also significantly increased. Therefore, in an environment that provides a giga-class data transmission speed, thousands or tens of thousands of packets may occur in the transmitting side when a status PDU is received. For example, RLC setting parameters (eg, a reassemble timer, etc.) are set in consideration of HARQ retransmission delay, and at this time, Status PDUs may be delivered at intervals of several tens of ms.

In the case of a radio access system protocol, there may be time critical functional blocks and non-time critical functional blocks according to their functions. The RLC protocol block and the MAC function block, which are in charge of the traffic transmission function, must perform their functions in physical synchronization for each slot (or TTI (Transmission Time Interval)) together with the PHY (Physical) layer block. Although the execution time of the software block including the ARQ function may vary depending on the performance of the hardware on which the protocol is mounted, in the case of a system with a short slot length such as mmWave, it is very difficult to process thousands or tens of thousands of packets within the limited time. difficult. The channel state is variable, and the transmission interval of the Status PDU may be hundreds of ms depending on the case. As the transmission interval of the Status PDU becomes longer, the number of packets to be processed may increase by a factor of that.

An embodiment of the present disclosure provides a method and apparatus for managing and processing packet-related data information for high-speed data ARQ retransmission.

2 is a diagram showing the structure of a data buffer for data information management according to an embodiment of the present disclosure.

In an embodiment of the present disclosure, a data buffer as shown in FIG. 2 is used to manage and process packet-related data information for high-speed data ARQ retransmission.

When a packet to be transmitted arrives, the data buffer 10 sequentially stores and manages packet information, and is also called an SDUBLK buffer. The data buffer 10 includes a packet block information unit (U) for storing information of packets. The packet block information unit (U) is also named SDUBlockInfo. The packet block information unit (U) includes an element (also named information element) for storing information of a packet, and the information element is also named SDUInfo. That is, SDUBlockInfo, which is a packet block information unit (U), includes N pieces of SDUInfo, and the N pieces of SDUInfo are included in an array form. For example, SDUInfo[0] to SDUInfo[N-1] are included in an array form, and this array is also called an SDUInfo array, and SDUInfo, which is packet information, is stored in N elements constituting the SDUInfo array.

The data buffer 10 of the present disclosure is a linked list having a packet block information unit (U), that is, SDUBlockInfo as a node. Specifically, the data buffer 10 includes a plurality of SDUBlockInfo, and each SDUBlockInfo functions as one node and is a linked list in which these SDUBlockInfos are sequentially connected. In FIG. 2, the data buffer 10 is implemented in the form of a linked list including three SDUBlockInfo (three SDUInfo arrays) (U1 to U3), and the SDUInfo array constituting each SDUBlockInfo includes 5 elements as an example. and the present disclosure is not limited thereto.

On the other hand, SDUBlockInfo (U), which is a packet block information unit, includes a mask field identifying state information of a packet. Specifically, the mask field is also referred to as the FBmask field, and the FBmask field is composed of N bits, and each 1 bit represents status information of a packet, that is, whether the packet is successfully transmitted or not. When this 1-bit information is, for example, "0", it indicates that the transmission of the corresponding packet was successful, and when it is "1", it indicates that the transmission of the corresponding packet was not successful. The nth bit among N bits in the FBmask field represents packet status information of the nth SDUInfo among SDUInfos included in SDUBlockInfo(U).

SDUBlockInfo (U) may also include the following information.

- Start index/start SN: Start index is also called the start index, which indicates the index of the SDUInfo array in which the first transmitted packet is stored among the packets stored in SDUBlockInfo. The start SN is also referred to as the start sequence number, and represents the sequence number (SN) of the first transmitted packet.

- End index/end SN: End index is also called end index, which indicates the index of the SDUInfo array in which packet information of the last transmitted packet among the packets stored in SDUBlockInfo is stored. The end SN is also called the end sequence number, and indicates the sequence number of the last transmitted packet.

- Next index: Next index is also called the next index, which indicates the smallest index of an empty SDUInfo element in the SDUInfo array in SDUBlockInfo. For example, it indicates the index of an empty SDUInfo element (U3_E2) among the elements of the third SDUInfo array (U3) among the three SDUInfo arrays of FIG.

- Empty num: Also named as the number of empty elements, which indicates the number of empty SDUInfo elements in the SDUInfo array in SDUBlockInfo.

Such information may be stored for each field of SDUBlockInfo(U). In this case, SDUBlockInfo (U) includes FBmask field (also named mask field), Start index/start SN field (also named first transmission information field), End index/end SN field (also named last transmission information field), It may include a Next index field (also named an empty index field) and an Empty num field (also named an empty count field).

Meanwhile, SDUInfo, which is each element in the SDUInfo array of SDUBlockInfo (U), stores specific information of a packet, and the stored information may include the following information.

- packet arrival time

- packet length

- sequence number of the packet

- Packet transmission status information (NO TX, NO RX, ACK, NACK, pNACK, etc.)

- Physical memory address where the packet is stored

- The index of the element in the SDUInfo array where the information of the packet is stored

- Memory address where SDUBlockInfo is stored

As described above, in the embodiment of the present disclosure, information of a transmitted packet is managed using the data buffer 10, which is a linked list having SDUBlockInfo as a node.

3 is a diagram showing the structure of a data information management device according to an embodiment of the present disclosure.

As shown in FIG. 3, the data information management apparatus 1 according to an embodiment of the present disclosure includes a data buffer 10, a packet buffer 20, and an information processing unit 30, and includes a transmission processing unit 40 and feedback reception. It includes a processing unit (50).

The data buffer 10, as described above, is a linked list having SDUBlockInfo as a node, and is configured to store information of packets.

The packet buffer 20 is a buffer in which packets to be transmitted are stored.

When a packet to be transmitted arrives (for example, when the packet to be transmitted is stored in the packet buffer 20), the information processing unit 30 is configured to store the information of the corresponding packet in the data buffer 10. Also, the information processing unit 30 is configured to update information about packets that have already been processed and stored in the data buffer 10 based on the information of the feedback message received by the feedback receiving processing unit 40 .

The transmission processing unit 40 is configured to perform packet transmission processing, and is also configured to perform packet retransmission processing.

The feedback receiving processing unit 50 is configured to receive a feedback message for the transmitted packet from a receiving side. The feedback message may be configured in a format as shown in FIG. 1 .

Based on the data information management device having this structure, a data information management method according to an embodiment of the present disclosure will be described.

4, 5a and 5b are flowcharts of a data information management method according to an embodiment of the present disclosure.

Here, for convenience of explanation, the data information management method will be described by taking the data buffer 10 according to the embodiment of the present disclosure having the structure shown in FIG. 2 as an example. In FIG. 2, three SDUBlockInfo (U1 to U3) are included in the data buffer 10 in the form of a linked list, and each SDUBlockInfo includes 5 SDUInfo elements (eg, SDUInfo[0] to SDUInfo[4]). , and only one packet information is stored in SDUBlockInfo (U3), the last node, and four SDUInfo are empty. SDUBlockInfo (U3), which is the last node, is also named tail. In FIG. 2, for example, packets with sequence numbers N to N+6 are transmitted only once, and among the transmitted packets, N+ A case in which only the first packet receives an ACK is exemplified.

First, a data information management method according to packet transmission will be described based on FIG. 4 .

As shown in FIG. 4, when a packet to be transmitted arrives (S100), the data information management device 1 stores the information of the corresponding packet in the data buffer 10.

Specifically, the data information management device 1 checks the number of empty elements of the last node of the data buffer 10 (S110). For example, among the fields of SDUBlockInfo (U3), which is the last node in the data buffer 10 of FIG. 2, an Empty num field is checked to check the number of empty elements of SDUBlockInfo (U3).

If the number of empty elements in SDUBlockInfo, which is the last node, is not "0", the data information management device 1 sends the packet to be transmitted to the SDUInfo element having the smallest index among the empty elements of SDUBlockInfo, which is the last node. Stores the information SDUInfo of (S120, S130). For example, in the data buffer 10 of FIG. 2, an index is obtained by checking the Next index field among the fields of SDUBlockInfo (U3), which is the last node, and corresponds to the obtained index among empty elements of SDUBlockInfo (U3). SDUInfo information of a packet to be transmitted is stored in an element corresponding to the smallest index among empty SDUInfo elements.

In this way, after storing the information of the packet to be transmitted in the data buffer 10, the data information management device 1 updates the information of SDUBlockInfo in which the information of the packet is stored (S140). For example, in FIG. 2, the next index of the Next index field of SDUBlockInfo (U3), which is the last node where the packet to be transmitted is stored, is increased by 1, and empty num of the Empty num field is decreased by 1.

On the other hand, if the number of empty elements of the last node of the data buffer 10 is "0" in step S130, a new SDUBlockInfo node is created (S150), and among the elements constituting the newly created new SDUBlockInfo, the most In an element having a low index, information of a packet to be transmitted is stored (S160). For example, in FIG. 2, if the number of empty elements of SDUBlockInfo (U3), which is the last node, is “0”, a new SDUBlockInfo (U4) (not shown) is additionally created and connected to SDUBlockInfo (U3) , In the SDUInfo element (eg, SDUInfo[0]) having the lowest index of SDUBlockInfo (U4), information on a packet to be transmitted is stored.

Through these steps, the information of the packet to be transmitted is stored and managed in the data buffer 10 .

Next, based on FIGS. 5A and 5B, a data information management method performed when a feedback message is received from a receiver after packet transmission will be described.

As shown in FIG. 5A, when a packet is transmitted from the transmitting side to the receiving side and a feedback message is received, the data information management device 1 updates information of the transmitted packet corresponding to the feedback message.

When a feedback message, that is, a Status PDU is received from the receiving side (S300), the data information management device 1 identifies a sequence number of a packet from the Status PDU (S310), and determines whether the transmission of the packet having the identified sequence number is successful or not. Check (S320).

After confirming whether the transmission of the packet was successful, the state information of the packet confirmed as successful transmission is updated. Specifically, the FB ask field (mask field) of SDUBlockInfo in which the corresponding packet is stored is updated. That is, among the bits of the FB mask field, the status information is updated by processing the bit corresponding to the packet identified as successful transmission, that is, ACK, from the Status PDU as “0” (S330 and S340).

6 is an exemplary view illustrating information update of a packet of a data buffer according to an embodiment of the present disclosure.

For example, when successive packets with SN of y are identified as ACK from a packet with SN of x+2, as shown on the right side of FIG. 6, all bits at corresponding positions in the FB mask field are set to “0” On the other hand, each bit of the FB mask field is basically set to "1", for example, to record that the transmission of the corresponding packet was not successful, and after receiving the feedback message, the transmission is successful If confirmed, it may be updated to “0” as described above. Of course, the present disclosure is not limited to this.

Through this process, when the packets identified by ACK are consecutive packets, the process ends by updating the FB mask field in SDUBlockInfo once. In other words, for n consecutive packets identified by ACK, n times of updating process of finding SDUInfo in SDUBlockInfo and updating SDUInfo information respectively is omitted. Therefore, processing time can be reduced.

On the other hand, for packets confirmed as transmission failure, SDUInfo of the corresponding packet is found, information is updated, and retransmission is prepared. In step S330, for a packet identified as transmission failure, that is, NACK, from the Status PDU, SDUInfo of the corresponding packet is searched based on the SN of the corresponding packet.

As shown in FIG. 5B, the data information management device 1 compares the SN of the packet identified as NACK from the Status PDU with the start index and end sequence number of SDUBlockInfo of the data buffer 10. Specifically, the start index, that is, Start index (the index of the SDUInfo array in which the first transmitted packet is stored) is obtained from the Start index/start SN field of SDUBlockInfo, and the end sequence number, that is, end SN ( The SN of the last first transmitted packet is obtained (S350) and compared with the SN of the packet identified as NACK (S360).

If the SN of the packet identified as NACK is a value between the start index and the end SN, a reference index is calculated among elements of the SDUInfo array in SDUBlockInfo, and SDUInfo of an element corresponding to the reference index is searched (S370 to S390). Here, it is calculated based on reference index = (SN of the packet identified as NACK - start SN).

The data information management device 1 may more quickly find SDUInfo of a packet identified as NACK by searching for an element corresponding to a reference index instead of searching for all elements of the SDUInfo array in SDUBlockInfo.

Thereafter, the data information management device 1 performs retransmission processing based on the SDUInfo information of the packet identified as NACK (S400). To this end, the information processing unit 30 transfers SDUInfo information (eg, the actual memory address where the packet is stored) of the packet identified as NACK to the transmission processing unit 40, and the transmission processing unit 40 transmits the packet buffer In (20), a retransmission process for the packet stored in the corresponding memory address is performed.

On the other hand, in step S370, if the SN of the packet identified as NACK is not a value between the start index and the end SN, the data information management device 1 includes the corresponding SDUBlockInfo in the corresponding packet (having an SN to be processed as NACK) packet) is assumed to be missing. Thereafter, the data information management device 1 returns to step S350 to acquire the start index and end SN of SDUBlockInfo next stored in the data buffer 10 and repeats subsequent steps.

On the other hand, the data information management device 1 deletes the packets corresponding to the corresponding SDUBlockInfo from the packet buffer 20 when all packets in the SDUBlockInfo of the data buffer 10 succeed in transmission, and in the data buffer 10 Remove the corresponding SDUBlockInfo.

7 is an exemplary diagram illustrating a process of deleting a data buffer according to an embodiment of the present disclosure.

For example, as illustrated in FIG. 7, in the data buffer 10 having the same structure as in FIG. 2, when it is confirmed that all packets corresponding to SDUBlockInfo(U1) have been successfully transmitted, SDUBlockInfo(U1) is deleted. Accordingly, the head of the data buffer 10 is changed to SDUBlockInfo (U2).

As described above, in the case of a high-speed data stream, the number of packets to be processed when a Status PDU is received may range from thousands to tens of thousands. In this case, since the pattern of ACK and NACK occurrence tends to appear in the form of a block (consecutive ACK packets or consecutive NACK packets), and an adaptive transmission technique according to the channel condition is generally used, ACK is more efficient than NACK. The block size is large and the frequency is high. Therefore, according to an embodiment of the present disclosure, when the packets identified by ACK are consecutive packets, the process is terminated by updating the FB mask field in SDUBlockInfo once, thereby If the size is large enough, processing time can be reduced proportionally. In addition, since SDUInfo of a packet identified as NACK can be found more quickly, high-speed data retransmission can be performed.

Nevertheless, if the NACK frequency is also high, the load can be controlled by storing Status PDU information, completing transmission of the next slot, and processing the remaining NACK packets. At this time, load control can be performed by storing the identifier of the first Status PDU and the index of the last NACK element (IE) processed in the Status PDU.

This embodiment of the present disclosure is applied when implementing the L2 protocol in a wireless access system, and provides an efficient method for processing a data buffer structure and an ARQ operation, thereby enabling high-speed data service.

8 is a structural diagram illustrating a computing device for implementing a method according to an embodiment of the present disclosure.

As illustrated in FIG. 8 , the method (data information management method) according to an embodiment of the present disclosure may be implemented using the computing device 100 .

The computing device 100 may include at least one of a processor 110, a memory 120, an input interface device 130, an output interface device 140, a storage device 150, and a network interface device 160. . Each component may be connected by a bus 170 to communicate with each other. In addition, each of the components may be connected through individual interfaces or individual buses centering on the processor 110 instead of the common bus 170 .

The processor 110 may be implemented in various types such as an application processor (AP), a central processing unit (CPU), a graphic processing unit (GPU), and the like, and executes commands stored in the memory 120 or the storage device 150. It may be any semiconductor device that The processor 110 may execute a program command stored in at least one of the memory 120 and the storage device 150 . Such a processor 110 may be configured to implement the functions and methods described above based on FIGS. 1 to 7 . For example, the processor 110 may be implemented to perform the function of an information processing unit.

The memory 120 and the storage device 150 may include various types of volatile or non-volatile storage media. For example, the memory may include read-only memory (ROM) 121 and random access memory (RAM) 122 . In an embodiment of the present disclosure, the memory 120 may be located inside or outside the processor 110, and the memory 120 may be connected to the processor 110 through various known means. The memory 120 and/or the storage device 150 may be configured to perform functions of a data buffer and a packet buffer, as an example of implementation.

Input interface device 130 is configured to provide data to processor 110 , and output interface device 140 is configured to output data from processor 110 .

The network interface device 160 may transmit or receive signals with other devices through a wired network or a wireless network. For example, the network interface device 160 may be configured to perform functions of a transmission processing unit and a feedback reception processing unit.

The input interface device 130 , the output interface device 140 , and the network interface device 160 may be collectively referred to as “interface devices”.

The computing device 100 having such a structure is called a data information management device and can implement the above methods according to an embodiment of the present disclosure.

In addition, at least some of the methods according to an embodiment of the present disclosure may be implemented as a program or software executed on the computing device 100, and the program or software may be stored in a computer-readable medium.

In addition, at least some of the methods according to an embodiment of the present disclosure may be implemented as hardware that can be electrically connected to the computing device 100 .

Embodiments of the present disclosure are not implemented only through the devices and/or methods described above, and may be implemented through a program for realizing functions corresponding to the configuration of the embodiments of the present disclosure, a recording medium on which the program is recorded, and the like. Also, such an implementation can be easily implemented by an expert in the art to which the present disclosure belongs based on the description of the above-described embodiment.

Although the embodiments of the present disclosure have been described in detail above, the scope of the present disclosure is not limited thereto, and various modifications and improvements of those skilled in the art using the basic concepts of the present disclosure defined in the following claims are also included in the present disclosure. that fall within the scope of the right.

Claims (20)

As a data information management method,
When a packet to be transmitted arrives, by a management device, storing information of the packet in a data buffer, wherein the data buffer includes at least one packet block information unit, and a linked list having the packet block information unit as a node It is made in the form, wherein the packet block information unit includes a plurality of elements;
checking, by the management device, whether the transmission of the packet is successful from the feedback message when a feedback message is received from a receiving side after the packet is transmitted; and
Updating information of the packet stored in the data buffer for the packet confirmed as successful transmission.
A management method comprising a. According to claim 1
Storing the data in the buffer
checking the number of empty elements of the last packet block information unit of the data buffer; and
If the number of empty elements is not 0, storing information of the packet in an element having the lowest index among empty elements of the last packet block information unit.
Including, management method. According to claim 2
The step of storing in the data buffer,
if the number of empty elements is 0, generating a new packet block information unit and linking the new packet block information unit to the last packet block information unit; and
storing information of the packet in an element having the lowest index among elements of the new packet block information unit;
Further comprising a, management method. According to claim 1
The data buffer includes a mask field including a plurality of bits, and each bit of the mask field indicates transmission status information indicating whether transmission success of a packet storing information in a corresponding location is successful. According to claim 4
Updating the information of the packet,
In the mask field of the data buffer, updating a value of a bit corresponding to the packet confirmed as successful transmission.
Including, management method. According to claim 5
In the step of updating the value of the bit corresponding to the packet confirmed by the transmission success,
When the packets identified as successful transmission are two or more consecutive packets, information on the consecutive packets is obtained through a process of updating the values of bits corresponding to the consecutive packets identified as successful transmission in the mask field. A management method that is updated at once, without a separate search process. According to claim 4
Each bit of the mask field of the data buffer is basically recorded as a first value indicating that the transmission of the corresponding packet has failed,
Updating the value of the bit corresponding to the packet confirmed as successful transmission,
In the mask field, updating a first value of a bit corresponding to the packet confirmed as successful transmission to a second value indicating that the corresponding packet is successfully transmitted.
Including, management method. According to claim 1
After the step of checking whether the transmission of the packet was successful,
Calculating a reference index for packets identified as transmission failures;
Searching for the element having the reference index among the elements of the packet block information unit of the data buffer to obtain information of the packet identified as the transmission failure.
A management method further comprising a. According to claim 8
The data buffer includes a first transmission information field containing information on a first transmitted packet and a last transmission information field including information on a last transmitted packet,
The first transmission information field includes a start index, which is an index of an element in which the initially transmitted packet is stored, and a start sequence number, which is a sequence number of the first transmitted packet;
The last information transmission field includes an end index, which is an index of an element in which the last transmitted packet is stored, and an end sequence number, which is a sequence number of the last transmitted packet. According to claim 9
The reference index is a value obtained by subtracting the starting sequence number from the sequence number of the packet identified as the transmission failure. According to claim 9
Calculating the reference index,
The management method of calculating the reference index when the sequence number of the packet identified as the transmission failure is a value between the start index and the end sequence number. According to claim 8
Performing retransmission of the packet identified as transmission failure based on information on the packet identified as transmission failure
Including more,
The information of the packet includes a memory address where the packet is stored and a memory address where the packet information is stored. Optionally, the information of the packet includes the arrival time of the packet, the length of the packet, the sequence number of the packet, and the packet information. Further comprising at least one of transmission state information of and an index of an element in which information is stored, the management method. As a data information management device,
A packet buffer in which packets to be transmitted are stored;
A data buffer for storing packet information - the data buffer includes at least one packet block information unit, and is formed in the form of a linked list having the packet block information unit as a node, wherein the packet block information unit includes a plurality of elements contains -;
a feedback receiving processing unit configured to receive a feedback message from a receiving side for the transmitted packet; and
When a packet to be transmitted arrives in the packet buffer, information on the packet is stored in the data buffer, whether or not packet transmission is successful is checked from the feedback message, and for packets confirmed as transmission success, stored in the data buffer Information processing unit configured to update information of the packet
A management device comprising a. According to claim 13
The information processing unit specifically,
When performing the operation of storing the information of the packet in the data buffer,
check the number of empty elements of the last packet block information unit of the data buffer;
if the number of empty elements is not 0, store information of the packet in an element having the lowest index among empty elements of the last packet block information unit;
if the number of empty elements is 0, create a new packet block information unit, and link the new packet block information unit to the last packet block information unit in the data buffer; and
and store information of the packet in an element having a lowest index among elements of the new packet block information unit. According to claim 13
The data buffer includes a mask field including a plurality of bits, and each bit of the mask field indicates transmission status information indicating whether transmission success of a packet in which information is stored in a corresponding location is successful. According to claim 15
The data buffer includes a first transmission information field containing information on a first transmitted packet and a last transmission information field including information on a last transmitted packet,
The first transmission information field includes a start index, which is an index of an element in which the initially transmitted packet is stored, and a start sequence number, which is a sequence number of the first transmitted packet;
The last information transmission field includes an end index, which is an index of an element in which the last transmitted packet is stored, and an end sequence number, which is a sequence number of the last transmitted packet. According to claim 15,
wherein the data buffer further comprises an empty index field containing a smallest index of empty elements among elements of the packet block information unit and an empty number field containing the number of the empty elements. According to claim 15
When the information processing unit performs an operation of updating information of the packet,
In the mask field of the data buffer, the value of the bit corresponding to the packet confirmed as successful transmission is configured to update from a first value to a second value indicating that the corresponding packet is successfully transmitted,
When the packets identified as successful transmission are two or more consecutive packets, information on the consecutive packets is obtained through a process of updating the values of bits corresponding to the consecutive packets identified as successful transmission in the mask field. A management device that is updated at once without a separate search process. According to claim 16
The information processing unit further calculates a reference index for a packet identified as transmission failure, searches for an element having the reference index among elements of a packet block information unit of the data buffer, and identifies the transmission failure. A management device, configured to obtain information of a packet to be configured. According to claim 19
A transmission processing unit configured to retransmit the packet identified as transmission failure based on information on the packet identified as transmission failure.
Including more,
The reference index is a value obtained by subtracting the starting sequence number from the sequence number of the packet identified as the transmission failure.

Images