WO2020192604A1 - 资源分配的方法、装置及存储介质、电子装置 - Google Patents

资源分配的方法、装置及存储介质、电子装置 Download PDF

Info

Publication number
WO2020192604A1
WO2020192604A1 PCT/CN2020/080559 CN2020080559W WO2020192604A1 WO 2020192604 A1 WO2020192604 A1 WO 2020192604A1 CN 2020080559 W CN2020080559 W CN 2020080559W WO 2020192604 A1 WO2020192604 A1 WO 2020192604A1
Authority
WO
WIPO (PCT)
Prior art keywords
bandwidth
service
sorting
operators
operator
Prior art date
Application number
PCT/CN2020/080559
Other languages
English (en)
French (fr)
Inventor
许倩倩
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2020192604A1 publication Critical patent/WO2020192604A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H04W72/044—Wireless resource allocation based on the type of the allocated resource
    • H04W72/0453—Resources in frequency domain, e.g. a carrier in FDMA
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/14—Spectrum sharing arrangements between different networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling
    • 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/535—Allocation or scheduling criteria for wireless resources based on resource usage policies

Definitions

  • the present disclosure relates to the field of communications, for example, to a method, device, storage medium, and electronic device for resource allocation.
  • Shared network means that multiple operators can share a base station or joint networking, that is, a base station or communication network allows users to access multiple operators, and each operator’s bandwidth occupation ratio and bandwidth occupancy rules are determined by multiple operators. Negotiated between.
  • the embodiments of the present disclosure provide a resource allocation method and device, so as to realize that access users can occupy spectrum resources more flexibly according to their operator attributes and service slicing characteristics, and ensure the orderliness of scheduling while maximizing the satisfaction of access The user’s business needs.
  • a method for resource allocation including:
  • the attributes of the operators corresponding to the multiple access users the attributes of the service slices corresponding to the services of the multiple access users, the preset sorting strategy of the operator, and the preset service slice attributes.
  • a sorting strategy to sort the multiple access users is a sorting strategy to sort the multiple access users
  • bandwidth resources are allocated to those in the sorting queue. user.
  • a device for resource allocation including:
  • the scheduling module is set to determine the respective bandwidths of multiple operators and the respective bandwidths of multiple service slices according to preset bandwidth occupancy rules
  • the sorting module is set to be based on the attributes of the operators corresponding to the multiple access users, the attributes of the service slices corresponding to the services of the multiple access users, the preset sorting strategy of the operator, and the preset The ordering strategy of the service slices, ordering the multiple access users;
  • the scheduling module is further configured to: according to the sorting results of the multiple access users, the bandwidths of the multiple operators, the bandwidths of the multiple service slices, and the preset bandwidth occupation rules Resources are allocated to users in the sorting queue.
  • Fig. 1 is a flowchart of a method for resource allocation according to an embodiment of the present disclosure
  • Fig. 2 is a structural block diagram of an apparatus for resource allocation according to an embodiment of the present disclosure
  • FIG. 3 is a schematic structural diagram of an electronic device according to an embodiment of the present disclosure.
  • This embodiment discloses a method for resource allocation. As shown in FIG. 1, the method includes:
  • Step 110 According to preset bandwidth occupancy rules, determine the respective bandwidths of multiple operators and the respective bandwidths of multiple service slices;
  • Step 120 According to the attributes of the operators corresponding to the multiple access users, the attributes of the service slices respectively corresponding to the services of the multiple access users, the preset sorting strategy of the operator, and the preset A service slice ordering strategy to order the multiple access users;
  • Step 130 According to the ranking result of the multiple access users, the bandwidth to which the multiple operators belong, the bandwidth to which the multiple service slices belong, and the preset bandwidth occupation rule, bandwidth resources are allocated to the ranking Users in the queue.
  • sorting the multiple access users includes:
  • sorting strategies of the multiple operators are the same, and the sorting strategies of the multiple service slices are also the same, uniformly sorting the multiple access users;
  • the access users belonging to the same service slice are uniformly sorted.
  • sorting the multiple access users further includes: uniformly sorting the access users corresponding to the same service type in different service slices according to the service priority guarantee level.
  • the preset bandwidth occupancy rule includes multiple users that are allowed to access each other to occupy remaining resources
  • the method further includes:
  • Bandwidth resources allocated to users in the sorting queue include:
  • the Bandwidth resources are allocated to users in the sorting queue.
  • the method further includes at least one of the following:
  • This embodiment also provides a device for resource allocation. As shown in FIG. 2, the device includes:
  • the sorting module 11 is configured to be based on the attributes of the operators corresponding to the multiple access users, the attributes of the service slices corresponding to the services of the multiple access users, and the preset sorting strategies and presets of the operators.
  • the ordering strategy of the service slices in order to order the multiple access users;
  • the scheduling module 12 is configured to determine the respective bandwidths of multiple operators and the respective bandwidths of multiple service slices according to preset bandwidth occupancy rules; and, according to the ranking results of the multiple access users, the multiple operators The bandwidth to which the quotient belongs, the bandwidth to which the multiple service slices belong, and the preset bandwidth occupancy rule to allocate bandwidth resources to users in the sorting queue.
  • the device further includes:
  • the bandwidth resource correction module 13 is configured to correct the bandwidth of at least one of the multiple operators and/or the bandwidth of at least one of the multiple service slices by using at least one bandwidth correction value, wherein: The at least one bandwidth correction value is used to balance the bandwidth of different access user types and/or the bandwidth of different service slices.
  • the resource allocation method disclosed in the present disclosure further includes the following steps:
  • bandwidth occupancy rules indicates the percentage of the full bandwidth occupied by each operator or each slice service, and can also set the shared bandwidth ratio, which means that multiple operators or multiple slice services can be occupied
  • bandwidth occupation ratio of service slice 1 is 50%
  • the bandwidth occupation ratio of service slice 2 is 30%
  • the shared bandwidth ratio is 20%.
  • the calculation method of the bandwidth occupied by the operator is the same as the calculation method of the bandwidth occupied by the business slice bandwidth;
  • the attribute of the operator refers to the information of the operator to which the access user belongs
  • the service slice attribute represents the information of the slice to which the user's service belongs, and is also an important basis for the base station to schedule the user to allocate resources.
  • each service slice of each operator determines its own sorting strategy, including: service priority guarantee level, such as multiple guaranteed bit rate (GBR) services and non-guaranteed bit rate (NonGBR) Priority between services, service delay, service allocation and retention priority (Allocation and Retention Priority, ARP), etc.
  • service priority guarantee level such as multiple guaranteed bit rate (GBR) services and non-guaranteed bit rate (NonGBR) Priority between services, service delay, service allocation and retention priority (Allocation and Retention Priority, ARP), etc.
  • base station scheduling can slice different services of different operators Put the users into different user queues and sort them separately. If the base station only serves one operator but supports multiple service slices, each service slice determines its own scheduling strategy.
  • high-priority services are guaranteed first, for example: GBR services, services of the same level are scheduled in sequence according to the scheduling results of the sorting algorithm.
  • the bandwidth correction value the upper limit of the bandwidth occupied by the operator in the next scheduling opportunity is corrected to balance the upper limit of bandwidth occupied by different operators each time. If in the bandwidth occupation rule, operators are not allowed to occupy the remaining resources with each other, then there is no need to calculate the bandwidth correction value here.
  • the resource ratio of the service slice can be divided according to the resource ratio of the operator, that is, the resources of each service slice of each operator are clarified
  • the upper limit of the ratio is to maintain the operator's bandwidth correction value and the operator's service slice bandwidth correction value respectively.
  • the upper limit of the resource ratio of each operator can be calculated, the upper limit of the resource ratio of each service slice can be calculated, the same slice services of different operators can be uniformly ordered and scheduled, and the operator bandwidth correction value and the service slice bandwidth correction value can be maintained respectively.
  • Sharing mode 2 operators share 1 base station and serve 2 types of business slices, where the number of operators and the type of business slices can be greater than 2.
  • the number listed in the embodiment is just an example and does not constitute a specific limitation .
  • Step 201 Determine the upper limit of the bandwidth occupied by the operator and the upper limit of the bandwidth occupied by the service slice according to the rules of the operator and service slice bandwidth occupation, including the bandwidth occupation ratio: 2 operators share 20MHz, and the bandwidth occupation ratio of operator A is 50%.
  • Operator B serves business slices 1 and 2 at the same time, and the proportions of the two business slices occupying operator B's resources are: 60% and 40%.
  • the remaining bandwidth resources can be shared among operators or between service slices.
  • Step 203 Correct the upper limit of the bandwidth occupied by each service slice of each operator for the current scheduling opportunity according to the bandwidth correction value: Since the bandwidth correction value is 0, the upper limit of the bandwidth occupied by service slice 1 of the current scheduling opportunity of operator A is 50 RB, and operator B The upper limit of bandwidth occupied by service slice 1 is 30 RBs, and the upper limit of bandwidth occupied by service slice 2 of operator B is 20 RBs.
  • Step 204 Obtain the operator and service slice attributes to which the access user belongs.
  • Step 205 When the operator and the service slice ordering strategy are the same, the access users of the two operators and the service slice queue together.
  • Step 206 According to the sorting result of the access users, the upper limit of the bandwidth occupied by each service slice, the bandwidth occupancy rule, and the service resource requirement, resources are allocated in sequence according to the sorting queue result:
  • the bandwidth resource allocated when scheduling users cannot exceed the full bandwidth.
  • Step 207 According to the resource allocation result, calculate the total bandwidth occupied by all access users of each service slice of each operator: service slice 1 of operator A occupies 20 RBs; service slice 1 of operator B occupies 45 RBs of bandwidth ; Service slice 2 of operator B occupies 35 RBs of bandwidth.
  • Sharing mode 2 operators share 1 base station and serve 2 types of business slices, where the number of operators and the type of business slices can be greater than 2.
  • the number listed in the embodiment is just an example and does not constitute a specific limitation .
  • Step 301 Determine the upper limit of the bandwidth occupied by the operator and the upper limit of the bandwidth occupied by the service slice according to the rules of the operator and service slice bandwidth occupation, including the bandwidth occupation ratio: 2 operators share 20MHz, and the bandwidth occupation ratio of operator A is 50%.
  • Operator A only serves business slice 1;
  • Operator B simultaneously serves business slices 1 and 2, the two types of service slices occupy 60% and 40% of operator B resources respectively.
  • the remaining bandwidth resources can be shared between operators or between service slices.
  • Step 303 Obtain the operator and service slice attributes of the access user.
  • Step 304 When the operators have the same sorting strategy and the service slice sorting strategies are different, users of the same service slice of the two operators queue together.
  • the GBR service level is higher than the NGBR service, and the GBR services of service slice 2 are sorted together.
  • Step 305 According to the upper limit of the bandwidth occupied by each service slice, the bandwidth occupancy rules and the service resource requirements, resources are allocated in sequence according to the sorting queue result:
  • the bandwidth resource allocated when scheduling users cannot exceed the full bandwidth.
  • Step 306 According to the resource allocation result, calculate the total bandwidth occupied by all access users in each service slice of each operator: service slice 1 of operator A occupies 70 RBs; service slice 1 of operator B occupies 20 RBs of bandwidth ; Service slice 2 of operator B occupies 10 RBs of bandwidth.
  • Step 307 Calculate the operator bandwidth correction value according to the actual bandwidth occupied by the operator and the bandwidth that the operator belongs to:
  • Sharing mode 2 operators jointly form a network, share 3 base stations under the network, and serve 2 types of business slices.
  • the number of operators, the number of base stations and the type of business slices can all be greater than 2. The number is just an example and does not constitute a specific limit.
  • Step 401 Determine the rules for the bandwidth occupation of operators and service slices, including the bandwidth occupation ratio: base station 1 is exclusively occupied by operator A and only serves service slice 1; base station 2 is shared by operators A and B, and the bandwidth occupation ratio of operator A is 50%, only service service slice 1, and operator B bandwidth occupation ratio is 50%, service service slice 1 and service slice 2, both service slices share resources; base station 3 is shared by operators A and B, and operator A bandwidth
  • the occupation ratio is 50%, service slice 1 and service slice 2, the bandwidth occupation ratios of the two service slices are 50% and 50% respectively, and the bandwidth occupation ratio of operator B is 50%, only service slice 2; at the same time, the remaining The bandwidth resources allow sharing between operators or between service slices.
  • Step 402 Calculate the upper limit of the initial bandwidth occupied by each operator and each service slice in each base station in the network according to the bandwidth occupation ratio and sharing mode of each operator, and the bandwidth ratio of each base station during initial scheduling is the same as the preset ratio :
  • the upper limit of the bandwidth occupied by base station 1 operator A is: 100 RBs, only serving business slice 1;
  • Step 404 Correct the upper limit of the bandwidth occupied by the operator of the current scheduling opportunity according to the bandwidth correction value: Since the bandwidth correction value is 0, the upper limit of the bandwidth occupied by each base station of the current scheduling opportunity is the same as the initial value.
  • Step 405 Different base stations respectively perform resource allocation according to the operator attribute and operator ranking strategy to which the access user belongs, according to the upper limit of the bandwidth occupied by the operator, the bandwidth occupation rule, and the service resource requirement.
  • Step 406 According to the resource allocation result, calculate the sum of the actual bandwidth occupied by all access users of each operator:
  • Base station 1 The user of operator A is allocated 90 RBs;
  • Base station 2 The user of operator A is allocated 70 RBs;
  • Base station 3 Service slice 1 user of operator A is allocated 30 RBs;
  • the user of operator B is allocated 40 RBs.
  • Step 408 According to the bandwidth correction value, balance the services of different base stations, and find the base station with the most resources occupied by operator A in the entire network: base station 1, base station 1 only serves operator A, and the base station has remaining resources available, select operator A
  • the base station that occupies the second most resources: base station 2 equalizes the service of operator A in base station 2 to base station 1.
  • the service demand of operator A in base station 2 has exceeded the upper limit of its bandwidth resources, and can reach base station 2 after balancing The balance of the two operators' business.
  • an embodiment of the present disclosure further provides an electronic device, including: a memory 310, a processor 320, and a computer program stored in the memory 310 and running on the processor 320, so When the processor 320 executes the computer program, the method described in any of the foregoing embodiments is implemented.
  • the embodiments of the present disclosure also provide a computer-readable storage medium that stores computer-executable instructions, and the computer-executable instructions are used to execute the method described in any of the foregoing embodiments.
  • the foregoing storage medium may include: Universal Serial Bus Flash Disk (U Disk), Read-Only Memory (ROM), Random Access Memory (Random Access Memory, RAM), mobile hard drives, magnetic disks or optical discs and other media that can store program codes.
  • U Disk Universal Serial Bus Flash Disk
  • ROM Read-Only Memory
  • RAM Random Access Memory
  • mobile hard drives magnetic disks or optical discs and other media that can store program codes.
  • bandwidth occupancy rules including operator’s bandwidth occupancy rules/bandwidth occupancy rules of service slices
  • the orderliness of bandwidth resource allocation is ensured, and access is maximized.
  • the above-mentioned multiple modules or multiple steps of the present disclosure can be implemented by a general computing device. They can be concentrated on a single computing device or distributed on a network composed of multiple computing devices. Optionally, they can be Implemented with program codes executable by a computing device, so that they can be stored in a storage device for execution by the computing device, and in some cases, the steps shown or described can be executed in a different order than here. , Or fabricate them into multiple integrated circuit modules separately, or fabricate multiple modules or steps in them into a single integrated circuit module to achieve. In this way, the present disclosure is not limited to a specific combination of hardware and software.

Landscapes

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

Abstract

本公开提供了一种资源分配方法、装置及存储介质、电子装置。其中，该方法包括：根据预设的带宽占用规则，确定多个运营商分别所属带宽和多种业务切片分别所属带宽；根据多个接入用户分别对应的运营商的属性、多个接入用户的业务分别对应的业务切片的属性、预设的所述运营商的排序策略和预设的所述业务切片的排序策略，对所述多个接入用户进行排序；根据所述多个接入用户的排序结果、所述多个运营商分别所属带宽、所述多种业务切片分别所属带宽和所述预设的带宽占用规则，将带宽资源分配给排序队列中的用户。

Description

资源分配的方法、装置及存储介质、电子装置
本申请要求在2019年3月26日提交中国专利局、申请号为201910230456.X的中国专利申请的优先权，该申请的全部内容通过引用结合在本申请中。
技术领域
本公开涉及通信领域，例如，涉及一种资源分配的方法、装置及存储介质、电子装置。
背景技术
为了降低投资成本和运营成本，不同接入用户类别(例如运营商在组网时划分)可以通过合作实现网络共享，也称为频带复用。共享网络是指多个运营商可以共享一个基站或者联合组网，即一个基站或者通信网络允许接入多个运营商的用户，每个运营商带宽占用比例以及带宽占用规则由多个运营商之间协商确定。
在引入业务切片后，相关技术中虽然有频带共享的策略，但是这些策略都是建立在运营商带宽载频固定的基础上，并没有考虑业务切片的需求，未能解决在满足多个运营商频带复用需求的同时，兼顾不同业务切片的调度请求。
发明内容
本公开实施例提供了一种资源分配的方法及装置，以实现接入用户可以根据其运营商属性和业务切片特性更加灵活的占用频谱资源，保证调度有序性的同时，最大化满足接入用户的业务需求。
根据本公开的一个实施例，提供了一种资源分配的方法，包括：
根据预设的带宽占用规则，确定多个运营商分别所属带宽和多种业务切片分别所属带宽；
根据多个接入用户分别对应的运营商的属性、所述多个接入用户的业务分别对应的业务切片的属性、预设的所述运营商的排序策略和预设的所述业务切片的排序策略，对所述多个接入用户进行排序；
根据所述多个接入用户的排序结果、所述多个运营商分别所属带宽、所述多种业务切片分别所属带宽和所述预设的带宽占用规则，将带宽资源分配给排序队列中的用户。
根据本公开的另一个实施例，提供了一种资源分配的装置，包括：
调度模块，设置为根据预设的带宽占用规则，确定多个运营商分别所属带宽和多种业务切片分别所属带宽；
排序模块，设置为根据多个接入用户分别对应的运营商的属性、所述多个接入用户的业务分别对应的业务切片的属性、预设的所述运营商的排序策略和预设的所述业务切片的排序策略，对所述多个接入用户进行排序；
所述调度模块还设置为：根据所述多个接入用户的排序结果、所述多个运营商分别所属带宽、所述多种业务切片分别所属带宽和所述预设的带宽占用规则将带宽资源分配给排序队列中的用户。
附图说明
图1是根据本公开实施例的资源分配的方法流程图；
图2是根据本公开实施例的资源分配的装置结构框图；
图3是根据本公开实施例的电子装置结构示意图。
具体实施方式
下文中将参考附图并结合实施例来详细说明本公开。在不冲突的情况下，本申请中的实施例及实施例中的特征可以相互组合。
本实施例公开了一种资源分配的方法，如图1所示，所述方法包括：
步骤110：根据预设的带宽占用规则，确定多个运营商分别所属带宽和多种业务切片分别所属带宽；
步骤120：根据多个接入用户分别对应的运营商的属性、所述多个接入用户的业务分别对应的业务切片的属性、预设的所述运营商的排序策略和预设的所述业务切片的排序策略，对所述多个接入用户进行排序；
步骤130：根据所述多个接入用户的排序结果、所述多个运营商分别所属带宽、所述多种业务切片分别所属带宽和所述预设的带宽占用规则，将带宽资源分配给排序队列中的用户。
在一实施例中，对所述多个接入用户进行排序包括：
在所述多个运营商的排序策略相同，并且所述多种业务切片的排序策略也相同的情况下，对所述多个接入用户统一排序；
在所述多个运营商的排序策略不同且所述多种业务切片的排序策略不同的情况下，将所述多个接入用户放入不同的用户队列分别排序；
在所述多个运营商的排序策略相同，且所述多种业务切片的排序策略不同的情况下，对属于相同业务切片的接入用户统一排序。
在一实施例中，对所述多个接入用户进行排序还包括：根据业务优先保证级别，对不同业务切片中的相同业务类型对应的接入用户统一排序。
在一实施例中，所述预设的带宽占用规则包括允许接入的多个用户之间相互占用剩余资源；
在一实施例中，在所述确定多个运营商分别所属带宽和多种业务切片分别所属带宽之后，还包括：
利用至少一个带宽修正值修正下述至少之一：所述多个运营商中的至少一个运营商所属带宽；所述多种业务切片中的至少一种业务切片所属带宽；其中，所述至少一个带宽修正值用于均衡下述至少之一：不同运营商所属带宽；不同业务切片所属带宽。
在一实施例中，所述根据所述多个接入用户的排序结果、所述多个运营商分别所属带宽、所述多种业务切片分别所属带宽和所述预设的带宽占用规则，将带宽资源分配给排序队列中的用户包括：
根据所述多个接入用户的排序结果、所述预设的带宽占用规则、修正后的所述多个运营商分别所属带宽、修正后的所述多种业务切片分别所属带宽，将所述带宽资源分配给排序队列中的用户。
在一实施例中，该方法还包括下述至少之一：
确定上一次带宽资源分配时所述多个运营商中每个运营商实际占用的带宽 资源，将所述上一次所述多个运营商中的至少一个运营商实际占用的带宽资源与所述上一次所述至少一个运营商所属带宽上限的差值作为所述至少一个带宽修正值；
确定上一次带宽资源分配时所述多种业务切片中每种业务切片实际占用的带宽资源，将所述上一次所述多种业务切片中至少一种业务切片实际占用的带宽资源与所述上一次所述至少一种业务切片所属带宽上限的差值作为所述至少一个带宽修正值。
本实施例还提供了一种资源分配的装置，如图2所示，所述装置包括：
排序模块11，设置为根据多个接入用户分别对应的运营商的属性、所述多个接入用户的业务分别对应的业务切片的属性、预设的所述运营商的排序策略和预设的所述业务切片的排序策略，对所述多个接入用户进行排序；
调度模块12，设置为根据预设的带宽占用规则，确定多个运营商分别所属带宽和多种业务切片分别所属带宽；以及，根据所述多个接入用户的排序结果、所述多个运营商分别所属带宽、所述多种业务切片分别所属带宽和所述预设的带宽占用规则，将带宽资源分配给排序队列中的用户。
在一实施例中，所述装置还包括：
带宽资源修正模块13，设置为通过至少一个带宽修正值修正所述多个运营商中的至少一个运营商所属带宽和/或所述多种业务切片中的至少一种业务切片所属带宽，其中，所述至少一个带宽修正值用于均衡不同接入用户类型的所属带宽和/或不同业务切片的所属带宽。
本公开公开的资源分配的方法还包括以下步骤：
根据运营商和切片业务协商的带宽占规规则，用户所属运营商属性以及用户的业务切片属性完成调度。其中，带宽占用规则包括：其一，带宽占用比例：表示每个运营商或者每种切片业务占用全带宽的比例，还可设置共享带宽比例，表示多个运营商或者多种切片业务均可占用的带宽，例如1个基站服务2种业务切片，业务切片1带宽占用比例为50％，业务切片2带宽占用比例为30％，共享带宽比例为20％，对于20MHz的频带，业务切片1最多可占用20*(50％+20％)＝14MHz，该值仅表示带宽的大小，不包括带宽所属频带的位置，运营商带宽占用频带的计算方式同业务切片带宽占用频带的计算方式；其二，剩余资源占用 规则：表示如果调度机会中，某个运营商或者某个业务切片的带宽没有分配完，剩余的带宽资源是否允许其他运营商或者其他业务切片使用。
运营商的属性是指接入用户所属运营商的信息，业务切片属性代表该用户的业务所属切片的信息，也是基站调度用户分配资源的重要依据。
调度前，确定基站是否有多个运营商或者多种业务切片共享，如果有，则进一步确定运营商或者业务切片的共享个数和共享方式，将这些运营商(至少2个)或者业务切片协商的带宽占规规则，作为调度的输入参数。
如果多个运营商共享基站，则每个运营商的每种业务切片确定各自的排序策略，包括：业务优先保证级别，例如多种保证比特速率(Guaranteed Bit Rate，GBR)业务和非保证比特速率(NonGBR)业务之间的优先级，业务时延，业务的分配保留优先级(Allocation and Retention Priority，ARP)等。
如果网络共享的多个运营商选择相同的排序策略，且多种业务切片也选择相同的排序策略，那么可以对所有接入用户统一排序；否则的话，基站调度可以将不同运营商的不同业务切片的用户放入不同用户队列，分别排序。如果基站仅服务1个运营商但支持多种业务切片，则每种业务切片确定各自的调度策略。
在一实施例中，当有新用户接入时，根据其接入信息获取其所属运营商属性以及业务切片属性，然后根据运营商的排序策略和业务切片的排序策略，将用户放入相应队列等待排序，高优先级业务优先保证，例如：GBR业务，相同级别的业务根据排序算法的调度结果依次调度。
根据运营商和业务切片带宽占用比例计算每个运营商的每种业务切片所属带宽，也就是运营商的业务切片初始占用带宽上限，获取用户队列排序结果后，再根据每个运营商和业务切片占用带宽上限和带宽占用规则依次分配资源给排序队列中的每一个用户。
调度完成后，统计每个运营商所实际占用的带宽即每个运营商所有接入用户占用带宽之和，计算该值和运营商占用带宽上限之间的差值，也就是运营商带宽修正值。根据带宽修正值修正下一个调度机会该运营商占用带宽上限，以均衡不同运营商每次占用带宽上限。如果带宽占规规则中，运营商间不允许相互占用剩余资源，那么这里不需要计算带宽修正值。统计每个运营商下的每种 业务切片的所有接入用户占用带宽之和，计算该值和业务切片占用带宽上限的差值，也就是业务切片带宽修正值，根据业务切片带宽修正值修正下一个调度机会该业务切片占用带宽比例的上限，以均衡不同业务切片每次占用带宽上限。如果根据带宽占用规则，不需要修正业务切片占用带宽，则可以不调整带宽修正值。
由多个运营商和多种切片共享，且业务切片的资源比例未按照运营商划分，可以将业务切片的资源比例按照运营商的资源比例划分，即明确每个运营商每种业务切片的资源比例上限，分别维护运营商带宽修正值和运营商内业务切片带宽修正值。
或者，可以计算每个运营商的资源比例上限，计算每种业务切片的资源比例上限，不同运营商的相同切片业务统一排序调度，分别维护运营商带宽修正值和业务切片带宽修正值。
每次调度可重复上述步骤。
下面通过具体的实例来详细说明本公开的技术方案：
实例一：
共享方式：2个运营商共享1个基站，服务2种业务切片，其中运营商个数和业务切片种类都可以大于2，实施例中所列的个数仅是以此举例，不构成具体限制。
步骤201：根据运营商和业务切片带宽占规规则，包括带宽占用比例，确定运营商占用带宽上限和业务切片占用带宽上限：2个运营商共享20MHz，运营商A带宽占用比例为50％，运营商B带宽占用比例为50％；运营商A仅服务业务切片1，运营商A和运营商B分别占用带宽资源上限为20MHz*50％＝10MHz，对应50个资源块(Resource Block，RB)；运营商B同时服务业务切片1和2，2种业务切片分别占用运营商B资源比例为：60％和40％。剩余的带宽资源允许运营商之间或者业务切片之间共享。
步骤202：基站调度初始化带宽修正值：2个运营商需要1个运营商的带宽修正值，2种业务切片需要1个业务切片的带宽修正值，运营商带宽修正值初始化为Δ A＝0；业务切片带宽修正值初始化为Δ 1＝0，在一实施例中，运营商和业务切片只要调度占用的RB在其所属带宽范围内，则不需要修正。
步骤203：根据带宽修正值修正当前调度机会每个运营商每种业务切片占用带宽上限：由于带宽修正值为0，当前调度机会运营商A业务切片1占用带宽上限为50个RB，运营商B业务切片1占用带宽上限为30个RB，运营商B业务切片2占用带宽上限为20个RB。
步骤204：获取接入用户所属运营商和业务切片属性，运营商A接入2个用户：用户设备(User Equipment，UE)标识(Identity，ID)＝1的用户接入一种NonGBR业务；UE ID＝2的用户接入一种NonGBR业务。运营商B接入4个用户：UE ID＝3的用户接入业务切片1的一种NonGBR业务；UE ID＝4的用户接入业务切片1的一种NonGBR业务；UE ID＝5的用户接入业务切片2的一种GBR业务，UE ID＝6的用户接入业务切片2的一种GBR业务。
步骤205：当运营商和业务切片排序策略相同时，2种运营商和业务切片的接入用户一起排队。根据业务优先保证级别，GBR业务级别相同一起排序，排序结果为：UE ID＝5→UE ID＝6；NonGBR业务级别相同一起排序，排序结果为：UE ID＝3→UE ID＝1→UE ID＝2→UE ID＝4。
步骤206：根据接入用户的排序结果、每种业务切片占用带宽上限、带宽占用规则以及业务资源需求依次按照排序队列结果分配资源：
UE ID＝5的用户分配20个RB；
UE ID＝6的用户分配15个RB；
UE ID＝3的用户分配30个RB；
UE ID＝1的用户分配5个RB；
UE ID＝2的用户分配15个RB；
UE ID＝4的用户分配15个RB。
其中，调度用户时分配的带宽资源不能超过全带宽。
步骤207：根据资源分配结果，统计每个运营商每个业务切片所有接入用户实际占用带宽之和：运营商A业务切片1占用带宽20个RB；运营商B业务切片1占用带宽45个RB；运营商B业务切片2占用带宽35个RB。
步骤208：根据运营商实际占用带宽和运营商所属带宽，计算运营商带宽修正值：运营商A实际占用带宽20个RB，小于其所属带宽上限30个RB(该业 务切片所属带宽上限为50个RB)，因此带宽修正值为Δ A＝0+30＝30。
步骤209：根据业务切片实际占用带宽和业务切片所属带宽，计算业务切片带宽修正值：由于仅有运营商B服务2种业务切片，所以仅计算运营商B的业务切片带宽修正值，运营商B业务切片1实际占用带宽45个RB，业务切片1大于其所属带宽上限15个RB(业务切片1所属带宽上限30个RB)，因此带宽修正值为Δ B,1＝0-15＝-15。
实例二：
共享方式：2个运营商共享1个基站，服务2种业务切片，其中运营商个数和业务切片种类都可以大于2，实施例中所列的个数仅是以此举例，不构成具体限制。
步骤301：根据运营商和业务切片带宽占规规则，包括带宽占用比例，确定运营商占用带宽上限和业务切片占用带宽上限：2个运营商共享20MHz，运营商A带宽占用比例为50％，运营商B带宽占用比例为50％，运营商A和运营商B分别占用带宽资源上限为20MHz*50％＝10MHz，对应50个RB；运营商A仅服务业务切片1；运营商B同时服务业务切片1和2，2种业务切片分别占用运营商B资源比例为：60％和40％，同时，剩余的带宽资源允许运营商之间或者业务切片之间共享。
步骤302：根据上一个调度机会的业务切片带宽修正值Δ A＝30：Δ B,1＝-15，根据运营商和业务切片带宽占用比例和共享方式，计算当前调度机会修正后业务切片占用带宽上限：运营商A带宽上限为：50+30＝80个RB；运营商B业务切片1带宽上限为30-15＝15个RB，业务切片2带宽上限为100-80-15＝5个RB。
步骤303：获取接入用户所属运营商和业务切片属性，运营商A接入2个用户：UE ID＝1的用户接入一种NonGBR业务；UE ID＝2的用户接入一种NonGBR业务。运营商B接入4个用户：UE ID＝3的用户接入业务切片1的一种NonGBR业务；UE ID＝4的用户接入业务切片1的一种NonGBR业务；UE ID＝5的用户接入业务切片2的一种GBR业务，UE ID＝6的用户接入业务切片2的一种GBR业务。
步骤304：当运营商排序策略相同，业务切片排序策略不同时，2种运营商相同业务切片的用户一起排队。根据业务优先保证级别，GBR业务级别高于 NGBR业务，业务切片2的GBR业务一起排序，排序结果为：UE ID＝6→UE ID＝5；业务切片1的4个NonGBR业务用户一起排序，排序结果为：UE ID＝2→UE ID＝3→UE ID＝4→UE ID＝1。
步骤305：根据每种业务切片占用带宽上限，带宽占用规则以及业务资源需求依次按照排序队列结果分配资源：
UE ID＝6的用户分配5个RB；
UE ID＝5的用户分配5个RB；
UE ID＝2的用户分配40个RB；
UE ID＝3的用户分配5个RB；
UE ID＝4的用户分配15个RB；
UE ID＝1的用户分配30个RB。
其中，调度用户时分配的带宽资源不能超过全带宽。
步骤306：根据资源分配结果，统计每个运营商每个业务切片所有接入用户实际占用带宽之和：运营商A业务切片1占用带宽70个RB；运营商B业务切片1占用带宽20个RB；运营商B业务切片2占用带宽10个RB。
步骤307：根据运营商实际占用带宽和运营商所属带宽，计算运营商带宽修正值：运营商A实际占用带宽70个RB，小于其所属带宽上限10个RB(该业务切片所属带宽上限为80个RB)，因此带宽修正值为：Δ A＝0+10＝10。
步骤308：根据业务切片实际占用带宽和业务切片所属带宽，计算业务切片带宽修正值：由于仅有运营商B服务2种业务切片，所以仅计算运营商B的业务切片带宽修正值，运营商B业务切片1实际占用带宽20个RB，业务切片1大于其所属带宽上限5个RB(业务切片1所属带宽上限15个RB)，因此带宽修正值为Δ B,1＝0-5＝-5。
实例三：
共享方式：2个运营商联合组网，共享网络下的3个基站，服务2种业务切片，其中运营商个数、基站个数和业务切片种类都可以大于2，实施例中所列的个数仅是以此举例，不构成具体限制。
步骤401：确定运营商和业务切片带宽占规规则，包括带宽占用比例：基站1由运营商A独占，仅服务业务切片1；基站2由运营商A和B共享，运营商A带宽占用比例为50％，仅服务业务切片1，运营商B带宽占用比例为50％，服务业务切片1和业务切片2，两个业务切片全共享资源；基站3由运营商A和B共享，运营商A带宽占用比例为50％，服务业务切片1和业务切片2，两种业务切片的带宽占用比例分别为50％和50％，运营商B带宽占用比例为50％，仅服务业务切片2；同时，剩余的带宽资源允许运营商之间或者业务切片之间共享。
步骤402：根据每个运营商带宽占用比例和共享方式，计算网络下每个基站中每个运营商和每种业务切片的初始占用带宽上限，初始调度时每个基站的带宽比例同预设比例：
基站1运营商A占用带宽上限为：100个RB，仅服务业务切片1；
基站2运营商A占用带宽上限为：100*50％＝50个RB，仅服务业务切片1；运营商B所属带宽为50个RB，服务业务切片1和2，没有资源比例要求；
基站3运营商A占用带宽上限为：100*50％＝50个RB，其中业务切片1占用带宽上限为25个RB，业务切片2占用带宽上限为25个RB；运营商B占用带宽上限为为50个RB，仅服务业务切片2。
步骤403：基站调度初始化带宽修正值：2个运营商仅需要1个运营商的带宽修正值：Δ A,n＝0,n＝2,3，其中基站1不需要运营商带宽修正值；服务2个业务切片需要1个业务切片带宽修正值：Δ 1,3,A＝0，其中基站1不需要业务切片修正值，基站2也不需要带宽修正值，基站3的运营商B也不需要业务切片修正值，仅运营商3的运营商A需要业务切片修正值。
步骤404：根据带宽修正值修正当前调度机会运营商占用带宽上限：由于带宽修正值为0，当前调度机会每个基站占用带宽上限同初始值。
步骤405：不同基站分别根据接入用户所属运营商属性和运营商排序策略，按照运营商占用带宽上限，带宽占用规则以及业务资源需求分别进行资源分配。
步骤406：根据资源分配结果，统计每个运营商所有接入用户实际占用带宽之和：
基站1：运营商A的用户分配90个RB；
基站2：运营商A的用户分配70个RB；
运营商B的用户分配30个RB；
基站3：运营商A的业务切片1用户分配30个RB；
运营商A的业务切片2用户分配30个RB；
运营商B的用户分配40个RB。
步骤407：根据运营商实际占用带宽和运营商所属带宽，计算带宽修正值为：基站2运营商带宽修正值为：Δ A,2＝0-20＝-20；基站3运营商带宽修正值为：Δ A,3＝0-10＝-10；基站3运营商A的业务切片带宽修正值为Δ 1,3,A＝0-5＝-5。
步骤408：根据带宽修正值，均衡不同基站业务，查找全网中运营商A占用资源最多的基站：基站1，基站1仅服务运营商A，该基站还有剩余资源可以使用，选择运营商A占用资源次多的基站：基站2，将基站2中运营商A的业务向基站1均衡，同时基站2中运营商A的业务需求量已经超过其带宽资源上限，均衡后还可以达到基站2内部两个运营商业务的均衡。
在一实施例中，如图3所示，本公开实施例还提供一种电子装置，包括：存储器310、处理器320及存储在存储器310上并可在处理器320上运行的计算机程序，所述处理器320执行所述计算机程序时实现上述任一实施例所述的方法。
本公开实施例还提供一种计算机可读存储介质，存储有计算机可执行指令，所述计算机可执行指令用于执行上述任一实施例所述的方法。
在本实施例中，上述存储介质可以包括：通用串行总线闪存盘(Universal Serial Bus Flash Disk，U盘)、只读存储器(Read-Only Memory，ROM)、随机存取存储器(Random Access Memory，RAM)、移动硬盘、磁碟或者光盘等多种可以存储程序代码的介质。
采用本公开提供的方法及装置，在满足预设的带宽占用规则包括运营商的带宽占用规则/业务切片的带宽占用规则的基础上，保证带宽资源分配的有序性，最大化地满足接入用户的业务需求，最大化地满足业务的切片需求，通过运营商间协作调度，提高了频谱资源利用率，进一步降低了运营商的投资成本，从而更加适应未来多运营商混合调度的需求。
上述的本公开的多个模块或多个步骤可以用通用的计算装置来实现，它们可以集中在单个的计算装置上，或者分布在多个计算装置所组成的网络上，可选地，它们可以用计算装置可执行的程序代码来实现，从而，可以将它们存储在存储装置中由计算装置来执行，并且在某些情况下，可以以不同于此处的顺序执行所示出或描述的步骤，或者将它们分别制作成多个集成电路模块，或者将它们中的多个模块或步骤制作成单个集成电路模块来实现。这样，本公开不限制于特定的硬件和软件结合。

Claims (10)

  1. 一种资源分配的方法，包括：
    根据预设的带宽占用规则，确定多个运营商分别所属带宽和多种业务切片分别所属带宽；
    根据多个接入用户分别对应的运营商的属性、所述多个接入用户的业务分别对应的业务切片的属性、预设的所述运营商的排序策略和预设的所述业务切片的排序策略，对所述多个接入用户进行排序；
    根据所述多个接入用户的排序结果、所述多个运营商分别所属带宽、所述多种业务切片分别所属带宽和所述预设的带宽占用规则，将带宽资源分配给排序队列中的用户。
  2. 根据权利要求1所述的方法，其中，对所述多个接入用户进行排序包括：
    在所述多个运营商的排序策略相同，并且所述多种业务切片的排序策略也相同的情况下，对所述多个接入用户统一排序；
    在所述多个运营商的排序策略不同且所述多种业务切片的排序策略不同的情况下，将所述多个接入用户放入不同的用户队列分别排序；
    在所述多个运营商的排序策略相同，且所述多种业务切片的排序策略不同的情况下，对属于相同业务切片的接入用户统一排序。
  3. 根据权利要求1所述的方法，其中，对所述多个接入用户进行排序包括：根据业务优先保证级别，对不同业务切片中的相同业务类型对应的接入用户统一排序。
  4. 根据权利要求1所述的方法，其中，所述预设的带宽占用规则包括允许接入的多个用户之间相互占用剩余资源；
    在所述确定多个运营商分别所属带宽和多种业务切片分别所属带宽之后，还包括：
    利用至少一个带宽修正值修正下述至少之一：所述多个运营商中的至少一个运营商所属带宽；所述多种业务切片中的至少一种业务切片所属带宽；其中，所述至少一个带宽修正值用于均衡下述至少之一：不同运营商所属带宽；不同业务切片所属带宽。
  5. 根据权利要求4所述的方法，其中，所述根据所述多个接入用户的排序 结果、所述多个运营商分别所属带宽、所述多种业务切片分别所属带宽和所述预设的带宽占用规则，将带宽资源分配给排序队列中的用户包括：
    根据所述多个接入用户的排序结果、所述预设的带宽占用规则、修正后的所述多个运营商分别所属带宽、修正后的所述多种业务切片分别所属带宽，将所述带宽资源分配给排序队列中的用户。
  6. 根据权利要求5所述的方法，还包括下述至少之一：
    确定上一次带宽资源分配时所述多个运营商中每个运营商实际占用的带宽资源，将所述上一次所述多个运营商中的至少一个运营商实际占用的带宽资源与所述上一次所述至少一个运营商所属带宽上限的差值作为所述至少一个带宽修正值；
    确定上一次带宽资源分配时所述多种业务切片中每种业务切片实际占用的带宽资源，将所述上一次所述多种业务切片中至少一种业务切片实际占用的带宽资源与所述上一次所述至少一种业务切片所属带宽上限的差值作为所述至少一个带宽修正值。
  7. 一种资源分配的装置，包括：
    调度模块，设置为根据预设的带宽占用规则，确定多个运营商分别所属带宽和多种业务切片分别所属带宽；
    排序模块，设置为根据多个接入用户分别对应的运营商的属性、所述多个接入用户的业务分别对应的业务切片的属性、预设的所述运营商的排序策略和预设的所述业务切片的排序策略，对所述多个接入用户进行排序；
    所述调度模块还设置为：根据所述多个接入用户的排序结果、所述多个运营商分别所属带宽、所述多种业务切片分别所属带宽和所述预设的带宽占用规则，将带宽资源分配给排序队列中的用户。
  8. 根据权利要求7所述的装置，还包括：
    带宽资源修正模块，设置为通过至少一个带宽修正值修正下述至少之一：所述多个运营商中的至少一个运营商所属带宽；所述多种业务切片中的至少一种业务切片所属带宽，其中，所述至少一个带宽修正值用于均衡下述至少之一：不同接入用户类型的所属带宽；不同业务切片的所属带宽。
  9. 一种存储介质，所述存储介质中存储有计算机程序，其中，所述计算机程序被设置为运行时执行所述权利要求1至6任一项中所述的方法。
  10. 一种电子装置，包括存储器和处理器，所述存储器中存储有计算机程序，所述处理器被设置为运行所述计算机程序以执行所述权利要求1至6任一项中所述的方法。
PCT/CN2020/080559 2019-03-26 2020-03-23 资源分配的方法、装置及存储介质、电子装置 WO2020192604A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201910230456.X 2019-03-26
CN201910230456.XA CN111757468A (zh) 2019-03-26 2019-03-26 一种资源分配的方法、装置及存储介质、电子装置

Publications (1)

Publication Number Publication Date
WO2020192604A1 true WO2020192604A1 (zh) 2020-10-01

Family

ID=72610933

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/080559 WO2020192604A1 (zh) 2019-03-26 2020-03-23 资源分配的方法、装置及存储介质、电子装置

Country Status (2)

Country Link
CN (1) CN111757468A (zh)
WO (1) WO2020192604A1 (zh)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113596912A (zh) * 2021-07-29 2021-11-02 西安电子科技大学 基于ran切片的无线异构网络资源调度方法
CN114158075A (zh) * 2021-12-10 2022-03-08 中国联合网络通信集团有限公司 网络资源配置方法、装置、设备及存储介质

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112333831B (zh) * 2020-11-27 2022-05-24 中国联合网络通信集团有限公司 一种资源分配方法和接入网设备
CN112312568B (zh) * 2020-11-27 2022-05-24 中国联合网络通信集团有限公司 一种资源分配方法和接入网设备
CN112333832B (zh) * 2020-11-27 2022-07-08 中国联合网络通信集团有限公司 一种资源分配方法、接入网设备及计算机可读存储介质
CN112333833B (zh) * 2020-11-27 2022-05-24 中国联合网络通信集团有限公司 一种资源分配方法和接入网设备

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104980935A (zh) * 2014-04-03 2015-10-14 中兴通讯股份有限公司 一种共享网络的方法、装置和系统
CN107071782A (zh) * 2017-04-01 2017-08-18 北京邮电大学 基于网络切片的无线资源分配方法
CN108322937A (zh) * 2017-01-18 2018-07-24 上海诺基亚贝尔股份有限公司 无线接入网中用于网络切片的资源分配方法和编排器
WO2018169661A1 (en) * 2017-03-17 2018-09-20 Qualcomm Incorporated Prioritizing incompatible network slices
CN109845338A (zh) * 2016-08-12 2019-06-04 日本电气株式会社 支持网络切片的通信系统

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104980935A (zh) * 2014-04-03 2015-10-14 中兴通讯股份有限公司 一种共享网络的方法、装置和系统
CN109845338A (zh) * 2016-08-12 2019-06-04 日本电气株式会社 支持网络切片的通信系统
CN108322937A (zh) * 2017-01-18 2018-07-24 上海诺基亚贝尔股份有限公司 无线接入网中用于网络切片的资源分配方法和编排器
WO2018169661A1 (en) * 2017-03-17 2018-09-20 Qualcomm Incorporated Prioritizing incompatible network slices
CN107071782A (zh) * 2017-04-01 2017-08-18 北京邮电大学 基于网络切片的无线资源分配方法

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113596912A (zh) * 2021-07-29 2021-11-02 西安电子科技大学 基于ran切片的无线异构网络资源调度方法
CN113596912B (zh) * 2021-07-29 2023-07-18 西安电子科技大学 基于ran切片的无线异构网络资源调度方法
CN114158075A (zh) * 2021-12-10 2022-03-08 中国联合网络通信集团有限公司 网络资源配置方法、装置、设备及存储介质

Also Published As

Publication number Publication date
CN111757468A (zh) 2020-10-09

Similar Documents

Publication Publication Date Title
WO2020192604A1 (zh) 资源分配的方法、装置及存储介质、电子装置
US11246135B2 (en) Resource selection method and apparatus under multiple carriers, computer device, and storage medium
JP6420361B2 (ja) ネットワークの共有方法、装置、システム及びコンピュータ記憶媒体
CN111818581B (zh) 一种用户接入方法和接入网设备
CN103945540B (zh) 一种逻辑信道优先级处理方法及装置
CN111818588A (zh) 一种用户接入方法和接入网设备
US20150334733A1 (en) Data scheduling method and device
CN112543508A (zh) 面向5g网络切片的无线资源分配方法及网络架构
CN107154840B (zh) 资源分配控制方法、装置及系统
CN109743751B (zh) 无线接入网的资源分配方法及装置
CN105120482B (zh) 一种基于资源利用率的时延优先调度方法
CN105722151B (zh) 一种均衡控制信道负载的方法及装置
CN104640227A (zh) Lte系统中混合业务的下行资源调度方法
Hirayama et al. RAN slicing in multi-CU/DU architecture for 5G services
CN106851667B (zh) 一种针对空口协议数据面的数据处理方法及装置
CN103139780B (zh) 小区间干扰协调方法及装置
CN103096490B (zh) 一种业务接入方法及装置
CN107947890B (zh) 一种小区间干扰协调方法及网络设备
CN111567115A (zh) 一种车联网系统的功率分配方法和装置
EP1154665B1 (en) Wireless data transmission scheduling
CN112996114B (zh) 资源调度方法、装置、设备及存储介质
Liu et al. Flexible spectrum sharing in OFDMA cellular networks
US10511419B2 (en) Multi-user grouping
Caeiro et al. A fair mechanism of virtual radio resource management in multi-RAT wireless het-nets
CN103874165B (zh) 一种应用于lte‑a系统的业务接入方法及装置

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 20776895

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 01/03/2022)

122 Ep: pct application non-entry in european phase

Ref document number: 20776895

Country of ref document: EP

Kind code of ref document: A1