CN111132357B - High-priority guarantee method and device for key service - Google Patents
High-priority guarantee method and device for key service Download PDFInfo
- Publication number
- CN111132357B CN111132357B CN201811284443.2A CN201811284443A CN111132357B CN 111132357 B CN111132357 B CN 111132357B CN 201811284443 A CN201811284443 A CN 201811284443A CN 111132357 B CN111132357 B CN 111132357B
- Authority
- CN
- China
- Prior art keywords
- scheduling
- key
- priority
- service
- services
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 26
- 238000012163 sequencing technique Methods 0.000 claims description 14
- 238000010586 diagram Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
- H04W72/566—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient
- H04W72/569—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient of the traffic information
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The application discloses a high-priority guarantee method for key services, which comprises the following steps: configuring the key service into a service quality grade with higher priority according to the service quality grade priority, and scheduling according to the priority sequence of the service quality grade when scheduling; for the key service which can not be carried on the service quality grade with higher priority, the key service is specially marked, when dispatching, whether the key service with the special mark is to be dispatched is judged, if yes, the key service with the special mark is dispatched preferentially. Corresponding to the method, the application also discloses a high-priority guarantee device of the key service. By applying the technical scheme disclosed by the application, the low time delay and the low packet loss rate can be realized for the key service.
Description
Technical Field
The present application relates to the field of communications technologies, and in particular, to a method and a device for guaranteeing a high priority of a key service.
Background
The QoS class in the current 3GPP protocol can guarantee the scheduling priority and scheduling delay of various services to a certain extent, but for some information in the industry, such as control class and operation class, which need special guarantees, the requirements of low delay and low packet loss rate of the information cannot be guaranteed by the QoS class alone, and special guarantees need to be performed. Specifically, there are two main types of problems:
1. some industry information cannot be normally borne on a high-priority QoS (quality of service) level, and can only be borne on a low-priority QoS level, so that the time delay and packet loss rate required by the industry cannot be met, and scheduling guarantee needs to be carried out under the condition that the priority cannot be changed.
2. The data to be transmitted with the same QoS priority is borne in the network, one part of the data is industry information with high priority needing to be guaranteed, and the other part of the data with low priority needs to be further guaranteed in scheduling of the data to be transmitted with the same QoS priority by further guaranteeing time delay and packet loss rate.
Disclosure of Invention
The application provides a high-priority guarantee method and equipment for key services, so as to realize low time delay and low packet loss rate for the key services.
The application discloses a high-priority guarantee method for key services, which comprises the following steps:
configuring the key service into a service quality grade with higher priority according to the service quality grade priority, and scheduling according to the priority sequence of the service quality grades when scheduling;
for the key service which can not be carried on the service quality grade with higher priority, the key service is specially marked, when dispatching, whether the key service with the special mark is to be dispatched is judged, if yes, the key service with the special mark is dispatched preferentially.
Preferably, the method further comprises:
dividing a subframe into a common frame and a key service frame in advance, wherein at least 1 key service frame is arranged in each period T1;
scheduling according to the priority sequence of the service quality grades on the common frames;
and on the key service frame, carrying out priority scheduling on the key service with the special identifier.
Preferably, the preferentially scheduling the key service with the special identifier on the key service frame includes:
judging whether a key service with a special identifier exists in a data packet to be scheduled, if not, scheduling the data packet on the subframe by adopting the same scheduling method as a common frame, and if so, scheduling according to the following steps:
selecting all key services with special identifications, and sequencing according to the waiting scheduling time;
the longer the waiting time is, the higher the sequencing priority is, and the higher the possibility of obtaining the priority scheduling is;
scheduling the key services in sequence according to the scheduling priority of the key services based on the waiting time sequence;
and after the key services with special identifications are all scheduled, scheduling the data packets with non-special priority if the key service frames have residual frequency domain resources.
Preferably, the method further comprises:
n subframes are taken in a period T2, and X% of frequency domain resources are reserved on each subframe, wherein N is all or part of the subframes in the period T2, and X is more than or equal to 0 and less than or equal to 100;
when scheduling, for the N subframes with reserved resources, scheduling according to the following steps:
step 1) firstly, scheduling data packets except for key services on frequency domain resources except reserved resources according to scheduling priorities;
step 2) if the key service is scheduled or the residual frequency domain resources are completely occupied, the key service is scheduled on the reserved resources;
step 3) if the key service has completely occupied the reserved resource and has key service and non-key service to be scheduled, performing step 5); if the key service is completely scheduled and the reserved resource is remained, performing step 4);
step 4) performing supplementary scheduling of non-critical services on the residual resources, and if no non-critical services to be scheduled exist, performing step 5);
and 5) carrying out next subframe scheduling.
The application also discloses a high priority guarantee device for key services, comprising: the system comprises a configuration module, an identification module and a scheduling module, wherein:
the configuration module is used for configuring the key service into a service quality grade with higher priority according to the service quality grade priority;
the identification module is used for carrying out special identification on the key service which cannot be carried on the service quality grade with higher priority;
the scheduling module is used for scheduling according to the priority sequence of the service quality grades, judging whether the key service with the special identifier is to be scheduled or not when scheduling is carried out, and if so, carrying out priority scheduling on the key service with the special identifier.
Preferably, the scheduling module is further configured to:
dividing a subframe into a common frame and a key service frame in advance, wherein at least 1 key service frame is arranged in each period T1;
scheduling according to the priority sequence of the service quality grades on the common frames;
and on the key service frame, carrying out priority scheduling on the key service with the special identifier.
Preferably, the scheduling module is further configured to:
judging whether a key service with a special identifier exists in a data packet to be scheduled, if not, scheduling the data packet on the subframe by adopting the same scheduling method as a common frame, and if so, scheduling according to the following steps:
selecting all key services with special identifications, and sequencing according to the waiting scheduling time;
the longer the waiting time is, the higher the sequencing priority is, and the higher the possibility of obtaining priority scheduling is;
scheduling the key services in sequence according to the scheduling priority of the key services based on the waiting time sequence;
and after all the key services with special identifications are scheduled and the key service frames have residual frequency domain resources, scheduling the data packets with non-special priorities.
Preferably, the scheduling module is further configured to:
n subframes are taken in a period T2, and X% of frequency domain resources are reserved on each subframe, wherein N is all or part of the subframes in the period T2, and X is more than or equal to 0 and less than or equal to 100;
when scheduling, for the N subframes with reserved resources, scheduling according to the following steps:
step 1) firstly, scheduling data packets except for key services on frequency domain resources except reserved resources according to scheduling priorities;
step 2) if the key service is scheduled or the residual frequency domain resources are completely occupied, the key service is scheduled on the reserved resources;
step 3) if the key service has completely occupied the reserved resource and has key services and non-key services to be scheduled, performing step 5); if the key service is completely scheduled and the reserved resource is remained, performing step 4);
step 4) performing supplementary scheduling of non-critical services on the residual resources, and if no non-critical services to be scheduled exist, performing step 5);
and 5) carrying out next subframe scheduling.
According to the technical scheme, the key service is configured into the service quality grade with higher priority according to the service quality grade priority, and scheduling is carried out according to the priority sequence of the service quality grade when scheduling is carried out; on the basis, for the key service which cannot be carried on the service quality level with higher priority, the key service is specially identified, whether the key service with the special identification is to be scheduled exists is judged firstly when the key service is scheduled, if so, the key service with the special identification is scheduled preferentially, so that the key service is scheduled preferentially, and the low time delay and the low packet loss rate of the key service are ensured.
Drawings
Fig. 1 is a schematic diagram of a high priority guarantee method for a key service of the present application;
fig. 2 is a schematic diagram of a composition structure of a high-priority security device for a key service in the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is further described in detail below by referring to the accompanying drawings and examples.
The present application provides a method for guaranteeing a high priority of a critical service, as shown in fig. 1, the method includes:
firstly, according to the priority of the quality of service (QoS) grade, the key service is configured into the service quality grade with higher priority, when scheduling, according to the priority sequence, the high-priority service quality grade is scheduled first, thereby ensuring that the high-priority data packet is scheduled fully.
Secondly, for some services which cannot be loaded on the service quality level with higher priority due to the requirements of industry standards or other reasons, the key services can be identified by a user identification or service identification method, and then the scheduling priority is directly raised for the key services, and the specific implementation method can be as follows: and carrying out special identification on the key service, when scheduling is carried out every TTI, firstly judging whether the key service with the special identification exists to be scheduled, if so, directly sequencing the service at the forefront of the data connection to be scheduled, and carrying out priority scheduling.
The application provides a scheme for performing priority scheduling on a key service in a time domain, which specifically comprises the following steps:
the sub-frames are divided into normal frames and key service frames, wherein 1 or more key service frames are set in each period T1. On the common frame, scheduling according to the QoS level priority, when encountering the key service frame, firstly judging whether the data packet to be scheduled has the key service with special identification, if not, adopting the same scheduling method as the common frame to schedule the data packet on the sub-frame, if so, scheduling according to the following steps:
1) Selecting all key services with special identifications, and sequencing according to the waiting scheduling time;
2) The longer the waiting time is, the higher the sequencing priority is, and the higher the possibility of obtaining priority scheduling is;
3) The key services are sequentially scheduled according to the key service scheduling priority based on the waiting time sequencing;
4) When the key service with special identification is all scheduled and the key service frame has residual frequency domain resources, the scheduling of the data packet with non-special priority can be carried out.
The above introduces a priority scheduling scheme for the key service in the time domain, and the present application also provides a scheme for resource reservation in the frequency domain, so as to ensure priority scheduling of the key service at each time. The method comprises the following steps:
taking N subframes in a period T2 (N can be all or part of subframes contained in the period T2), reserving X% of frequency domain resources on each subframe (X% of all frequency domain resources on the subframe, wherein X is more than or equal to 0 and less than or equal to 100), and scheduling the subframes with reserved resources according to the following steps during scheduling:
1) Scheduling the data packets except the key service on the frequency domain resources except the reserved resources according to the scheduling priority without changing the original scheduling priority;
2) If the key service is scheduled or the residual frequency domain resources are completely occupied, the key service is scheduled on the reserved resources;
3) If the key service has completely occupied the reserved resources and has key services and non-key services to be scheduled, performing step 5); if the key service is completely scheduled and the reserved resource is remained, performing step 4);
4) Performing supplementary scheduling of non-critical services on the remaining resources, and if no non-critical services to be scheduled exist, performing step 5);
5) And carrying out next subframe scheduling.
Corresponding to the above method, the present application further provides a high-priority security device for a key service, whose composition structure is shown in fig. 2, including: the system comprises a configuration module, an identification module and a scheduling module, wherein:
the configuration module is used for configuring the key service into a service quality grade with higher priority according to the service quality grade priority;
the identification module is used for carrying out special identification on the key service which cannot be carried on the service quality grade with higher priority;
the scheduling module is used for scheduling according to the priority sequence of the service quality grades, judging whether the key service with the special identifier is to be scheduled or not when scheduling is carried out, and carrying out priority scheduling on the key service with the special identifier if the key service with the special identifier is to be scheduled.
Preferably, the scheduling module is further configured to:
dividing a subframe into a common frame and a key service frame in advance, wherein at least 1 key service frame is arranged in each period T1;
scheduling according to the priority sequence of the service quality grades on the common frames;
and on the key service frame, carrying out priority scheduling on the key service with the special identifier.
Preferably, the scheduling module is further configured to:
judging whether a key service with a special identifier exists in a data packet to be scheduled, if not, scheduling the data packet on the subframe by adopting the same scheduling method as a common frame, and if so, scheduling according to the following steps:
selecting all key services with special identifications, and sequencing according to the waiting scheduling time;
the longer the waiting time is, the higher the sequencing priority is, and the higher the possibility of obtaining priority scheduling is;
scheduling the key services in sequence according to the scheduling priority of the key services based on the waiting time sequence;
and after the key services with special identifications are all scheduled, scheduling the data packets with non-special priority if the key service frames have residual frequency domain resources.
Preferably, the scheduling module is further configured to:
n subframes are taken in a period T2, and X% of frequency domain resources are reserved on each subframe, wherein N is all or part of the subframes in the period T2, and X is more than or equal to 0 and less than or equal to 100;
when scheduling, for the N subframes with reserved resources, scheduling according to the following steps:
step 1) firstly, scheduling data packets except for key services on frequency domain resources except reserved resources according to scheduling priorities;
step 2) if the key service is scheduled or the residual frequency domain resources are completely occupied, the key service is scheduled on the reserved resources;
step 3) if the key service has completely occupied the reserved resource and has key services and non-key services to be scheduled, performing step 5); if the key service is completely scheduled and the reserved resource is remained, performing step 4);
step 4) performing supplementary scheduling of non-critical services on the residual resources, and if no non-critical services to be scheduled exist, performing step 5);
and 5) carrying out next subframe scheduling.
The above description is only a preferred embodiment of the present application and should not be taken as limiting the present application, and any modifications, equivalents, improvements and the like made within the spirit and principle of the present application should be included in the protection scope of the present application.
Claims (6)
1. A high priority guarantee method for key service is characterized by comprising the following steps:
configuring the key service into a service quality grade with higher priority according to the service quality grade priority, and scheduling according to the priority sequence of the service quality grades when scheduling;
for key services which cannot be carried on a higher priority service quality level, carrying out special identification on the key services, when scheduling is carried out, firstly judging whether the key services with special identification exist to be scheduled, and if so, carrying out priority scheduling on the key services with special identification;
the method further comprises the following steps:
dividing a subframe into a common frame and a key service frame in advance, wherein at least 1 key service frame is arranged in each period T1;
scheduling according to the priority sequence of the service quality grades on the common frames;
and on the key service frame, carrying out priority scheduling on the key service with the special identifier.
2. The method of claim 1, wherein the preferentially scheduling the specially identified critical traffic on the critical traffic frame comprises:
judging whether a key service with a special identifier exists in a data packet to be scheduled, if not, scheduling the data packet on the subframe by adopting the same scheduling method as a common frame, and if so, scheduling according to the following steps:
selecting all key services with special identifications, and sequencing according to the waiting scheduling time;
the longer the waiting time is, the higher the sequencing priority is, and the higher the possibility of obtaining priority scheduling is;
scheduling the key services in sequence according to the scheduling priority of the key services based on the waiting time sequence;
and after the key services with special identifications are all scheduled, scheduling the data packets with non-special priority if the key service frames have residual frequency domain resources.
3. The method of claim 1, further comprising:
n subframes are taken in a period T2, and X% of frequency domain resources are reserved on each subframe, wherein N is all or part of the subframes in the period T2, and X is more than or equal to 0 and less than or equal to 100;
when scheduling, for the N subframes, scheduling according to the following steps:
step 1) firstly, scheduling data packets except for key services on frequency domain resources except reserved resources according to scheduling priorities;
step 2) if the key service is scheduled or the residual frequency domain resources are completely occupied, the key service is scheduled on the reserved resources;
step 3) if the key service has completely occupied the reserved resource and has key services and non-key services to be scheduled, performing step 5); if the key service is completely scheduled and the reserved resource is remained, performing step 4);
step 4) performing supplementary scheduling of non-critical services on the residual resources, and if no non-critical services to be scheduled exist, performing step 5);
and 5) carrying out next subframe scheduling.
4. A high priority provisioning apparatus for critical services, comprising: the system comprises a configuration module, an identification module and a scheduling module, wherein:
the configuration module is used for configuring the key service into a service quality grade with higher priority according to the service quality grade priority;
the identification module is used for carrying out special identification on key services which cannot be carried on the service quality grade with higher priority;
the scheduling module is used for scheduling according to the priority sequence of the service quality grades, judging whether the key service with the special identifier is to be scheduled or not when scheduling is carried out, and if so, carrying out priority scheduling on the key service with the special identifier;
the scheduling module is further configured to:
dividing a subframe into a common frame and a key service frame in advance, wherein at least 1 key service frame is arranged in each period T1;
scheduling according to the priority sequence of the service quality grades on the common frames;
and on the key service frame, carrying out priority scheduling on the key service with the special identifier.
5. The device of claim 4, wherein the scheduling module is further configured to:
judging whether the data packet to be scheduled has the key service with the special identifier, if not, adopting the same scheduling method as the common frame to schedule the data packet on the subframe, if so, scheduling according to the following steps:
selecting all key services with special identifications, and sequencing according to the waiting scheduling time;
the longer the waiting time is, the higher the sequencing priority is, and the higher the possibility of obtaining priority scheduling is;
scheduling the key services in sequence according to the scheduling priority of the key services based on the waiting time sequence;
and after the key services with special identifications are all scheduled, scheduling the data packets with non-special priority if the key service frames have residual frequency domain resources.
6. The device of claim 4, wherein the scheduling module is further configured to:
n subframes are taken in a period T2, and X% of frequency domain resources are reserved on each subframe, wherein N is all or part of the subframes in the period T2, and X is more than or equal to 0 and less than or equal to 100;
during scheduling, for the N subframes, scheduling is performed according to the following steps:
step 1) firstly, scheduling data packets except for key services on frequency domain resources except reserved resources according to scheduling priorities;
step 2) if the key service is scheduled or the residual frequency domain resources are completely occupied, the key service is scheduled on the reserved resources;
step 3) if the key service has completely occupied the reserved resource and has key services and non-key services to be scheduled, performing step 5); if the key service is completely scheduled and the reserved resource is remained, performing step 4);
step 4) performing supplementary scheduling of non-critical services on the residual resources, and if no non-critical services to be scheduled exist, performing step 5);
and 5) carrying out next subframe scheduling.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811284443.2A CN111132357B (en) | 2018-10-31 | 2018-10-31 | High-priority guarantee method and device for key service |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811284443.2A CN111132357B (en) | 2018-10-31 | 2018-10-31 | High-priority guarantee method and device for key service |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111132357A CN111132357A (en) | 2020-05-08 |
| CN111132357B true CN111132357B (en) | 2022-11-25 |
Family
ID=70485265
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811284443.2A Active CN111132357B (en) | 2018-10-31 | 2018-10-31 | High-priority guarantee method and device for key service |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111132357B (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102546546A (en) * | 2010-12-21 | 2012-07-04 | 中兴通讯股份有限公司 | Method and system for achieving quality of service (QoS) in identifier-based network |
| WO2012107004A1 (en) * | 2011-02-12 | 2012-08-16 | 电信科学技术研究院 | Scheduling method, device and system based on quality of service |
| CN103596285A (en) * | 2012-08-16 | 2014-02-19 | 华为技术有限公司 | Wireless resource scheduling method, wireless resource scheduler and system thereof |
| CN103618679A (en) * | 2013-11-25 | 2014-03-05 | 上海华为技术有限公司 | Service quality control method, device and system |
| CN103857050A (en) * | 2012-12-07 | 2014-06-11 | 普天信息技术研究院有限公司 | Method for scheduling resources in TD-LTE trunking communication system |
| EP2860922A1 (en) * | 2012-07-26 | 2015-04-15 | ZTE Corporation | Method and apparatus for determining scheduling policy |
| EP3107243A1 (en) * | 2010-05-25 | 2016-12-21 | Headwater Partners I LLC | Device- assisted services for protecting network capacity |
| CN106851749A (en) * | 2017-04-06 | 2017-06-13 | 上海航天测控通信研究所 | A kind of relay satellite system resource regulating method based on resource reservation |
-
2018
- 2018-10-31 CN CN201811284443.2A patent/CN111132357B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP3107243A1 (en) * | 2010-05-25 | 2016-12-21 | Headwater Partners I LLC | Device- assisted services for protecting network capacity |
| CN102546546A (en) * | 2010-12-21 | 2012-07-04 | 中兴通讯股份有限公司 | Method and system for achieving quality of service (QoS) in identifier-based network |
| WO2012107004A1 (en) * | 2011-02-12 | 2012-08-16 | 电信科学技术研究院 | Scheduling method, device and system based on quality of service |
| EP2860922A1 (en) * | 2012-07-26 | 2015-04-15 | ZTE Corporation | Method and apparatus for determining scheduling policy |
| CN103596285A (en) * | 2012-08-16 | 2014-02-19 | 华为技术有限公司 | Wireless resource scheduling method, wireless resource scheduler and system thereof |
| CN103857050A (en) * | 2012-12-07 | 2014-06-11 | 普天信息技术研究院有限公司 | Method for scheduling resources in TD-LTE trunking communication system |
| CN103618679A (en) * | 2013-11-25 | 2014-03-05 | 上海华为技术有限公司 | Service quality control method, device and system |
| CN106851749A (en) * | 2017-04-06 | 2017-06-13 | 上海航天测控通信研究所 | A kind of relay satellite system resource regulating method based on resource reservation |
Non-Patent Citations (2)
| Title |
|---|
| Service selection based on status identification in SOA;Neelavathi;《2011 3rd International Conference on Electronics Computer Technology》;20110707;全文 * |
| 面向移动应用的LTE网络协议栈（RLC和MAC层）优化;范灏;《信息科技辑》;20150915;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111132357A (en) | 2020-05-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101971681B (en) | Method for dispatching multi sub-frames and the system, the terminal and the base station thereof | |
| TWI375441B (en) | Apparatus, method and computer program product providing persistent uplink and downlink resource allocation | |
| EP2958387A1 (en) | Data transmission processing method and device | |
| US20100260185A1 (en) | Method, system and apparatus for forwarding packets | |
| CN101946463A (en) | Uplink scheduling in wireless networks | |
| CN111278016A (en) | Network slice processing method, system and storage medium | |
| CN101568155B (en) | Method for distributing radio resources | |
| Schmidt et al. | Slice scheduling with QoS-guarantee towards 5G | |
| CN100414924C (en) | A Method of Allocating Bandwidth Resources of ABIS Interface | |
| CN109392148A (en) | A kind of method, terminal and the network equipment of ascending resource distribution | |
| CN103052071B (en) | Method and equipment for distributing resources | |
| Ginthör et al. | 5G RAN slicing for deterministic traffic | |
| CN110602796A (en) | Resource scheduling method on mobile broadband shared channel and electronic equipment | |
| CN108738156B (en) | Bluetooth service scheduling method, device, equipment and computer readable storage medium | |
| CN106936644A (en) | A kind of power distribution network method for processing business and system | |
| Borin et al. | Scheduler for IEEE 802.16 networks | |
| CN110035509B (en) | A mobile communication uplink multi-slot scheduling method and system | |
| CN111132357B (en) | High-priority guarantee method and device for key service | |
| CN107205279A (en) | A kind of data transmission method and device | |
| CN109728884B (en) | Cluster data transmission method and device | |
| CN101615985A (en) | Data processing method, device and system | |
| EP2229795A1 (en) | Method for resource assignment signalling in a mobile radio communication system and base station for a mobile radio communication system | |
| JP4973452B2 (en) | Invalid data removal using WiMAX scheduler latency count | |
| CN106714325B (en) | TTI variable wireless communications method and device | |
| CN113038530A (en) | High-efficiency transmission method for packet service of QoS guarantee of satellite mobile communication system |
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 |