CN111867114B - Method and device for determining scheduling priority - Google Patents

Method and device for determining scheduling priority Download PDF

Info

Publication number
CN111867114B
CN111867114B CN201910359925.8A CN201910359925A CN111867114B CN 111867114 B CN111867114 B CN 111867114B CN 201910359925 A CN201910359925 A CN 201910359925A CN 111867114 B CN111867114 B CN 111867114B
Authority
CN
China
Prior art keywords
terminal
scheduling
reference information
priority
packet
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.)
Active
Application number
CN201910359925.8A
Other languages
Chinese (zh)
Other versions
CN111867114A (en
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.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies 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 Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to CN201910359925.8A priority Critical patent/CN111867114B/en
Priority to PCT/CN2020/083799 priority patent/WO2020220954A1/en
Publication of CN111867114A publication Critical patent/CN111867114A/en
Application granted granted Critical
Publication of CN111867114B publication Critical patent/CN111867114B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/50Allocation or scheduling criteria for wireless resources
    • H04W72/56Allocation or scheduling criteria for wireless resources based on priority criteria
    • H04W72/566Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/12Wireless traffic scheduling
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/20Control channels or signalling for resource management
    • H04W72/21Control channels or signalling for resource management in the uplink direction of a wireless link, i.e. towards the network
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/50Allocation or scheduling criteria for wireless resources
    • H04W72/56Allocation or scheduling criteria for wireless resources based on priority criteria
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N7/00Television systems
    • H04N7/18Closed-circuit television [CCTV] systems, i.e. systems in which the video signal is not broadcast

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The embodiment of the application provides a method and a device for determining scheduling priority, relates to the technical field of communication, and aims to achieve lower packet loss rate and lower transmission delay in video transmission. The method comprises the following steps: the access network equipment receives scheduling reference information sent by a terminal when the terminal is scheduled, wherein the scheduling reference information is buffer area state information of a next data packet to be transmitted in a transmission queue of the terminal and/or the number of times of reference of a corresponding video frame; and the access network equipment determines the scheduling priority of the terminal according to the priority algorithm and the scheduling reference information.

Description

Method and device for determining scheduling priority
Technical Field
The embodiment of the application relates to the technical field of communication, in particular to a method and a device for determining scheduling priority.
Background
With the rapid development of computer networks and image processing technologies, video surveillance has been widely applied in various scenarios, such as traffic analysis, medical health, public safety, wildlife tracking, and environmental monitoring. Video monitoring is a technology for monitoring collected video data after transmission, and is divided into a wired video monitoring system and a wireless video monitoring system.
The wireless video monitoring system has the characteristics of low cost, wide application range, good expansibility, high mobility and the like, and is more widely applied. However, due to the factors of limited bandwidth resources of the wireless channel, fluctuation of transmission capacity with time, and the like, the transmission delay of the wireless video transmission system is obviously increased. In many video transmission scenes, users have certain requirements on transmission delay, and very poor experience is brought to the users due to too high delay.
Currently, the air interface protocol stack of the fifth generation mobile communication technology (5G) includes a user plane protocol (ue) and a control plane protocol (pcc), and the ue consists of a Packet Data Convergence Protocol (PDCP) layer, a Radio Link Control (RLC) layer, a Media Access Control (MAC) layer, and a physical layer. When data transmission is performed, data first arrives at the PDCP layer, which encrypts PDCP PDUs and then adds PDCP headers to the RLC layer. The PDCP PDUs are put into a buffer for transmission after arriving at the RLC layer. When the RLC layer receives the transmission instruction from the MAC layer, the RLC layer takes out data of a corresponding size from the buffer and transmits the data to the MAC layer, and the MAC layer forms the data into a transmission block and transmits the transmission block.
In order to ensure the real-time performance of wireless video transmission, a PDCP layer timing mechanism can be adopted, and the PDCP layer checks whether the PDCP PDUs in the queue are overtime, and discards the overtime PDCP PDUs, thereby improving the video transmission delay experience. However, when the PDCP packet loss rate is too high, the video quality at the receiving end is seriously degraded. Therefore, it is necessary to solve the problem of obtaining a lower packet loss rate and a lower transmission delay in video transmission.
Disclosure of Invention
The embodiment of the application provides a method and a device for determining a scheduling priority, so as to achieve a lower packet loss rate and a lower transmission delay in video transmission.
In order to achieve the above purpose, the embodiment of the present application adopts the following technical solutions:
in a first aspect, a method for determining a scheduling priority is provided, including: the access network equipment receives scheduling reference information sent by a terminal when the terminal is scheduled, wherein the scheduling reference information is buffer area state information of a next data packet to be transmitted in a transmission queue of the terminal and/or the number of times of reference of a corresponding video frame; and the access network equipment determines the scheduling priority of the terminal according to the priority algorithm and the scheduling reference information.
By the method for determining the scheduling priority, the scheduling priority is determined by combining the buffer status information of the next data packet to be transmitted in the transmission queue and/or the referred times of the corresponding video frames when the terminal is scheduled. On one hand, the buffer zone state changes in real time, so that the buffer zone state of a data packet is the most accurate when a terminal is scheduled, the determined scheduling priority is more consistent with the buffer zone state of the next data packet to be transmitted, and the high packet loss rate caused by a PDCP layer timing mechanism is avoided on the premise that the PDCP layer timing mechanism ensures low transmission delay. On the other hand, due to the video transmission interframe reference mechanism, once the data packet of the referred video frame is discarded, other frames subsequently referring to the frame are considered to be lost due to being incapable of decoding, so that the scheduling priority is determined by combining the referred times of the video frame, and the high packet loss rate caused by discarding the data packet in the video frame with high referred times due to the PDCP timing mechanism is avoided on the premise that the PDCP timing mechanism ensures low transmission delay.
With reference to the first aspect, in one possible implementation manner, the buffer status information may include at least one of the following information: dwell delay in the transmit queue, packet size. The scheduling priority of the terminal is determined through the residence time delay and/or the size of the data packet in the transmission queue, so that the scheduling priority determined for the terminal is strongly related to the residence time delay and/or the size of the data packet of the next data packet to be transmitted in the transmission queue, a higher priority is configured for the terminal to which the data packet with the residence time delay and/or the data volume is large, and the next data packet to be transmitted is prevented from being discarded due to a PDCP layer timing mechanism.
With reference to the first aspect or any one of the foregoing possible implementation manners, in another possible implementation manner, when the scheduling reference information is a residence time delay in a transmission queue, the access network device determines a scheduling priority of the terminal according to a priority algorithm and the scheduling reference information, which may specifically be implemented as: and the access network equipment acquires the queue first packet time delay of the terminal according to the resident time delay, substitutes the queue first packet time delay of the terminal into a priority algorithm and determines the scheduling priority of the terminal. In the implementation mode, the scheduling priority is determined after the delay of the first packet of the queue is determined according to the residence delay, and under the scene that the delay of the upstream first packet cannot be obtained in real time, the delay of the first packet of the queue is obtained, so that the scheduling priority is determined.
For example, in an uplink transmission system, an access network device under a New Radio (NR) protocol framework cannot acquire accurate queue first packet delay of each user in real time.
With reference to the first aspect or any one of the foregoing possible implementation manners, in another possible implementation manner, a specific implementation manner of a priority algorithm is provided, where the priority algorithm may be implemented as: and the terminal with the large value of the scheduling reference information has high scheduling priority. The probability of discarding the next data packet to be transmitted in the transmission queue of the terminal with the large value of the scheduling reference information is greatly reduced. It should be noted that, specific contents of the priority algorithm may be configured according to actual requirements, and this application is not specifically limited to this.
With reference to the first aspect or any one of the foregoing possible implementation manners, in another possible implementation manner, the present application provides a specific implementation manner of a priority algorithm, where the priority algorithm may be implemented as: and setting a factor related to the scheduling reference information, wherein the factor and the scheduling reference information are in an increasing functional relation. The purpose of high scheduling priority of the terminal with the large value of the scheduling reference information is achieved by increasing the functional relation, and the probability that the next data packet to be transmitted in the transmission queue of the terminal with the large value of the scheduling reference information is discarded is further reduced.
With reference to the first aspect or any one of the foregoing possible implementation manners, in another possible implementation manner, the obtaining, by the access network device, the queue first packet delay of the terminal according to the residence delay may specifically be implemented as: if the residence time delay tau 1 is not 0, the queue first packet time delay tau of the terminal is tau 1+ T3-T1; if τ 1 is 0, τ is T3-T2. Wherein, T1 is the time when the access network device last receives the residence time delay sent by the terminal; t2 is the time when the access network device receives the user request of the terminal after T1; t3 is the current time.
With reference to the first aspect or any one of the foregoing possible implementation manners, in another possible implementation manner, the receiving, by the access network device, scheduling reference information sent by the terminal when being scheduled may specifically be implemented as: the access network equipment receives a data packet sent by a terminal when the terminal is scheduled, and the control information of the packet head of the data packet carries scheduling reference information.
With reference to the first aspect or any one of the foregoing possible implementation manners, in another possible implementation manner, the receiving, by the access network device, scheduling reference information sent by the terminal when the terminal is scheduled may specifically be implemented as: the access network device receives a PDCP Protocol Data Unit (PDU) carrying the scheduling reference information, which is sent by the terminal when being scheduled. In the implementation mode, the existing PDCP layer packet header control information is adopted to carry the scheduling reference information, so that the resources are saved.
With reference to the first aspect or any one of the foregoing possible implementation manners, in another possible implementation manner, the receiving, by the access network device, scheduling reference information sent by the terminal when being scheduled may specifically be implemented as: and the access network equipment receives the MAC control unit CE which carries the scheduling reference information and is sent by the terminal when the terminal is scheduled. In the implementation mode, the existing MAC layer packet header control information is adopted to carry the scheduling reference information, so that the resource is saved.
With reference to the first aspect or any one of the foregoing possible implementation manners, in another possible implementation manner, the receiving, by the access network device, scheduling reference information sent by the terminal when being scheduled may specifically be implemented as: and the access network equipment receives the control information which is sent by the terminal when being scheduled and carries the scheduling reference information. Wherein the control information is transmitted on a control channel. In the implementation mode, the control information is newly defined for sending the scheduling reference information, so that the control information in the packet header of the data packet is prevented from being modified, and the implementation is simple.
With reference to the first aspect or any one of the foregoing possible implementation manners, in another possible implementation manner, the foregoing next data packet to be transmitted may include: the first packet to be transmitted, or the first packet in the queue, except the data packet to be transmitted currently.
For example, if the scheduling reference information is that the terminal reports the control information of each layer of packet header when being scheduled, the next packet to be transmitted refers to the first packet to be transmitted except the packet to be transmitted currently; and if the scheduling reference information is reported through the newly defined control information, the next packet to be transmitted is the first packet of the queue.
In a second aspect, another method for determining scheduling priority is provided, which may include: a terminal acquires scheduling reference information, wherein the scheduling reference information is buffer area state information of a next data packet to be transmitted in a transmission queue of the terminal and/or the referenced times of a corresponding video frame; when the terminal is scheduled, the terminal sends the scheduling reference information to the access network equipment, and the scheduling reference information is used for the access network equipment to determine the scheduling priority of the terminal.
By the method for determining the scheduling priority, the scheduling priority is determined by combining the buffer status information of the next data packet to be transmitted in the transmission queue and/or the referred times of the corresponding video frames when the terminal is scheduled. On one hand, the buffer area state changes in real time, so that the buffer area state of the data packet is the most accurate when the terminal is scheduled, the determined scheduling priority is more consistent with the buffer area state of the next data packet to be transmitted, and the high packet loss rate caused by the PDCP layer timing mechanism is avoided on the premise that the PDCP layer timing mechanism ensures low transmission delay. On the other hand, due to the inter-frame reference mechanism of video transmission, once the data packet of the referred video frame is discarded, other frames subsequently referring to the frame are considered to be completely lost due to being incapable of decoding, so that the scheduling priority is determined by combining the referred times of the video frame, and the high packet loss rate caused by discarding the data packet in the video frame with high referred times due to the PDCP timing mechanism is avoided on the premise that the PDCP timing mechanism ensures low transmission delay.
It should be noted that the method for determining a scheduling priority provided by the second aspect is the same as the method for determining a scheduling priority provided by the first aspect, and only the first aspect is described from the perspective of access network equipment, and the second aspect is described from the perspective of a terminal, so that reference may be made to specific implementations of the first aspect for specific implementations of the second aspect.
With reference to the second aspect, in a possible implementation manner, when the terminal is scheduled, the sending of the scheduling reference information to the access network device may specifically be implemented as: when the terminal is scheduled, the control information of the packet header of the data packet carries scheduling reference information, and the data packet is sent to the access network equipment.
With reference to the second aspect or any one of the foregoing possible implementation manners, in another possible implementation manner, the sending, by the terminal, the scheduling reference information to the access network device may specifically be implemented as: and the terminal sends the PDCP PDU carrying the scheduling reference information to the access network equipment. In the implementation mode, the existing PDCP layer packet header control information is adopted to carry the scheduling reference information, so that the resources are saved.
With reference to the second aspect or any one of the foregoing possible implementation manners, in another possible implementation manner, the sending, by the terminal, the scheduling reference information to the access network device may specifically be implemented as: and the terminal sends the MAC CE carrying the scheduling reference information to the access network equipment. The existing MAC layer packet header control information is adopted to carry the scheduling reference information, so that the resources are saved.
With reference to the second aspect or any one of the foregoing possible implementation manners, in another possible implementation manner, the sending, by the terminal, the scheduling reference information to the access network device may specifically be implemented as: and the terminal sends control information carrying the scheduling reference information to the access network equipment. Wherein the control information is transmitted on a control channel. In the implementation mode, the control information is newly defined for sending the scheduling reference information, so that the control information in the packet header of the data packet is prevented from being modified, and the implementation is simple.
In a third aspect, a method for determining scheduling priority is provided, which may include: the method comprises the steps that access network equipment receives latest scheduling reference information sent by a terminal when the scheduling reference information changes, wherein the latest scheduling reference information is the latest referenced times of a video frame corresponding to a first data packet to be transmitted in a transmission queue of the terminal; and the access network equipment determines the scheduling priority of the terminal according to a priority algorithm and the latest scheduling reference information.
According to the method for determining the scheduling priority, the scheduling priority is determined by combining the latest reference times of the video frame corresponding to the first data packet to be transmitted in the terminal transmission queue. Due to the video transmission interframe reference mechanism, once the data packet of the referenced video frame is discarded, other frames subsequently referencing the frame are considered to be totally lost due to being incapable of decoding, so that the scheduling priority is determined by combining the latest referenced times of the video frame, and the high packet loss rate caused by discarding the data packet in the video frame with high referenced times due to the PDCP timing mechanism is avoided on the premise that the PDCP timing mechanism ensures low transmission delay. In addition, the probability of the change of the referred times of the video frame is very small, and the latest scheduling reference information sent when the scheduling reference information changes reduces the system overhead.
It should be noted that the difference between the method for determining scheduling priority provided by the third aspect and the method for determining scheduling priority provided by the first aspect is: the terminal has different timings for sending the scheduling reference information and different contents of the scheduling reference information, and other specific implementations are similar to the first aspect and the implementation manner thereof, so as to refer to the first aspect or any possible implementation manner for the specific implementation of the third aspect.
With reference to the third aspect, in a possible implementation manner, a specific implementation manner of a priority algorithm is provided, where the priority algorithm may be implemented as: and the terminal with the large value of the scheduling reference information has high scheduling priority. The probability of discarding the next data packet to be transmitted in the transmission queue of the terminal with the large value of the scheduling reference information is greatly reduced. It should be noted that, specific contents of the priority algorithm may be configured according to actual requirements, and this is not specifically limited in this application.
With reference to the third aspect or any one of the foregoing possible implementation manners, in another possible implementation manner, the present application provides a specific implementation manner of a priority algorithm, where the priority algorithm may be implemented as: and setting a factor related to the scheduling reference information, wherein the factor and the scheduling reference information are in an increasing function relationship. The purpose of high scheduling priority of the terminal with the large value of the scheduling reference information is achieved by increasing the functional relation, and the probability that the next data packet to be transmitted in the transmission queue of the terminal with the large value of the scheduling reference information is discarded is further reduced.
With reference to the third aspect or any one of the foregoing possible implementation manners, in another possible implementation manner, the receiving, by the access network device, scheduling reference information sent by the terminal when scheduled may specifically be implemented as: the access network equipment receives a data packet sent by a terminal when the terminal is scheduled, and control information of a packet header of the data packet carries scheduling reference information. In the implementation mode, the control information of the existing data packet header is adopted to carry the scheduling reference information, so that the resources are saved.
For example, the scheduling reference information may be carried in a PDCP PDU or a MAC CE.
With reference to the third aspect or any one of the foregoing possible implementation manners, in another possible implementation manner, the receiving, by the access network device, scheduling reference information sent by the terminal when scheduled may specifically be implemented as: and the access network equipment receives the control information which is sent by the terminal when being scheduled and carries the scheduling reference information. Wherein the control information is transmitted on a control channel. In the implementation mode, the control information is newly defined to be used for sending the scheduling reference information, so that the control information in the packet header of the data packet is prevented from being modified, and the implementation is simple.
In a fourth aspect, a method for determining scheduling priority is provided, which may include: the terminal monitors scheduling reference information, wherein the scheduling reference information is the referred times of a video frame corresponding to a first data packet to be transmitted in a transmission queue of the terminal; when the scheduling reference information changes, the terminal sends the latest scheduling reference information to the access network equipment, and the latest scheduling reference information is used for the access network equipment to determine the scheduling priority of the terminal.
According to the method for determining the scheduling priority, the scheduling priority is determined by combining the latest reference times of the video frame corresponding to the first data packet to be transmitted in the terminal transmission queue. Due to the video transmission interframe reference mechanism, once the data packet of the referenced video frame is discarded, other frames subsequently referencing the frame are considered to be totally lost due to being incapable of decoding, so that the scheduling priority is determined by combining the latest referenced times of the video frame, and the high packet loss rate caused by discarding the data packet in the video frame with high referenced times due to the PDCP timing mechanism is avoided on the premise that the PDCP timing mechanism ensures low transmission delay. In addition, the probability of the change of the referred times of the video frame is very small, and the latest scheduling reference information sent when the scheduling reference information changes reduces the system overhead.
It should be noted that, the method for determining scheduling priority provided by the fourth aspect is the same as the method for determining scheduling priority provided by the third aspect, except that the third aspect is described from the perspective of access network equipment, and the fourth aspect is described from the perspective of a terminal, so that reference may be made to specific implementations of the third aspect in the fourth aspect.
With reference to the fourth aspect, in a possible implementation manner, when the terminal is scheduled, the method for sending the scheduling reference information to the access network device may specifically be implemented as: when the terminal is scheduled, the control information of the packet header of the data packet carries the scheduling reference information, and the data packet is sent to the access network equipment.
With reference to the fourth aspect or any one of the foregoing possible implementation manners, in another possible implementation manner, the sending, by the terminal, the scheduling reference information to the access network device may specifically be implemented as: and the terminal sends the PDCP PDU carrying the scheduling reference information to the access network equipment. In the implementation mode, the existing PDCP layer packet header control information is adopted to carry the scheduling reference information, so that the resources are saved.
With reference to the fourth aspect or any one of the foregoing possible implementation manners, in another possible implementation manner, the sending, by the terminal, the scheduling reference information to the access network device may specifically be implemented as: and the terminal sends the MAC CE carrying the scheduling reference information to the access network equipment. The existing MAC layer packet header control information is adopted to carry the scheduling reference information, so that the resources are saved.
With reference to the fourth aspect or any one of the foregoing possible implementation manners, in another possible implementation manner, the sending, by the terminal, the scheduling reference information to the access network device may specifically be implemented as: and the terminal sends control information carrying the scheduling reference information to the access network equipment. Wherein the control information is transmitted on a control channel. In the implementation mode, the control information is newly defined for sending the scheduling reference information, so that the control information in the packet header of the data packet is prevented from being modified, and the implementation is simple.
In a fifth aspect, an apparatus for determining a scheduling priority is provided, where the apparatus may be an access network device, an apparatus in the access network device, or an apparatus capable of being used in cooperation with the access network device. In one design, the apparatus may include a module corresponding to one or more of the methods/operations/steps/actions described in the first aspect, where the module may be implemented by hardware circuit, software, or a combination of hardware circuit and software. In one design, the apparatus may include a receiving module and a determining module. Exemplarily, the following steps are carried out:
the receiving module is used for receiving scheduling reference information sent by the terminal when the terminal is scheduled, wherein the scheduling reference information is buffer status information of a next data packet to be transmitted in a transmission queue of the terminal and/or the referred times of a corresponding video frame.
And the determining module is used for determining the scheduling priority of the terminal according to the priority algorithm and the scheduling reference information received by the receiving module.
The device for determining the scheduling priority determines the scheduling priority by combining the buffer status information of the next data packet to be transmitted in the transmission queue and/or the referred times of the corresponding video frames when the terminal is scheduled. On one hand, the buffer area state changes in real time, so that the buffer area state of the data packet is the most accurate when the terminal is scheduled, the determined scheduling priority is more consistent with the buffer area state of the next data packet to be transmitted, and the high packet loss rate caused by the PDCP layer timing mechanism is avoided on the premise that the PDCP layer timing mechanism ensures low transmission delay. On the other hand, due to the video transmission interframe reference mechanism, once the data packet of the referred video frame is discarded, other frames subsequently referring to the frame are considered to be lost due to being incapable of decoding, so that the scheduling priority is determined by combining the referred times of the video frame, and the high packet loss rate caused by discarding the data packet in the video frame with high referred times due to the PDCP timing mechanism is avoided on the premise that the PDCP timing mechanism ensures low transmission delay.
It should be noted that, for the apparatus for determining a scheduling priority provided by the fifth aspect, a specific implementation of the method for determining a scheduling priority provided by the first aspect may refer to a specific implementation of the first aspect.
With reference to the fifth aspect, in one possible implementation manner, the buffer status information may include at least one of the following information: residence time delay in the transmission queue, packet size. The scheduling priority of the terminal is determined through the residence time delay and/or the size of the data packet in the transmission queue, so that the scheduling priority determined for the terminal is strongly related to the residence time delay and/or the size of the data packet of the next data packet to be transmitted in the transmission queue, a higher priority is configured for the terminal to which the data packet with the residence time delay and/or the data volume is large, and the next data packet to be transmitted is prevented from being discarded due to a PDCP layer timing mechanism.
With reference to the fifth aspect or any one of the foregoing possible implementation manners, in another possible implementation manner, when the scheduling reference information is a residence time delay in a transmission queue, the determining module may be specifically configured to: and acquiring the queue first packet delay of the terminal according to the resident delay, substituting the queue first packet delay of the terminal into a priority algorithm, and determining the scheduling priority of the terminal. In the implementation mode, the scheduling priority is determined after the delay of the first packet of the queue is determined according to the resident delay, and under the scene that the delay of the upstream first packet cannot be obtained in real time, the delay of the first packet of the queue is obtained, so that the scheduling priority is determined.
With reference to the fifth aspect or any one of the foregoing possible implementation manners, in another possible implementation manner, a specific implementation manner of a priority algorithm is provided, where the priority algorithm may be implemented as: and the terminal with the large value of the scheduling reference information has high scheduling priority. The probability of discarding the next data packet to be transmitted in the transmission queue of the terminal with the large value of the scheduling reference information is greatly reduced. It should be noted that, specific contents of the priority algorithm may be configured according to actual requirements, and this application is not specifically limited to this.
With reference to the fifth aspect or any one of the foregoing possible implementation manners, in another possible implementation manner, the present application provides a specific implementation manner of a priority algorithm, where the priority algorithm may be implemented as: and setting a factor related to the scheduling reference information, wherein the factor and the scheduling reference information are in an increasing functional relation. The purpose of high scheduling priority of the terminal with the large value of the scheduling reference information is achieved by increasing the functional relation, and the probability that the next data packet to be transmitted in the transmission queue of the terminal with the large value of the scheduling reference information is discarded is further reduced.
With reference to the fifth aspect or any one of the foregoing possible implementation manners, in another possible implementation manner, the determining module obtains the queue first packet delay of the terminal according to the residence delay, and may specifically be implemented as: if the residence time delay tau 1 is not 0, the queue first packet time delay tau of the terminal is tau 1+ T3-T1; if τ 1 is 0, τ is T3-T2. Wherein, T1 is the time when the terminal last received the residence time delay sent by the terminal; t2 is the time when the user request of the terminal is received after T1; t3 is the current time.
With reference to the fifth aspect or any one of the foregoing possible implementations, in another possible implementation, the receiving module may specifically be configured to: and receiving a data packet sent by a terminal when the terminal is scheduled, wherein the control information of the packet head of the data packet carries scheduling reference information.
With reference to the fifth aspect or any one of the foregoing possible implementations, in another possible implementation, the receiving module may specifically be configured to: and receiving the PDCP PDU which is sent by the terminal when being scheduled and carries the scheduling reference information. In the implementation mode, the existing PDCP layer packet header control information is adopted to carry the scheduling reference information, so that the resources are saved.
With reference to the fifth aspect or any one of the foregoing possible implementations, in another possible implementation, the receiving module may specifically be configured to: and receiving the MAC CE carrying the scheduling reference information transmitted by the terminal when the terminal is scheduled. In the implementation mode, the existing MAC layer packet header control information is adopted to carry the scheduling reference information, so that the resource is saved.
With reference to the fifth aspect or any one of the foregoing possible implementations, in another possible implementation, the receiving module may specifically be configured to: and receiving the control information which is sent by the terminal when the terminal is scheduled and carries the scheduling reference information. Wherein the control information is transmitted on a control channel. In the implementation mode, the control information is newly defined for sending the scheduling reference information, so that the control information in the packet header of the data packet is prevented from being modified, and the implementation is simple.
With reference to the fifth aspect or any one of the foregoing possible implementation manners, in another possible implementation manner, the foregoing next data packet to be transmitted may include: the first packet to be transmitted, or the first packet in the queue, except the data packet to be transmitted currently.
In a sixth aspect, an apparatus for determining a scheduling priority is provided, where the apparatus may be a terminal, an apparatus in a terminal, or an apparatus capable of being used in cooperation with a terminal. In one design, the apparatus may include a module corresponding to one or more of the methods/operations/steps/actions described in the second aspect, where the module may be implemented by hardware circuit, software, or a combination of hardware circuit and software. In one design, the apparatus may include an acquisition module and a transmission module. Exemplarily, the following steps are carried out:
the acquisition module is used for acquiring scheduling reference information, wherein the scheduling reference information is buffer status information of a next data packet to be transmitted in a transmission queue of the terminal and/or the number of times of reference of a corresponding video frame.
A sending module, configured to send, to the access network device, the scheduling reference information acquired by the acquiring unit when the apparatus is scheduled, where the scheduling reference information is used by the access network device to determine a scheduling priority of the apparatus.
The device for determining the scheduling priority determines the scheduling priority by combining the buffer status information of the next data packet to be transmitted in the transmission queue and/or the referred times of the corresponding video frames when the data packet is scheduled. On one hand, the buffer zone state changes in real time, so that the buffer zone state of a data packet is the most accurate when the data packet is scheduled, the determined scheduling priority is more consistent with the buffer zone state of the next data packet to be transmitted, and the high packet loss rate caused by a PDCP layer timing mechanism is avoided on the premise that the PDCP layer timing mechanism ensures low transmission delay. On the other hand, due to the video transmission interframe reference mechanism, once the data packet of the referred video frame is discarded, other frames subsequently referring to the frame are considered to be lost due to being incapable of decoding, so that the scheduling priority is determined by combining the referred times of the video frame, and the high packet loss rate caused by discarding the data packet in the video frame with high referred times due to the PDCP timing mechanism is avoided on the premise that the PDCP timing mechanism ensures low transmission delay.
It should be noted that, the sixth aspect provides an apparatus for determining a scheduling priority, which is used to execute the method for determining a scheduling priority provided by the second aspect, and specific implementation may refer to specific implementation of the second aspect.
With reference to the sixth aspect, in a possible implementation manner, the sending module is specifically configured to: when the data packet is scheduled, the control information of the packet header of the data packet carries scheduling reference information, and the data packet is sent to the access network equipment.
With reference to the sixth aspect or any one of the foregoing possible implementations, in another possible implementation, the sending module is specifically configured to: and sending the PDCP PDU carrying the scheduling reference information to the access network equipment. In the implementation mode, the existing PDCP layer packet header control information is adopted to carry the scheduling reference information, so that the resources are saved.
With reference to the sixth aspect or any one of the foregoing possible implementations, in another possible implementation, the sending module is specifically configured to: and sending the MAC CE carrying the scheduling reference information to the access network equipment. The existing MAC layer packet header control information is adopted to carry the scheduling reference information, so that the resources are saved.
With reference to the sixth aspect or any one of the foregoing possible implementations, in another possible implementation, the sending module is specifically configured to: and sending control information carrying the scheduling reference information to the access network equipment. Wherein the control information is transmitted on a control channel. In the implementation mode, the control information is newly defined for sending the scheduling reference information, so that the control information in the packet header of the data packet is prevented from being modified, and the implementation is simple.
In a seventh aspect, an apparatus for determining a scheduling priority is provided, where the apparatus may be an access network device, an apparatus in the access network device, or an apparatus capable of being used in cooperation with the access network device. In one design, the apparatus may include a module corresponding to one or more of the methods/operations/steps/actions described in the first aspect, where the module may be implemented by hardware circuit, software, or a combination of hardware circuit and software. In one design, the apparatus may include a receiving module and a determining module. Exemplarily, the following steps are carried out:
and the receiving module is used for receiving the latest scheduling reference information sent by the terminal when the scheduling reference information changes, wherein the latest scheduling reference information is the latest referenced times of the video frame corresponding to the first data packet to be transmitted in the transmission queue of the terminal.
And the determining module is used for determining the scheduling priority of the terminal according to the priority algorithm and the latest scheduling reference information received by the receiving module.
The device for determining the scheduling priority determines the scheduling priority by combining the latest referenced times of the video frame corresponding to the first data packet to be transmitted in the terminal transmission queue. Due to the video transmission interframe reference mechanism, once the data packet of the referenced video frame is discarded, other frames which refer to the frame subsequently are considered to be lost completely because the frames cannot be decoded, so the scheduling priority is determined by combining the latest referenced times of the video frame, and the high packet loss rate caused by discarding the data packet in the video frame with high referenced times due to the PDCP timing mechanism is avoided on the premise that the PDCP timing mechanism ensures low transmission delay. In addition, the probability of the change of the referred times of the video frame is very small, and the latest scheduling reference information sent when the scheduling reference information changes reduces the system overhead.
It should be noted that, for the apparatus for determining a scheduling priority provided in the seventh aspect, for performing the method for determining a scheduling priority provided in the third aspect, reference may be made to a specific implementation of the third aspect.
With reference to the seventh aspect, in a possible implementation manner, a specific implementation of a priority algorithm is provided, where the priority algorithm may be implemented as: and the terminal with the large value of the scheduling reference information has high scheduling priority. The probability of discarding the next data packet to be transmitted in the transmission queue of the terminal with the large value of the scheduling reference information is greatly reduced. It should be noted that, specific contents of the priority algorithm may be configured according to actual requirements, and this is not specifically limited in this application.
With reference to the seventh aspect or any one of the foregoing possible implementations, in another possible implementation, the present application provides a specific implementation of a priority algorithm, where the priority algorithm may be implemented as: and setting a factor related to the scheduling reference information, wherein the factor and the scheduling reference information are in an increasing function relationship. The purpose of high scheduling priority of the terminal with the large value of the scheduling reference information is achieved by increasing the functional relation, and the probability that the next data packet to be transmitted in the transmission queue of the terminal with the large value of the scheduling reference information is discarded is further reduced.
With reference to the seventh aspect or any one of the foregoing possible implementations, in another possible implementation, the receiving module is specifically configured to: and receiving a data packet sent by the terminal when the terminal is scheduled, wherein the control information of the packet header of the data packet carries scheduling reference information. In the implementation mode, the control information of the existing data packet header is adopted to carry the scheduling reference information, so that the resources are saved.
For example, the scheduling reference information may be carried in a PDCP PDU or a MAC CE.
With reference to the seventh aspect or any one of the foregoing possible implementations, in another possible implementation, the receiving module is specifically configured to: and receiving control information which is sent by the terminal when the terminal is scheduled and carries scheduling reference information. Wherein the control information is transmitted on a control channel. In the implementation mode, the control information is newly defined for sending the scheduling reference information, so that the control information in the packet header of the data packet is prevented from being modified, and the implementation is simple.
In an eighth aspect, an apparatus for determining a scheduling priority is provided, where the apparatus may be a terminal, an apparatus in a terminal, or an apparatus capable of being used with a terminal. In one design, the apparatus may include a module corresponding to one or more of the methods/operations/steps/actions described in the second aspect, where the module may be implemented by hardware circuit, software, or a combination of hardware circuit and software. In one design, the apparatus may include a monitoring module and a transmitting module. Exemplarily, the following steps are carried out:
and the monitoring module is used for monitoring scheduling reference information, wherein the scheduling reference information is the referred times of a video frame corresponding to the first data packet to be transmitted in a transmission queue of the device.
And a sending module, configured to send, when the scheduling reference information changes, latest scheduling reference information to the access network device, where the latest scheduling reference information is used by the access network device to determine a scheduling priority of the terminal.
The device for determining the scheduling priority determines the scheduling priority by combining the latest reference times of the video frame corresponding to the first data packet to be transmitted in the transmission queue. Due to the video transmission interframe reference mechanism, once the data packet of the referenced video frame is discarded, other frames subsequently referencing the frame are considered to be totally lost due to being incapable of decoding, so that the scheduling priority is determined by combining the latest referenced times of the video frame, and the high packet loss rate caused by discarding the data packet in the video frame with high referenced times due to the PDCP timing mechanism is avoided on the premise that the PDCP timing mechanism ensures low transmission delay. In addition, the probability of the change of the referred times of the video frame is very small, and the latest scheduling reference information sent when the scheduling reference information changes reduces the system overhead.
It should be noted that, for the apparatus for determining a scheduling priority provided by the eighth aspect, to execute the method for determining a scheduling priority provided by the fourth aspect, a specific implementation may refer to a specific implementation of the fourth aspect.
With reference to the eighth aspect, in a possible implementation manner, the sending module is specifically configured to: when the data packet is scheduled, the control information of the packet header of the data packet carries scheduling reference information, and the data packet is sent to the access network equipment.
With reference to the eighth aspect or any one of the foregoing possible implementations, in another possible implementation, the sending module is specifically configured to: and sending the PDCP PDU carrying the scheduling reference information to the access network equipment. In the implementation mode, the existing PDCP layer packet header control information is adopted to carry the scheduling reference information, so that the resources are saved.
With reference to the eighth aspect or any one of the foregoing possible implementations, in another possible implementation, the sending module is specifically configured to: and sending the MAC CE carrying the scheduling reference information to the access network equipment. The existing MAC layer packet header control information is adopted to carry the scheduling reference information, so that the resources are saved.
With reference to the eighth aspect or any one of the foregoing possible implementations, in another possible implementation, the sending module is specifically configured to: and sending control information carrying the scheduling reference information to the access network equipment. Wherein the control information is transmitted on a control channel. In the implementation mode, the control information is newly defined for sending the scheduling reference information, so that the control information in the packet header of the data packet is prevented from being modified, and the implementation is simple.
In a ninth aspect, an embodiment of the present application provides yet another apparatus for determining a scheduling priority, where the apparatus includes a processor configured to implement the method described in the first aspect. The apparatus may further comprise a memory coupled to the processor, and the processor may implement the method described in the first aspect when executing the instructions stored in the memory. The apparatus may also include a communication interface for the apparatus to communicate with other devices, such as a transceiver, circuit, bus, module, or other type of communication interface, which may be terminals. In one possible implementation, the apparatus includes:
a memory to store instructions;
the processor is used for receiving scheduling reference information sent by the terminal when the terminal is scheduled by utilizing the communication interface, wherein the scheduling reference information is buffer area state information of a next data packet to be transmitted in a transmission queue of the terminal and/or the number of times of reference of a corresponding video frame; and determining the scheduling priority of the terminal according to the priority algorithm and the scheduling reference information.
In the present application, the instructions in the memory may be stored in advance, or may be downloaded from the internet and stored when the apparatus is used.
The coupling in the embodiments of the present application is an indirect coupling or connection between devices, units or modules, which may be in an electrical, mechanical or other form, and is used for information interaction between the devices, units or modules.
In a tenth aspect, an embodiment of the present application provides another apparatus for determining a scheduling priority, where the apparatus includes a processor configured to implement the method described in the second aspect. The apparatus may further comprise a memory coupled to the processor, and the processor may implement the method described in the second aspect when executing the instructions stored in the memory. The apparatus may also include a communication interface for the apparatus to communicate with other devices, such as a transceiver, circuit, bus, module, or other type of communication interface, which may be an access network device. In one possible implementation, the apparatus includes:
a memory to store instructions;
the processor is used for acquiring scheduling reference information, wherein the scheduling reference information is buffer area state information of a next data packet to be transmitted in a transmission queue of the terminal and/or the referred times of a corresponding video frame; and when the terminal is scheduled, the communication interface is utilized to send the scheduling reference information to the access network equipment, and the scheduling reference information is used for the access network equipment to determine the scheduling priority of the terminal.
In an eleventh aspect, an embodiment of the present application provides another apparatus for determining a scheduling priority, where the apparatus includes a processor configured to implement the method described in the third aspect. The apparatus may further comprise a memory coupled to the processor, and the processor may implement the method described in the third aspect when executing the instructions stored in the memory. The apparatus may also include a communication interface for the apparatus to communicate with other devices, such as a transceiver, circuit, bus, module, or other type of communication interface, which may be terminals. In one possible implementation, the apparatus includes:
a memory to store instructions;
the processor is used for receiving the latest scheduling reference information sent by the terminal when the scheduling reference information changes by using the communication interface, wherein the latest scheduling reference information is the latest referenced times of a video frame corresponding to the first data packet to be transmitted in a transmission queue of the terminal; and determining the scheduling priority of the terminal according to a priority algorithm and the latest scheduling reference information.
In a twelfth aspect, an embodiment of the present application provides yet another apparatus for determining a scheduling priority, where the apparatus includes a processor configured to implement the method described in the fourth aspect. The apparatus may further comprise a memory coupled to the processor, and the processor may implement the method described in the fourth aspect above when executing the instructions stored in the memory. The apparatus may also include a communication interface for the apparatus to communicate with other devices, such as a transceiver, circuit, bus, module, or other type of communication interface, which may be access network devices. In one possible implementation, the apparatus includes:
a memory to store instructions;
the processor monitors scheduling reference information, wherein the scheduling reference information is the referred times of a video frame corresponding to a first data packet to be transmitted in a transmission queue of the terminal; and when the scheduling reference information changes, the latest scheduling reference information is sent to the access network equipment by using the communication interface, and the latest scheduling reference information is used for the access network equipment to determine the scheduling priority of the terminal.
In a thirteenth aspect, an embodiment of the present application further provides a computer-readable storage medium, which includes instructions, when executed on a computer, cause the computer to perform a method for determining a scheduling priority according to any one of the above aspects or any one of the possible implementations.
In a fourteenth aspect, an embodiment of the present application provides a chip system, where the chip system includes a processor and may further include a memory, and is configured to implement the function of the access network device in the foregoing method. The chip system may be formed by a chip, and may also include a chip and other discrete devices.
In a fifteenth aspect, an embodiment of the present application provides a chip system, where the chip system includes a processor and may further include a memory, and is configured to implement the functions of the terminal in the foregoing method. The chip system may be formed by a chip, and may also include a chip and other discrete devices.
In a sixteenth aspect, a communication system is provided, where the communication system includes a first communication device and a second communication device, the first communication device may implement the method of the first aspect or any possible implementation of the first aspect, and the second communication device may implement the method of the second aspect or any possible implementation of the second aspect. For example, the first communication device is an access network device, and the second communication device is a terminal.
A seventeenth aspect provides a communication system, which includes a third communication device and a fourth communication device, wherein the third communication device may implement the method of the third aspect or the method of any possible implementation of the third aspect, and the fourth communication device may implement the method of the fourth aspect or the method of any possible implementation of the fourth aspect. For example, the third communication device is an access network device, and the fourth communication device is a terminal.
The solutions provided by the above ninth aspect to the seventeenth aspect are used for implementing the method for determining the scheduling priority provided by the above first aspect to the fourth aspect, and therefore the same beneficial effects as those of the first aspect to the fourth aspect can be achieved, and details are not repeated here.
Drawings
Fig. 1 is a schematic diagram of a communication system in which the present invention is applied;
fig. 2 is a schematic structural diagram of a communication device according to an embodiment of the present application;
fig. 3 is a flowchart illustrating a method for determining a scheduling priority according to an embodiment of the present application;
fig. 4 is a schematic structural diagram of a type of PDCP control PDU according to an embodiment of the present application;
fig. 5 is a schematic diagram of an internal architecture of a delay PDU according to an embodiment of the present application;
fig. 6 is an internal schematic diagram of a MAC PDU according to an embodiment of the present application;
fig. 6a is a schematic diagram illustrating an internal architecture of an LCID field in a MAC PDU according to an embodiment of the present application;
fig. 7 is a flowchart illustrating another method for determining a scheduling priority according to an embodiment of the present application;
fig. 8 is a schematic structural diagram of an apparatus for determining a scheduling priority according to an embodiment of the present application;
fig. 9 is a schematic structural diagram of another apparatus for determining a scheduling priority according to an embodiment of the present application;
fig. 10 is a schematic structural diagram of another apparatus for determining a scheduling priority according to an embodiment of the present application;
fig. 11 is a schematic structural diagram of another apparatus for determining a scheduling priority according to an embodiment of the present application;
fig. 12 is a schematic structural diagram of another apparatus for determining a scheduling priority according to an embodiment of the present application.
Detailed Description
In the embodiments of the present application, for convenience of clearly describing the technical solutions of the embodiments of the present application, terms such as "first" and "second" are used to distinguish the same items or similar items with substantially the same functions and actions. Those skilled in the art will appreciate that the terms "first," "second," etc. do not denote any order or quantity, nor do the terms "first," "second," etc. denote any order or importance.
In the embodiments of the present application, words such as "exemplary" or "for example" are used to mean serving as an example, instance, or illustration. Any embodiment or design described herein as "exemplary" or "such as" is not necessarily to be construed as preferred or advantageous over other embodiments or designs. Rather, use of the word "exemplary" or "such as" is intended to present relevant concepts in a concrete fashion for ease of understanding.
In the description of the present application, "/" indicates a relationship in which the objects linked before and after are "or", for example, a/B may indicate a or B; in the present application, "and/or" is only an association relationship describing an association object, and means that there may be three relationships, for example, a and/or B, and may mean: a exists alone, A and B exist simultaneously, and B exists alone, wherein A and B can be singular or plural. Also, in the description of the present application, "a plurality" means two or more than two unless otherwise specified. "at least one of the following" or similar expressions refer to any combination of these items, including any combination of the singular or plural items. For example, at least one (one) of a, b, or c, may represent: a, b, c, a-b, a-c, b-c, or a-b-c, wherein a, b, c may be single or multiple.
In the embodiments of the present application, at least one may also be described as one or more, and a plurality may be two, three, four or more, which is not limited in the present application.
In the embodiment of the present application, for a technical feature, the technical features in the technical feature are distinguished by "first", "second", "third", "a", "B", "C", and "D", and the like, and the technical features described in "first", "second", "third", "a", "B", "C", and "D" are not in a sequential order or a size order.
In addition, the network architecture and the service scenario described in the embodiment of the present application are for more clearly illustrating the technical solution of the embodiment of the present application, and do not constitute a limitation to the technical solution provided in the embodiment of the present application, and it can be known by a person skilled in the art that the technical solution provided in the embodiment of the present application is also applicable to similar technical problems along with the evolution of the network architecture and the appearance of a new service scenario.
Before describing the embodiments of the present application, a brief description of the process of wireless video transmission will be given.
The air interface protocol stack of 5G includes a user plane protocol and a control plane protocol, the user plane mainly executes transmission of user data, and the control plane mainly operates control signaling. The user plane protocol stack consists of a PDCP layer, an RLC layer, an MAC layer and a physical layer. The PDCP layer processes IP packets from the data plane and its functions include header compression and decompression, ciphering and deciphering, discarding user plane data that has timed out, etc. The RLC layer is responsible for segmentation/concatenation and reassembly of RLC Service Data Units (SDUs) to fit the size specified by the MAC layer. The MAC layer is responsible for matching logical channels and transport channels. The physical layer is responsible for the transmission of a bit stream of data. The PDCP layer, the RLC layer, and the MAC layer have corresponding PDUs and SDUs. A PDU is a data unit addressed to a lower layer, and an SDU is a data unit received from an upper layer.
In order to ensure the real-time performance of wireless video transmission, a PDCP layer timing mechanism is adopted in the current wireless video transmission. Data first arrives at the PDCP layer, which encrypts PDCP PDUs, and then adds PDCP headers to the RLC layer. The PDCP PDUs are put into a buffer for transmission after arriving at the RLC layer. When the RLC layer receives the transmission instruction from the MAC layer, the data with the corresponding size is taken out from the buffer and sent to the MAC layer. The MAC layer will group this data into transport blocks and transmit them. In order to guarantee real-time performance of the video call, the PDCP layer checks whether the PDCP PDUs in the queue have timed out. If time out, the corresponding PDCP PDU is discarded. And discarding the overtime video data through a timing mechanism of the PDCP layer so as to avoid wasting resources on the overtime video data, thereby improving the overall video transmission delay experience. However, when the PDCP packet loss rate is too high, the video quality at the receiving end is seriously degraded.
According to the h.264 compression standard, I frames and P frames are included in video pictures. The I frame, also called intra-frame coded frame, is an independent frame with all information, and can be independently decoded without referring to other pictures. The P frame, also called an inter-frame predictive coding frame, needs to refer to the previous I frame for coding, which indicates the difference between the current frame picture and the previous frame (the previous frame may be an I frame or a P frame), and when decoding the P frame, the difference defined by the current frame needs to be superimposed on the previously buffered picture to generate the final picture. P-frames generally occupy fewer data bits than I-frames. Since the amount of I-frame data is much larger than P-frames, I-frames of high importance are more likely to be discarded due to timeouts.
In downlink transmission in a scene adopting a PDCP layer timing mechanism, in order to reduce the packet loss rate of the PDCP layer, a delay factor may be considered during scheduling, and a higher scheduling priority may be set for a user with a high delay of a first packet in a queue, so as to obtain a lower packet loss rate and a lower transmission delay. However, due to an interframe reference mechanism of video transmission, only a delay factor is considered during scheduling, the number of times of reference of a video frame corresponding to each data packet is not considered, and an I frame with high importance is more easily discarded due to overtime, so that the problem that the frame loss rate of a receiving end is too high is caused. In addition, the scheduling algorithm considering the time delay factor needs to know the time delay of the first packet of the queue of the user, and this information is changed in real time, and accurate time delay information of the first packet of the queue of each user cannot be obtained in real time in an uplink transmission system.
Based on this, the application provides a method for determining a scheduling priority, which is used for determining the scheduling priority for a user in video transmission and considering a lower packet loss rate and a lower transmission delay. The basic principle is as follows: when the scheduling priority is determined, the buffer area state of the data packet to be transmitted and/or the referred times of the corresponding video frame are combined, so that the determined scheduling priority is more related to the buffer area state of the data packet to be transmitted and/or the referred times of the corresponding video frame, and high packet loss rate caused by a PDCP layer timing mechanism is avoided on the premise that the PDCP layer timing mechanism ensures low transmission delay.
It should be noted that the scheme provided in the embodiment of the present application may be applied to a terminal device or an access network device, and the type of the device executing the scheme of the present application is not specifically limited in the present application, and the following contents are not described one by one.
The terminal related to the embodiment of the application can be a device with a wireless transceiving function, and the terminal can be deployed on land and comprises an indoor or outdoor terminal, a handheld terminal or a vehicle-mounted terminal; can also be deployed on the water surface (such as a ship and the like); and may also be deployed in the air (e.g., airplanes, balloons, satellites, etc.). The terminal may be a User Equipment (UE), wherein the UE includes a handheld device, a vehicle-mounted device, a wearable device, or a computing device having wireless communication functionality. Illustratively, the UE may be a mobile phone (mobile phone), a tablet computer, or a computer with wireless transceiving function. The terminal device may also be a Virtual Reality (VR) terminal device, an Augmented Reality (AR) terminal device, a wireless terminal in industrial control, a wireless terminal in unmanned driving, a wireless terminal in telemedicine, a wireless terminal in smart grid, a wireless terminal in smart city (smart city), a wireless terminal in smart home (smart home), and so on. In the embodiment of the present application, the apparatus for implementing the function of the terminal may be a terminal; it may also be a device, such as a system-on-chip, capable of supporting the terminal to implement the function, which may be installed in the terminal. In the embodiment of the present application, the chip system may be composed of a chip, and may also include a chip and other discrete devices. In the technical solution provided in the embodiment of the present application, a device for implementing a function of a terminal is a terminal, and the terminal is a UE as an example, the technical solution provided in the embodiment of the present application is described.
The access network device related to the embodiment of the present application includes a Base Station (BS), which may be a device deployed in a radio access network and capable of performing wireless communication with a terminal. The base station may have various forms, such as a macro base station, a micro base station, a relay station, an access point, and the like. For example, the base station related to the embodiment of the present application may be a base station in 5G or a base station in a Long Term Evolution (LTE) system, where the base station in 5G may also be referred to as a Transmission Reception Point (TRP) or a gNB. In this embodiment of the present application, the apparatus for implementing the function of the access network device may be an access network device; it may also be a device, such as a chip system, capable of supporting the access network equipment to implement the function, and the device may be installed in the access network equipment. In the technical solution provided in the embodiment of the present application, an apparatus for implementing a function of a network device is an access network device, and an access network device is a base station as an example, which is described in the technical solution provided in the embodiment of the present application.
The technical scheme provided by the embodiment of the application can be applied to wireless communication among communication devices. The wireless communication between the communication devices may include: wireless communication between a network device and a terminal, wireless communication between a network device and a network device, and wireless communication between a terminal and a terminal. In the embodiments of the present application, the term "wireless communication" may also be simply referred to as "communication", and the term "communication" may also be described as "data transmission", "information transmission", or "transmission". The technical solution can be used for performing wireless communication between the scheduling entity and the subordinate entity, and those skilled in the art can use the technical solution provided in the embodiments of the present application for performing wireless communication between other scheduling entities and subordinate entities, for example, wireless communication between a macro base station and a micro base station, for example, wireless communication between a first terminal and a second terminal. In order to simplify the description, the method provided in the embodiment of the present application is described by taking communication between an access network device and a terminal device as an example.
Fig. 1 is a schematic diagram of a communication system to which the technical solution provided by the embodiment of the present application is applicable, where the communication system may include one or more access network devices 100 (only 1 is shown) and one or more terminals 200 (only 1 is shown) capable of communicating with the access network devices 100. Fig. 1 is a schematic diagram, and does not limit an application scenario of the technical solution provided in the embodiment of the present application.
The access network device 100 may be a TRP, a base station, a relay station, or an access point, etc. The access network device 100 may be a network device in a 5G communication system or an access network device in a future evolution network; but also wearable devices or vehicle-mounted devices, etc. The access network device 100 may additionally be: a Base Transceiver Station (BTS) in a global system for mobile communication (GSM) or Code Division Multiple Access (CDMA) network, or an nb (nodeb) in Wideband Code Division Multiple Access (WCDMA), or an eNB or enodeb (evolved nodeb) in LTE. The access network device 100 may also be a wireless controller in a Cloud Radio Access Network (CRAN) scenario.
Terminal 200 can be a UE, access terminal, UE unit, UE station, mobile station, remote terminal, mobile device, UE terminal, wireless communication device, UE agent, or UE device, among others. An access terminal may be a cellular phone, a cordless phone, a Session Initiation Protocol (SIP) phone, a Wireless Local Loop (WLL) station, a Personal Digital Assistant (PDA), a handheld device with wireless communication capability, a computing device, a processing device, a vehicle-mounted device, a wearable device, a terminal in a 5G network, a terminal in a future evolved Public Land Mobile Network (PLMN) network, or the like.
It should be noted that the communication system shown in fig. 1 may be an LTE system, an LTE-Advanced system, an NR system, an ultra-reliable low latency communication (URLLC) scenario, a narrowband internet of things (NB-IoT) system, an enhanced machine type communication (eMTC) system, and the like, but the communication system to which the method provided in the embodiment of the present application is applied is not limited to the above communication systems.
The technical scheme provided by the embodiment of the application can be applied to various access technologies when applied to a communication system. For example, the present invention can be applied to an Orthogonal Multiple Access (OMA) technology or a non-orthogonal multiple access (NOMA) technology. When the method is applied to the orthogonal multiple access technology, the method may be applied to Orthogonal Frequency Division Multiple Access (OFDMA) or single carrier frequency division multiple access (SC-FDMA), and the like, and the embodiments of the present application are not limited thereto. When the method is applied to the non-orthogonal multiple access technology, the method may be applied to Sparse Code Multiple Access (SCMA), multiple-user shared access (MUSA), Pattern Division Multiple Access (PDMA), Interleaved Grid Multiple Access (IGMA), resource extended multiple access (RSMA), non-orthogonal code multiple access (NCMA), or non-orthogonal code access (NOCA), and the embodiments of the present application are not limited thereto.
In addition, in the communication system shown in fig. 1, multiple antennas may be deployed on the access network device 100 and/or the terminal 200, and multiple antennas are used for communication, which significantly improves the performance of the wireless communication system. In some implementations, the access network device 100 is a transmitting end, and the terminal 200 is a receiving end; in another possible implementation manner, the terminal 200 is a transmitting end and the network device 100 is a receiving end. Referring to fig. 1, during communication, a transmitting end may transmit a signal to a receiving end using multiple antennas, and the receiving end may receive the signal using one or more antennas; or the transmitting end may use one antenna to transmit a signal to the receiving end, and the receiving end may use a plurality of antennas to receive the signal.
Before describing the embodiments of the present application, the terms referred to in the present application will be explained.
The video is composed of continuous images, and one video frame is an image. A video frame is a unit of data of an application layer.
The data packets, video frame transmissions and delivery to the network layer correspond to one or more IP packets and delivery to the PDCP layer corresponds to one or more PDCP layer data packets.
The transmission queue refers to a set of data packets waiting to be sent in a terminal buffer.
The residence time delay refers to the time from the time when the data packet arrives at the terminal buffer to the current time.
The first packet delay of the queue refers to the residence delay of the first to-be-transmitted data packet in the terminal transmission queue in the queue.
Embodiments of the present application will be described in detail below with reference to the accompanying drawings.
In one aspect, an embodiment of the present application provides a communication device. Fig. 2 illustrates a communication device 20 in connection with various embodiments of the present application. The communication device 20 may be an access network device 100 or a terminal 200 in the communication system shown in fig. 1. As shown in fig. 2, the communication device 20 may include: processor 201, memory 202, communication interface 203.
The following specifically describes each constituent element of the communication device 20 with reference to fig. 2:
a memory 202, which may be a volatile memory (volatile memory), such as a random-access memory (RAM); or a non-volatile memory (non-volatile memory), such as a read-only memory (ROM), a flash memory (flash memory), a hard disk (HDD) or a solid-state drive (SSD); or a combination of the above types of memories, for storing program code, and configuration files, which implement the methods of the present application. It should be noted that the program code and the configuration file that are stored in the memory 202 and can implement the method of the present application may be configured in advance or downloaded via the internet, and this is not particularly limited in the embodiment of the present application.
The processor 201 is a control center of the communication device 20, and may be a Central Processing Unit (CPU), an Application Specific Integrated Circuit (ASIC), or one or more integrated circuits configured to implement the embodiments of the present application, for example: one or more microprocessors (digital signal processors, DSPs), or one or more Field Programmable Gate Arrays (FPGAs). Processor 201 may perform various functions of communication device 20 by executing or executing software programs and/or modules stored in memory 202, as well as invoking data stored in memory 202.
The communication interface 203 is used for the communication device 20 to interact with other units. The communication interface 203 may be a transceiver, a circuit, a module, an interface, or the like. Communication interface 203 may also be used for communicating with a communication network, such as an ethernet, a Radio Access Network (RAN), a Wireless Local Area Network (WLAN), and so on. The communication interface 203 may include a receiving unit implementing a receiving function and a transmitting unit implementing a transmitting function.
The embodiment of the present application does not limit the specific connection medium among the communication interface 203, the processor 201, and the memory 202. In the embodiment of the present application, the memory 202, the processor 201, and the communication interface 203 are connected by a bus in fig. 2, the bus is represented by a thick line in fig. 2, and the connection manner between other components is merely illustrative and not limited thereto. The bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, only one thick line is shown in FIG. 2, but it is not intended that there be only one bus or one type of bus.
In one possible implementation, the processor 201 performs the following functions by running or executing software programs and/or modules stored in the memory 202 and calling up data stored in the memory 202:
receiving scheduling reference information sent by a terminal when the terminal is scheduled through a communication interface 203, wherein the scheduling reference information is buffer status information of a next data packet to be transmitted in a transmission queue of the terminal and/or referred times of a corresponding video frame; and determining the scheduling priority of the terminal according to the priority algorithm and the scheduling reference information.
In one possible implementation, the processor 201 performs the following functions by running or executing software programs and/or modules stored in the memory 202 and calling up data stored in the memory 202:
acquiring scheduling reference information, wherein the scheduling reference information is buffer area state information of a next data packet to be transmitted in a transmission queue of the terminal and/or the referenced times of a corresponding video frame; when scheduled, the scheduling reference information is sent to the access network device through the communication interface 203, and the scheduling reference information is used for the access network device to determine the scheduling priority of the communication device 20.
In one possible implementation, the processor 201 performs the following functions by running or executing software programs and/or modules stored in the memory 202 and invoking data stored in the memory 202:
receiving the latest scheduling reference information sent by the terminal when the scheduling reference information changes through a communication interface 203, wherein the latest scheduling reference information is the latest referenced times of a video frame corresponding to a first data packet to be transmitted in a transmission queue of the terminal; and determining the scheduling priority of the terminal according to a priority algorithm and the latest scheduling reference information.
In one possible implementation, the processor 201 performs the following functions by running or executing software programs and/or modules stored in the memory 202 and invoking data stored in the memory 202:
monitoring scheduling reference information, wherein the scheduling reference information is the referred times of a video frame corresponding to a first data packet to be transmitted in a transmission queue of the terminal; when the scheduling reference information changes, the latest scheduling reference information is sent to the access network device through the communication port 203, and the latest scheduling reference information is used by the access network device to determine the scheduling priority of the communication device 20.
It should be noted that the communication device configuration shown in fig. 2 does not constitute a limitation of the communication device, and may include more or less components than those shown, or combine some components, or arrange different components.
In another aspect, an embodiment of the present application provides a method for determining a scheduling priority, which is applied to an access network device in a communication system to determine the scheduling priority for a terminal. For an access network device, the same method for determining the scheduling priority for each terminal communicating with the access network device is used, and the embodiment of the present application only describes a process in which the access network device and a terminal interact to determine the scheduling priority for the terminal, and the following description is not repeated one by one.
As shown in fig. 3, a method for determining a scheduling priority provided by an embodiment of the present application may include:
s301, the terminal acquires scheduling reference information.
The scheduling reference information is buffer status information of a next data packet to be transmitted in a transmission queue of the terminal and/or the referenced times of the corresponding video frame.
Optionally, the next data packet to be transmitted may include: the first packet to be transmitted, or the first packet in the queue, except the data packet to be transmitted currently. In different scenarios, the next data packet to be transmitted has different definitions, which is not specifically limited in the embodiment of the present application.
For example, if the scheduling reference information is that the terminal reports the control information of each layer of packet header when being scheduled, the next packet to be transmitted refers to the first packet to be transmitted except the packet to be transmitted currently. If the scheduling reference information is reported through the newly defined control information, the next packet to be transmitted is the first packet of the queue. Certainly, the definition of the next data packet to be transmitted may be configured according to actual requirements, which is not specifically limited in this embodiment of the present application.
The buffer area state information is used for showing the characteristic of the next data packet to be transmitted in the transmission queue of the terminal in the buffer area, and the characteristic is strongly related to the quality of video transmission. In practical application, the content of the buffer status information is configured according to actual requirements on the principle that the stronger a certain buffer status of a data packet, the higher the data packet needs to be scheduled to ensure the time delay and quality of video transmission.
Illustratively, the buffer status information may include at least one of the following information: residence time delay in the transmission queue, packet size.
Specifically, if the data packet is scheduled earlier, the data packet whose residence time is extended can be prevented from being discarded by the PDCP timing mechanism, so that the quality of video transmission is improved, and therefore, the residence time delay can be used as the buffer status information. If the data packet with large data volume is discarded, the influence on the quality of video transmission is large, and if the data packet is scheduled earlier, the data packet can be prevented from being discarded by a PDCP timing mechanism, so that the quality of video transmission is improved, and the size of the data packet can be used as buffer zone state information.
Of course, the content of the buffer status information may also be determined in practical applications, and is not limited to the residence time delay and/or the data packet size in the transmission queue illustrated herein.
The number of times that the data packet corresponds to a video frame is referred to by other frames is the number of times that the video frame generating the data packet is referred to by other frames.
In a possible implementation, the content of the scheduling reference information may be an operation parameter inside the terminal, and the terminal can directly read the operation parameter in S301.
In another possible implementation, the scheduling reference information may be a parameter stored by an application layer, and the parameter is transmitted from the application layer to a network layer, and in S301, the network layer of the terminal receives the scheduling reference information transmitted by the application layer. It should be noted that, the information transmission process between the application layer and the network layer is not limited herein.
S302, when the terminal is scheduled, the terminal sends scheduling reference information to the access network equipment.
The scheduling reference information sent by the terminal to the access network device in S302 is scheduling reference information obtained by the terminal in S301. In S302, the scheduling reference information sent by the terminal is used by the access network device to determine the scheduling priority of the terminal.
Specifically, when the terminal is scheduled by the access network device, the physical layer receives the scheduling instruction, the physical layer sends a scheduling instruction to the MAC layer, the MAC layer sends a transmission instruction to the RLC layer, and the RLC layer takes out data of a scheduled size from the buffer as a data packet for transmission.
Optionally, when the terminal is scheduled in S302, specific implementation manners of sending the scheduling reference information to the access network device may include, but are not limited to, the following two implementation manners:
in the first implementation, in S302, when the terminal is scheduled, the terminal may transmit scheduling reference information carried by existing control information in each layer of packet header of a data packet to be transmitted on a data channel, so as to send the scheduling reference information to the access network device.
In a first implementation, the next packet to be transmitted refers to the first packet to be transmitted except the packet to be transmitted currently.
Illustratively, S302 may be specifically implemented as: and when the terminal is scheduled, the terminal sends PDCP PDU carrying scheduling reference information to the access network equipment. The terminal can carry the scheduling reference information in the newly defined PDU and send the PDU to the access network device.
In this way, the terminal reports the dwell delay of the next packet to be transmitted in the transmission queue through the PDCP PDU (scheduling reference information in this example is the dwell delay, and is not limited to the scheduling reference information).
Fig. 4 illustrates types of PDCP control PDUs, 000 being a PDCP status report (PDCP status report), 001 being a distributed robust header compression (ROHC) feedback packet (interleaved ROHC feedback packet), 010 being an LTE WLAN Aggregation (LWA) status report (LWA status report), 011 being an LWA end-marker packet (LWA end-marker packet), 100 being an Uplink Data Compression (UDC) feedback packet (UDC feedback packet), 101-111 being a reserved PDU Type. A new control PDU, called a delayed PDU, is defined using a reserved field of PDCP Type (PDU Type 111). When the terminal is scheduled each time, the PDCP layer uploads the dwell delay of the next to-be-transmitted data packet in the queue through the delay PDU (if there is no next to-be-transmitted packet in the queue, the dwell delay is reported to 0).
Fig. 5 illustrates an internal architecture of a delay PDU, where the first bit is 0 to indicate that the PDU is a control PDU, the 2 nd to 4 th bits are 111 to indicate that the PDU type is a newly defined delay PDU, the 5 th to 8 th bits are reserved bits, and the 9 th to 16 th bits are quantized delay.
For another example, S302 may be specifically implemented as: and when the terminal is scheduled, the terminal sends the MAC CE carrying the scheduling reference information to the access network equipment. The terminal can carry the scheduling reference information in the newly defined MAC CE to send to the access network device.
In this manner, the user reports the residence time delay of the next packet to be transmitted in the transmission queue in the queue through the MAC CE (the scheduling reference information in this example is the residence time delay, and is not limited to the scheduling reference information). Fig. 6 is an internal diagram of a MAC PDU including a MAC header (MAC header), 0 or more MAC CEs, 0 or more MAC SDUs, and Padding (Padding), where Padding is optional. The MAC CE, MAC SDU, Padding constitute a MAC payload (payload). The MAC header includes a plurality of MAC sub-headers, each MAC sub-header corresponds to one MAC CE or MAC SDU or Padding, and an LCID field in the sub-header is used to indicate which MAC SDU or MAC CE or Padding the sub-header specifically corresponds to.
Fig. 6a illustrates the internal structure of LCID field in MAC PDU, LCID has 5 bits, Index (Index) in the figure represents the specific value of LCID, and LCID value (values) represents the type of MAC CE, MAC SDU or Padding. As shown in fig. 6a, 00000 is Common Control Channel (CCCH), 00001-. And when the terminal is scheduled each time, the MAC layer uploads the resident time delay of the next data packet to be transmitted in the transmission queue through the time delay MAC CE.
For example, the implementation manner of defining the time-delay MAC CE may be to define LCID values as the time-delay MAC CE when LCID Index in sub-header is 01011. After receiving the MAC PDU, the base station reads the LCID value of 01011 in the sub-header, and then knows the corresponding time delay MAC CE of the sub-header. Since the length of the MAC CE, MAC SDU or Padding corresponding to each LCID Index is determined, the position of the delayed MAC CE can be found in the MAC PDU. For example, the length of the delay MAC CE may be set to 2 bytes, i.e. 16 bits, and if the delay quantization interval is 1 ms, it may represent a delay of 0-65535 ms.
It should be noted that the length of the time delay MAC CE may be configured according to actual requirements, and is only an integer byte, which is not specifically limited in this embodiment of the present application.
In the second implementation, in S302, the terminal sends control information carrying scheduling reference information to the access network device. The control information is transmitted on the control channel by newly defining the control information for transmitting the scheduling reference information.
S303, the access network equipment receives the scheduling reference information sent by the terminal when the terminal is scheduled.
It should be noted that the scheduling reference information received by the access network device in S303 is the scheduling reference information sent by the terminal when being scheduled in S302.
Corresponding to the description in S302, the access network device in S303 may receive the scheduling reference information sent by the terminal when being scheduled, through but not limited to the following two implementation manners, including:
in implementation mode 1, when the receiving terminal of the access network device is scheduled, scheduling reference information carried by existing control information in each layer of packet header of a data packet to be transmitted is adopted, and the scheduling reference information is transmitted on a data channel.
For example, the access network device may receive PDCP PDUs carrying scheduling reference information sent by the terminal when scheduled. The specific implementation of this method has already been described in detail in S302, and is not described herein again.
For example, the access network device may receive the MAC CE carrying the scheduling reference information sent by the terminal when being scheduled. The specific implementation of this method has already been described in detail in S302, and is not described herein again.
In implementation mode 2, the access network device receives control information carrying scheduling reference information sent by the terminal when the terminal is scheduled, and the control information is transmitted on a control channel.
S304, the access network equipment determines the scheduling priority of the terminal according to the priority algorithm and the scheduling reference information.
The priority algorithm may include: and the terminal with the large value of the scheduling reference information has high scheduling priority. In practical applications, the specific content of the priority algorithm is not specifically limited in the embodiment of the present application, and any priority algorithm with a high scheduling priority for a terminal with a large value of scheduling reference information may be used as the priority algorithm described in S304.
The embodiment of the present application provides contents of a specific priority algorithm, which may include: and setting a factor related to the scheduling reference information, wherein the factor and the scheduling reference information are in an increasing functional relation.
Wherein, the increasing functional relationship may include but is not limited to at least one of the following functional relationships: monotonically increasing linear functions, exponential functions, logarithmic functions, power functions, and the like.
It should be noted that the priority algorithm may only include a factor related to the scheduling reference information, and of course, the priority algorithm may also include a factor related to the scheduling reference information and other factors, which is not specifically limited in this embodiment of the present application.
For example, the priority algorithm may be a proportional fairness algorithm, a round robin algorithm, a maximum interference algorithm, etc., which is not specifically limited in this application.
For example, assume that the priority algorithm is a proportional fair algorithm and the calculation formula is
Figure BDA0002044119750000181
Wherein, P k Indicating the scheduling priority, P, of the kth user k The larger the value of (c) the higher the priority. R k And T k Respectively representing the current rate and the historical cumulative average rate of the kth user. Adding a factor related to scheduling reference information in a proportional fair priority calculation formula, and using A k Expressing this factor, the priority calculation formula is
Figure BDA0002044119750000182
Defining the scheduling reference information as N, then A k And N is an increasing function relationship. For example, A k =N、A k =2 N 、A k =log(N+1)、A k =N 2 And the like.
In another possible implementation, when the scheduling reference information is a residence time delay in the transmission queue, the determining, by the access network device in S304, the scheduling priority of the terminal according to the priority algorithm and the scheduling reference information may include: and acquiring the queue first packet delay of the terminal according to the resident delay, substituting the queue first packet delay of the terminal into a priority algorithm, and determining the scheduling priority of the terminal.
Illustratively, an embodiment of the present application provides an implementation manner for an access network device to obtain a queue first packet delay of a terminal according to a residence delay, where the implementation manner includes: if the residence time delay tau 1 is not 0, the queue first packet time delay tau of the terminal is tau 1+ T3-T1; if τ 1 is 0, τ is T3-T2.
Wherein, T1 is the time when the terminal last received the residence time delay sent by the terminal; t2 is a time when the user request of the terminal is received after T1; t3 is the current time. The user request may be a contention access request, an uplink scheduling request, or others.
Specifically, the access network device and each terminal communicating with the access network device execute the processes of S301 to S304, determine a scheduling priority for each terminal, and schedule each terminal according to the determined scheduling priority.
By the method for determining the scheduling priority, the scheduling priority is determined by combining the buffer status information of the next data packet to be transmitted in the transmission queue and/or the referred times of the corresponding video frames when the terminal is scheduled. On one hand, the buffer zone state changes in real time, so that the buffer zone state of a data packet is the most accurate when a terminal is scheduled, the determined scheduling priority is more consistent with the buffer zone state of the next data packet to be transmitted, and the high packet loss rate caused by a PDCP layer timing mechanism is avoided on the premise that the PDCP layer timing mechanism ensures low transmission delay. On the other hand, due to the inter-frame reference mechanism of video transmission, once the data packet of the referred video frame is discarded, other frames subsequently referring to the frame are considered to be completely lost due to being incapable of decoding, so that the scheduling priority is determined by combining the referred times of the video frame, and the high packet loss rate caused by discarding the data packet in the video frame with high referred times due to the PDCP timing mechanism is avoided on the premise that the PDCP timing mechanism ensures low transmission delay.
On the other hand, as shown in fig. 7, another method for determining a scheduling priority provided in the embodiment of the present application may include:
s701, the terminal monitors scheduling reference information.
The scheduling reference information is the referenced times of the video frame corresponding to the first data packet to be transmitted in the transmission queue of the terminal.
It should be noted that, for the manner of acquiring the scheduling reference information, details have been described in S301, and a specific implementation of S701 may refer to a specific implementation of S301, which is not described herein again.
S702, when the scheduling reference information changes, the terminal sends the latest scheduling reference information to the access network equipment.
And the latest scheduling reference information is used for the access network equipment to determine the scheduling priority of the terminal.
It should be noted that, the manner in which the terminal sends the latest scheduling reference information in S702 may refer to the manner in which the terminal sends the scheduling reference information to the access network device in S302, and details are not described here again.
S703, the access network equipment receives the latest scheduling reference information sent by the terminal when the scheduling reference information changes.
It should be noted that, in S703, when the latest scheduling reference information received by the access network device, that is, the scheduling reference information changes in 7302, the terminal sends the latest scheduling reference information to the access network device.
It should be noted that, the manner in which the access network device receives the latest scheduling reference information in S703 may refer to the manner in which the access network device receives the scheduling reference information in S303, and details are not described here again.
S704, the access network equipment determines the scheduling priority of the terminal according to the priority algorithm and the latest scheduling reference information.
The priority algorithm may include: and the terminal with the large value of the scheduling reference information has high scheduling priority.
In one possible implementation, the priority algorithm includes: and setting a factor related to the scheduling reference information, wherein the factor and the scheduling reference information are in an increasing function relationship.
It should be noted that the specific implementation of S704 is the same as the specific implementation of S304, and reference may be made to the content of S304, which is not described herein again.
The access network equipment and each terminal communicating with the access network equipment execute the processes from S701 to S704, determine the scheduling priority for each terminal, and schedule each terminal according to the determined scheduling priority.
According to the method for determining the scheduling priority, the scheduling priority is determined by combining the latest reference times of the video frame corresponding to the first data packet to be transmitted in the terminal transmission queue. Due to the video transmission interframe reference mechanism, once the data packet of the referenced video frame is discarded, other frames subsequently referencing the frame are considered to be totally lost due to being incapable of decoding, so that the scheduling priority is determined by combining the latest referenced times of the video frame, and the high packet loss rate caused by discarding the data packet in the video frame with high referenced times due to the PDCP timing mechanism is avoided on the premise that the PDCP timing mechanism ensures low transmission delay. In addition, the probability of the change of the referred times of the video frame is very small, and the latest scheduling reference information sent when the scheduling reference information changes reduces the system overhead.
In the embodiments provided in the present application, the method provided in the embodiments of the present application is introduced from the perspective of an access network device, a terminal, and interaction between the access network device and the terminal. In order to implement the functions in the method provided by the embodiments of the present application, the access network device and the terminal may include a hardware structure and/or a software module, and implement the functions in the form of a hardware structure, a software module, or a hardware structure plus a software module. Whether any of the above functions is implemented as a hardware structure, a software module, or a combination of a hardware structure and a software module depends upon the particular application and design constraints imposed on the technical solution.
The division of the modules in the embodiments of the present application is schematic, and only one logical function division is provided, and in actual implementation, there may be another division manner, and in addition, each functional module in each embodiment of the present application may be integrated in one processor, may also exist alone physically, or may also be integrated in one module by two or more modules. The integrated module can be realized in a hardware mode, and can also be realized in a software functional module mode.
In the case of dividing each functional module corresponding to each function, as shown in fig. 8, a device 80 for determining scheduling priority provided in this embodiment of the present application is used to implement the function of the access network device in the foregoing method. The apparatus 80 may be an access network device, an apparatus in the access network device, or an apparatus capable of being used with the access network device. Wherein the means 80 for determining the scheduling priority may be a system on chip. In the embodiment of the present application, the chip system may be composed of a chip, and may also include a chip and other discrete devices. As shown in fig. 8, the means 80 for determining the scheduling priority may include: a receiving module 801 and a determining module 802. The receiving module 801 is configured to execute the processes S303 and S703 in fig. 3 or fig. 7; the determining module 802 is configured to perform the processes S304 and S704 in fig. 3 or fig. 7. All relevant contents of each step related to the above method embodiment may be referred to the functional description of the corresponding functional module, and are not described herein again.
Fig. 9 shows an apparatus 90 for determining scheduling priority according to an embodiment of the present application, which is used to implement the functions of the access network device in the foregoing method. The device 90 for determining the scheduling priority may be an access network device, a device in the access network device, or a device capable of being used in cooperation with the access network device. The means 90 for determining the scheduling priority may be a system on a chip. In the embodiment of the present application, the chip system may be formed by a chip, and may also include a chip and other discrete devices. The apparatus 90 for determining scheduling priority includes at least one processing module 901, configured to implement the function of the access network device in the method provided in the embodiment of the present application. For example, the processing module 901 may be configured to execute the processes S304 and S704 in fig. 3 or fig. 7, specifically refer to the detailed description in the method example, and are not described herein again.
The means for determining scheduling priority 90 may also include at least one memory module 902 for storing program instructions and/or data. The storage module 902 is coupled to the processing module 901. The coupling in the embodiments of the present application is an indirect coupling or a communication connection between devices, units or modules, and may be an electrical, mechanical or other form for information interaction between the devices, units or modules. The processing module 901 may cooperate with the storage module 902. Processing module 901 may execute program instructions stored in storage module 902. At least one of the at least one memory module may be included in the processing module.
The means for determining scheduling priority 90 may further comprise a communication module 903 for communicating with other devices over a transmission medium, such that the means in the means for determining scheduling priority 90 may communicate with other devices. Illustratively, the other device may be a terminal. The communication module 903 is used for the apparatus to communicate with other devices. Illustratively, the processor 901 performs the procedures S303, S703 in fig. 3 or fig. 7 using the communication interface 903.
When the processing module 901 is a processor, the storage module 902 is a memory, and the communication module 903 is a communication interface, the apparatus 90 for determining scheduling priority according to fig. 9 in this embodiment may be the communication device 20 shown in fig. 2.
As mentioned above, the apparatus 80 for determining scheduling priority or the apparatus 90 for determining scheduling priority provided in the embodiments of the present application may be used to implement the functions of the access network device in the method implemented in the embodiments of the present application, and for convenience of description, only the portion related to the embodiments of the present application is shown, and details of the technology are not disclosed, please refer to the embodiments of the present application.
In the case of dividing each functional module corresponding to each function, as shown in fig. 10, an apparatus 100 for determining scheduling priority provided in the embodiment of the present application is used to implement the function of the terminal in the above method. The apparatus 100 for determining scheduling priority may be a terminal, may be an apparatus in a terminal, or may be an apparatus that can be used in cooperation with a terminal. The apparatus 100 for determining scheduling priority may be a system on a chip. In the embodiment of the present application, the chip system may be formed by a chip, and may also include a chip and other discrete devices. As shown in fig. 10, the apparatus 100 for determining a scheduling priority may include: an acquisition module 1001 and a sending module 1002. The obtaining module 1001 is configured to execute the process S301 in fig. 3; the sending module 1002 is configured to execute the process S302 in fig. 3. All relevant contents of each step related to the above method embodiment may be referred to the functional description of the corresponding functional module, and are not described herein again.
In the case of dividing each functional module according to each function, as shown in fig. 11, another apparatus 110 for determining a scheduling priority provided in this embodiment of the present application is used to implement the function of the terminal in the foregoing method. The apparatus 110 for determining the scheduling priority may be a terminal, an apparatus in the terminal, or an apparatus capable of being used in cooperation with the terminal. The means 110 for determining the scheduling priority may be a system on chip. In the embodiment of the present application, the chip system may be composed of a chip, and may also include a chip and other discrete devices. As shown in fig. 11, the means for determining scheduling priority 110 may include: a monitoring module 1101 and a sending module 1102. The monitoring module 1101 is configured to execute the process S701 in fig. 7; the sending module 1102 is configured to execute the process S702 in fig. 7. All relevant contents of each step related to the above method embodiment may be referred to the functional description of the corresponding functional module, and are not described herein again.
Fig. 12 shows an apparatus 120 for determining scheduling priority according to an embodiment of the present application, configured to implement the functions of the terminal in the foregoing method. The apparatus 120 for determining the scheduling priority may be a terminal, an apparatus in the terminal, or an apparatus capable of being used together with the terminal. The means 120 for determining the scheduling priority may be a system on chip. In the embodiment of the present application, the chip system may be composed of a chip, and may also include a chip and other discrete devices. The apparatus 120 for determining a scheduling priority includes at least one processing module 1201, configured to implement a function of a terminal in the method provided in the embodiment of the present application. For example, the processing module 1201 may be configured to execute the processes S301 and S701 in fig. 3 or fig. 7, specifically refer to the detailed description in the method example, which is not described herein again.
The means for determining scheduling priority 120 may also include at least one memory module 1202 for storing program instructions and/or data. The memory module 1202 and the processing module 1201 are coupled. The coupling in the embodiments of the present application is an indirect coupling or a communication connection between devices, units or modules, and may be an electrical, mechanical or other form for information interaction between the devices, units or modules. The processing module 1201 may cooperate with the storage module 1202. The processing module 1201 may execute program instructions stored in the storage module 1202. At least one of the at least one memory module may be included in the processing module.
The means for determining scheduling priority 120 may further comprise a communication module 1203 configured to communicate with other devices via a transmission medium, such that the means for determining scheduling priority 120 may communicate with other devices. Illustratively, the other device may be a terminal. The communication module 1203 is used for the apparatus to communicate with other devices. Illustratively, the processor 1201 performs the processes S302, S702 in fig. 3 or fig. 7 using the communication interface 1203.
When the processing module 1201 is a processor, the storage module 1202 is a memory, and the communication module 1203 is a communication interface, the apparatus 120 for determining scheduling priority according to fig. 12 in this embodiment may be the communication device 20 shown in fig. 2.
As described above, the apparatus 100 for determining scheduling priority or the apparatus 110 for determining scheduling priority or the apparatus 120 for determining scheduling priority provided in the embodiments of the present application may be used to implement the functions of the terminal in the method implemented in the embodiments of the present application, and for convenience of description, only the portion related to the embodiments of the present application is shown, and details of the specific technology are not disclosed, please refer to the embodiments of the present application.
In another aspect, an embodiment of the present application provides a communication system, where the communication system includes a first communication device and a second communication device, where the first communication device may implement a function of an access network device, and the second communication device may implement a function of a terminal. For example, the first communication device is an access network device, and the second communication device is a terminal.
As another form of this embodiment, a computer-readable storage medium is provided having stored thereon instructions that, when executed, perform the method of the above-described method embodiment.
As another form of the present embodiment, there is provided a computer program product containing instructions that, when executed, perform the method of the above-described method embodiments.
The embodiment of the present invention further provides a chip system, which includes a processor and is used for implementing the technical method of the embodiment of the present invention. In one possible design, the system-on-chip further includes a memory for storing program instructions and/or data necessary for a communication device of an embodiment of the present invention. In one possible design, the system-on-chip further includes a memory for the processor to call application code stored in the memory. The chip system may be composed of one or more chips, and may also include a chip and other discrete devices, which is not specifically limited in this embodiment of the present application.
The steps of a method or algorithm described in connection with the disclosure herein may be embodied in hardware or in software instructions executed by a processor. The software instructions may consist of corresponding software modules, which may be stored in RAM, flash memory, ROM, erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), registers, a hard disk, a removable hard disk, a compact disc read-only memory (CD-ROM), or any other form of storage medium known in the art. An exemplary storage medium is coupled to the processor such the processor can read information from, and write information to, the storage medium. Of course, the storage medium may also be integral to the processor. The processor and the storage medium may reside in an ASIC. Additionally, the ASIC may reside in a core network interface device. Of course, the processor and the storage medium may reside as discrete components in a core network interface device. Alternatively, the memory may be coupled to the processor, for example, the memory may be separate and coupled to the processor via a bus. The memory may also be integral to the processor. The memory can be used for storing application program codes for executing the technical scheme provided by the embodiment of the application, and the processor controls the execution. The processor is used for executing the application program codes stored in the memory, so as to realize the technical scheme provided by the embodiment of the application.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
Those skilled in the art will recognize that in one or more of the examples described above, the functions described herein may be implemented in hardware, software, firmware, or any combination thereof. When implemented in software, the functions may be stored on or transmitted over as one or more instructions or code on a computer-readable medium. Computer-readable media includes both computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another. A storage media may be any available media that can be accessed by a general purpose or special purpose computer. It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection of some interfaces, devices or units, and may be an electric or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may be physically included alone, or two or more units may be integrated into one unit. The integrated unit can be realized in a form of hardware, or in a form of hardware plus a software functional unit.
The integrated unit implemented in the form of a software functional unit may be stored in a computer readable storage medium. The software functional unit is stored in a storage medium and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute some steps of the methods described in the embodiments of the present application. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a read-only memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
Finally, it should be noted that: the above embodiments are only used to illustrate the technical solutions of the present application, and not to limit the same; although the present application has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions in the embodiments of the present application.

Claims (14)

1. A method for determining scheduling priority, comprising:
receiving scheduling reference information sent by a terminal when the terminal is scheduled, wherein the scheduling reference information is buffer area state information of a next data packet to be transmitted in a transmission queue of the terminal, or the scheduling reference information is buffer area state information of the next data packet to be transmitted in the transmission queue of the terminal and the referred times of a corresponding video frame; the buffer status information comprises a dwell delay in a queue;
determining the scheduling priority of the terminal according to a priority algorithm and the scheduling reference information;
the determining the scheduling priority of the terminal according to the priority algorithm and the scheduling reference information includes:
and acquiring the queue first packet delay of the terminal according to the residence delay, substituting the queue first packet delay of the terminal into the priority algorithm, and determining the scheduling priority of the terminal.
2. The method of claim 1, wherein the buffer status information further comprises: the size of the data packet.
3. The method according to claim 1 or 2, wherein the priority algorithm comprises: and the terminal with the large value of the scheduling reference information has high scheduling priority.
4. The method of claim 3, wherein the priority algorithm comprises: setting a factor related to the scheduling reference information, wherein the factor and the scheduling reference information are in an increasing function relationship.
5. The method according to claim 1 or 2, wherein the obtaining the first packet delay of the queue of the terminal according to the residence delay comprises:
if the residence time delay τ 1 is not 0, the first queue packet time delay τ of the terminal is τ 1+ T3-T1;
if τ 1 is 0, T3-T2;
wherein, the T1 is a time when the terminal receives the residence time delay sent by the terminal last time; the T2 is a time when a user request of the terminal is received after the T1; the T3 is the current time.
6. The method according to claim 1 or 2, wherein the receiving the scheduling reference information transmitted by the terminal when scheduled comprises:
receiving a Packet Data Convergence Protocol (PDCP) Protocol Data Unit (PDU) which carries the scheduling reference information and is sent by the terminal when the terminal is scheduled;
or,
receiving a Media Access Control (MAC) control unit (CE) which carries the scheduling reference information and is sent by the terminal when the terminal is scheduled;
or,
and receiving control information which is sent by the terminal when the terminal is scheduled and carries the scheduling reference information.
7. The method according to claim 1 or 2, wherein the next data packet to be transmitted comprises:
the first packet to be transmitted, or the first packet in the queue, except the data packet to be transmitted currently.
8. A method for determining scheduling priority, comprising:
acquiring scheduling reference information, wherein the scheduling reference information is buffer area state information of a next data packet to be transmitted in a transmission queue of a terminal, or the scheduling reference information is buffer area state information of the next data packet to be transmitted in the transmission queue of the terminal and the referenced times of a corresponding video frame; the buffer status information comprises a dwell delay in a queue;
when the terminal is scheduled, sending the scheduling reference information to access network equipment, wherein the scheduling reference information is used for the access network equipment to determine the scheduling priority of the terminal;
the scheduling reference information is used for the access network device to determine the scheduling priority of the terminal, and includes:
and the access network equipment acquires the queue first packet time delay of the terminal according to the residence time delay, substitutes the queue first packet time delay of the terminal into a priority algorithm and determines the scheduling priority of the terminal.
9. The method of claim 8,
the buffer status information further includes: the size of the data packet.
10. The method according to claim 8 or 9, wherein the sending the scheduling reference information to the access network device comprises:
sending a packet data convergence protocol PDCP protocol data unit PDU carrying the scheduling reference information to the access network equipment;
or,
sending a Media Access Control (MAC) control unit (CE) carrying the scheduling reference information to the access network equipment;
or,
and sending control information carrying the scheduling reference information to the access network equipment.
11. The method according to claim 8 or 9, wherein the next data packet to be transmitted comprises:
the first packet to be transmitted, or the first packet in the queue, except the data packet to be transmitted currently.
12. An apparatus for determining scheduling priority, characterized in that it is configured to implement a method for determining scheduling priority according to any one of claims 1 to 11.
13. An apparatus for determining scheduling priority, comprising a processor and a memory, the memory coupled to the processor, the processor configured to perform the method of any of claims 1 to 11.
14. A computer-readable storage medium comprising instructions which, when executed on a computer, cause the computer to perform the method of determining scheduling priority of any of claims 1 to 11.
CN201910359925.8A 2019-04-28 2019-04-28 Method and device for determining scheduling priority Active CN111867114B (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201910359925.8A CN111867114B (en) 2019-04-28 2019-04-28 Method and device for determining scheduling priority
PCT/CN2020/083799 WO2020220954A1 (en) 2019-04-28 2020-04-08 Scheduling priority determination method and apparatus

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910359925.8A CN111867114B (en) 2019-04-28 2019-04-28 Method and device for determining scheduling priority

Publications (2)

Publication Number Publication Date
CN111867114A CN111867114A (en) 2020-10-30
CN111867114B true CN111867114B (en) 2022-08-26

Family

ID=72965564

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910359925.8A Active CN111867114B (en) 2019-04-28 2019-04-28 Method and device for determining scheduling priority

Country Status (2)

Country Link
CN (1) CN111867114B (en)
WO (1) WO2020220954A1 (en)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113490281B (en) * 2021-07-20 2023-03-14 上海中兴易联通讯股份有限公司 Method and device for scheduling optimization of 5G NR (noise generation and noise reduction) system
CN114173185B (en) * 2021-12-03 2022-12-13 东北大学 IPv 6-based 360-degree video self-adaptive transmission method
CN117119056A (en) * 2022-05-16 2023-11-24 华为技术有限公司 Message processing method and device
WO2024007334A1 (en) * 2022-07-08 2024-01-11 Huawei Technologies Co., Ltd. A device and methodology for hybrid scheduling using strict priority and packet urgentness
CN115150391B (en) * 2022-07-25 2023-05-09 中电金信软件有限公司 File transmission method and device, electronic equipment and readable storage medium

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101364856A (en) * 2007-08-07 2009-02-11 鼎桥通信技术有限公司 Resource distribution method and apparatus
CN103312441A (en) * 2012-03-15 2013-09-18 华为技术有限公司 Data packet transmission method and system, transmitting end equipment and receiving end equipment

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100589474C (en) * 2007-04-29 2010-02-10 中国科学技术大学 Cross-layer scheduling method in OFDM multi-antenna system
CN101527965B (en) * 2008-03-05 2011-04-20 大唐移动通信设备有限公司 Method and system for improving uplink service quality
CN103166995B (en) * 2011-12-14 2016-08-10 华为技术有限公司 A kind of video transmission method and device
CN103369674B (en) * 2012-04-01 2016-03-30 华为技术有限公司 The distribution method of interface-free resources and equipment
US10123359B2 (en) * 2014-02-02 2018-11-06 Lg Electronics Inc. Method and apparatus for transmitting information for D2D operation in wireless communication system
WO2018030710A1 (en) * 2016-08-11 2018-02-15 Samsung Electronics Co., Ltd. Method and apparatus for scheduling uplink data in mobile communication system
CN108811099B (en) * 2017-05-03 2024-07-23 华为技术有限公司 Scheduling method and equipment for uplink transmission resources

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101364856A (en) * 2007-08-07 2009-02-11 鼎桥通信技术有限公司 Resource distribution method and apparatus
CN103312441A (en) * 2012-03-15 2013-09-18 华为技术有限公司 Data packet transmission method and system, transmitting end equipment and receiving end equipment

Also Published As

Publication number Publication date
CN111867114A (en) 2020-10-30
WO2020220954A1 (en) 2020-11-05

Similar Documents

Publication Publication Date Title
CN111867114B (en) Method and device for determining scheduling priority
US10574402B2 (en) Station (STA), access point (AP) and method for aggregation of data packets for uplink transmission
US9763238B2 (en) Signaling uplink frame duration in wireless local-area networks
WO2018202037A1 (en) Data transmission method, terminal device, and network device
JP7262591B2 (en) Wireless communication method and device
CN113766567A (en) Communication method and device
US20220368494A1 (en) Uplink re-transmission with compact memory usage
WO2024169506A1 (en) Communication method and device
EP4175356A1 (en) Wireless communication method, terminal device, and network device
CN116114254A (en) Communication method and device
WO2022223031A1 (en) Communication processing method for data transmission and related device
CN108886766B (en) Control information transmission method and device
CN115066867A (en) Uplink data transmission scheduling
WO2024082843A1 (en) Logical channel grouping method and communication apparatus
US12058039B2 (en) Packet validity time enhancement for quality of service flows
WO2024169477A1 (en) Method and apparatus for sending uplink control information
WO2023045714A1 (en) Scheduling method and communication apparatus
WO2024093908A1 (en) Communication method and related device
WO2024179407A1 (en) Information transmission method and apparatus
WO2023280047A1 (en) Communication method and device
WO2024168869A1 (en) Wireless communication method and related devices
WO2023231025A1 (en) Wireless communication method and device for extended reality traffic
WO2024001831A1 (en) Communication method, terminal device, network device and communication system
CN118102466A (en) Communication method and device, storage medium, terminal equipment and network equipment
CN117560694A (en) Communication method and device, storage medium, terminal equipment and network equipment

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant