CN117955926A - Millimeter wave data surface scheduling method, device and equipment - Google Patents

Millimeter wave data surface scheduling method, device and equipment Download PDF

Info

Publication number
CN117955926A
CN117955926A CN202410338307.6A CN202410338307A CN117955926A CN 117955926 A CN117955926 A CN 117955926A CN 202410338307 A CN202410338307 A CN 202410338307A CN 117955926 A CN117955926 A CN 117955926A
Authority
CN
China
Prior art keywords
data
queue
empty
management frame
head
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202410338307.6A
Other languages
Chinese (zh)
Inventor
何宝东
章亚伟
刘晶
龚贺
张百喆
黄诗扬
魏菁杨
姜宽
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Guangzhou Tianyi Technology Co ltd
Original Assignee
Guangzhou Tianyi Technology Co ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Guangzhou Tianyi Technology Co ltd filed Critical Guangzhou Tianyi Technology Co ltd
Priority to CN202410338307.6A priority Critical patent/CN117955926A/en
Publication of CN117955926A publication Critical patent/CN117955926A/en
Pending legal-status Critical Current

Links

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

The application provides a millimeter wave data surface scheduling method, a device and equipment, when data flow between a master station and a slave station is needed to be scientifically scheduled in a private network bridge system of a plurality of point-to-multipoint, if data slicing processing cannot be carried out, the method provided by the embodiment of the application can effectively realize the scientific scheduling of the data flow so as to better realize the data flow processing of respective service functions between the master station and the slave station in order to better process the data interaction between the master station and the slave station.

Description

Millimeter wave data surface scheduling method, device and equipment
Technical Field
The present application relates to the field of data processing technologies, and in particular, to a method, an apparatus, and a device for scheduling a millimeter wave data plane.
Background
Along with development of scientific technology, a large amount of data transmission services are required to be realized in the practical application process, and in a millimeter wave point-to-multipoint private protocol system, in order to realize the normal data transmission function of a closed system of a master station and a slave station, a private protocol stack needs to be developed pertinently, so that access, authentication and services only of network elements in the private protocol are ensured. The technology can be applied to application scenes such as video data backhaul of subways and base station data backhaul.
As a private protocol system, the processing of the data plane is a key feature, and the slicing function is a key feature that the processing of the data plane is not switched on. The slicing function refers to splitting a large data packet into small packets for transmission when the time slot resources in the TDMA system are insufficient to transmit the large data packet, so that the time slot resources can be better utilized; however, in the practical application process, sometimes, there is a case that the current time slot resource of the system cannot meet the requirement of sending a large data packet, and when the current time slot resource of the system cannot meet the requirement of sending the large data packet, non-fragmented data transmission is required. The non-slicing function refers to that when the system temporarily does not have a time slot meeting the requirement of transmitting a large data packet, the system waits for the next time slot to transmit the data packet again; both the fragmentation function and the non-fragmentation function are implemented and applied in proprietary protocols. The non-slicing function has the characteristics of simple scheduling and easy realization, and also has larger market space. In the practical application process, how to effectively complete the scientific scheduling of the data surface of the system without slicing is a concern.
Disclosure of Invention
The application aims to solve the problem of non-fragmented implementation flow in a closed system protocol, and in view of the problem, the application provides a millimeter wave data plane scheduling method, device and equipment, which are used for solving the technical defect that the data flow scheduling processing of a master station and a slave station of a bridge system is difficult in the prior art.
A millimeter wave data plane scheduling method, comprising:
When the scheduling time arrives, acquiring a scheduling time slot resource of a transmitting end of the point-to-multipoint system and a coding and modulation scheme adopted by current transmitted data;
Judging whether a control frame queue of the transmitting end is empty or not;
If the control frame queue is not empty, processing the control frame queue data according to a preset first data processing strategy;
If the control frame queue is empty, judging whether the management frame queue of the sending end is empty or not;
If the management frame queue is not empty, processing the data of the management frame queue according to the scheduling time slot resource of the transmitting end, the coding and modulation scheme adopted by the current transmitted data and a preset second data processing strategy until the management frame queue is empty;
if the management frame queue is empty, judging whether the aggregation link layer protocol data unit has a management frame, and if the aggregation link layer protocol data unit has the management frame, directly waiting for the next scheduling time;
If the aggregate link layer protocol data unit does not have a management frame, judging whether a retransmission queue is empty;
If the retransmission queue is not empty, sequentially taking out data packets from the head of the retransmission queue to form data information of a management frame and putting the data information into the aggregation link layer protocol data unit;
Judging whether the current remained allocated time slot resources are enough to bear the data information of a management frame formed by taking out data packets from the head of the retransmission queue;
If the current remained allocated time slot resources are not enough to bear the data information of the management frame formed by taking out the data packets from the head of the retransmission queue, the packet grouping operation is not carried out any more, and the next time of scheduling arrives.
Preferably, the method further comprises:
If the retransmission queue is empty, judging whether a new transmission data queue of the sending end is empty or not;
If the new transmission data queue is not empty, judging whether the current moment reaches a transmission window boundary or not;
if the current moment does not reach the boundary of the sending window, sequentially taking out data packets from the head of the new transmission data queue according to the head of the queue in the sending window and putting the data packets taken out from the head of the new transmission data queue into the aggregation link layer protocol data unit, wherein the data packets taken out from the head of the new transmission data queue are a complete load;
judging whether the current remained allocated time slot resources are enough to bear the data packet fetched from the head of the new transmission data queue;
If the currently remaining allocated time slot resources are enough to bear the data packet taken out from the queue head of the new transmission data queue, adding a queue head identifier in a sending window, putting the corresponding data packet into a transmission queue, and polling the queue head of the new transmission data queue to continuously take out the next data packet until the new transmission data queue is empty;
and if the new transmission data queue is empty, directly waiting for the arrival of the next scheduling moment.
Preferably, the method further comprises:
if the current remaining allocated time slot resources are not enough to bear the data packets taken out from the head of the new transmission data queue, no aggregation operation is carried out, and the next scheduling moment is waited for;
if the current time reaches the transmission window boundary, the aggregation operation is not performed, and the next scheduling time is waited for.
Preferably, the preset first data processing policy is:
Sequentially taking out the acknowledgement frame, the status report of the acknowledgement frame and the status report of the buffer zone in the control frame queue from the control frame queue respectively;
And aggregating the acknowledgement frame, the status report of the acknowledgement frame and the status report of the buffer area taken out of the control frame queue to form a data packet to be transmitted, and filling the data packet into the aggregated link layer protocol data unit until the control frame queue is empty.
Preferably, the preset second data processing strategy is:
Sequentially taking out data packets from the head of the management frame queue, wherein the data packets taken out from the head of the management frame queue are the data information of a complete management frame;
Judging whether the currently allocated time slot resources can bear the data packet taken out from the head of the management frame queue or not according to the currently remaining allocated time slot resources of the transmitting end;
If the currently allocated time slot resource can bear the data packet taken out from the head of the management frame queue, putting the data packet taken out from the head of the management frame queue into a transmitted message queue, and polling the head of the management frame queue to take out the next data packet or fragment until the management frame queue is empty;
If the currently allocated time slot resource cannot bear the data packet fetched from the head of the management frame queue, the next scheduling moment is directly waited.
Preferably, the method further comprises:
In the process of scheduling and distributing time slot resources, the time slot resources distributed for each slave station are required to meet the time slot resources capable of transmitting a complete data packet;
Wherein,
The time slot resource capacity required to send a complete packet is 1518 bytes.
A millimeter wave data plane scheduling device, comprising:
The acquisition unit is used for acquiring the scheduling time slot resources of the transmitting end of the point-to-multipoint system and the coding and modulation scheme adopted by the current transmitted data when the scheduling time arrives;
a first judging unit, configured to judge whether a control frame queue of the transmitting end is empty;
The first processing unit is used for processing the control frame queue data according to a preset first data processing strategy when the execution result of the first judging unit is that the control frame queue is not empty;
the second judging unit is used for judging whether the management frame queue of the sending end is empty or not when the execution result of the first judging unit is that the control frame queue is empty;
The second processing unit is used for processing the data of the management frame queue according to the scheduling time slot resource of the transmitting end, the coding and modulation scheme adopted by the current transmitting data and a preset second data processing strategy when the execution result of the second judging unit is that the management frame queue is not empty, until the management frame queue is empty;
a third judging unit, configured to judge whether a management frame exists in an aggregated link layer protocol data unit when an execution result of the second judging unit is that the management frame queue is empty, and if the management frame exists in the aggregated link layer protocol data unit, directly wait for a next scheduling time;
A fourth judging unit, configured to judge whether a retransmission queue is empty when an execution result of the third judging unit is that the aggregated link layer protocol data unit does not have a management frame;
The third processing unit is used for sequentially taking out data packets from the head of the retransmission queue to form data information of a management frame and putting the data information into the aggregation link layer protocol data unit when the execution result of the fourth judging unit is that the retransmission queue is non-empty;
a fifth judging unit, configured to judge whether the currently remaining allocated timeslot resources are sufficient to carry data information of a management frame formed by taking out a data packet from the head of the retransmission queue;
And the first waiting processing unit is used for not performing the packet grouping operation and waiting for the arrival of the next scheduling moment when the execution result of the fifth judging unit is that the currently remaining allocated time slot resources are insufficient to bear the data information of the management frame formed by taking out the data packets from the head of the retransmission queue.
Preferably, the apparatus further comprises:
a sixth judging unit, configured to judge whether a new transmission data queue of the transmitting end is empty when an execution result of the fifth judging unit is that the retransmission queue is empty;
A seventh judging unit, configured to judge whether the current time reaches a transmission window boundary when the execution result of the sixth judging unit is that the new transmission data queue is not empty;
a fourth processing unit, configured to, when the execution result of the seventh determining unit is that the current time does not reach the boundary of the transmission window, sequentially fetch data packets from the head of the new transmission data queue according to the queue header indicator in the transmission window, and put the data packets fetched from the head of the new transmission data queue into the aggregated link layer protocol data unit, where the data packets fetched from the head of the new transmission data queue are a complete load;
An eighth judging unit, configured to judge whether the currently remaining allocated timeslot resources are sufficient to carry a data packet extracted from the head of the new transmission data queue;
A fifth processing unit, configured to add a first identifier in a transmission window to a transmission queue when the execution result of the eighth determining unit is that the currently remaining allocated timeslot resource is sufficient to carry a data packet extracted from the first queue of the new transmission data queue, and place the corresponding data packet in the transmission queue, and poll the first queue of the new transmission data queue to continue to extract a next data packet until the new transmission data queue is empty;
And the second waiting processing unit is used for directly waiting for the arrival of the next scheduling moment when the execution result of the sixth judging unit is that the newly transmitted data queue is empty.
Preferably, the apparatus further comprises:
A third waiting processing unit, configured to wait for a next scheduling time to arrive when the execution result of the eighth judging unit is that the currently remaining allocated timeslot resource is insufficient to carry the data packet fetched from the head of the new data queue and no aggregation operation is performed;
And the fourth waiting processing unit is used for waiting for the arrival of the next scheduling time when the execution structure of the seventh judging unit is that the current time reaches the transmission window boundary and the aggregation operation is not performed.
A millimeter wave data plane scheduling device, comprising: one or more processors, and memory;
stored in the memory are computer readable instructions that, when executed by the one or more processors, implement the steps of the millimeter wave data plane scheduling method of any one of the preceding introduction.
According to the technical scheme, in the actual application process, when the data flow between the master station and the slave station is needed to be scientifically scheduled in some point-to-multipoint private bridge systems, the method provided by the embodiment of the application can acquire the scheduling time slot resources of the transmitting end of the point-to-multipoint system and the coding and modulation scheme adopted by the current transmitting data when the scheduling time arrives; the coding and modulation scheme currently employed to transmit data may determine the capacity of each transmission of data. In the actual application process, when data interaction is needed between the master station and the slave station, a control frame and a management frame are needed to be sent, so after the coding and modulation scheme adopted by the current sending data of the sending end of the point-to-multipoint system is obtained, whether a control frame queue of the sending end is empty can be further judged; if the control frame queue is not empty, the control frame queue is indicated to have data to be transmitted, and the control frame queue data can be processed according to a preset first data processing strategy; in the actual application process, the data business flow between the master station and the slave station can comprise a management frame queue and a retransmission queue besides controlling the frame queue; therefore, if the control frame queue is empty, it can be determined whether the management frame queue of the transmitting end is empty; if the management frame queue is not empty, it is indicated that the management frame queue has data to be processed, and the data of the management frame queue can be processed according to the scheduling time slot resource of the transmitting end, the coding and modulation scheme adopted by the current transmitted data and the preset second data processing strategy until the management frame queue is empty; if the management frame queue is empty, the data of the management frame queue is processed.
In practical applications, management frames typically contain control information and parameters, and are typically used to negotiate parameters of a data link, establish a connection, transmit data, etc. To ensure the reliability and correctness of the data. Therefore, after the data processing of the management frame queue is finished, whether the management frame exists in the aggregate link layer protocol data unit can be continuously judged, if the management frame exists in the aggregate link layer protocol data unit, the data transmission can be indicated, and the next scheduling time is directly waited; if the aggregate link layer protocol data unit does not have a management frame, the data still needing to be processed is indicated to exist, and whether a retransmission queue is empty can be judged; if the retransmission queue is not empty, it indicates that there is data that needs to be retransmitted due to transmission failure currently, the data packets can be sequentially fetched from the head of the retransmission queue to form data information of the management frame and put into the aggregated link layer protocol data unit.
In the actual application process, when the data interaction is carried out between the master station and the slave station, because the available time slot resources are limited, the data which can be transmitted each time are limited, and therefore, after the data processing of the retransmission queue is finished, whether the current remained allocated time slot resources are enough to bear the data information of a management frame formed by taking out the data packet from the head of the retransmission queue can be judged; if the current remaining allocated time slot resources are not enough to bear the data information of the management frame formed by the data packets taken out from the head of the retransmission queue, the current remaining time slot resources are not capable of processing the data information of the management frame formed by the data packets taken out from the head of the retransmission queue, the packing operation can be omitted, and the next scheduling time is waited to arrive.
Therefore, when the data flow between the master station and the slave station is required to be scientifically scheduled in some point-to-multipoint private bridge systems, if the data slicing processing cannot be performed, in order to better process the data interaction between the master station and the slave station, the method provided by the embodiment of the application can effectively realize the scientific scheduling of the data flow so that the data flow processing of the respective service functions can be better realized between the master station and the slave station.
Drawings
In order to more clearly illustrate the embodiments of the application or the technical solutions of the prior art, the drawings which are used in the description of the embodiments or the prior art will be briefly described, it being obvious that the drawings in the description below are only some embodiments of the application, and that other drawings can be obtained from these drawings without inventive faculty for a person skilled in the art.
Fig. 1 is a flowchart of a method for implementing millimeter wave data plane scheduling according to an embodiment of the present application;
Fig. 2 is a schematic diagram of a data structure of an MPDU according to an example embodiment of the present application;
Fig. 3 is a schematic diagram of a structure for aggregating data by aggregating link layer protocol data units according to an embodiment of the present application;
fig. 4 is a schematic diagram of an MPDU delay frame format structure according to an example of an embodiment of the present application;
fig. 5 is a schematic diagram of a sequence control field structure of a frame according to an example of the embodiment of the present application;
Fig. 6 is a schematic structural diagram of a millimeter wave data plane scheduling device according to an embodiment of the present application;
Fig. 7 is a block diagram of a hardware structure of a millimeter wave data plane scheduling device according to an embodiment of the present application.
Detailed Description
The following description of the embodiments of the present application will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present application, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the application without making any inventive effort, are intended to be within the scope of the application.
In view of the fact that most of millimeter wave data surface scheduling schemes are difficult to adapt to complex and changeable service demands at present, the inventor researches a millimeter wave data surface scheduling scheme, and when data flows between a master station and a slave station need to be scientifically scheduled in a private network bridge system with a plurality of points to a plurality of points, the method provided by the embodiment of the application can effectively realize the scientific scheduling of the data flows so that the data flow processing of respective service functions can be better realized between the master station and the slave station.
The methods provided by embodiments of the present application may be used in a number of general purpose or special purpose computing device environments or configurations. For example: personal computers, server computers, hand-held or portable devices, tablet devices, multiprocessor devices, distributed computing environments that include any of the above devices or devices, and the like.
The embodiment of the application provides a millimeter wave data surface scheduling method, which can be applied to various data management systems, various computer terminals or intelligent terminals, and an execution subject of the method can be a processor or a server of the computer terminal or the intelligent terminal.
The following describes, with reference to fig. 1, a flow of a millimeter wave data plane scheduling method according to an embodiment of the present application, where, as shown in fig. 1, the flow may include the following steps:
Step S101, when the scheduling time arrives, the scheduling time slot resource of the transmitting end of the point-to-multipoint system and the coding and modulation scheme adopted by the current transmitting data are obtained.
Specifically, in the practical application process, when data interaction is performed between a transmitting end and a receiving end of the point-to-multipoint system, time slot resources are often required, and the data capacity which can be transmitted each time is different if the code and the modulation scheme adopted by the current data transmission are different.
In the practical application process, the coding and modulation scheme adopted for transmitting data refers to the modulation coding efficiency of signals, which is called MCS for short, and the higher the MCS adopted for transmitting data is, the more data packets can be transmitted in unit time and unit bandwidth are, so that the number of fragments is directly affected.
The scheduling time slot refers to how long the upper layer scheduling algorithm gives each transmission time slot, and the longer the time slot, the more data is transmitted each time under the condition that the MCS is unchanged, and the less data is otherwise transmitted each time.
Both the time slot resources and the coding and modulation efficiency of the transmitted data affect the total amount of data per transmission. Therefore, scientific data flow scheduling is performed in order to better utilize the available slot resources. When the scheduling time arrives, the scheduling time slot resource of the transmitting end of the point-to-multipoint system and the coding and modulation scheme adopted by the current transmitting data can be obtained. By knowing the scheduling time slot resources, the communication resources can be planned and allocated better, so that each node can use the bandwidth fairly and efficiently, and the conflict and the resource waste are avoided. In the practical application process, the length of the scheduling time slot resource is related to the configuration of the point-to-multipoint system.
For example, when the point-to-multipoint system has a plurality of terminals and a certain scheduling period of the point-to-multipoint system is 5ms, the 5ms is a time shared by the plurality of terminals, and if the point-to-multipoint system has only one terminal or only one slave station, the 5ms is a time that one terminal can use when the scheduling period of the point-to-multipoint system is 5ms, and if the point-to-multipoint system has a plurality of terminals, each terminal is allocated a scheduling period of less than 5ms.
In the practical application process, the selection of the coding and modulation scheme directly influences the transmission rate, the reliability and the anti-interference capability of the data. Thus, acquiring the currently employed coding and modulation scheme may evaluate whether it is suitable for the current communication environment, and whether adjustments are needed to improve transmission quality. The adaptation of different coding and modulation schemes to channel conditions is also different. Knowing the currently adopted coding and modulation method can help to improve the robustness of the signal, reduce the error rate and improve the performance of the whole system. The acquisition of the scheduling slots and the coded modulation scheme also helps to monitor the operating state of the system. For example, if an abnormality or a fault is found, the system can be timely checked and repaired to ensure the stable operation of the system. The scheduling time slot resource of the transmitting end of the point-to-multipoint system and the coding and modulation scheme adopted by the current transmitting data can be obtained, and the parameters can be obtained and adjusted in real time in a dynamically changing communication environment, so that the system can be quickly adapted to the change, and a good communication effect is maintained.
In summary, the method for obtaining the scheduling time slot resource of the transmitting end of the point-to-multipoint system and the coding and modulation scheme adopted by the current transmitting data have key significance for effective operation, performance optimization and self-adaptive adjustment of the point-to-multipoint system. It helps to improve the efficiency, reliability and adaptability of the system, thereby providing better communication services.
Step S102, judging whether the control frame queue of the transmitting end is empty.
In particular, in practical application, a point-to-multipoint system may generally include a control frame queue and a management frame queue. When the transmitting end of the point-to-multipoint system transmits data each time, the data in the control frame queue and the management frame queue are generally contained in the data frame to be transmitted. Therefore, the sending end can be ensured to timely send control information and management information to the receiving end, so that the reliability and stability of data transmission are ensured. Wherein control frames of the control frame queues may be used to transmit control information. Such as acknowledgement frames, request frames, etc.
Therefore, when data transmission is required, it is necessary to determine whether the control frame queue of the transmitting end is empty, and if the control frame queue is not empty, it is indicated that there is data to be processed in the control frame queue. Therefore, if it is determined that the control frame queue is not empty, step S103 may be performed; if the control frame queue is empty, it indicates that there is no data to be processed in the control frame queue, and step S104 may be performed.
Step S103, processing the control frame queue data according to a preset first data processing strategy.
Specifically, as can be seen from the above description, the method provided by the embodiment of the present application can determine whether the control frame queue is empty, and if it is determined that the control frame queue is not empty, it is indicated that there is control information to be processed in the control frame queue, and then the control frame queue data can be processed according to a preset first data processing policy.
The preset first data processing policy may be: sequentially taking out a confirmation frame, a status report of the confirmation frame and a status report of a buffer area in a control frame queue from the control frame queue respectively; and aggregating the acknowledgement frame, the status report of the acknowledgement frame and the status report of the buffer area taken out of the control frame queue to form a data packet to be transmitted, and filling the data packet to be transmitted into an aggregated link layer protocol data unit after the data packet to be transmitted is formed until the control frame queue is empty.
In the practical application process, the data surface flow between the transmitting end and the receiving end of the point-to-multipoint system is mainly a process that a data packet is transmitted from a data chip to a WIFI chip cache queue or the data packet generated by the WIFI chip is put into the cache queue, then the data is transmitted from the WIFI chip through a physical layer and an air interface, after the receiving end correctly receives the data, the receiving end confirms the data, or the receiving end does not correctly receive the data, and the transmitting end carries out the data transmission again.
The acknowledgement frame in the control frame queue may be used to acknowledge that the transmitting end has successfully received the data frame, and send acknowledgement information to the transmitting end. Status reports of acknowledgement frames of the control frame queues may be used to indicate the status of acknowledgement frames. For example, it may be confirmed whether an acknowledgement frame of the control frame queue has been successfully transmitted, has been properly received by the receiving end, etc. The status report of the buffer may be used to indicate the buffer status of the transmitting end and the receiving end, for example, may be used to indicate the remaining space of the buffer, the fullness of the buffer, etc. The acknowledgement frame of the control frame queue, the status report of the acknowledgement frame, the status report of the buffer, and the like can help the transmitting end and the receiving end to better manage data transmission, so as to improve the efficiency and the reliability of the data transmission.
The 802.11 protocol defines SDUs and PDUs, among others. The SDU (SERVICE DATA Unit), namely a service data Unit, also called a service data Unit, is a data set of user service of a designated layer, and the data is not changed when the SDU is transmitted to the same protocol layer, namely a service part, when the SDU is transmitted to a receiver, the SDU is transmitted to a lower layer, and then the lower layer encapsulates the SDU in a PDU and transmits the PDU. PDU (Protocol Data Unit) are protocol data units, which are unit information exchanged between peer entities of each layer of the computer network. For example, the PDU of the TCP layer is segment, and the PDU exchanged between application layers is application data. In the actual application process, the data to be actually transmitted by the upper layer is transferred to the MAC layer (link layer), and this data is called MSDU. For MAC, MSDUs are in fact data to be transmitted by MAC, i.e. payload (payload). The MAC layer also encapsulates some of its header information when handling payload. The information and MSDU together form MPDU of MAC layer, the data packet to be transmitted formed by aggregating the acknowledgement frame, the status report of acknowledgement frame and the status report of buffer area taken out from the control frame queue is MPDU, and after the data packet to be transmitted is formed, it is filled into the protocol data unit of aggregation link layer.
For example, fig. 2 illustrates a data structure diagram of an MPDU.
In general, a point-to-multipoint system defaults to one slave station to group only one MPDU during a scheduling process, and it should be noted that the status report of the acknowledgement frame and the buffer is typically placed at the forefront of the filled aggregated link layer protocol data unit, and the status report of the acknowledgement frame is placed at the last position of the filled aggregated link layer protocol data unit. Wherein aggregating link layer protocol data units is aggregating multiple link layer protocol data units into a single PHY protocol data unit. In practical applications, aggregating link layer protocol data units for data aggregation is typically performed at the bottom of the link layer, where the basic purpose is to have multiple MPDUs share physical layer header data and access channels together.
Fig. 3 illustrates a schematic diagram of a structure for aggregating link layer protocol data units for data aggregation. As shown in fig. 3, the aggregation link layer protocol data unit aggregation mechanism (a-MPDU aggregation mechanism) is most characterized in that the aggregated data unit is an MPDU with a MAC header and FCS added thereto. Since each subframe includes an FCS field, the receiving end can perform correctness detection on each subframe. The 802.11n standard proposes a mechanism called BlockACK to complete the acknowledgement function of the receiving end to the aggregate frame, and the number of subframes actually contained in the a-MPDU aggregate frame depends only on the number of MPDUs in the current transmit queue, and there is no setting of the maximum waiting duration. In addition, the a-MPDU aggregation mechanism can only aggregate 64 subframes at most, and this limitation is caused by the BlockACK acknowledgement scheme adopted by the mechanism. Depending on the station throughput capability, the maximum length of a-MPDU aggregate frames may be 8191 bytes, 16383 bytes, 32767 bytes, 65535 bytes, 1048575 bytes, and the transmitting end may not allow for transmission of a-MPDU frames greater than the maximum length.
As can be seen from fig. 3 above, a sub-frame of an a-MPDU may be composed of MPDU delay, MPDU and Padding data. The Padding data also serves to ensure that the byte length of each subframe is an integer multiple of 4. MPDU delay is a spacer between subframes, and its specific format is shown in fig. 4. Fig. 4 illustrates an MPDU delimite frame format structure diagram.
The specific meaning of the MPDU delimite subfields is shown in table 1 below:
table 1 MPDU Delimiter concrete meanings of each sub-field
The DEILMITER field is used to facilitate the receiving end to detect the edges of each subframe in the aggregate frame and extract the subframes. In the deaggregation algorithm, the receiving end detects the position of Delimiter according to the Signature subdomain in Delimiter, and then checks the correctness of Delimiter according to the CRC subdomain. If the data is correct, the MPDU after the Delimiter is extracted, and then the next Delimiter is detected until the depolymerization process of the A-MPDU is completed. If an error-generating Delimiter is encountered, the receiving end needs to skip 4 bytes (the MPDU Delimiter is just 4 bytes long), and then the detection of the next 4-byte group is performed until the next Delimiter is found. The a-MPDU maximum 1048575Bytes, the number of aggregated MPDUs is constrained by the block acknowledgement mechanism, currently considered as 64 aggregation parameters reference the protocol standard. In the case of determining the number of bytes that can be scheduled, the MPDUs need to be aggregated, but there is a possibility that the last packet MPDU cannot be stuffed with the number of bytes that can be scheduled, combined with the "sequence control field" frame format containing 2 octets in MAC HEADER. Since MAC HEADER of the 802.11MAC frame contains 2 octets of "sequence control field", it consists of a 4bit "slice number" and a 12bit "sequence number".
As shown in fig. 5, wherein fig. 5 illustrates a sequence control field structure diagram of a frame. "sequence number" gives the sequence number of the MSDU or MMPDU. The station assigns a sequence number to each MSDU or MMPDU it sends. When an upper layer frame is delivered to the MAC transmission, it is given a sequence number. This field functions as a modulus for the counter of the transmitted frame, 4096. This counter starts with 0 and it will increment by 1 every time the MAC processes an upper layer packet. If the upper layer packet is fragmented, all frame fragments will have the same sequence number. In case of a retransmitted frame, the sequence numbers do not change at all. Each TID maintains a set of sequence numbers, and in this scheme, the management frame and the data frame independently maintain a set of own sequence numbers and fragment numbers. Note that the fixed overhead (header and checksum) is considered when the a-MPDU is packetized; and the A-MPDU aggregation only supports the same TID (identifier), namely only supports data frame aggregation or manages frame aggregation, and can carry the mode of control frames.
Step S104, judging whether the management frame queue of the sending end is empty.
Specifically, in the practical application process, the point-to-multipoint system further comprises a management frame queue. The management frame information is included when the point-to-multipoint system transmits data, so as to ensure the reliability and stability of data transmission. The management frame queue may include management frame information, which may include status information of a transmitting end and a receiving end, status information of a buffer, error information, and the like. Such information may help the sender and receiver to better manage data transmissions to improve the efficiency and reliability of the data transmissions.
For example, the transmitting end can adjust the data transmission rate according to the state information of the management frame information buffer area so as to avoid the overflow of the buffer area; the receiving end can perform error recovery according to the error information so as to ensure the integrity of the data.
The management frame may be used to transmit management information, e.g., may be used to transmit heartbeat frames, synchronization frames, etc.; the data of the management frame queue are contained in the data frames to be transmitted, so that the receiving end can be ensured to correctly receive and process the data, and the reliability and stability of data transmission are improved. Therefore, when the control frame queue is determined to be empty, it may be further determined whether the management frame queue is empty, to determine whether there is data to be processed in the management frame queue.
If the management frame queue is not empty, it is indicated that the management frame queue has data to be processed, and step S105 may be executed;
if the management frame queue is empty, it indicates that there is no data to be processed in the management frame queue, and step S106 may be executed.
Step S105, processing the data of the management frame queue according to the scheduled time slot resource of the transmitting end, the coding and modulation scheme adopted by the current transmitting data and the preset second data processing policy until the management frame queue is empty.
Specifically, as can be seen from the description above, the method provided by the embodiment of the present application can determine whether the control frame queue and the management frame queue are empty, and in the actual application process, if it is determined that the management frame queue is not empty, it is indicated that there is data to be processed in the management frame queue, and then the data in the management frame queue can be processed according to the scheduled time slot resource of the transmitting end, the coding and modulation scheme adopted by the current data transmission, and the preset second data processing policy until the management frame queue is empty.
The preset second data processing policy may be: sequentially taking out data packets from the head of the management frame queue, wherein the data packets taken out from the head of the management frame queue are the data information of a complete management frame; judging whether the currently allocated time slot resources can bear the data packet taken out from the head of the management frame queue or not according to the currently remaining allocated time slot resources of the transmitting end; if the currently allocated time slot resource can bear the data packet taken out from the queue head of the management frame queue, the data packet taken out from the queue head of the management frame queue can be put into a transmitted message queue, and the next data packet or fragment is taken out from the queue head of the management frame queue until the management frame queue is empty; if the currently allocated time slot resource cannot bear the data packet fetched from the head of the management frame queue, the next scheduling time can be directly waited.
Step S106, judging whether the aggregate link layer protocol data unit has a management frame.
Specifically, as can be seen from the foregoing description, the method provided by the embodiment of the present application may aggregate the acknowledgement frame, the status report of the acknowledgement frame, and the status report of the buffer area, which are to be fetched from the control frame queue, to form a data packet to be sent, and fill the data packet to be sent into the aggregated link layer protocol data unit after forming the data packet to be sent, and may further process the data of the management frame queue.
In practical application, in a point-to-multipoint system, the efficiency and stability of network communication are ensured. After the data of the control frame queue and the management frame queue are processed, whether the management frame exists in the aggregate link layer protocol data unit can be further judged, and if the management frame exists, the repeated transmission of the same frame can be avoided, so that the network traffic is reduced and the communication efficiency is improved. Meanwhile, the method is also helpful to avoid the problems of network congestion, data loss and the like, thereby improving the stability and reliability of the network. In practical applications, management frames are typically used for network management and control, e.g. topology discovery, link state monitoring, error detection, etc. If there is already a management frame in the aggregate link layer protocol data, it may indicate that the network is performing some management operation.
The management frame may carry status information of the device or node, such as identification, address, configuration, etc. If there is already a management frame in the aggregated link layer protocol data, this may mean that the device or node is communicating its status to other parts or accepting the relevant management instructions. Management frames may also be used to report network failures, errors, or anomalies. If there are already management frames in the aggregated link layer protocol data, it may suggest that there are some problems that require fault diagnosis and repair. The aggregate link layer protocol may use management frames to coordinate protocol interactions between different devices or nodes. These frames can help ensure proper operation of the protocol and proper transmission of data. Thus, if there is already a management frame in the aggregate link layer protocol data unit, it is possible to directly wait for the next scheduling instant.
If there are no management frames in the aggregate link layer protocol data unit, then there may be several cases:
(1) It is possible that the current data unit mainly contains user data or traffic data and does not relate to network management or control information.
(2) It is explained that the current communication is mainly focused on the transmission and exchange of data, and there may be no condition for triggering or requiring transmission of management frames.
(3) The absence of a management frame may suggest that the link layer protocol is working properly and that no management operations need to be performed or exceptions reported.
(4) In some cases, the presence or absence of management frames may be related to a particular network phase, scenario, or application requirement. For example, in certain particular modes of communication, management frames may not be needed or used.
Therefore, if there is no management frame in the aggregate link layer protocol data unit, step S107 may be performed;
Step S107, it is determined whether the retransmission queue is empty.
In particular, in practical application, the point-to-multipoint system may include a retransmission queue. The retransmission data queue of the point-to-multipoint system is used for storing data frames needing retransmission. When the transmitting end transmits the data frame, if the receiving end does not correctly receive the data frame, the transmitting end stores the data frame in a retransmission data queue and retransmits the data frame when appropriate. The size of the retransmission data queue and the retransmission policy depend on the specific communication protocol and application scenario. In the practical application process, in some cases, the retransmission data queue may occupy a large amount of storage space, so that a retransmission policy needs to be reasonably designed to avoid resource waste.
As can be seen from the above description, the method provided by the embodiment of the present application can process the data of the control frame queue and the management frame queue, and further, after processing the control frame queue and the management frame, can further perform non-empty judgment on the retransmission queue to determine whether the retransmission queue is empty. If the retransmission queue is not empty, it is indicated that there is data requiring retransmission in the retransmission queue due to transmission failure, and step S108 may be executed; if the retransmission queue is empty, it indicates that there is no data to be retransmitted in the retransmission queue, and step S111 may be performed.
Step S108, the data packets are sequentially fetched from the head of the retransmission queue to form the data information of the management frame and put into the aggregation link layer protocol data unit.
Specifically, as can be seen from the foregoing description, the method provided by the embodiment of the present application may determine whether the retransmission queue is empty, so as to determine whether the retransmission queue has data to be retransmitted, if it is determined that the retransmission queue is not empty, it is indicated that the retransmission queue has data to be retransmitted, and then the data packets may be sequentially taken out from the head of the retransmission queue to form the data information of the management frame and put into the aggregated link layer protocol data unit, so that retransmission processing may be performed on the data of the retransmission queue.
Step S109, judging whether the current remained allocated time slot resource is enough to bear the data information of the management frame formed by taking out the data packet from the head of the retransmission queue.
Specifically, as can be seen from the above description, the method provided by the present application can determine whether there is data to be retransmitted in the retransmission queue and process the data, further, in order to ensure that the data in the retransmission queue can be retransmitted successfully, it can be further determined whether the currently remaining allocated timeslot resources are sufficient to carry the data information of the management frame formed by the data packets fetched from the head of the retransmission queue, if the currently remaining allocated timeslot resources are insufficient to carry the data information of the management frame formed by the data packets fetched from the head of the retransmission queue, it is indicated that the packet grouping operation can not be performed any more, and step S110 can be executed.
Step S110, wait for the next scheduling time to arrive.
Specifically, as can be seen from the description above, the method provided by the embodiment of the present application can determine whether the currently remaining allocated timeslot resources are sufficient to carry the data information of the management frame formed by the data packets fetched from the head of the retransmission queue, and if the currently remaining allocated timeslot resources are insufficient to carry the data information of the management frame formed by the data packets fetched from the head of the retransmission queue, it is indicated that the packet grouping operation cannot be performed any more, and only the data to be retransmitted of the retransmission queue can be processed after the next scheduling time arrives.
Step S111, determining whether the new data queue of the transmitting end is empty.
Specifically, as can be seen from the above description, the method provided by the embodiment of the present application can determine whether the retransmission queue is empty, and if the retransmission queue is empty, it is indicated that there is no data to be processed in the retransmission queue. In the practical application process, although the retransmission data queue is empty, there is no data that needs to be retransmitted, the remaining time slot resources can be utilized. In the practical application process, the point-to-multipoint system can also comprise a new transmission data queue. Therefore, after processing the data of the retransmission queue, the management frame queue and the control frame queue, the method provided by the embodiment of the application can also process the new transmission data queue.
Therefore, in order to confirm whether the new transmission data queue has data to be transmitted, it can be determined whether the new transmission data queue at the transmitting end is empty. If the new data queue is not empty, it indicates that there is data to be processed in the new data queue, and step S112 may be executed.
Step S112, judging whether the current time reaches the transmission window boundary.
Specifically, as can be seen from the foregoing description, the method provided by the embodiment of the present application may process the data of the control frame queue, the management frame queue and the retransmission queue respectively, and in the practical application process, the time slot resources that can be used for each data scheduling are limited. If the current time reaches the transmission window boundary, the data transmission is insufficient to process the data of the new transmission data queue, and the time for processing the data of the new transmission data queue is needed to be waited until the next scheduling time arrives. If the current time does not reach the transmission window boundary, it indicates that the processing of the data of the new transmission data queue may be continued, and step S113 may be executed.
Step S113, according to the queue head indicator in the transmitting window, sequentially taking out the data packets from the queue head of the new transmission data queue and putting the data packets taken out from the queue head of the new transmission data queue into the aggregation link layer protocol data unit.
Specifically, as can be seen from the above description, the method provided by the embodiment of the present application can determine whether the newly transmitted data queue has data to be processed and further determine whether the current time reaches the transmission window boundary. If it is determined that the transmission window boundary has not been reached, the processing of the data of the new transmission data queue may be continued, and then the data packets may be sequentially fetched from the head of the new transmission data queue according to the queue header indicator in the transmission window, and the data packets fetched from the head of the new transmission data queue may be put into the aggregated link layer protocol data unit. Wherein the data packet fetched from the head of the newly transmitted data queue is a complete load.
Step S114, determining whether the currently remaining allocated timeslot resources are sufficient to carry the data packet fetched from the head of the new transmission data queue.
Specifically, as can be seen from the above description, the method provided by the embodiment of the present application can determine whether the currently remaining allocated timeslot resources can carry the data packet fetched from the head of the new data transmission queue. If the currently remaining allocated timeslot resources are sufficient to carry the data packet fetched from the head of the new data queue, it is indicated that the currently remaining allocated timeslot resources may be used to process the data of the new data queue, and step S115 may be performed.
Step S115, adding a queue head identifier in a sending window, placing the corresponding data packet into a transmission queue, and polling the queue head of the new transmission data queue to continuously take out the next data packet until the new transmission data queue is empty.
Specifically, as can be seen from the description above, the method provided by the embodiment of the present application can determine whether the currently remaining allocated timeslot resource is sufficient to carry data fetched from the head of the new transmission data queue, if the currently remaining allocated timeslot resource is sufficient to carry data fetched from the head of the new transmission data queue, it is indicated that the currently remaining allocated timeslot resource can be used to process data of the new transmission data queue, then add a first identifier in the transmission window to process, and place a corresponding data packet into the transmission queue, and poll the head of the new transmission data queue to continue to fetch the next data packet until the new transmission data queue is empty, so as to finish data processing of the new transmission data queue. If the new data queue is empty, the process may return to step S110, and wait for the next scheduling time to arrive. If the currently remaining allocated timeslot resources are not enough to carry the data packet fetched from the head of the new transmission data queue, it indicates that the currently allocated timeslot resources are not enough to process the data packet fetched from the new transmission data queue, and the aggregation operation cannot be performed any more, and the data of the new transmission data queue can be processed only when the next scheduling time arrives, and then the step S110 can be executed again, and the next scheduling time arrives. If the current time reaches the transmission window boundary, it indicates that there is no time for processing from the new transmission data queue at the current time, the aggregation operation is not performed, and the process returns to the execution step S110 to wait for the next scheduling time to arrive.
According to the technical scheme, when the data flow between the master station and the slave station is required to be scientifically scheduled in a private network bridge system of some point-to-multipoint, if the data slicing processing cannot be performed, the method provided by the embodiment of the application can effectively realize the scientific scheduling of the data flow so as to better realize the data flow processing of the respective service functions between the master station and the slave station in order to better realize the data interaction between the master station and the slave station.
Further, in the actual application process, in order to ensure the utilization rate of the time slot resources in the process of scheduling and distributing the time slot resources, the situation that the time slot resources are wasted or the utilization rate of the time slot resources is not high is avoided, and the time slot resources distributed for each slave station can meet the requirement of the time slot resources capable of transmitting a complete data packet; the time slot resource capacity required to transmit a complete packet may be 1518 bytes.
For example, in the practical application process, if the data flow scheduling process between the transmitting end and the receiving end does not support the slicing process, when time slot resources are allocated to each secondary station, in order to determine that enough quick stock sources can be ensured, the keep-alive duration of each RT needs to be capable of transmitting a complete data packet, that is, at least 1518Bytes of active resources need to be reserved for each secondary station. In the practical application process, the active resource is reserved for the secondary station, and the active resource can be reserved according to the capacity of setting the size of the acknowledgement frame to 256bits and repeatedly sending the acknowledgement frame for 3 times.
In particular, in the MCS0 scenario, 8 users may be accommodated according to a timeslot ratio of 1:10, where a quick stock source with the same size as that of the uplink scheduling still needs to be reserved during downlink scheduling, in the case of 1:4, 15 users or resources may need to be reserved, in the case of 1:1, 25 users or living resources may need to be reserved, and if 32 users are accommodated, the TDMA frame period may need to be enlarged. Wherein MCS0 refers to the 0 th mode in Modulation coding scheme; in the practical application process, the coding and modulation method adopted by the transmitted data can be divided into different modes, and the MCS0 is the rate with the lowest rate corresponding to different rates; the coding and modulation methods may have different physical layer rates configuring different MCS levels.
In summary, if the data is processed in a non-fragmented manner in the data flow scheduling process between the transmitting end and the receiving end, in order to ensure that a complete packet is transmitted under 16 fragments or that a complete packet is successfully transmitted under the non-fragmented condition, a certain size of active time slot resources must be reserved, but in the practical application process, if a certain active resource is reserved, a certain constraint may be caused on the number of users, especially under the condition that the MCS is lower than the fragments, the number of users is supported less under the condition of extreme 1:10 time slot ratio, so that if more users are supported, coordination needs to be performed in several dimensions of the time slot ratio, the MCS level and the TDMA frame period.
The following describes the millimeter wave data plane scheduling device provided by the embodiment of the present application, and the data plane scheduling device of the millimeter wave described below and the data plane scheduling method of the millimeter wave described above may be referred to correspondingly.
Referring to fig. 6, fig. 6 is a schematic structural diagram of a millimeter wave data plane scheduling device according to an embodiment of the present application.
As shown in fig. 6, the data plane scheduling apparatus of millimeter waves may include:
An obtaining unit 101, configured to obtain, when the scheduling time arrives, a scheduling time slot resource of a transmitting end of the point-to-multipoint system and a coding and modulation scheme adopted by current transmission data;
A first judging unit 102, configured to judge whether a control frame queue of the transmitting end is empty;
a first processing unit 103, configured to process the control frame queue data according to a preset first data processing policy when the execution result of the first judging unit 102 is that the control frame queue is not empty;
A second judging unit 104, configured to judge whether the management frame queue of the transmitting end is empty when the execution result of the first judging unit 102 is that the control frame queue is empty;
a second processing unit 105, configured to process, when the execution result of the second determining unit 104 is that the management frame queue is not empty, the data of the management frame queue according to the scheduled time slot resource of the transmitting end, the coding and modulation scheme adopted by the current transmitting data, and a preset second data processing policy, until the management frame queue is empty;
A third judging unit 106, configured to judge whether a management frame exists in the aggregated link layer protocol data unit when the execution result of the second judging unit 104 is that the management frame queue is empty, and if the management frame exists in the aggregated link layer protocol data unit, directly wait for the next scheduling time;
A fourth judging unit 107, configured to judge whether a retransmission queue is empty when the execution result of the third judging unit 106 is that the aggregated link layer protocol data unit does not have a management frame;
A third processing unit 108, configured to sequentially fetch data packets from a head of the retransmission queue to form data information of a management frame and put the data information into the aggregated link layer protocol data unit when the execution result of the fourth judging unit 107 is that the retransmission queue is not empty;
A fifth judging unit 109, configured to judge whether the currently remaining allocated timeslot resources are sufficient to carry data information of a management frame formed by taking out a data packet from the head of the retransmission queue;
a first waiting processing unit 110, configured to, when the execution result of the fifth determining unit 109 is that the currently remaining allocated timeslot resources are insufficient to carry data information of a management frame formed by fetching data packets from the head of the retransmission queue, not perform a packet grouping operation, and wait for the arrival of the next scheduling time.
According to the technical scheme, in the actual application process, when the data flow between the master station and the slave station is needed to be scientifically scheduled in some point-to-multipoint private bridge systems, the device provided by the embodiment of the application can acquire the scheduling time slot resources of the transmitting end of the point-to-multipoint system and the coding and modulation scheme adopted by the current transmitting data when the scheduling time arrives; the coding and modulation scheme currently employed to transmit data may determine the capacity of each transmission of data. In the actual application process, when data interaction is needed between the master station and the slave station, a control frame and a management frame are needed to be sent, so after the coding and modulation scheme adopted by the current sending data of the sending end of the point-to-multipoint system is obtained, whether a control frame queue of the sending end is empty can be further judged; if the control frame queue is not empty, the control frame queue is indicated to have data to be transmitted, and the control frame queue data can be processed according to a preset first data processing strategy; in the actual application process, the data business flow between the master station and the slave station can comprise a management frame queue and a retransmission queue besides controlling the frame queue; therefore, if the control frame queue is empty, it can be determined whether the management frame queue of the transmitting end is empty; if the management frame queue is not empty, it is indicated that the management frame queue has data to be processed, and the data of the management frame queue can be processed according to the scheduling time slot resource of the transmitting end, the coding and modulation scheme adopted by the current transmitted data and the preset second data processing strategy until the management frame queue is empty; if the management frame queue is empty, the data of the management frame queue is processed.
In practical applications, management frames typically contain control information and parameters, and are typically used to negotiate parameters of a data link, establish a connection, transmit data, etc. To ensure the reliability and correctness of the data. Therefore, after the data processing of the management frame queue is finished, whether the management frame exists in the aggregate link layer protocol data unit can be continuously judged, if the management frame exists in the aggregate link layer protocol data unit, the data transmission can be indicated, and the next scheduling time is directly waited; if the aggregate link layer protocol data unit does not have a management frame, the data still needing to be processed is indicated to exist, and whether a retransmission queue is empty can be judged; if the retransmission queue is not empty, it indicates that there is data that needs to be retransmitted due to transmission failure currently, the data packets can be sequentially fetched from the head of the retransmission queue to form data information of the management frame and put into the aggregated link layer protocol data unit.
In the actual application process, when the data interaction is carried out between the master station and the slave station, because the available time slot resources are limited, the data which can be transmitted each time are limited, and therefore, after the data processing of the retransmission queue is finished, whether the current remained allocated time slot resources are enough to bear the data information of a management frame formed by taking out the data packet from the head of the retransmission queue can be judged; if the current remaining allocated time slot resources are not enough to bear the data information of the management frame formed by the data packets taken out from the head of the retransmission queue, the current remaining time slot resources are not capable of processing the data information of the management frame formed by the data packets taken out from the head of the retransmission queue, the packing operation can be omitted, and the next scheduling time is waited to arrive. Therefore, when the data flow between the master station and the slave station is required to be scientifically scheduled in some point-to-multipoint private bridge systems, if the data slicing processing cannot be performed, in order to better process the data interaction between the master station and the slave station, the device provided by the embodiment of the application can effectively realize the scientific scheduling of the data flow so as to better realize the data flow processing of the respective service functions between the master station and the slave station.
Further alternatively, the apparatus may further include:
a sixth judging unit, configured to judge whether a new transmission data queue of the transmitting end is empty when an execution result of the fifth judging unit is that the retransmission queue is empty;
A seventh judging unit, configured to judge whether the current time reaches a transmission window boundary when the execution result of the sixth judging unit is that the new transmission data queue is not empty;
a fourth processing unit, configured to, when the execution result of the seventh determining unit is that the current time does not reach the boundary of the transmission window, sequentially fetch data packets from the head of the new transmission data queue according to the queue header indicator in the transmission window, and put the data packets fetched from the head of the new transmission data queue into the aggregated link layer protocol data unit, where the data packets fetched from the head of the new transmission data queue are a complete load;
An eighth judging unit, configured to judge whether the currently remaining allocated timeslot resources are sufficient to carry a data packet extracted from the head of the new transmission data queue;
A fifth processing unit, configured to add a first identifier in a transmission window to a transmission queue when the execution result of the eighth determining unit is that the currently remaining allocated timeslot resource is sufficient to carry a data packet extracted from the first queue of the new transmission data queue, and place the corresponding data packet in the transmission queue, and poll the first queue of the new transmission data queue to continue to extract a next data packet until the new transmission data queue is empty;
And the second waiting processing unit is used for directly waiting for the arrival of the next scheduling moment when the execution result of the sixth judging unit is that the newly transmitted data queue is empty.
Further optionally, the apparatus may further include:
A third waiting processing unit, configured to wait for a next scheduling time to arrive when the execution result of the eighth judging unit is that the currently remaining allocated timeslot resource is insufficient to carry the data packet fetched from the head of the new data queue and no aggregation operation is performed;
And the fourth waiting processing unit is used for waiting for the arrival of the next scheduling time when the execution structure of the seventh judging unit is that the current time reaches the transmission window boundary and the aggregation operation is not performed.
The specific process flow of each unit included in the millimeter wave data plane scheduling device may be described with reference to the foregoing related description of the millimeter wave data plane scheduling method, which is not repeated herein.
The millimeter wave data surface scheduling device provided by the embodiment of the application can be applied to millimeter wave data surface scheduling equipment, such as a terminal: cell phones, computers, etc. Alternatively, fig. 7 shows a block diagram of a hardware structure of a millimeter wave data plane scheduling device, and referring to fig. 7, the hardware structure of the millimeter wave data plane scheduling device may include: at least one processor 1, at least one communication interface 2, at least one memory 3 and at least one communication bus 4.
In the embodiment of the present application, the number of the processor 1, the communication interface 2, the memory 3 and the communication bus 4 is at least one, and the processor 1, the communication interface 2 and the memory 3 complete communication with each other through the communication bus 4.
The processor 1 may be a central processing unit CPU, or an Application-specific integrated Circuit ASIC (Application SPECIFIC INTEGRATED Circuit), or one or more integrated circuits configured to implement embodiments of the present application, etc.;
The memory 3 may comprise a high-speed RAM memory, and may further comprise a non-volatile memory (non-volatile memory) or the like, such as at least one magnetic disk memory; wherein the memory stores a program, the processor is operable to invoke the program stored in the memory, the program operable to: and realizing each processing flow in the data plane scheduling scheme of the terminal millimeter wave. The embodiment of the present application also provides a readable storage medium storing a program adapted to be executed by a processor, the program being configured to: and realizing each processing flow of the terminal in the millimeter wave data surface scheduling scheme. Finally, it is further noted that relational terms such as first and second, and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Moreover, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element. In the present specification, each embodiment is described in a progressive manner, and each embodiment is mainly described in a different point from other embodiments, and identical and similar parts between the embodiments are all enough to refer to each other.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present application. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the application. The various embodiments may be combined with one another. Thus, the present application is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

Claims (10)

1. A millimeter wave data plane scheduling method, comprising:
When the scheduling time arrives, acquiring a scheduling time slot resource of a transmitting end of the point-to-multipoint system and a coding and modulation scheme adopted by current transmitted data;
Judging whether a control frame queue of the transmitting end is empty or not;
If the control frame queue is not empty, processing the control frame queue data according to a preset first data processing strategy;
If the control frame queue is empty, judging whether the management frame queue of the sending end is empty or not;
If the management frame queue is not empty, processing the data of the management frame queue according to the scheduling time slot resource of the transmitting end, the coding and modulation scheme adopted by the current transmitted data and a preset second data processing strategy until the management frame queue is empty;
if the management frame queue is empty, judging whether the aggregation link layer protocol data unit has a management frame, and if the aggregation link layer protocol data unit has the management frame, directly waiting for the next scheduling time;
If the aggregate link layer protocol data unit does not have a management frame, judging whether a retransmission queue is empty;
If the retransmission queue is not empty, sequentially taking out data packets from the head of the retransmission queue to form data information of a management frame and putting the data information into the aggregation link layer protocol data unit;
Judging whether the current remained allocated time slot resources are enough to bear the data information of a management frame formed by taking out data packets from the head of the retransmission queue;
If the current remained allocated time slot resources are not enough to bear the data information of the management frame formed by taking out the data packets from the head of the retransmission queue, the packet grouping operation is not carried out any more, and the next time of scheduling arrives.
2. The method according to claim 1, characterized in that the method further comprises:
If the retransmission queue is empty, judging whether a new transmission data queue of the sending end is empty or not;
If the new transmission data queue is not empty, judging whether the current moment reaches a transmission window boundary or not;
if the current moment does not reach the boundary of the sending window, sequentially taking out data packets from the head of the new transmission data queue according to the head of the queue in the sending window and putting the data packets taken out from the head of the new transmission data queue into the aggregation link layer protocol data unit, wherein the data packets taken out from the head of the new transmission data queue are a complete load;
judging whether the current remained allocated time slot resources are enough to bear the data packet fetched from the head of the new transmission data queue;
If the currently remaining allocated time slot resources are enough to bear the data packet taken out from the queue head of the new transmission data queue, adding a queue head identifier in a sending window, putting the corresponding data packet into a transmission queue, and polling the queue head of the new transmission data queue to continuously take out the next data packet until the new transmission data queue is empty;
and if the new transmission data queue is empty, directly waiting for the arrival of the next scheduling moment.
3. The method according to claim 2, characterized in that the method further comprises:
if the current remaining allocated time slot resources are not enough to bear the data packets taken out from the head of the new transmission data queue, no aggregation operation is carried out, and the next scheduling moment is waited for;
if the current time reaches the transmission window boundary, the aggregation operation is not performed, and the next scheduling time is waited for.
4. The method of claim 1, wherein the predetermined first data processing strategy is:
Sequentially taking out the acknowledgement frame, the status report of the acknowledgement frame and the status report of the buffer zone in the control frame queue from the control frame queue respectively;
And aggregating the acknowledgement frame, the status report of the acknowledgement frame and the status report of the buffer area taken out of the control frame queue to form a data packet to be transmitted, and filling the data packet into the aggregated link layer protocol data unit until the control frame queue is empty.
5. The method of claim 1, wherein the predetermined second data processing strategy is:
Sequentially taking out data packets from the head of the management frame queue, wherein the data packets taken out from the head of the management frame queue are the data information of a complete management frame;
Judging whether the currently allocated time slot resources can bear the data packet taken out from the head of the management frame queue or not according to the currently remaining allocated time slot resources of the transmitting end;
If the currently allocated time slot resource can bear the data packet taken out from the head of the management frame queue, putting the data packet taken out from the head of the management frame queue into a transmitted message queue, and polling the head of the management frame queue to take out the next data packet or fragment until the management frame queue is empty;
If the currently allocated time slot resource cannot bear the data packet fetched from the head of the management frame queue, the next scheduling moment is directly waited.
6. The method according to claim 1, characterized in that the method further comprises:
In the process of scheduling and distributing time slot resources, the time slot resources distributed for each slave station are required to meet the time slot resources capable of transmitting a complete data packet;
Wherein,
The time slot resource capacity required to send a complete packet is 1518 bytes.
7. A millimeter wave data plane scheduling device, comprising:
The acquisition unit is used for acquiring the scheduling time slot resources of the transmitting end of the point-to-multipoint system and the coding and modulation scheme adopted by the current transmitted data when the scheduling time arrives;
a first judging unit, configured to judge whether a control frame queue of the transmitting end is empty;
The first processing unit is used for processing the control frame queue data according to a preset first data processing strategy when the execution result of the first judging unit is that the control frame queue is not empty;
the second judging unit is used for judging whether the management frame queue of the sending end is empty or not when the execution result of the first judging unit is that the control frame queue is empty;
The second processing unit is used for processing the data of the management frame queue according to the scheduling time slot resource of the transmitting end, the coding and modulation scheme adopted by the current transmitting data and a preset second data processing strategy when the execution result of the second judging unit is that the management frame queue is not empty, until the management frame queue is empty;
a third judging unit, configured to judge whether a management frame exists in an aggregated link layer protocol data unit when an execution result of the second judging unit is that the management frame queue is empty, and if the management frame exists in the aggregated link layer protocol data unit, directly wait for a next scheduling time;
A fourth judging unit, configured to judge whether a retransmission queue is empty when an execution result of the third judging unit is that the aggregated link layer protocol data unit does not have a management frame;
The third processing unit is used for sequentially taking out data packets from the head of the retransmission queue to form data information of a management frame and putting the data information into the aggregation link layer protocol data unit when the execution result of the fourth judging unit is that the retransmission queue is non-empty;
a fifth judging unit, configured to judge whether the currently remaining allocated timeslot resources are sufficient to carry data information of a management frame formed by taking out a data packet from the head of the retransmission queue;
And the first waiting processing unit is used for not performing the packet grouping operation and waiting for the arrival of the next scheduling moment when the execution result of the fifth judging unit is that the currently remaining allocated time slot resources are insufficient to bear the data information of the management frame formed by taking out the data packets from the head of the retransmission queue.
8. The apparatus of claim 7, wherein the apparatus further comprises:
a sixth judging unit, configured to judge whether a new transmission data queue of the transmitting end is empty when an execution result of the fifth judging unit is that the retransmission queue is empty;
A seventh judging unit, configured to judge whether the current time reaches a transmission window boundary when the execution result of the sixth judging unit is that the new transmission data queue is not empty;
a fourth processing unit, configured to, when the execution result of the seventh determining unit is that the current time does not reach the boundary of the transmission window, sequentially fetch data packets from the head of the new transmission data queue according to the queue header indicator in the transmission window, and put the data packets fetched from the head of the new transmission data queue into the aggregated link layer protocol data unit, where the data packets fetched from the head of the new transmission data queue are a complete load;
An eighth judging unit, configured to judge whether the currently remaining allocated timeslot resources are sufficient to carry a data packet extracted from the head of the new transmission data queue;
A fifth processing unit, configured to add a first identifier in a transmission window to a transmission queue when the execution result of the eighth determining unit is that the currently remaining allocated timeslot resource is sufficient to carry a data packet extracted from the first queue of the new transmission data queue, and place the corresponding data packet in the transmission queue, and poll the first queue of the new transmission data queue to continue to extract a next data packet until the new transmission data queue is empty;
And the second waiting processing unit is used for directly waiting for the arrival of the next scheduling moment when the execution result of the sixth judging unit is that the newly transmitted data queue is empty.
9. The apparatus of claim 8, wherein the apparatus further comprises:
A third waiting processing unit, configured to wait for a next scheduling time to arrive when the execution result of the eighth judging unit is that the currently remaining allocated timeslot resource is insufficient to carry the data packet fetched from the head of the new data queue and no aggregation operation is performed;
And the fourth waiting processing unit is used for waiting for the arrival of the next scheduling time when the execution structure of the seventh judging unit is that the current time reaches the transmission window boundary and the aggregation operation is not performed.
10. A millimeter wave data plane scheduling device, comprising: one or more processors, and memory;
Stored in the memory are computer readable instructions which, when executed by the one or more processors, implement the steps of the data plane scheduling method of millimeter waves of any one of claims 1 to 6.
CN202410338307.6A 2024-03-25 2024-03-25 Millimeter wave data surface scheduling method, device and equipment Pending CN117955926A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202410338307.6A CN117955926A (en) 2024-03-25 2024-03-25 Millimeter wave data surface scheduling method, device and equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202410338307.6A CN117955926A (en) 2024-03-25 2024-03-25 Millimeter wave data surface scheduling method, device and equipment

Publications (1)

Publication Number Publication Date
CN117955926A true CN117955926A (en) 2024-04-30

Family

ID=90793102

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202410338307.6A Pending CN117955926A (en) 2024-03-25 2024-03-25 Millimeter wave data surface scheduling method, device and equipment

Country Status (1)

Country Link
CN (1) CN117955926A (en)

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102769925A (en) * 2011-05-04 2012-11-07 中兴通讯股份有限公司 Sending method and device of control frame
US20160323426A1 (en) * 2015-04-30 2016-11-03 Newracom, Inc. Multi-user communication in wireless networks
US20180123950A1 (en) * 2016-11-03 2018-05-03 Parallel Wireless, Inc. Traffic Shaping and End-to-End Prioritization
WO2019032136A1 (en) * 2017-08-08 2019-02-14 Intel IP Corporation Apparatus, system and method of neighbor awareness networking (nan) multicast service group (nmsg) scheduling
US20190268972A1 (en) * 2018-02-26 2019-08-29 Intel IP Corporation Management frames for rate adaptation by enhanced directional multi-gigabit (edmg) stations in millimeter wave (mmwave) networks
US20210076420A1 (en) * 2019-09-09 2021-03-11 Sony Corporation Rta queue management in wireless local area network (wlan) stations
CN117675723A (en) * 2024-02-01 2024-03-08 广州天奕技术股份有限公司 Data plane scheduling method, system, device and equipment

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102769925A (en) * 2011-05-04 2012-11-07 中兴通讯股份有限公司 Sending method and device of control frame
US20160323426A1 (en) * 2015-04-30 2016-11-03 Newracom, Inc. Multi-user communication in wireless networks
US20180123950A1 (en) * 2016-11-03 2018-05-03 Parallel Wireless, Inc. Traffic Shaping and End-to-End Prioritization
WO2019032136A1 (en) * 2017-08-08 2019-02-14 Intel IP Corporation Apparatus, system and method of neighbor awareness networking (nan) multicast service group (nmsg) scheduling
US20190268972A1 (en) * 2018-02-26 2019-08-29 Intel IP Corporation Management frames for rate adaptation by enhanced directional multi-gigabit (edmg) stations in millimeter wave (mmwave) networks
US20210076420A1 (en) * 2019-09-09 2021-03-11 Sony Corporation Rta queue management in wireless local area network (wlan) stations
CN117675723A (en) * 2024-02-01 2024-03-08 广州天奕技术股份有限公司 Data plane scheduling method, system, device and equipment

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
王潍潍: ""毫米波通信系统中空间复用调度算法的研究"", 《中国优秀硕士学位论文全文数据库》, no. 11, 15 November 2017 (2017-11-15), pages 10 - 34 *
肖久夕: ""基于用户体验的点对多点WLAN资源调度算法研究"", 《中国优秀硕士学位论文全文数据库》, no. 07, 15 July 2021 (2021-07-15), pages 6 - 18 *

Similar Documents

Publication Publication Date Title
US9397791B2 (en) Transmitting data in a mobile communication system
CN101421964B (en) Method and apparatus for transmitting and receiving status report in a mobile communication system
US8428086B2 (en) Transmitting data in a mobile communication system
US7706816B2 (en) Apparatus for allocating transmission period in a wireless communication system
KR100842586B1 (en) METHOD FOR TRANSMITTING OF AGGREGATED MAC MPDUs IN WIRELESS TELECOMMUNICATION SYSTEM AND THEREFOR SYSTEM
US7636312B2 (en) Apparatus and method for moving a receive window in a radio access network
CN101843157B (en) Buffer status reporting based on radio bearer configuration
US9294248B2 (en) Method and device for use in frame acknowledgement
CN104244324A (en) Wireless link transmission method and system
US20210007008A1 (en) Method and apparatus for data segmentation and reassembly over multiple wireless links
WO2023185353A1 (en) Data transmission method, electronic device, and storage medium
Sayenko et al. Performance analysis of the IEEE 802.16 ARQ mechanism
KR20070087725A (en) Method for effectively transmitting or receiving data via wireless network, and wireless device thereof
WO2024028277A1 (en) Infrastructure equipment, communications devices and methods
CN118018629B (en) Millimeter wave data stream slicing processing method, device and equipment
CN117955926A (en) Millimeter wave data surface scheduling method, device and equipment
CN117955927B (en) Millimeter wave data stream management method, device and equipment
WO2012155419A1 (en) Method and base station for processing retransmission data
WO2012155441A1 (en) Method and base station for processing re-transmission data
Tykhomyrov et al. Analysis and performance evaluation of the IEEE 802.16 ARQ mechanism

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