Data packet scheduling method and device

A scheduling method and data packet technology, applied in the field of communications, can solve problems such as failure to avoid interference, failure to avoid co-channel interference, and failure to effectively avoid mutual interference between adjacent cells, and achieve the effect of avoiding severe interference and avoiding interference.

Active Publication Date: 2020-02-04
CHENGDU TD TECH LTD
View PDF9 Cites 1 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] Existing time domain and frequency domain interference avoidance technologies are all based on the method of staggering the allocation of adjacent cell time domain resources or frequency domain resources to achieve the interference avoidance effect of adjacent cells in the time domain and frequency domain under light load, but in Under medium and high-load networks, the existing interference avoidance methods cannot effectively avoid mutual interference betw

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Data packet scheduling method and device
  • Data packet scheduling method and device
  • Data packet scheduling method and device

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0053] This embodiment describes in detail the process of scheduling large data packets that are not sensitive to delay when the service cell is performing high-priority guaranteed services and neighboring cells are performing high-priority guaranteed services.

[0054] see figure 1 , figure 1 It is a schematic diagram of the data packet scheduling process in Embodiment 1 of the present application. The specific steps are:

[0055] Step 101 , for any scheduling period, when the data packet to be scheduled is a large data packet that is not sensitive to delay, the base station determines whether the serving cell and neighboring cells are performing high-priority guaranteed services.

[0056] Step 102, if the base station determines that the serving cell is performing a high-priority guaranteed service, and the neighboring cell is performing a high-priority guaranteed service, then determine whether the neighboring cell is in a medium-to-high load state, and if so, perform step ...

Embodiment 2

[0064] This embodiment describes in detail the process of scheduling a delay-insensitive large data packet when the serving cell does not perform high-priority guaranteed services, and the adjacent cells perform high-priority guaranteed services.

[0065] see figure 2 , figure 2 It is a schematic diagram of the data packet scheduling process in Embodiment 2 of the present application. The specific steps are:

[0066] Step 201 , for any scheduling period, when the data packet to be scheduled is a large data packet that is not sensitive to delay, the base station determines whether the serving cell and neighboring cells are performing high-priority guaranteed services.

[0067] Step 202, if the base station determines that the serving cell is not performing high-priority guaranteed services, and the neighboring cells are performing high-priority guaranteed services, then determine whether the serving cell is in a light load state; if yes, execute step 203; otherwise , go to...

Embodiment 3

[0075] This embodiment describes in detail the process of scheduling large data packets that are not time-delay sensitive when the adjacent cells are not performing high-priority guaranteed services.

[0076] see image 3 , image 3 It is a schematic diagram of the data packet scheduling process in Embodiment 3 of the present application. The specific steps are:

[0077] Step 301 , for any scheduling period, when the data packet to be scheduled is a large data packet that is not sensitive to delay, the base station determines whether the serving cell and neighboring cells are performing high-priority guaranteed services.

[0078] Step 302, if the base station determines that the adjacent cell is not performing high-priority guaranteed services, schedule the data packet to be scheduled in the current scheduling period.

[0079] Based on the same inventive concept, the present application also proposes a data packet scheduling device, which is applied to medium and high load ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention provides a data packet scheduling method and device. The method comprises the steps: determining whether a service cell and an adjacent cell carry out the high-priority guarantee serviceor not in any scheduling period when a to-be-scheduled data packet is a big data packet insensitive to time delay; if it is determined that the serving cell carries out the high-priority guarantee service and the neighbor cell carries out the high-priority guarantee service, determining whether the neighbor cell is in a medium-high load state or not; when it is determined that the neighbor cell is in a medium-high load state, buffering the to-be-scheduled data packet, and determining whether to schedule or not in the next scheduling period; and when it is determined that the neighbor cell isnot in the medium-high load state, scheduling the to-be-scheduled data packet in the current scheduling period. According to the method, interference to the neighbor cell can be avoided during large data packet scheduling insensitive to time delay.

Description

technical field [0001] The present invention relates to the technical field of communication, in particular to a data packet scheduling method and device. Background technique [0002] Time Division Duplex (TDD) system remote base station interference is the intra-system interference caused by TDD’s inherent specific conditions. The strong interference generated by the uplink reception of the terminal base station. [0003] In the prior art, there are already detection and discrimination means, which can identify whether a base station is subjected to remote interference from a remote base station. [0004] Existing time domain and frequency domain interference avoidance technologies are all based on the method of staggering the allocation of adjacent cell time domain resources or frequency domain resources to achieve the interference avoidance effect of adjacent cells in the time domain and frequency domain under light load, but in Under medium and high-load networks, the...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): H04W72/12
CPCH04W72/52H04W72/569Y02D30/70
Inventor 王梦茹黄伟
Owner CHENGDU TD TECH LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap