WO2017185908A1 - 一种资源调度的方法及装置、存储介质 - Google Patents

一种资源调度的方法及装置、存储介质 Download PDF

Info

Publication number
WO2017185908A1
WO2017185908A1 PCT/CN2017/077374 CN2017077374W WO2017185908A1 WO 2017185908 A1 WO2017185908 A1 WO 2017185908A1 CN 2017077374 W CN2017077374 W CN 2017077374W WO 2017185908 A1 WO2017185908 A1 WO 2017185908A1
Authority
WO
WIPO (PCT)
Prior art keywords
virtual network
resource
allocated
allocation
max
Prior art date
Application number
PCT/CN2017/077374
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 WO2017185908A1 publication Critical patent/WO2017185908A1/zh

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/0896—Bandwidth or capacity management, i.e. automatically increasing or decreasing capacities
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/46—Interconnection of networks
    • H04L12/4641—Virtual LANs, VLANs, e.g. virtual private networks [VPN]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • 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

Definitions

  • the present invention relates to, but is not limited to, the field of wireless communications, and more particularly to a method and apparatus for resource scheduling based on virtual network (VN) in a Long Term Evolution (LTE) scenario, and a storage medium.
  • VN virtual network
  • LTE Long Term Evolution
  • Virtualization technology is not a new term. In the computer field, concepts such as virtual memory and virtual operating systems have long appeared. With the development of the Internet, network virtualization technology has emerged, which aims to meet the complex and diverse network requirements, improve the Internet architecture, and better practice and test new network technologies. Through network virtualization, people can create multiple virtual networks on a shared physical network resource and operate and manage each virtual network independently.
  • Wireless network virtualization is an emerging research hotspot in recent years. It separates the network infrastructure from the services provided by the network. Different services can coexist on the same infrastructure, that is, the physics belonging to one or more suppliers.
  • the infrastructure can be shared among multiple Service Providers (SPs).
  • SPs Service Providers
  • network flexibility and resource utilization can be improved, and at the same time, due to the improvement of network programmability, service providers can provide more distinctive services.
  • this technology can provide a better experimental environment for the testing and implementation of new communication technologies.
  • the algorithm has a polling algorithm, a maximum carrier-to-interference ratio algorithm, a proportional fairness algorithm, and the like.
  • the embodiments of the present invention provide a resource scheduling method and device, and a storage medium, to perform reasonable resource allocation on a virtual network, improve resource utilization, and meet actual requirements of each virtual network.
  • the embodiment of the invention provides a resource scheduling method, including:
  • the performing resource allocation includes: selecting a resource block for the selected virtual network to perform allocation according to the specified condition.
  • the selecting, by the specified condition, the resource block for the selected virtual network to allocate includes:
  • R i,n represents the current rate of the user i on the resource block numbered n, R i , which averages the average rate of the user i.
  • the virtual network that selects the resource to be allocated according to the polling manner performs resource allocation until the resource blocks available to the virtual network of all the resources to be allocated are all allocated, including:
  • the resource allocation duration reaches the specified time, the number of resource blocks owned by the virtual network that meets the preset condition is adjusted.
  • the adjusting the number of resource blocks owned by the virtual network that meets the preset condition includes:
  • R A,x represents the average rate of the xth virtual network
  • R D,x the demand rate of the xth virtual network
  • N x is the number of resource blocks occupied by the xth virtual network
  • An embodiment of the present invention provides a device for resource scheduling, including:
  • Selecting a module configured to select a virtual network to be allocated according to a polling manner to perform resource allocation, until all resource blocks available for each virtual network to be allocated are allocated;
  • the allocating module configured to perform resource allocation includes: selecting a resource block for the selected virtual network for allocation according to the specified condition.
  • the allocating module comprises:
  • a detection unit configured to detect the selected virtual network The largest user i;
  • An allocation unit configured to select a resource block corresponding to the user i for allocation, where
  • R i,n represents the current rate of the user i on the resource block numbered n, R i , which averages the average rate of the user i.
  • the apparatus of this embodiment further includes: an adjusting module, configured to perform resource allocation by selecting, by the selecting module, a virtual network to be allocated resources according to a polling manner, until each virtual network of the resource to be allocated is available.
  • an adjusting module configured to perform resource allocation by selecting, by the selecting module, a virtual network to be allocated resources according to a polling manner, until each virtual network of the resource to be allocated is available. In the process of allocating resource blocks, when the resource allocation duration reaches the specified time, the resources owned by the virtual network satisfying the preset conditions are The number of source blocks is adjusted.
  • the adjusting module comprises:
  • a computing unit configured to calculate p x and q x values for each virtual network, wherein R A,x represents the average rate of the xth virtual network, R D,x the demand rate of the xth virtual network, and N x is the number of resource blocks occupied by the xth virtual network;
  • a determining unit configured to determine whether all p x values are greater than or equal to 1, or all q x values are less than or equal to 1;
  • Embodiments of the present invention provide a storage medium storing a computer program configured to perform the foregoing resource scheduling method.
  • the virtual network to be allocated resources is selected according to the polling manner to perform resource allocation until all resource blocks available to the virtual network of all the resources to be allocated are allocated; the resource allocation includes: Specify a condition to select a resource block for allocation for the selected virtual network.
  • the technical solution of the embodiment of the present invention can perform reasonable resource allocation on the virtual network, improve resource utilization, and meet the actual requirements of each virtual network.
  • FIG. 1 is a flowchart of a method for resource scheduling according to an embodiment of the present invention
  • FIG. 3 is a schematic diagram of a virtual network band occupancy according to an embodiment of the present invention.
  • FIG. 4 is a flowchart of a method for a basic allocation phase according to an embodiment of the present invention.
  • FIG. 5 is a flowchart of a dynamic adjustment phase according to an embodiment of the present invention.
  • FIG. 6 is a schematic diagram of an apparatus for resource scheduling according to an embodiment of the present invention.
  • one base station can establish multiple VNs by dividing frequency band resources.
  • the present application proposes a resource scheduling method for a base station to establish resource allocation problems of multiple virtual networks. The method is divided into a basic allocation phase and a dynamic adjustment phase.
  • FIG. 1 is a flowchart of a method for resource scheduling according to an embodiment of the present invention. As shown in FIG. 1 , the method in this embodiment includes:
  • Step S11 Select a virtual network to be allocated resources according to a polling manner to perform resource allocation until all resource blocks available to the virtual network of all the resources to be allocated are allocated.
  • Step S12 The performing resource allocation comprises: selecting a resource block for the selected virtual network according to the specified condition for allocation.
  • the method of this embodiment is a basic allocation phase, and the task of allocating related resources to the user is completed.
  • the scheduler knows the number of virtual networks that need to be established, and has determined the number of resource blocks (RBs) that each virtual network originally has.
  • the sum of the number of RBs owned by each virtual network is equal to the total number of RBs N allocated by the system to the virtual network.
  • the solution selects the VN that needs to allocate resources according to the polling mode.
  • the selected VN selects an RB to serve a user within it according to a proportionally improved manner, and then selects the next VN that needs to allocate resources. Do this repeatedly until all VN assignments are complete.
  • the user of VN 1 is initially assigned an RB, and the user and the corresponding RB are based on The maximum value is determined, where user i belongs to VN1.
  • the allocation of one RB is completed for the first virtual network, one RB is allocated to VN2, and one RB is allocated for VN3.
  • another RB is assigned to VN1, and then VN2 and VN3 are allocated.
  • the basic allocation phase completes the specific resource allocation to the virtual network. This step allocates all N RBs.
  • the present application adds the idea of dynamic adjustment. That is, according to the current average rate condition of each VNx, the number of RBs N x to be allocated for each allocation is adjusted to achieve the purpose of meeting the rate requirements in different VNs.
  • the virtual network that selects the resource to be allocated according to the polling manner performs resource allocation until the resource blocks available to the virtual network of all the resources to be allocated are all allocated, including:
  • the resource allocation duration reaches the specified time, the number of resource blocks owned by the virtual network that meets the preset condition is adjusted.
  • the base station uses a part of the resources for the establishment of the virtual network, that is, allocates the resources to the X virtual networks, and then dynamically adjusts the resources occupied by the respective virtual networks according to the network requirements of the different virtual networks.
  • FIG. 2 is a general flowchart of an embodiment of the present invention:
  • the overall process of the invention has two main parts, the first part is the basic allocation stage and the second part is the dynamic adjustment stage.
  • Step S101 Basic allocation stage.
  • resources are allocated reasonably according to the number of virtual networks and the number of RBs occupied by each virtual network.
  • Step S102 Whether the statistical time is accumulated to T. If not accumulated to T, go to step 101, if accumulated to T, then go to step 103;
  • the basic allocation phase completes the specific resource allocation to the virtual network
  • the dynamic adjustment phase completes the adjustment of how many RBs each virtual network should be allocated in the base phase.
  • the time T is equivalent to a dynamically adjusted period value, such as 10 Transmission Time Interval (TTI) or 100 TTI. For example, if T is 100 TTIs, if each TTI completes the basic allocation process, when 100 TTIs are performed, a dynamic adjustment process is performed, which is intended to be completed in the basic phase for each virtual network. How many RB adjustments are assigned.
  • the basic allocation process is used in every round of RB allocation, and the dynamic adjustment phase is not necessarily.
  • T the purpose of adjusting the update frequency can be achieved.
  • Step S103 When the set T is reached, the accumulation time is cleared, and then the flow proceeds to step S104.
  • Step S104 Dynamic adjustment phase. After the dynamic adjustment is completed, if the available resource blocks are not allocated as in the previous basic allocation phase, then go to step 101 to continue the basic allocation, which will update the N x parameters to be used in the S101 base allocation, and restart the timing. If all the available resource blocks have been allocated in the previous basic allocation phase, the resource allocation for the next scheduling period is performed, and the process proceeds to step 101.
  • the actual user average rate and the average rate of demand in each VN are compared, and the RB resources occupied by the virtual network with better user QoS are transferred to the virtual network with poor performance, that is, the guarantee is Under the premise of better performance of the virtual network out of the resource, the number of RBs with poor performance VN x is increased, thereby achieving the purpose of dynamically adjusting and rationally allocating resources.
  • FIG. 3 is a schematic diagram of a virtual network band occupancy according to an embodiment of the present invention:
  • a part of the resources of the base station is used for the non-virtual network, and another part is used for the establishment of the virtual network, which is represented as non-virtual network resources and assignable RB resources, respectively.
  • the base station serves a total of three virtual networks, namely VN1, VN2, and VN3.
  • Each of the three virtual networks occupies a certain number of RBs, and three virtual networks.
  • the total number of RBs occupied by the network is fixed.
  • FIG. 4 is a flowchart of a method for a basic allocation phase according to an embodiment of the present invention. As shown in FIG. 4, the method in this embodiment includes the following steps:
  • Step S301 the initialization step of the resource allocation process, the number of X is determined to be established VN, VN in each round of allocation should occupy an RB number N x, and the virtual network system for the total number of allocatable RB N.
  • Set A ⁇ 1, 2, ..., X ⁇ , indicating the number set of VN;
  • B is an empty set, indicating that the VN set of N x RBs has been allocated;
  • set C ⁇ 1, 2, ..., N ⁇ , indicating A numbered set of RBs can be assigned in the system.
  • Step S302 Select VN x to perform the following resource allocation, and the selection rule is: select the smallest number value x in A, and remove x from A.
  • Step S303 The search detects the VN x determined in step 302.
  • the largest user i and its corresponding RB number n cause the RB to serve the user and remove the RB number n from the set C.
  • i is the user number in VN x
  • n is the RB number available for allocation
  • R i,n represents the current rate of user i on the RB numbered n
  • R i represents the average rate of user i on average.
  • Step S304 It is determined whether the assignable RB set C is an empty set. If it is an empty set, the allocation is completed, otherwise step 305 is performed.
  • Step S305 Update the B set, where the B set indicates the VN number that has been allocated, that is, when a certain VN is allocated, the VN number is added to the B set.
  • Step S307 Determine whether A is an empty set. If it is an empty set, it indicates that all the numbers in the set A are allocated in the round, and step 308 is performed; otherwise, S302 is performed.
  • the basic allocation method is to allocate one RB for VN1, then allocate one RB for VN2, then VN3, then VN1, VN2, VN3, VN1, VN2, VN3, VN1, VN2, VN3, VN1.
  • VN2, VN3, ... the change of set A can be expressed as A: ⁇ 1, 2, 3 ⁇ , allocation 1, ⁇ 2, 3 ⁇ , allocation 2, ⁇ 3 ⁇ , allocation 3, empty set, reassignment, ⁇ 1 , 2, 3 ⁇ , allocation 1, ⁇ 2, 3 ⁇ , allocation 2, ⁇ 3 ⁇ , allocation 3, empty set, reassignment value...
  • the base allocation phase will allocate a total of N RBs to the 3 virtual networks.
  • Step S309 the assignment is completed.
  • RB may be allocated according to the number set in advance for each VN x possession N x, a fairer allocation method based Resources, scheduled users.
  • the fixed number of N x may result in a situation where the actual QoS of the user of each VN does not necessarily satisfy the demand.
  • the N x value in step 301 of the basic allocation is adjusted by an algorithm, that is, the number of RBs occupied by each VN x is adjusted, thereby achieving the purpose of adjusting user QoS in the VN.
  • FIG. 5 is a flowchart of a dynamic adjustment phase according to an embodiment of the present invention. As shown in FIG. 5, the method includes the following steps:
  • Step S401 Calculate p x and q x values of each virtual network.
  • R A,x and R D,x represent the average rate and the required rate of VN x , respectively. Describes the satisfaction satisfaction of VN x . Since R A, x and VN x have a linear relationship with the bandwidth of the band allocated, so Describes the new estimate p x for VN x in the case of reducing one owned RB.
  • X_min represents the corresponding virtual network number with the smallest p x value
  • x_max represents the corresponding virtual network number with the largest q x value.
  • Step S402 It is judged whether all p x values are greater than or equal to 1 or all q x values are less than or equal to 1. If it is established, since adjustment is not necessary, the adjustment is completed, that is, S407 is executed. Otherwise, S403 is executed.
  • Step S403 Acquire virtual network numbers x_min and x_max according to p x and q x values.
  • This step is to select the virtual network x_min with the lowest rate satisfaction and the virtual network x_max with the highest rate satisfaction after reducing one RB.
  • Step S404 If q x_max >1 and p x_min ⁇ 1, S405 is performed, otherwise the algorithm ends, that is, S407 is executed.
  • This step ensures that the adjustment is to provide the resources of the virtual network that meet the requirements to the virtual network that does not meet the demand.
  • Step S406 The virtual network numbers x_min and x_max are reacquired, and the process returns to S404.
  • Step S407 The adjustment algorithm ends.
  • the algorithm in FIG. 5 can dynamically adjust the number of RBs occupied by the virtual network, and is designed to transfer the RB resources occupied by the virtual network with good user rate satisfaction to the virtual network with poor performance, that is, to ensure that the resources are transferred out.
  • the number of RBs of the virtual network VN x is poorly increased, thereby achieving the purpose of dynamically adjusting and rationally allocating resources.
  • FIG. 6 is a schematic diagram of an apparatus for resource scheduling according to an embodiment of the present invention. As shown in Figure 6, the apparatus of this embodiment includes:
  • the selecting module 61 is configured to select a virtual network to be allocated resources according to a polling manner. Source allocation until all resource blocks available to the virtual network of all resources to be allocated are allocated;
  • the allocating module 62 is configured to perform resource allocation, including: selecting a resource block for the selected virtual network for allocation according to the specified condition.
  • the distribution module 62 includes:
  • the detecting unit 621 is configured to detect the selected virtual network The largest user i;
  • the allocating unit 622 is configured to select a resource block corresponding to the user i for allocation, where
  • R i,n represents the current rate of the user i on the resource block numbered n, R i , which averages the average rate of the user i.
  • the apparatus may further include:
  • the adjusting module 63 is configured to perform resource allocation in the virtual network in which the selecting module selects a resource to be allocated according to a polling manner, until all resource blocks available to the virtual network of the resource to be allocated are allocated, and when the resource is allocated When the duration reaches the specified time, the number of resource blocks owned by the virtual network that meets the preset conditions is adjusted.
  • the adjustment module 63 includes:
  • a calculating unit 631 configured to calculate p x and q x values of each virtual network, where R A,x represents the average rate of the xth virtual network, R D,x the demand rate of the xth virtual network, and N x is the number of resource blocks occupied by the xth virtual network;
  • the determining unit 632 is configured to determine whether all p x values are greater than or equal to 1, or all q x values are less than or equal to 1;
  • each unit in the resource scheduling device may be a Central Processing Unit (CPU) or a Micro Processor Unit (CPU) located in the resource scheduling device.
  • CPU Central Processing Unit
  • CPU Micro Processor Unit
  • MPU or Digital Signal Processor (DSP), or Field Programmable Gate Array (FPGA).
  • an embodiment of the present invention further provides an electronic device, where the electronic device includes: a memory and a processor, where the computer stores executable instructions, and the processor reads and executes the computer executable instructions.
  • the electronic device includes: a memory and a processor, where the computer stores executable instructions, and the processor reads and executes the computer executable instructions.
  • the apparatus for tracking the service signaling may also be stored in a computer readable storage medium if it is implemented in the form of a software function module and sold or used as a separate product.
  • the technical solution of the embodiments of the present invention may be embodied in the form of a software product in essence or in the form of a software product stored in a storage medium, including a plurality of instructions.
  • a computer device (which may be a personal computer, server, or network device, etc.) is caused to perform all or part of the methods described in various embodiments of the present invention.
  • the foregoing storage medium includes: a U disk, a mobile hard disk, a read only memory (ROM), a magnetic disk, or an optical disk, and the like, which can store program codes.
  • ROM read only memory
  • magnetic disk or an optical disk, and the like, which can store program codes.
  • embodiments of the present invention also provide a storage medium storing computer executable instructions, the method of implementing the resource scheduling when the computer executable instructions are executed.
  • the technical solution of the embodiment of the present invention selects a virtual network to be allocated resources according to a polling manner to perform resource allocation until all resource blocks available to the virtual network of all the resources to be allocated are allocated; the resource allocation includes: The condition selects a resource block for allocation for the selected virtual network. In this way, reasonable resource allocation can be performed on the virtual network to improve resource utilization and meet the actual needs of each virtual network.

Landscapes

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

Abstract

一种资源调度的方法及装置、存储介质，该方法包括：按照轮询方式选择待分配资源的虚拟网络进行资源分配，直至所有待分配资源的虚拟网络各自可用的资源块都分配完为止；所述进行资源分配包括：按照指定条件为所选的虚拟网络选择一个资源块进行分配。

Description

一种资源调度的方法及装置、存储介质 技术领域
本申请涉及但不限于无线通信领域，尤指涉及一种长期演进(Long Term Evolution，简称LTE)场景中基于虚拟网络(Virtual Network，简称VN)的资源调度的方法及装置、存储介质。
背景技术
现如今，通信技术正在飞速发展。在这个发展过程中，有许多已有技术正在被改进、完善，以适应新的通信环境与框架，还有许多新的技术被提出，以进一步满足人们对于通信质量、速率等方面的需求。在无线网络领域，虚拟化技术与无线网络相结合在近年来成为了一个研究热点。
虚拟化技术并不是一个新鲜的词汇，在计算机领域中，虚拟内存、虚拟操作系统等概念早已出现。随着互联网的发展，又出现了网络虚拟化技术，其旨在满足复杂多样的网络需求，改善互联网架构，同时更好地对网络新技术进行实践与检验。通过网络虚拟化，人们可以在一个共享的物理网络资源上创建多个虚拟网络，并对每个虚拟网络进行独立地运作与管理。
无线网络虚拟化是近年来的一个新兴研究热点，它将网络的基础设施与网络所提供的服务相分离，不同的服务可以在同一个基础设施上共存，即属于一个或多个供应者的物理基础设施可以在多个服务提供者(Service Provider，简称SP)间被共享。通过对无线网络虚拟化技术的应用，可以提升网络的灵活性、资源利用率，同时由于网络可编程性的提升，便于服务提供者提供更具特色的服务。另外，该技术可为通信新技术的测试与实施提供更好的实验环境。
目前，对于基站资源的调度算法已经有了许多研究，比较经典的调度 算法有轮询算法、最大载干比算法、比例公平算法等。随着基站虚拟网络的建立，目前关于如何具体为基站内虚拟网络合理分配资源及分配多少资源的研究并不多。
发明内容
本发明实施例提供一种资源调度的方法及装置、存储介质，以对虚拟网络进行合理的资源分配，提高资源利用率并满足每个虚拟网络实际需求。
本发明实施例提供了一种资源调度的方法，包括：
按照轮询方式选择待分配资源的虚拟网络进行资源分配，直至所有待分配资源的虚拟网络各自可用的资源块都分配完为止；
所述进行资源分配包括：按照指定条件为所选的虚拟网络选择一个资源块进行分配。
在一实施方式中，所述按照指定条件为所选的虚拟网络选择资源块进行分配，包括：
检测出所选的虚拟网络中
Figure PCTCN2017077374-appb-000001
最大的用户i；
选择所述用户i对应的资源块进行分配，其中，
Ri,n表示所述用户i在编号为n的资源块上的当前速率，Ri,平均表示所述用户i的平均速率。
在一实施方式中，所述按照轮询方式选择待分配资源的虚拟网络进行资源分配，直至所有待分配资源的虚拟网络各自可用的资源块都分配完为止的过程中，包括：
当资源分配持续时间达到指定时间时，对满足预设条件的虚拟网络所拥有的资源块数进行调整。
在一实施方式中，所述对满足预设条件的虚拟网络所拥有的资源块数进行调整，包括：
计算每个虚拟网络的px与qx值，其中，
Figure PCTCN2017077374-appb-000002
RA,x表示第x个虚拟网络的平均速率，RD,x第x个虚拟网络的需求速率，Nx为第x个虚拟网络所占有的资源块数；
判断是否所有px值均大于等于1，或所有qx值均小于等于1，如不是，则进行动态调整，包括以下步骤：
获取px值最小的相应虚拟网络的编号x_min，qx值最大的相应虚拟网络的编号x_max，
如qx_max>1且px_min<1，则令Nx_min＝Nx_min+1，Nx_max＝Nx_max-1，
Figure PCTCN2017077374-appb-000003
px_max＝qx_max，然后重新进行所述动态调整。
本发明实施例提供一种资源调度的装置，包括：
选择模块，配置为按照轮询方式选择待分配资源的虚拟网络进行资源分配，直至所有待分配资源的虚拟网络各自可用的资源块都分配完为止；
分配模块，配置为进行资源分配包括：按照指定条件为所选的虚拟网络选择一个资源块进行分配。
在一实施方式中，所述分配模块包括：
检测单元，配置为检测出所选的虚拟网络中
Figure PCTCN2017077374-appb-000004
最大的用户i；
分配单元，配置为选择所述用户i对应的资源块进行分配，其中，
Ri,n表示所述用户i在编号为n的资源块上的当前速率，Ri,平均表示所述用户i的平均速率。
在一实施方式中，本实施例的装置还包括：调整模块，配置为在所述选择模块按照轮询方式选择待分配资源的虚拟网络进行资源分配，直至所有待分配资源的虚拟网络各自可用的资源块都分配完为止的过程中，当资源分配持续时间达到指定时间时，对满足预设条件的虚拟网络所拥有的资 源块数进行调整。
在一实施方式中，所述调整模块包括：
计算单元，配置为计算每个虚拟网络的px与qx值，其中，
Figure PCTCN2017077374-appb-000005
Figure PCTCN2017077374-appb-000006
RA,x表示第x个虚拟网络的平均速率，RD,x第x个虚拟网络的需求速率，Nx为第x个虚拟网络所占有的资源块数；
判断单元，配置为判断是否所有px值均大于等于1，或所有qx值均小于等于1；
调整单元，配置为在所述判断模块判断为不是的情况下，则进行动态调整，包括以下步骤：获取px值最小的相应虚拟网络的编号x_min，qx值最大的相应虚拟网络的编号x_max，如qx_max>1且px_min<1，则令Nx_min＝Nx_min+1，Nx_max＝Nx_max-1，
Figure PCTCN2017077374-appb-000007
px_max＝qx_max，然后重新进行所述动态调整。
本发明实施例提供一种存储介质，该存储介质存储有计算机程序，该计算机程序配置为执行上述资源调度的方法。
本发明实施例的技术方案中，按照轮询方式选择待分配资源的虚拟网络进行资源分配，直至所有待分配资源的虚拟网络各自可用的资源块都分配完为止；所述进行资源分配包括：按照指定条件为所选的虚拟网络选择一个资源块进行分配。采用本发明实施例的技术方案，可以对虚拟网络进行合理的资源分配，提高资源利用率并满足每个虚拟网络实际需求。
附图说明
图1为本发明实施例的一种资源调度的方法的流程图；
图2为本发明实施例提供的一种总体流程图；
图3为本发明实施例提供的一种虚拟网络频带占用的示意图；
图4为本发明实施例提供的一种基础分配阶段的方法的流程图；
图5为本发明实施例提供的一种动态调整阶段的流程图；
图6为本发明实施例的一种资源调度的装置的示意图。
具体实施方式
为使本发明的目的、技术方案和优点更加清楚明白，下文中将结合附图对本发明的实施例进行详细说明。需要说明的是，在不冲突的情况下，本申请中的实施例及实施例中的特征可以相互任意组合。
在基站虚拟化中，一个基站可以通过划分频带资源来建立多个VN。本申请针对基站建立多个虚拟网络的资源分配问题，提出了一种资源调度的方法。该方法分为基础分配阶段和动态调整阶段。
图1为本发明实施例的一种资源调度的方法的流程图，如图1所示，本实施例的方法包括：
步骤S11、按照轮询方式选择待分配资源的虚拟网络进行资源分配，直至所有待分配资源的虚拟网络各自可用的资源块都分配完为止；
步骤S12、所述进行资源分配包括：按照指定条件为所选的虚拟网络选择一个资源块进行分配。
本实施例的方法为基础分配阶段，完成的是为用户分配相关资源的任务。在基础分配阶段，调度器已知所需建立的虚拟网络个数，同时已确定每个虚拟网络最初拥有的资源块(Resource Block，简称RB)数目。各个虚拟网络拥有的RB数目之和等于系统分配给虚拟网络的总RB数目N。
在分配过程中，本方案按照轮询方式选择需要分配资源的VN。在一实施方式中，被选中的VN根据比例公平改进后的方式选择一个RB来服务其内的一个用户，然后再选择下一个需要分配资源的VN。反复执行此操作，直到所有VN分配完成。
例如：若有3个VN，在基础分配阶段中，一开始为VN 1的用户分配一个RB，这一个用户及对应的RB是根据
Figure PCTCN2017077374-appb-000008
的最大值来确定的，其中用户i属于VN1。在为第一个虚拟网络完成了一个RB的分配后，再对VN2这样分配一个RB，再为VN3分配一个RB。这一个循环完成之后，再接着对VN1分配一个RB，然后再对VN2、VN3进行分配……。基础分配阶段完成了对虚拟网络的具体资源分配，这一步骤将N个RB全部分配完毕。
为了满足各个VN的服务质量(Quality of Service，简称QoS)需求，本申请又加入动态调整的思想。即根据每个VNx的当前平均速率状况，调整每次分配时将被分配的RB数Nx，以达到满足不同VN中速率需求的目的。
在步骤S11，所述按照轮询方式选择待分配资源的虚拟网络进行资源分配，直至所有待分配资源的虚拟网络各自可用的资源块都分配完为止的过程中，包括：
当资源分配持续时间达到指定时间时，对满足预设条件的虚拟网络所拥有的资源块数进行调整。
在本实施例中，基站将一部分资源用于虚拟网络的建立，即将这些资源分配给X个虚拟网络，之后根据不同虚拟网络的网络需求对它们各自占用的资源进行了动态的调整。下面将结合附图和实施例对本申请的流程进行详细说明，但以下说明并不造成对本申请的任何不当限定。
图2为本发明实施例提供的一种总体流程图：
该发明的总体流程共有两个主要部分，第一个部分是基础分配阶段，第二个部分是动态调整阶段。
步骤S101：基础分配阶段。
在该阶段中，将根据虚拟网络个数及每个虚拟网络占用的RB数来对资源进行合理分配。
步骤S102：统计时间是否累积到T。如未累积到T，转向步骤101，如累积到T，则转向步骤103；
基础分配阶段完成了对虚拟网络的具体资源分配，而动态调整阶段完成的是对每个虚拟网络应该在基础阶段被分配多少个RB的调整。这里的时间T相当于一个动态调整的周期值，比如10个发送时间间隔(Transmission Time Interval，简称TTI)或者100个TTI等。举个例子：如果T是100个TTI，若每个TTI完成一次基础分配过程，当进行了100个TTI时，会执行一次动态调整过程，该过程旨在完成对每个虚拟网络应该在基础阶段被分配多少个RB的调整。
基础分配过程在每一轮RB分配时都会使用，而动态调整阶段则不一定，通过调节T，可以达到调节更新频率的目的。
步骤S103：当达到设定的T时，累积时间清零，然后转向步骤S104。
步骤S104：动态调整阶段。动态调整完后，如先前的基础分配阶段还有可用的资源块未被分配，则转向步骤101，继续进行基础分配，该阶段将更新S101基础分配中将使用的Nx参数，并重新开始计时；如先前的基础分配阶段所有可用的资源块均已被分配，则进行下一个调度周期的资源分配，转向步骤101。
在该阶段中，将比较每个VN中实际的用户平均速率与需求平均速率的差距，旨在将用户QoS较好的虚拟网络占用的RB资源转移给性能不佳的虚拟网络，即在保证被转出资源的虚拟网络较好性能的前提下，增加性能较差VNx的RB占用数目，从而达到动态调整且合理分配资源的目的。
图3为本发明实施例提供的一种虚拟网络频带占用的示意图：
在该实施例中，基站的资源有一部分用于非虚拟网络，而另一部分用于虚拟网络的建立，在图中分别表示为非虚拟网络资源和可分配RB资源。
如图所示，在可分配RB资源中，基站共服务了三个虚拟网络，分别为VN1、VN2、VN3，这三个虚拟网络各占用一定数量的RB，而三个虚拟网 络占用的总RB数目一定。
图4为本发明实施例提供的一种基础分配阶段的方法的流程图，如图4所示，本实施例的方法包括如下步骤：
步骤S301：该步骤为资源分配的初始化过程，需要确定要建立的VN个数X、每个VN在本轮分配应占有的RB数目Nx，以及系统总的用于虚拟网络的可分配RB数目N。集合A＝{1，2，…，X}，表示VN的编号集合；B为空集，表示已分配完Nx个RB的VN集合；集合C＝{1，2，…，N}，表示系统中可分配RB的编号集合。
步骤S302：选择VNx进行下面的资源分配，选择规则为：选择A中最小的编号值x，并将x从A中剔除
步骤S303：搜索检测出步骤302确定的VNx中
Figure PCTCN2017077374-appb-000009
最大的用户i及其对应的RB编号n，使该RB服务该用户，并将上述RB编号n从集合C中剔除。
其中，i为VNx中用户编号，n为可用于分配的RB编号，Ri,n表示用户i在编号为n的RB上的当前速率，Ri,平均表示用户i的平均速率。
步骤S304：判断可分配RB集合C是否为空集，若为空集，分配完毕，否则执行步骤305。
步骤S305：更新B集合，其中B集合表示已经分配完毕的VN编号，即某个VN分配完毕，则将该VN编号加入B集合内。
步骤S306：判断VN是否分配完毕，如果VN全部分配完毕，即B集合为B＝{1，2，…，X}，则跳至步骤S309，否则执行步骤307。
步骤S307：判断A是否是空集，如果是空集，说明集合A内全部编号在该轮均分配过，执行步骤308，否则执行S302。
步骤S308：更新A集合，对A重新赋值，即A为A＝{1，2，…，X}-B，旨在不对已分配完的B中VN再进行分配。再重新执行步骤302。
举个例子：如果有3个VN，基础分配方式是为VN1分配一个RB，然后为VN2分配一个RB，然后VN3，再VN1、VN2、VN3、VN1、VN2、VN3、VN1、VN2、VN3、VN1、VN2、VN3……集合A的变化可表述为A：{1，2，3}、分配1、{2，3}、分配2、{3}、分配3、空集、重赋值、{1，2，3}、分配1、{2，3}、分配2、{3}、分配3、空集、重赋值……。
基础分配阶段会将总共N个RB分配给这3个虚拟网络。
当然，这其中还要考虑排除RB分配够了的虚拟网络，集合B完成的就是这个功能。
当A为空集的时候，308执行的是对A的重新赋值，如果B为空集，那么A在308中就重新变为A＝{1，2，3}。即再对VN1、VN2、VN3进行分配。如果B比如有一个已分配完的网络VN2，那么A会在308中被赋值为A＝{1，3}，也就是系统会在VN1、VN3之间进行接下来的分配。
步骤S309：分配完毕。
根据预先设定的每个VNx占有的RB数目Nx，基础分配方法可以较公平合理地分配资源、调度用户。然而，Nx数目的固定会导致每个VN的用户实际QoS不一定满足需求的情况。
因此，在执行基础分配的基础上，为了满足各个VN的QoS需求，本申请又加入了动态调整的思想。通过算法对基础分配中步骤301中的Nx值做调整，即调整每个VNx占用的RB数目，从而达到调节VN内用户QoS的目的。
图5为本发明实施例提供的一种动态调整阶段的流程图，如图5所示，包括以下步骤：
步骤S401：计算每个虚拟网络的px与qx值。
本实施例中，令RA,x与RD,x分别表示VNx的平均速率与需求速率。
Figure PCTCN2017077374-appb-000010
描述了VNx的需求满足度。由于RA,x与VNx所分配的频带资源宽 度近似存在线性关系，所以令
Figure PCTCN2017077374-appb-000011
描述了VNx在减少一个所拥有RB的情况下新的估计值px。x_min表示px值最小的相应虚拟网络编号，而x_max表示qx值最大的相应虚拟网络编号。
步骤S402：判断是否所有px值均大于等于1或所有qx值均小于等于1。如果成立，则由于不需要进行调整，调整结束，即执行S407。否则，执行S403。
步骤S403：根据px与qx值获取虚拟网络编号x_min与x_max。
此步骤为的是选择速率满足度最低的虚拟网络x_min与减少一个RB后速率满足度最高的虚拟网络x_max。
步骤S404：如果qx_max>1且px_min<1，则执行S405，否则算法结束，即执行S407。
该步骤确保了调整是将满足需求的虚拟网络的资源提供给不满足需求的虚拟网络。
步骤S405：更新参数。使Nx_min＝Nx_min+1，Nx_max＝Nx_max-1。
Figure PCTCN2017077374-appb-000012
px_max＝qx_max。
步骤S406：重新获取虚拟网络编号x_min与x_max，并返回执行S404。
步骤S407：调整算法结束。
图5中的算法可以完成对虚拟网络占用RB数目的动态调整，旨在将用户速率满足度较好的虚拟网络占用的RB资源转移给性能不佳的虚拟网络，即在保证被转出资源的虚拟网络较好性能的前提下，增加性能较差虚拟网络VNx的RB占用数目，从而达到动态调整且合理分配资源的目的。
图6为本发明实施例的一种资源调度的装置的示意图，如图6所示，本实施例的装置包括：
选择模块61，配置为按照轮询方式选择待分配资源的虚拟网络进行资 源分配，直至所有待分配资源的虚拟网络各自可用的资源块都分配完为止；
分配模块62，配置为进行资源分配,包括：按照指定条件为所选的虚拟网络选择一个资源块进行分配。
其中，所述分配模块62包括：
检测单元621，配置为检测出所选的虚拟网络中
Figure PCTCN2017077374-appb-000013
最大的用户i；
分配单元622，配置为选择所述用户i对应的资源块进行分配，其中，
Ri,n表示所述用户i在编号为n的资源块上的当前速率，Ri,平均表示所述用户i的平均速率。
在一可选实施例中，所述装置还可以包括：
调整模块63，配置为在所述选择模块按照轮询方式选择待分配资源的虚拟网络进行资源分配，直至所有待分配资源的虚拟网络各自可用的资源块都分配完为止的过程中，当资源分配持续时间达到指定时间时，对满足预设条件的虚拟网络所拥有的资源块数进行调整。
其中，所述调整模块63包括：
计算单元631，配置为计算每个虚拟网络的px与qx值，其中，
Figure PCTCN2017077374-appb-000014
Figure PCTCN2017077374-appb-000015
RA,x表示第x个虚拟网络的平均速率，RD,x第x个虚拟网络的需求速率，Nx为第x个虚拟网络所占有的资源块数；
判断单元632，配置为判断是否所有px值均大于等于1，或所有qx值均小于等于1；
调整单元633，配置为在所述判断模块判断为不是的情况下，则进行动态调整，包括以下步骤：获取px值最小的相应虚拟网络的编号x_min，qx值最大的相应虚拟网络的编号x_max，如qx_max>1且px_min<1，则令 Nx_min＝Nx_min+1，Nx_max＝Nx_max-1，
Figure PCTCN2017077374-appb-000016
px_max＝qx_max，然后重新进行所述动态调整。
在实际应用中，所述资源调度的装置中的各个单元所实现的功能，均可由位于资源调度的装置中的中央处理器(Central Processing Unit，简称CPU)、或微处理器(Micro Processor Unit，简称MPU)、或数字信号处理器(Digital Signal Processor，简称DSP)、或现场可编程门阵列(Field Programmable Gate Array，简称FPGA)等实现。
此外，本发明实施例还提供一种电子设备，所述电子设备包括：存储器和处理器，所述存储器上存储有计算机可执行指令，所述处理器通过读取并执行所述计算机可执行指令来实现本发明实施例的资源调度的方法。
本发明实施例上述业务信令跟踪的装置如果以软件功能模块的形式实现并作为独立的产品销售或使用时，也可以存储在一个计算机可读取存储介质中。基于这样的理解，本发明实施例的技术方案本质上或者说对现有技术做出贡献的部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质中，包括若干指令用以使得一台计算机设备(可以是个人计算机、服务器、或者网络设备等)执行本发明各个实施例所述方法的全部或部分。而前述的存储介质包括：U盘、移动硬盘、只读存储器(Read Only Memory，简称ROM)、磁碟或者光盘等各种可以存储程序代码的介质。这样，本发明实施例不限制于任何特定的硬件和软件结合。
相应地，本发明实施例还提供了一种存储介质，其存储有计算机可执行指令，所述计算机可执行指令被执行时实现所述资源调度的方法。
本领域普通技术人员可以理解上述方法中的全部或部分步骤可通过程序来指令相关硬件完成，所述程序可以存储于计算机可读存储介质中，如只读存储器、磁盘或光盘等。可选地，上述实施例的全部或部分步骤也可以使用一个或多个集成电路来实现。相应地，上述实施例中的各模块/单元 可以采用硬件的形式实现，也可以采用软件功能模块的形式实现。本发明不限制于任何特定形式的硬件和软件的结合。
以上仅为本发明的优选实施例，当然，本发明还可有其他多种实施例，在不背离本发明精神及其实质的情况下，熟悉本领域的技术人员当可根据本发明作出各种相应的改变和变形，但这些相应的改变和变形都应属于本发明所附的权利要求的保护范围。
工业实用性
本发明实施例的技术方案，按照轮询方式选择待分配资源的虚拟网络进行资源分配，直至所有待分配资源的虚拟网络各自可用的资源块都分配完为止；所述进行资源分配包括：按照指定条件为所选的虚拟网络选择一个资源块进行分配。如此，可以对虚拟网络进行合理的资源分配，提高资源利用率并满足每个虚拟网络实际需求。

Claims (9)

  1. 一种资源调度的方法，包括：
    按照轮询方式选择待分配资源的虚拟网络进行资源分配，直至所有待分配资源的虚拟网络各自可用的资源块都分配完为止；
    所述进行资源分配包括：按照指定条件为所选的虚拟网络选择一个资源块进行分配。
  2. 如权利要求1所述的方法，其中，所述按照指定条件为所选的虚拟网络选择资源块进行分配，包括：
    检测出所选的虚拟网络中
    Figure PCTCN2017077374-appb-100001
    最大的用户i；
    选择所述用户i对应的资源块进行分配，其中，
    Ri,n表示所述用户i在编号为n的资源块上的当前速率，Ri,平均表示所述用户i的平均速率。
  3. 如权利要求1或2所述的方法，其中，所述按照轮询方式选择待分配资源的虚拟网络进行资源分配，直至所有待分配资源的虚拟网络各自可用的资源块都分配完为止的过程中，包括：
    当资源分配持续时间达到指定时间时，对满足预设条件的虚拟网络所拥有的资源块数进行调整。
  4. 如权利要求3所述的方法，其中，所述对满足预设条件的虚拟网络所拥有的资源块数进行调整，包括：
    计算每个虚拟网络的px与qx值，其中，
    Figure PCTCN2017077374-appb-100002
    RA,x表示第x个虚拟网络的平均速率，RD,x第x个虚拟网络的需求速率，Nx为第x个虚拟网络所占有的资源块数；
    判断是否所有px值均大于等于1，或所有qx值均小于等于1，如不是， 则进行动态调整，包括以下步骤：
    获取px值最小的相应虚拟网络的编号x_min，qx值最大的相应虚拟网络的编号x_max，
    如qx_max>1且px_min<1，则令Nx_min＝Nx_min+1，Nx_max＝Nx_max-1，
    Figure PCTCN2017077374-appb-100003
    px_max＝qx_max，然后重新进行所述动态调整。
  5. 一种资源调度的装置，包括：
    选择模块，配置为按照轮询方式选择待分配资源的虚拟网络进行资源分配，直至所有待分配资源的虚拟网络各自可用的资源块都分配完为止；
    分配模块，配置为进行资源分配包括：按照指定条件为所选的虚拟网络选择一个资源块进行分配。
  6. 如权利要求5所述的装置，其中，所述分配模块包括：
    检测单元，配置为检测出所选的虚拟网络中
    Figure PCTCN2017077374-appb-100004
    最大的用户i；
    分配单元，配置为选择所述用户i对应的资源块进行分配，其中，
    Ri,n表示所述用户i在编号为n的资源块上的当前速率，Ri,平均表示所述用户i的平均速率。
  7. 如权利要求4或5所述的装置，其中，还包括，
    调整模块，配置为在所述选择模块按照轮询方式选择待分配资源的虚拟网络进行资源分配，直至所有待分配资源的虚拟网络各自可用的资源块都分配完为止的过程中，当资源分配持续时间达到指定时间时，对满足预设条件的虚拟网络所拥有的资源块数进行调整。
  8. 如权利要求7所述的装置，其中，所述调整模块包括：
    计算单元，配置为计算每个虚拟网络的px与qx值，其中，
    Figure PCTCN2017077374-appb-100005
    Figure PCTCN2017077374-appb-100006
    RA,x表示第x个虚拟网络的平均速率，RD,x第x个虚拟网络的需求速率，Nx为第x个虚拟网络所占有的资源块数；
    判断单元，配置为判断是否所有px值均大于等于1，或所有qx值均小于等于1；
    调整单元，配置为在所述判断模块判断为不是的情况下，则进行动态调整，包括以下步骤：获取px值最小的相应虚拟网络的编号x_min，qx值最大的相应虚拟网络的编号x_max，如qx_max>1且px_min<1，则令Nx_min＝Nx_min+1，Nx_max＝Nx_max-1，
    Figure PCTCN2017077374-appb-100007
    px_max＝qx_max，然后重新进行所述动态调整。
  9. 一种存储介质，所述存储介质中存储有计算机可执行指令，该计算机可执行指令配置为执行权利要求1-4任一项所述的资源调度的方法。
PCT/CN2017/077374 2016-04-25 2017-03-20 一种资源调度的方法及装置、存储介质 WO2017185908A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201610260818.6 2016-04-25
CN201610260818.6A CN107306203A (zh) 2016-04-25 2016-04-25 一种基于虚拟网络的资源调度的方法及装置

Publications (1)

Publication Number Publication Date
WO2017185908A1 true WO2017185908A1 (zh) 2017-11-02

Family

ID=60150582

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/077374 WO2017185908A1 (zh) 2016-04-25 2017-03-20 一种资源调度的方法及装置、存储介质

Country Status (2)

Country Link
CN (1) CN107306203A (zh)
WO (1) WO2017185908A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109996295A (zh) * 2018-01-02 2019-07-09 中国移动通信有限公司研究院 一种车联网中通信资源分配方法、装置和介质

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109639460B (zh) * 2018-11-19 2021-12-07 中国联合网络通信集团有限公司 Nfv资源管理的方法和装置
CN109523184A (zh) * 2018-11-28 2019-03-26 郑州云海信息技术有限公司 一种资源调度的方法及装置

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101384066A (zh) * 2008-10-31 2009-03-11 华为技术有限公司 资源分配的方法、系统和设备
CN103781081A (zh) * 2014-02-28 2014-05-07 清华大学 基于机会共享的无线虚拟化资源分配方法
CN105007210A (zh) * 2015-08-05 2015-10-28 东南大学 长期演进系统中的网络虚拟化框架和资源块分配方法
US20160113018A1 (en) * 2014-10-20 2016-04-21 Fujitsu Limited Resource management in cloud-based radio access network

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101384066A (zh) * 2008-10-31 2009-03-11 华为技术有限公司 资源分配的方法、系统和设备
CN103781081A (zh) * 2014-02-28 2014-05-07 清华大学 基于机会共享的无线虚拟化资源分配方法
US20160113018A1 (en) * 2014-10-20 2016-04-21 Fujitsu Limited Resource management in cloud-based radio access network
CN105007210A (zh) * 2015-08-05 2015-10-28 东南大学 长期演进系统中的网络虚拟化框架和资源块分配方法

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
ZAKI, YASIR: "LTE mobile network virtualization Exploiting multiplexing and multi-user diversity gain", MOBILE NETWORKS AND APPLICATIONS, vol. 16, no. 4, 31 August 2011 (2011-08-31), pages 424 - 432, XP019923415, DOI: 10.1007/s11036-011-0321-7 LNKA *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109996295A (zh) * 2018-01-02 2019-07-09 中国移动通信有限公司研究院 一种车联网中通信资源分配方法、装置和介质

Also Published As

Publication number Publication date
CN107306203A (zh) 2017-10-31

Similar Documents

Publication Publication Date Title
JP6044813B2 (ja) 通信システム
JP4995808B2 (ja) データネットワークを通して強化されたコンテンツ配信を行うための方法及び装置
KR101225639B1 (ko) 피어 투 피어 네트워크에서 서비스 품질을 제공하기 위한 방법들 및 장치
JP6754734B2 (ja) Ｒａｎスライスにおけるリソース管理装置及びｒａｎスライスにおけるリソース管理方法
KR20120053049A (ko) 네트워크 내에서의 자원들의 할당을 관리하기 위한 방법 및 장치
JP6420361B2 (ja) ネットワークの共有方法、装置、システム及びコンピュータ記憶媒体
CA2864198C (en) Spectrum management system and method
US10448418B2 (en) Decreasing free-riding data traffic in uplink scheduling
WO2014094310A1 (zh) 资源调度的方法和装置
CN109743751B (zh) 无线接入网的资源分配方法及装置
CN107708217B (zh) 一种资源调度方法及基站
KR102615191B1 (ko) 제어 장치, 제어 방법 및 프로그램
WO2017185908A1 (zh) 一种资源调度的方法及装置、存储介质
WO2017176542A1 (en) Optimal dynamic cloud network control
WO2014117347A1 (zh) 一种数据调度方法和设备
CN111757468A (zh) 一种资源分配的方法、装置及存储介质、电子装置
US20160269297A1 (en) Scaling the LTE Control Plane for Future Mobile Access
JP2021501536A (ja) アップリンクデータパケットリソース割り当て方法およびユーザ端末
WO2012174912A1 (zh) 一种干扰协调请求的发送方法和设备
US11146367B2 (en) Method and apparatus for frequency selective scheduling in OFDMA based WLANs
WO2018120985A1 (zh) 一种进行资源分配的方法和设备
JP7100613B2 (ja) 制御装置、制御方法、プログラム及び基地局
KR102434985B1 (ko) Ran 공유 환경상에서의 자원 할당 방법 및 장치
CN108260220B (zh) 一种进行资源分配的方法和设备
JP5141422B2 (ja) 移動体通信無線基地局装置および移動体通信無線基地局装置におけるデータ多重処理方法

Legal Events

Date Code Title Description
NENP Non-entry into the national phase

Ref country code: DE

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

Ref document number: 17788561

Country of ref document: EP

Kind code of ref document: A1

122 Ep: pct application non-entry in european phase

Ref document number: 17788561

Country of ref document: EP

Kind code of ref document: A1