CN112272108B - Scheduling method and device - Google Patents
Scheduling method and device Download PDFInfo
- Publication number
- CN112272108B CN112272108B CN202011095776.8A CN202011095776A CN112272108B CN 112272108 B CN112272108 B CN 112272108B CN 202011095776 A CN202011095776 A CN 202011095776A CN 112272108 B CN112272108 B CN 112272108B
- Authority
- CN
- China
- Prior art keywords
- service
- cell
- priority
- slice
- scheduling
- 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
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0893—Assignment of logical groups to network elements
Abstract
The invention discloses a scheduling method and a scheduling device, and relates to the technical field of communication. The method comprises the following steps: first, target information is acquired. Then, the service in the cell is scheduled according to the target information. Wherein the target information at least comprises the priority of the service in the cell and the slice priority state of the service in the cell. It can be seen that, when the service is scheduled, the invention not only considers the priority of the service, but also considers the slice priority state of the service. Therefore, compared with the existing method, the scheduling method provided by the invention is more variable during scheduling, and the scheduling flexibility is improved.
Description
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a scheduling method and apparatus.
Background
Network slicing (hereinafter referred to as slicing) is an on-demand networking mode, which allows an operator to separate a plurality of virtual end-to-end networks on a unified infrastructure, and each slice is logically isolated from a radio access network bearer network to a core network to adapt to various types of applications. There may be a plurality of services under one slice.
Currently, there may be multiple slices in a cell, and there may be multiple services in a slice. The existing scheduling method only schedules the services according to the priority of the services when the services are scheduled. Therefore, the existing scheduling method is single and lacks flexibility.
Disclosure of Invention
The invention provides a scheduling method and a scheduling device, which are used for improving the flexibility of service scheduling.
In order to achieve the purpose, the invention adopts the following technical scheme:
in a first aspect, the present invention provides a scheduling method, including: first, target information is acquired. Then, the service in the cell is scheduled according to the target information. The target information at least comprises the priority of the service in the cell and the slice priority state of the service in the cell.
It can be seen that, when the service is scheduled, the invention not only considers the priority of the service, but also considers the slice priority state of the service. Therefore, compared with the existing method, the scheduling method provided by the invention is more variable during scheduling, and the scheduling flexibility is improved.
In a second aspect, the present invention provides a scheduling apparatus, including: an acquisition unit and a scheduling unit. The acquisition unit is used for acquiring target information, and the target information at least comprises the priority of the service in the cell and the slice priority state of the service in the cell. And the scheduling unit is used for scheduling the service in the cell according to the target information.
In a third aspect, the invention provides a computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by a scheduling apparatus, cause the scheduling apparatus to perform the scheduling method of the first aspect.
In a fourth aspect, the present invention provides a computer program product comprising instructions which, when run on a scheduling apparatus, cause the scheduling apparatus to perform the scheduling method according to the first aspect.
In a fifth aspect, the present invention provides a scheduling apparatus, including: a processor and a memory, the memory being arranged to store a program, the processor calling the program stored by the memory to perform the scheduling method as described in the first aspect.
Reference may be made to the detailed description of the first aspect and various implementations thereof; moreover, the beneficial effects of the second aspect to the fifth aspect and the various implementation manners thereof may refer to the beneficial effect analysis of the first aspect and the various implementation manners thereof, and are not described herein again.
These and other aspects of the invention will be more readily apparent from the following description.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings needed to be used in the description of the embodiments will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
Fig. 1 is a schematic structural diagram of a scheduling apparatus according to an embodiment of the present invention;
fig. 2 is a flowchart illustrating a scheduling method according to an embodiment of the present invention;
fig. 3 is a flowchart illustrating a scheduling method according to an embodiment of the present invention;
fig. 4 is a schematic structural diagram of a scheduling apparatus according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The term "and/or" herein is merely an association describing an associated object, meaning that three relationships may exist, e.g., a and/or B, may mean: a exists alone, A and B exist simultaneously, and B exists alone.
The terms "first" and "second" and the like in the description of the present invention and the drawings are used for distinguishing different objects or for distinguishing different processes for the same object, and are not used for describing a specific order of objects.
Furthermore, the terms "comprising" and "having" and any variations thereof as referred to in the description of the invention are intended to cover non-exclusive inclusions. For example, a process, method, system, article, or apparatus that comprises a list of steps or elements is not limited to only those steps or elements listed, but may alternatively include other steps or elements not listed, or inherent to such process, method, article, or apparatus.
It should be noted that in the description of the embodiments of the present invention, words such as "exemplary" or "for example" are used to indicate examples, illustrations or illustrations. Any embodiment or design described as "exemplary" or "such as" in an embodiment of the present invention 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 concepts related in a concrete fashion.
In the description of the present invention, the meaning of "a plurality" means two or more unless otherwise specified.
Brief introduction of the prior art:
currently, the 3GPP protocol defines four broad categories of slices: enhanced mobile broadband (eMBB), mass machine type communication (mtc), ultra-high reliable and low latency communication (URLLC), and vehicular wireless communication technology (vehicle to x, V2X).
The wireless side mainly realizes resource isolation and guarantee of the network slice at a New Radio (NR) Radio Access Network (RAN) part. At present, according to the delay, reliability and isolation requirements of a service, the terminal switching mode can be divided into soft switching and hard switching, where the soft switching includes slice-level quality of service (QoS) guarantee, and the hard switching includes dynamic reservation and static reservation of an air interface.
The QoS guarantee is scheduling based on QoS, and can ensure that different services are "customized as required" under the condition of limited resources, and provide network services with differentiated service quality for the services, including service scheduling weight, admission threshold, queue management threshold and the like.
Resource reservation, i.e., Resource Block (RB) resource reservation, allows multiple slices to share the RB resources of the same cell. And reserving and allocating a certain amount of RB resources for the specific slice according to the resource requirement of each slice. RB reservation is divided into static reservation and dynamic sharing.
The dynamic sharing mode comprises the following steps: the resources reserved for a given slice allow some multiplexing with other slices. When the slice does not need to use the reserved RB resources, the reserved RB resources of the slice may be partially or completely used for other slice data transmission. When data transmission exists between uplink and downlink, the required resources can be allocated in time.
A static reservation mode: the resources reserved for a given slice cannot be allocated for use by other slice users at any time. Ensuring that sufficient resources are available at any time.
Carrier isolation: different carrier cells are used by different slices, each slice only uses the air interface resource of the cell, and the slices are strictly distinguished to ensure respective resources.
Fifth generation mobile communication technology (5th generation mobile networks), 5G QoS is a framework based on QoS flows (QoS flows), which are the minimum granularity of 5G QoS control, each QoS Flow is uniquely identified by a QoS Flow Id (QFI), which is unique in each Protocol Data Unit (PDU) session.
The 5QI is a scalar used to index a 5G QoS characteristic. The 5G QoS characteristics include, but are not limited to, traffic type, priority, and traffic example, where the traffic type is used to characterize whether the traffic is Guaranteed Bit Rate (GBR) traffic or Non-guaranteed bit rate (Non-GBR). Table 1 shows a mapping relationship of 5QI to 5G QoS characteristics.
TABLE 1
In table 1, the priority of the service is used to indicate the priority level of the service, and the smaller the priority value of the service is, the higher the priority of the service is.
At present, slice-based soft switching is realized based on QoS, that is, QoS flow is allocated to different service flows under different slices, and then resources are allocated to the services in the slices according to the priority of the QoS flow. This scheduling method is relatively single and lacks flexibility. For example, if it is desired to ensure that all services in a slice have higher priority than all services in another slice, this can only be achieved if all services in the slice have higher priorities than all services in another slice.
In order to improve the flexibility of scheduling, an embodiment of the present invention provides a scheduling method, which may be executed by the scheduling apparatus 100. Fig. 1 shows a hardware configuration of the scheduling apparatus 100. As shown in fig. 1, the scheduling apparatus 100 may include a processor 101, a communication line 102, a memory 103, and a communication interface 104.
The illustrated structure of the embodiment of the present invention does not limit the scheduling apparatus 100. It may include more or fewer components than shown, or combine certain components, or split certain components, or a different arrangement of components. The illustrated components may be implemented in hardware, software, or a combination of software and hardware.
The controller may be a decision maker directing the various components of the scheduling apparatus 100 to work in concert as instructed. Are the neural center and the command center of the scheduling device 100. The controller generates an operation control signal according to the instruction operation code and the time sequence signal to complete the control of instruction fetching and instruction execution.
A memory may also be provided in the processor 101 for storing instructions and data. In some embodiments, the memory in the processor is a cache memory that may hold instructions or data that have just been used or recycled by the processor. If the processor needs to reuse the instruction or data, it can be called directly from memory. Avoiding repeated accesses reduces the latency of the processor and thus increases the efficiency of the system.
In some embodiments, the processor 101 may include an interface. The interface may include an integrated circuit (I2C) interface, an integrated circuit built-in audio (I2S) interface, a Pulse Code Modulation (PCM) interface, a universal asynchronous receiver/transmitter (UART) interface, a Mobile Industry Processor Interface (MIPI), a general-purpose input/output (GPIO) interface, a Subscriber Identity Module (SIM) interface, and/or a Universal Serial Bus (USB) interface, etc.
A communication line 102 for transmitting information between the processor 101 and the memory 103.
The memory 103 is used for storing and executing computer execution instructions and is controlled by the processor 101 to execute.
The memory 103 may be separate and coupled to the processor via the communication line 102. The memory 103 may be either volatile memory or nonvolatile memory, or may include both volatile and nonvolatile memory. The non-volatile memory may be a read-only memory (ROM), a Programmable ROM (PROM), an Erasable PROM (EPROM), an Electrically Erasable PROM (EEPROM), or a flash memory. Volatile memory can be Random Access Memory (RAM), which acts as external cache memory. By way of example, and not limitation, many forms of RAM are available, such as Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), Synchronous Dynamic Random Access Memory (SDRAM), double data rate SDRAM, Enhanced SDRAM (ESDRAM). It should be noted that the memory of the systems and apparatus described herein is intended to comprise, without being limited to, these and any other suitable types of memory.
A communication interface 104 for communicating with other devices or a communication network. The communication network may be an ethernet, a Radio Access Network (RAN), or a Wireless Local Area Network (WLAN), a Bluetooth (BT), a Global Navigation Satellite System (GNSS), a Frequency Modulation (FM), a Near Field Communication (NFC), an infrared technology (infrared, IR), or the like.
The following describes a scheduling method according to an embodiment of the present invention with reference to the scheduling apparatus 100 shown in fig. 1.
As shown in fig. 2, the scheduling method provided in the embodiment of the present invention includes:
s201, the scheduling apparatus 100 acquires target information.
Specifically, when a slice service in a cell is established, the scheduling apparatus 100 acquires target information through a core network.
The target information at least comprises the priority of the service in the cell and the slice priority state of the service in the cell.
The target information may also include a slice priority of traffic within the cell and a preconfigured slice priority of traffic within the cell.
The slice priority status of the service is used for representing whether the slice priority of the service is effective or not.
The slice priority state may also be referred to as a slice priority validation determination bit (bit), and the state of the slice priority may be represented by a value of the slice priority validation determination bit. For example, when the slice priority validation determination bit position 1, the slice priority takes effect. When the slice priority validation determination bit position is 0, the slice priority is not validated (invalidated). The slicing priority status of the service is determined when the service is signed.
Illustratively, the Slice Priority of the traffic may be represented by Slice _ Priority i And (4) showing. The slice priorities of the services within the same slice are the same. The lower the value of the slice priority, the higher the slice priority. The priority of the slice is determined at the time of slice subscription.
Illustratively, the pre-configured slice Priority of the service may be Predefined _ Priority i And (4) showing. The preconfigured slice priorities of the services with the same priority may be the same or different, and this is not limited in the embodiment of the present invention.
The scheduling apparatus 100 may directly obtain the priority of the service, or may indirectly obtain the priority of the service by obtaining the 5QI value of the service, or obtain the priority of the service by using other methods, which is not limited in the embodiment of the present invention.
S202, the scheduling apparatus 100 schedules the service in the cell according to the target information.
It can be seen from the foregoing S201-S202 that, in the embodiment of the present invention, when scheduling a service, not only the priority of the service but also the slice priority state of the service are considered. Therefore, compared with the existing method, the scheduling method provided by the embodiment of the invention is more variable during scheduling, and the scheduling flexibility is improved.
Referring to fig. 2, as shown in fig. 3, S202 may include:
s2021, the scheduling apparatus 100 schedules the service in the cell according to the priority of the service in the cell when only the first service exists in the cell.
The first service is a service with a slice priority in an invalid state.
Specifically, when only the first service exists in the cell, the scheduling apparatus 100 schedules the services in the cell in the order of the priority of the services from high to low.
It should be noted that, in order to schedule a certain service preferentially, the priority of the service may be set to be a high priority, and the slice priority states of all services in the cell are set to be in a non-effective state, that is, all services in the cell are set to be the first service.
Correspondingly, in order to schedule a certain service in a delayed manner, the priority of the service may be set to be a low priority, and the slice priority states of all services in the cell are set to be in a non-effective state, that is, all services in the cell are set to be the first service.
Illustratively, there are slice 1 and slice 2 within the cell. Slice _ Priority of Slice 1 i Slice 1 contains 5QI1 traffic, 5QI2 traffic, and 5QI9 traffic. Slice _ Priority of Slice 2 i Slice 2 contains 5QI1 traffic, 5QI2 traffic, 5QI3, and 5QI 8. As can be seen from table 1, the 5QI1 service corresponds to a priority value of 20, the 5QI2 service corresponds to a priority value of 40, the 5QI3 service corresponds to a priority value of 30, the 5QI8 service corresponds to a priority value of 80, and the 5QI9 service corresponds to a priority value of 90.
When slice priority validation determination bit bits of slice 1 5QI1 traffic of slice 1, slice 2 5QI1 traffic, slice 1 5QI2 traffic, slice 2 5QI2 traffic, 5QI3 traffic, 5QI8 traffic, and 5QI9 traffic are all set to 0 (that is, when only the first traffic exists in the cell), scheduling apparatus 100 schedules the traffic in the cell in the order of "5 QI1 traffic of slice 1 ═ 5QI1 traffic of slice 2 > 5QI3 traffic of slice 2 > 5QI2 traffic of slice 1 ═ 5QI2 traffic of slice 2 > 5QI8 traffic of slice 2 > 5QI9 traffic of slice 1".
S2022, when only the second service exists in the cell, the scheduling apparatus 100 schedules the service in the cell according to the priority of the service in the cell and the slice priority of the service in the cell.
The second service is a service with a slice priority as a valid state.
Specifically, in the embodiment of the present invention, according to the priority of the service in the cell and the slice priority of the service in the cell, scheduling the service in the cell may include:
the scheduling apparatus 100 determines a scheduling order of the services in the cell according to the priority of the services in the cell and the slice priority of the services in the cell, where the scheduling order is that the services with different slice priorities are scheduled from high to low according to the slice priorities of the services, and the services with the same slice priority are scheduled from high to low according to the priorities of the services.
That is, when allocating (scheduling) resources, all services in a slice with a high priority have priority guarantee rights with respect to all services in a slice with a low priority. And scheduling the services in the slices according to the priority corresponding to the 5 QI.
The scheduling apparatus 100 schedules the intra-cell services according to the scheduling order of the intra-cell services.
It should be noted that, in order to schedule all services in a slice preferentially, the priority of the slice may be set to be a high priority, and the slice priority states of all services in the cell are set to be in an active state, that is, all services in the cell are set to be the second service.
Correspondingly, in order to schedule all services in a slice in a delayed manner, the priority of the slice may be set to be a low priority, and the slice priority states of all services in the cell are set to be in an effective state, that is, all services in the cell are set to be the second service.
Illustratively, there are slice 1 and slice 2 within the cell. Slice _ Priority of Slice 1 i Slice 1 contains 5QI1 traffic, 5QI2 traffic, and 5QI9 traffic. Slice _ Priority of Slice 2 i Slice 2 contains 5QI1 traffic, 5QI2 traffic, 5QI3, and 5QI 8. Referring to table 1, it can be seen that the 5QI1 service corresponds to a priority value of 20, the 5QI2 service corresponds to a priority value of 40, the 5QI3 service corresponds to a priority value of 30, the 5QI8 service corresponds to a priority value of 80, and the 5QI9 service corresponds to a priority value of 90.
When slice priority validation determination bit bits of slice 1 5QI1 traffic of slice 1, slice 2 5QI1 traffic, slice 1 5QI2 traffic, slice 2 5QI2 traffic, 5QI3 traffic, 5QI8 traffic, and 5QI9 traffic are all set to 1 (that is, when only the second traffic exists in the cell), scheduling apparatus 100 schedules the traffic in the cell in the order of "5 QI1 traffic of slice 1 > 5QI2 traffic of slice 1 > 5QI9 traffic of slice 2 > 5QI1 traffic of slice 2 > 5QI3 traffic of slice 2 > 5QI2 traffic of slice 2 > 5QI8 traffic of slice 2".
S2023, when the first service and the second service coexist in the cell, the scheduling device 100 schedules the first service in the cell according to the priority of the first service in the cell, the slice priority of the first service in the cell, and the preconfigured slice priority of the first service in the cell; and scheduling the second service in the cell according to the priority of the second service in the cell and the slice priority of the second service in the cell.
It is worth mentioning that, in order to schedule all services in a slice preferentially and schedule a service later, the priority of the slice may be set to a high priority, and the pre-configured slice priority of the service may be set to a low priority. Setting the slice priority state of the service to be in a non-effective state, namely setting the service to be a first service, and setting the slice priority states of other services except the service in the cell to be in an effective state. I.e. other services than the service in the cell are set as the second service.
Accordingly, in order to schedule all services in a slice in a delayed manner and schedule a service preferentially, the priority of the slice may be set to a low priority, and the pre-configured slice priority of the service may be set to a high priority. Setting the slice priority state of the service to be in a non-effective state, namely setting the service to be a first service, and setting the slice priority states of other services except the service in the cell to be in an effective state. I.e. other services than the service in the cell are set as the second service.
Specifically, the above-mentioned specific embodiment of scheduling the first service in the cell according to the priority of the first service in the cell, the slice priority of the first service in the cell, and the preconfigured slice priority of the first service in the cell may refer to the specific embodiment of S2022, and is not described here again.
Specifically, the scheduling the first service in the cell according to the priority of the first service in the cell, the slice priority of the first service in the cell, and the preconfigured slice priority of the first service in the cell may include:
and taking the pre-configured slice priority of the first service in the cell as the slice priority of the first service in the cell.
And scheduling the first service in the cell according to the priority of the first service in the cell and the slice priority of the first service in the cell.
The above-mentioned specific implementation of scheduling the first service in the cell according to the priority of the first service in the cell and the slice priority of the first service in the cell may refer to the specific implementation of S2022, and is not described herein again.
Illustratively, there are slice 1 and slice 2 within the cell. Slice _ Priority of Slice 1 i Slice 1 contains 5QI1 traffic, 5QI2 traffic, and 5QI9 traffic. Slice _ Priority of Slice 2 i Slice 2 contains 5QI1 traffic, 5QI2 traffic, 5QI3, and 5QI 8. Predefined _ Priority of 5QI1 service of slice 1 i Predefined _ Priority of 5QI1 service of slice 2, 1 i Predefined _ Priority of 5QI1 service with slice 1 i The same is true. As can be seen from table 1, the 5QI1 service corresponds to a priority value of 20, the 5QI2 service corresponds to a priority value of 40, the 5QI3 service corresponds to a priority value of 30, the 5QI8 service corresponds to a priority value of 80, and the 5QI9 service corresponds to a priority value of 90.
The scheduling apparatus 100 sets the Predefined _ Priority of the 5QI1 service of slice 1 to the Predefined _ Priority of the 5QI1 service of slice 1 when the slice Priority validation bit bits of the 5QI1 service of slice 1, the 5QI1 service of slice 2 are all set to 0 and the slice Priority validation bit bits of the 5QI2 service of slice 1, the 5QI2 service of slice 2, the 5QI3 service, the 5QI8 service, and the 5QI9 service are all set to 1 (that is, when the first service and the second service exist in the cell at the same time) i Slice _ Priority of 5QI1 service as Slice 1 i Predefined _ Priority of 5QI1 service of slice 2 i Slice _ Pri as 5QI1 service for Slice 2ority i And according to "5 QI1 service of slice 1 to 5QI1 service of slice 2>Slice 1 5QI2 service>Slice 1 5QI9 service>Slice 2 5QI3 traffic>Slice 2 5QI2 traffic>Slice 2 5QI8 traffic "schedules traffic within a cell.
The above description mainly introduces the solutions provided by the embodiments of the present invention from the perspective of methods. To implement the above functions, it includes hardware structures and/or software modules for performing the respective functions. Those of skill in the art will readily appreciate that the invention is capable of being implemented as hardware or a combination of hardware and computer software in connection with the exemplary elements and algorithm steps described in connection with the embodiments disclosed herein. Whether a function is performed as hardware or computer software drives hardware depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
The embodiment of the present invention may perform the functional module division on the scheduling apparatus 100 according to the above method example, for example, each functional module may be divided corresponding to each function, or two or more functions may be integrated into one processing module. The integrated module can be realized in a hardware mode, and can also be realized in a software functional module mode. It should be noted that, the division of the modules in the embodiment of the present invention is schematic, and is only one logic function division, and another division manner may be available in actual implementation.
An embodiment of the present invention provides a scheduling apparatus 100, configured to execute the foregoing scheduling method, as shown in fig. 4, the scheduling apparatus 100 includes: an acquisition unit 401 and a scheduling unit 402.
An obtaining unit 401, configured to obtain target information, where the target information at least includes a priority of a service in a cell and a slice priority state of the service in the cell, and the slice priority state of the service is used to indicate whether a slice priority of the service is valid. For example, in conjunction with fig. 2, the obtaining unit 401 may be configured to perform S201.
A scheduling unit 402, configured to schedule a service in the cell according to the target information. For example, in conjunction with fig. 2, the scheduling unit 402 may be configured to perform S202.
The scheduling unit 402 may include: a first scheduling subunit, a second scheduling subunit, and a third scheduling subunit.
The first scheduling subunit is configured to schedule, according to the priority of the service in the cell, the service in the cell when only the first service exists in the cell, where the first service is a service whose slice priority is in an inactive state.
And the second scheduling subunit is used for scheduling the service in the cell according to the priority of the service in the cell and the slice priority of the service in the cell under the condition that only the second service exists in the cell, wherein the second service is a service with slice priority in an effective state, and the target information further comprises the slice priority of the service in the cell.
A third scheduling subunit, configured to schedule the first service in the cell according to the priority of the first service in the cell, the slice priority of the first service in the cell, and a preconfigured slice priority of the first service in the cell, when the first service and the second service coexist in the cell; and scheduling the second service in the cell according to the priority of the second service in the cell and the slice priority of the second service in the cell, wherein the target information further comprises the slice priority of the service in the cell and the pre-configured slice priority of the first service.
The second scheduling subunit is specifically configured to:
and determining the scheduling sequence of the services in the cell according to the priority of the services in the cell and the slice priority of the services in the cell, wherein the scheduling sequence is that the services with different slice priorities are scheduled from high to low according to the slice priority of the services, and the services with the same slice priority are scheduled from high to low according to the priority of the services.
And scheduling the services in the cell according to the scheduling sequence of the services in the cell.
The third scheduling subunit is specifically configured to:
and taking the pre-configured slice priority of the first service in the cell as the slice priority of the first service in the cell.
And scheduling the first service in the cell according to the priority of the first service in the cell and the slice priority of the first service in the cell.
Specifically, as shown in fig. 1 and 4. The acquiring unit 401 and the scheduling unit 402 in fig. 4 call a program in the memory 103 via the communication line 102 by the processor 101 in fig. 1 to execute the scheduling method described above.
It should be understood that, in various embodiments of the present invention, the sequence numbers of the above-mentioned processes do not mean the execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation on the implementation process of the embodiments of the present invention.
In the above embodiments, the implementation may be wholly or partially realized by software, hardware, firmware, or any combination thereof. When implemented using a software program, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. The processes or functions according to embodiments of the present invention occur, in whole or in part, when computer-executable instructions are loaded and executed on a computer. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored on a computer readable storage medium or transmitted from one computer readable storage medium to another computer readable storage medium, for example, the computer instructions may be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via wired (e.g., coaxial cable, fiber optic, Digital Subscriber Line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) means. Computer-readable storage media can be any available media that can be accessed by a computer or can comprise one or more data storage devices, such as servers, data centers, and the like, that can be integrated with the media. The usable medium may be a magnetic medium (e.g., floppy disk, hard disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., Solid State Disk (SSD)), among others.
Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the technical solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
It can be clearly understood by those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, devices and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the embodiments provided by the present invention, it should be understood that the disclosed system, device and method can be implemented in other ways. For example, the above-described embodiments of the apparatus are merely illustrative, and for example, a division of a unit is merely a logical division, and an actual implementation may have another division, 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 through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
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 invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit.
The above description is only for the specific embodiments of the present invention, but the scope of the present invention is not limited thereto, and any changes or substitutions that can be easily conceived by those skilled in the art within the technical scope of the present invention are included in the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.
Claims (8)
1. A method of scheduling, comprising:
acquiring target information, wherein the target information at least comprises the priority of a service in a cell, the slice priority state of the service in the cell, the slice priority of the service in the cell and the pre-configured slice priority of a first service, and the slice priority state of the service is used for representing whether the slice priority of the service takes effect or not;
under the condition that only a first service exists in the cell, scheduling the service in the cell according to the priority of the service in the cell, wherein the first service is a service with a slice priority in a non-effective state;
under the condition that only a second service exists in the cell, scheduling the service in the cell according to the priority of the service in the cell and the slice priority of the service in the cell, wherein the second service is a service with slice priority in an effective state, and the target information further comprises the slice priority of the service in the cell;
under the condition that the first service and the second service exist in the cell at the same time, scheduling the first service in the cell according to the priority of the first service in the cell, the slice priority of the first service in the cell and the pre-configured slice priority of the first service in the cell; and scheduling the second service in the cell according to the priority of the second service in the cell and the slice priority of the second service in the cell.
2. The scheduling method of claim 1, wherein the scheduling the first service in the cell according to the priority of the first service in the cell, the slice priority of the first service in the cell, and the preconfigured slice priority of the first service in the cell comprises:
taking the pre-configured slice priority of the first service in the cell as the slice priority of the first service in the cell;
and scheduling the first service in the cell according to the priority of the first service in the cell and the slice priority of the first service in the cell.
3. The scheduling method of claim 1, wherein the scheduling the traffic in the cell according to the priority of the traffic in the cell and the slice priority of the traffic in the cell comprises:
determining a scheduling sequence of the services in the cell according to the priority of the services in the cell and the slice priority of the services in the cell, wherein the scheduling sequence is that the services with different slice priorities are scheduled from high to low according to the slice priority of the services, and the services with the same slice priority are scheduled from high to low according to the priority of the services;
and scheduling the services in the cell according to the scheduling sequence of the services in the cell.
4. A scheduling apparatus, comprising: the device comprises an acquisition unit and a scheduling unit, wherein the scheduling unit comprises: a first scheduling subunit, a second scheduling subunit and a third scheduling subunit;
the acquiring unit is configured to acquire target information, where the target information at least includes a priority of a service in a cell, a slice priority status of the service in the cell, a slice priority of the service in the cell, and a preconfigured slice priority of the service in the cell, and the slice priority status of the service is used to indicate whether the slice priority of the service is valid;
the first scheduling subunit is configured to schedule, according to a priority of a service in the cell, the service in the cell when only a first service exists in the cell, where the first service is a service whose slice priority is in an invalid state;
the second scheduling subunit is configured to schedule the service in the cell according to the priority of the service in the cell and the slice priority of the service in the cell, where the second service is a service whose slice priority is an effective state, and the target information further includes the slice priority of the service in the cell;
the third scheduling subunit is configured to, when the first service and the second service coexist in the cell, schedule the first service in the cell according to a priority of the first service in the cell, a slice priority of the first service in the cell, and a preconfigured slice priority of the first service in the cell; and scheduling the second service in the cell according to the priority of the second service in the cell and the slice priority of the second service in the cell.
5. The scheduling apparatus according to claim 4, wherein the third scheduling subunit is specifically configured to:
taking the pre-configured slice priority of the first service in the cell as the slice priority of the first service in the cell;
and scheduling the first service in the cell according to the priority of the first service in the cell and the slice priority of the first service in the cell.
6. The scheduling device of claim 4, wherein the second scheduling subunit is specifically configured to:
determining a scheduling sequence of the services in the cell according to the priority of the services in the cell and the slice priority of the services in the cell, wherein the scheduling sequence is that the services with different slice priorities are scheduled from high to low according to the slice priorities of the services, and the services with the same slice priority are scheduled from high to low according to the priorities of the services;
and scheduling the services in the cell according to the scheduling sequence of the services in the cell.
7. A scheduling apparatus, comprising: one or more processors, and a memory;
the memory is coupled with the one or more processors; the memory is configured to store computer program code comprising instructions which, when executed by the one or more processors, cause the scheduling apparatus to perform the scheduling method of any of claims 1-3.
8. A computer-readable storage medium comprising instructions that, when executed on a scheduling apparatus, cause the scheduling apparatus to perform the scheduling method of any one of claims 1-3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011095776.8A CN112272108B (en) | 2020-10-14 | 2020-10-14 | Scheduling method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011095776.8A CN112272108B (en) | 2020-10-14 | 2020-10-14 | Scheduling method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112272108A CN112272108A (en) | 2021-01-26 |
| CN112272108B true CN112272108B (en) | 2022-09-27 |
Family
ID=74338675
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011095776.8A Active CN112272108B (en) | 2020-10-14 | 2020-10-14 | Scheduling method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112272108B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113473536B (en) * | 2021-06-16 | 2023-04-28 | 中国联合网络通信集团有限公司 | Data transmission method and device |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2017166988A1 (en) * | 2016-03-30 | 2017-10-05 | 中兴通讯股份有限公司 | Network slice processing method and apparatus, terminal, base station, and computer storage medium |
| CN107734703A (en) * | 2016-08-11 | 2018-02-23 | 华为技术有限公司 | A kind of resource regulating method and device |
| WO2019145049A1 (en) * | 2018-01-29 | 2019-08-01 | Nokia Solutions And Networks Oy | Proactive fault management in slicing-enabled communication networks |
| CN110662261A (en) * | 2018-06-30 | 2020-01-07 | 华为技术有限公司 | Resource allocation method and device for network slices |
| CN110691382A (en) * | 2018-07-06 | 2020-01-14 | 中国移动通信有限公司研究院 | Wireless resource allocation method and network element equipment |
| JP2020025210A (en) * | 2018-08-08 | 2020-02-13 | 株式会社Ｎｔｔドコモ | Resource allocation device and resource allocation method |
| CN110896355A (en) * | 2018-09-12 | 2020-03-20 | 华为技术有限公司 | Network slice selection method and device |
| CN111082955A (en) * | 2018-10-22 | 2020-04-28 | 中兴通讯股份有限公司 | Network slicing method, computer equipment and storage medium |
| CN111095979A (en) * | 2017-09-15 | 2020-05-01 | 上海诺基亚贝尔股份有限公司 | Method, apparatus, and computer storage medium for resource allocation |
| CN111416729A (en) * | 2019-01-08 | 2020-07-14 | 华为技术有限公司 | Resource scheduling method and equipment for network slice |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108307423B (en) * | 2016-08-26 | 2023-03-24 | 中兴通讯股份有限公司 | Wireless access network slice selection method and device |
| US11290333B2 (en) * | 2016-09-29 | 2022-03-29 | Telefonaktiebolaget Lm Ericsson (Publ) | Quality of service differentiation between network slices |
| CN106954267B (en) * | 2017-04-14 | 2019-11-22 | 北京邮电大学 | A kind of method for managing resource based on wireless network slice |
-
2020
- 2020-10-14 CN CN202011095776.8A patent/CN112272108B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2017166988A1 (en) * | 2016-03-30 | 2017-10-05 | 中兴通讯股份有限公司 | Network slice processing method and apparatus, terminal, base station, and computer storage medium |
| CN107734703A (en) * | 2016-08-11 | 2018-02-23 | 华为技术有限公司 | A kind of resource regulating method and device |
| CN111095979A (en) * | 2017-09-15 | 2020-05-01 | 上海诺基亚贝尔股份有限公司 | Method, apparatus, and computer storage medium for resource allocation |
| WO2019145049A1 (en) * | 2018-01-29 | 2019-08-01 | Nokia Solutions And Networks Oy | Proactive fault management in slicing-enabled communication networks |
| CN110662261A (en) * | 2018-06-30 | 2020-01-07 | 华为技术有限公司 | Resource allocation method and device for network slices |
| CN110691382A (en) * | 2018-07-06 | 2020-01-14 | 中国移动通信有限公司研究院 | Wireless resource allocation method and network element equipment |
| JP2020025210A (en) * | 2018-08-08 | 2020-02-13 | 株式会社Ｎｔｔドコモ | Resource allocation device and resource allocation method |
| CN110896355A (en) * | 2018-09-12 | 2020-03-20 | 华为技术有限公司 | Network slice selection method and device |
| CN111082955A (en) * | 2018-10-22 | 2020-04-28 | 中兴通讯股份有限公司 | Network slicing method, computer equipment and storage medium |
| CN111416729A (en) * | 2019-01-08 | 2020-07-14 | 华为技术有限公司 | Resource scheduling method and equipment for network slice |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112272108A (en) | 2021-01-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2018133398A1 (en) | Data transmission method and electronic terminal | |
| CN111757291B (en) | Communication method and device | |
| US20230209540A1 (en) | Method of allocating uplink data packet resource and user equipment | |
| KR102219015B1 (en) | Use of network support protocols to improve network usage | |
| EP3952426A1 (en) | Method and device for canceling sr to be processed | |
| WO2021184263A1 (en) | Data transmission method and apparatus, and communication device | |
| CN112243298B (en) | Scheduling method and device | |
| CN113556785A (en) | Method for controlling service quality flow and related equipment | |
| CN110267276B (en) | Network slice deployment method and device | |
| CN112272108B (en) | Scheduling method and device | |
| WO2019214524A1 (en) | Resource allocation method and apparatus | |
| US20190215850A1 (en) | Resource scheduling method and apparatus for logical channel | |
| CN112491978B (en) | Scheduling method and device | |
| CN113645706A (en) | Wireless resource scheduling method, device and base station | |
| WO2019195958A1 (en) | Dynamic maximum data burst volume enforcement in user equipment | |
| CN110933758B (en) | Interference coordination method and device, and base station | |
| CN114642051A (en) | Control method and device for uplink data transmission | |
| CN112867154B (en) | Resource allocation method, device, base station, user equipment and storage medium | |
| CN114698120A (en) | Bandwidth allocation method and device, storage medium and electronic equipment | |
| CN112243255B (en) | Determination method and device for scheduling priority | |
| WO2021159474A1 (en) | Resource reservation method, apparatus and terminal | |
| CN114125948A (en) | Method, device and storage medium for determining maximum service resource threshold | |
| WO2019214553A1 (en) | Resource allocation method and apparatus | |
| CN112996018B (en) | Determination method, device and readable storage medium | |
| EP3840497B1 (en) | Wireless communication method, computer readable storage medium and terminal device |
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 |