[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

CN112333835B - Carrier resource scheduling method and device - Google Patents

Carrier resource scheduling method and device Download PDF

Info

Publication number
CN112333835B
CN112333835B CN202011367993.8A CN202011367993A CN112333835B CN 112333835 B CN112333835 B CN 112333835B CN 202011367993 A CN202011367993 A CN 202011367993A CN 112333835 B CN112333835 B CN 112333835B
Authority
CN
China
Prior art keywords
service flow
service
resource scheduling
network
carrier resource
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
Application number
CN202011367993.8A
Other languages
Chinese (zh)
Other versions
CN112333835A (en
Inventor
杨艳
苗守野
冯毅
张涛
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China United Network Communications Group Co Ltd
Original Assignee
China United Network Communications Group Co Ltd
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 China United Network Communications Group Co Ltd filed Critical China United Network Communications Group Co Ltd
Priority to CN202011367993.8A priority Critical patent/CN112333835B/en
Publication of CN112333835A publication Critical patent/CN112333835A/en
Application granted granted Critical
Publication of CN112333835B publication Critical patent/CN112333835B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/04Wireless resource allocation
    • H04W72/044Wireless resource allocation based on the type of the allocated resource
    • H04W72/0453Resources in frequency domain, e.g. a carrier in FDMA
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/50Allocation or scheduling criteria for wireless resources
    • H04W72/52Allocation or scheduling criteria for wireless resources based on load
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/50Allocation or scheduling criteria for wireless resources
    • H04W72/54Allocation or scheduling criteria for wireless resources based on quality criteria
    • H04W72/543Allocation or scheduling criteria for wireless resources based on quality criteria based on requested quality, e.g. QoS
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/50Allocation or scheduling criteria for wireless resources
    • H04W72/56Allocation or scheduling criteria for wireless resources based on priority criteria
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Quality & Reliability (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The application provides a carrier resource scheduling method and device, relates to the technical field of communication, and solves the problem that a co-established shared base station cannot synchronously support carrier resources of shared carriers in public network service and private network service of different operators. The method comprises the following steps: acquiring network information of each service flow in at least one service flow and dependent parameters of a target area; performing first judgment on the network information of each service flow to obtain the network type of each service flow; determining a priority parameter of each service flow according to the dependent parameters and the network information; and carrying out carrier resource scheduling on at least one service flow according to the priority parameter and the network type of each service flow.

Description

Carrier resource scheduling method and device
Technical Field
Embodiments of the present application relate to the field of communications technologies, and in particular, to a method and an apparatus for scheduling carrier resources.
Background
The presence of the co-established shared base station reduces the cost of the base station which is required to be input by operators, and also meets the requirements of the operators for deploying public network services. Currently, a base station of a single operator usually carries public network service and private network service, or a plurality of operators commonly build and share the base station to carry public network service.
But the co-established shared base station cannot support the public network service and the private network service of different operators synchronously. The scheduling of carrier resources in public network service and private network service of different operators by shared carriers is further not supported.
Disclosure of Invention
The application provides a carrier resource scheduling method and device, which solve the problem that a co-established shared base station cannot synchronously support carrier resources of shared carriers in public network service and private network service of different operators.
In a first aspect, the present application provides a carrier resource scheduling method, applied to a shared carrier base station, where the shared carrier base station covers a target area, the method includes: network information of each service flow in at least one flow and dependent parameters of a target area are acquired. And then, executing first judgment on the network information of each service flow to obtain the network type of each service flow, and determining the priority parameter of each service flow according to the dependent parameters and the network information. And finally, carrying out carrier resource scheduling on at least one service flow according to the priority parameter and the network type of each service flow.
Wherein the network information of the traffic flow comprises public land mobile network PLMN and data network name DNN. The first judgment is as follows: if the PLMN of the first service flow is determined to correspond to the first operator and DNN of the first service flow is empty, determining that the network type of the first service flow is the public network of the first operator; if the PLMN of the first service flow is determined to correspond to the second operator and the DNN of the first service flow corresponds to the first private network, determining the network type of the first service flow as the first private network of the second operator; the first traffic stream is any traffic stream of the at least one traffic stream.
In the above scheme, the network type and the priority parameter of each service flow are determined according to the network information of the service flow and the dependent parameters of the target cell. And then, carrying out carrier resource scheduling on at least one service flow according to the priority parameter and the network type of each service flow. The scheduling method of the carrier resources in the public network service and the private network service of different operators is provided, the requirement that a plurality of operators simultaneously deploy the public network service and the private network service in the shared carrier base station is met, and the application range of the shared carrier base station is widened.
In a second aspect, the present application provides a carrier resource scheduling device, applied to a shared carrier base station, where the shared carrier base station covers a target area, the carrier resource scheduling device includes:
and the acquisition module is used for acquiring the network information of each service flow in at least one service flow and the dependent parameters of the target area. And the processing module is used for executing first judgment on the network information of each service flow acquired by the acquisition module to acquire the network type of each service flow. And the determining module is used for determining the priority parameter of each service flow according to the acquired dependent parameters and the network information. And the processing module is also used for carrying out carrier resource scheduling on at least one service flow according to the priority parameter and the network type of each service flow.
Wherein the network information of the traffic flow comprises public land mobile network PLMN and data network name DNN. The first judgment is as follows: if the PLMN of the first service flow is determined to correspond to the first operator and DNN of the first service flow is empty, determining that the network type of the first service flow is the public network of the first operator; if the PLMN of the first service flow is determined to correspond to the second operator and the DNN of the first service flow corresponds to the first private network, determining the network type of the first service flow as the first private network of the second operator; the first service is any one of the at least one service flow.
In a third aspect, the present application provides a carrier resource scheduling device applied to a shared carrier base station, including a processor, where the processor executes computer-executable instructions to cause the carrier resource scheduling device to perform a carrier resource scheduling method as described above.
In a fourth aspect, the present application provides a computer readable storage medium comprising instructions which, when run on a computer, cause the computer to perform a carrier resource scheduling method as described above.
In a fifth aspect, the present application provides a computer program product comprising instruction code for performing a carrier resource scheduling method as described above.
It should be appreciated that any of the carrier resource scheduling apparatus, the computer-readable storage medium, or the computer program product provided above is used to perform the method provided above, and thus, the advantages achieved by the method may refer to the advantages of the method provided above and the corresponding solutions in the following detailed description, which are not repeated herein.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are needed in the embodiments or the description of the prior art will be briefly introduced below, it being obvious that the drawings in the following description are only some embodiments of the present application, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a schematic diagram of a carrier resource scheduling system according to an embodiment of the present application;
fig. 2 is a schematic hardware structure of a carrier resource scheduling device according to an embodiment of the present application;
fig. 3 is a flow chart of a carrier resource scheduling method according to an embodiment of the present application;
fig. 4 is a schematic structural diagram of a carrier resource scheduling device according to an embodiment of the present application.
Detailed Description
The following description of the embodiments of the present application will be made clearly and fully with reference to the accompanying drawings, in which it is evident that the embodiments described are only some, but not all, of the embodiments of the present application. All other embodiments, which can be made by one of ordinary skill in the art without undue burden from the present disclosure, are within the scope of the present disclosure.
In the embodiments of the present application, words such as "exemplary" or "such as" are used to mean serving as examples, illustrations, or descriptions. Any embodiment or design described herein as "exemplary" or "for example" should not be construed as preferred or advantageous over other embodiments or designs. Rather, the use of words such as "exemplary" or "such as" is intended to present related concepts in a concrete fashion.
The terms "first" and "second" are used below for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defining "a first" or "a second" may explicitly or implicitly include one or more such feature. In the description of the embodiments of the present application, unless otherwise indicated, the meaning of "a plurality" is two or more.
With the continuous evolution of networks, industry users' network demands have become an important deployment requirement for the fifth generation mobile communication technology (5-generation, 5G). However, the 5G base station generally adopts a multi-array device configuration such as 192 arrays, which results in extremely high manufacturing cost of the 5G base station. In addition, the frequency band adopted by 5G is 3.5GHz, and the coverage range is obviously smaller than the base station of the frequency band below 2GHz, so that the number of stations in unit area is increased by times. Thus, the high base station costs and the dense number of base stations will lead to an exponential increase in operator costs.
The presence of the co-established shared base station reduces the cost of the base station which is required to be input by operators, and also meets the requirements of the operators for deploying public network services. Currently, a base station of a single operator usually carries public network service and private network service, or a plurality of operators commonly build and share the base station to carry public network service. It can be seen that the co-established shared base station is not capable of supporting both public network services and private network services of different operators simultaneously. The scheduling of carrier resources in public network service and private network service of different operators by shared carriers is further not supported.
In order to solve the above problems, the present application provides a shared carrier base station that synchronously supports public network services and private network services of different operators. The shared carrier base station adopts a single carrier mode, firstly, data of different operators are modulated on the same carrier by using a baseband processing unit, and then uplink data and downlink data are respectively combined together by using a radio frequency unit and output to the same antenna unit. The baseband processing unit of the shared carrier base station is connected with different 5G core networks (such as a public network core network and a private network core network of an operator) by adopting a plurality of optical fibers, and is used for interaction between the shared carrier base station and the core network. Therefore, in the shared carrier base station, one carrier can be utilized to carry public network services and private network services of different operators.
The carrier resource scheduling method of the embodiment is applied to the scene of carrier resource scheduling of the service performed by the shared carrier base station. The carrier resource scheduling device acquires network information of each service flow in at least one service flow and dependent parameters of a target area. And then, executing first judgment on the network information of each service flow to obtain the network type of each service flow, and determining the priority parameter of each service flow according to the dependent parameters and the network information. And finally, carrying out carrier resource scheduling on at least one service flow according to the priority parameter and the network type of each service flow. In this way, the method for scheduling carrier resources in the public network service and the private network service of different operators for sharing the carrier is provided, so that the requirement that a plurality of operators simultaneously deploy the public network service and the private network service in the shared carrier base station is met, and the application range of the shared carrier base station is widened.
Next, an implementation environment of the application embodiment will be described.
Fig. 1 is a schematic diagram of a carrier resource scheduling system according to an exemplary embodiment. The carrier resource scheduling method provided by the embodiment of the application can be applied to the carrier resource scheduling system. As shown in fig. 1, the carrier resource scheduling system may include: a service terminal 11 and a shared carrier base station 12. Wherein the service of the service terminal 11 can access the shared carrier base station 12.
The shared carrier base station 12 is mainly used for acquiring network information of each service flow in at least one service flow of the service terminal 11 and dependent parameters of a target area; performing first judgment on the network information of each service flow to obtain the network type of each service flow, and determining the priority parameter of each service flow according to the dependent parameters and the network information; and carrying out carrier resource scheduling on at least one service flow according to the priority parameter and the network type of each service flow. The shared carrier base station 12 is the aforementioned base station that uses one carrier to carry public network traffic and private network traffic of different operators.
The service terminal 11 is mainly used for establishing service connection with the shared carrier base station 12. In some embodiments, the service terminal 11 may be a mobile phone, a tablet computer, a notebook computer, a desktop computer, a portable computer, a core network side device, or the like, which is not limited in this application. In fig. 1, a service terminal 11 is shown as a mobile phone.
In a specific implementation, the carrier resource scheduling apparatus has components as shown in fig. 2. Fig. 2 is a schematic diagram of a carrier resource scheduling device according to an embodiment of the present application, which is applied to the above-mentioned shared carrier base station, where the carrier resource scheduling device may include at least one processor 202, and the processor 202 is configured to execute application program codes, so as to implement a carrier resource scheduling method in the present application.
The processor 202 may be a central processing unit (central processing unit, CPU), microprocessor, application-specific integrated circuit (ASIC), or one or more integrated circuits for controlling the execution of programs in accordance with aspects of the present application.
As shown in fig. 2, the carrier resource scheduling apparatus may further include a memory 203. The memory 203 is used for storing application program codes for executing the scheme of the application, and the processor 202 controls the execution.
The memory 203 may be, but is not limited to, a read-only memory (ROM) or other type of static storage device that can store static information and instructions, a random access memory (random access memory, RAM) or other type of dynamic storage device that can store information and instructions, or an electrically erasable programmable read-only memory (electrically erasable programmable read-only memory, EEPROM), a compact disc read-only memory (compact disc read-only memory) or other optical disc storage, optical disc storage (including compact disc, laser disc, optical disc, digital versatile disc, blu-ray disc, etc.), magnetic disk storage media or other magnetic storage devices, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer. The memory 203 may be stand alone and be coupled to the processor 202 via a bus 204. Memory 203 may also be integrated with processor 202.
As shown in fig. 2, the carrier resource scheduling device may further comprise a communication interface 201, wherein the communication interface 201, the processor 202, the memory 203 may be coupled to each other, for example, by a bus 204. The communication interface 201 is used for information interaction with other devices, for example, supporting information interaction of the carrier resource scheduling apparatus with other devices.
It should be noted that the device structure shown in fig. 2 does not constitute a limitation of the carrier resource scheduling apparatus, and the carrier resource scheduling apparatus may include more or less components than those shown in fig. 2, or may combine some components, or may be a different arrangement of components.
After the application scenario and the implementation environment of the embodiment of the present application are introduced, the carrier resource scheduling method provided by the embodiment of the present application is described below by referring to fig. 3 in conjunction with the carrier resource scheduling device shown in fig. 2.
Fig. 3 is a flow chart of a carrier resource scheduling method according to an embodiment of the present application, where the carrier resource scheduling method is applied to a shared carrier base station, and the shared carrier base station covers a target area. Referring to fig. 3, the carrier resource scheduling method includes the following steps.
301. The carrier resource scheduling device acquires network information of each service flow in at least one service flow and dependent parameters of a target area.
Wherein the dependent parameters include a capacity dependent parameter and a user number dependent parameter.
Specifically, the method for the carrier resource scheduling device to obtain the dependent parameters of the target area includes the following step 301a.
301a, a carrier resource scheduling device firstly acquires a first number and a second number of target areas in a preset time period. Wherein the preset time period comprises at least one hour; the first number is the number of hours, in at least one hour, for which the amount of transmitted data is greater than a first threshold; the second number is the number of hours, of at least one hour, for which the RRC connection number is greater than the second threshold. The preset time period is preset, for example, may be a default value, or may be a numerical value written by a relevant person according to an actual situation. For another example, the preset time period is 1 day of work and one day of non-work in two consecutive weeks.
Specifically, the carrier resource scheduling device collects information such as network type and radio resource control protocol (radio resource control, RRC) connection number of the service accessed to the shared carrier base station service within a preset time period. For example, the carrier resource scheduling device collects the network type of the service, the average capacity of the service, the highest capacity of the service, the average RRC connection number of the service, the maximum RRC connection number of the service, the average number of RRC connections with data transmission of the service, and the maximum number of RRC connections with data transmission of the service corresponding to each hour in 1 day of working day and 1 day of non-working day in busy hour period. As shown in table 1 below:
TABLE 1
Figure BDA0002805164310000071
And then, the carrier resource scheduling device determines the first quantity and the second quantity according to the network type of the service accessed in the shared carrier base station and the RRC connection number of the service. Specifically, if it is determined that the sum of the data volume of the public network service and the data volume of the private network service accessed in the shared carrier base station is greater than a first threshold in the first hour, the carrier resource scheduling device determines that the first hour is the dominant hour of the big data service, and adds one to the first number. And calculating all the acquisition hours by adopting the first number counting method, and accumulating to obtain a first number of numerical values. Wherein the first hour is any one of the collection hours; the first threshold may be a default value, or may be a value written by a related person according to an actual situation, for example, the related person determines the first threshold according to a sum of data volume of public network service and data volume of private network service accessed in the shared carrier base station in a first hour, and a ratio of the data volume to the total service capacity that can be accessed by the shared carrier base station.
If the sum of the average RRC connection number of the public network service accessed in the shared carrier base station and the average RRC connection number of the private network service is determined to be greater than the second threshold in the second hour, or the sum of the average RRC connection number of the public network service accessed in the shared carrier base station and the average RRC connection number of the private network service is determined to be greater than the second threshold, the carrier resource scheduling device determines that the second hour is the hour number of the dominant user, and is one added to the second number. And calculating all the acquisition hours by adopting the second number counting method, and accumulating to obtain the numerical value of the second number. Wherein the second hour is any one of the collection hours; the second threshold may be a default value, or may be a value written by a related person according to an actual situation, for example, the related person determines the second threshold according to a sum of an average RRC connection number of public network services accessed in the shared carrier base station and an average RRC connection number of private network services in a first hour, a ratio of the average RRC connection number of public network services accessed in the shared carrier base station to the total RRC connection number of private network services, or the related person determines the second threshold according to a ratio of the average RRC connection number of public network services accessed in the shared carrier base station to the average RRC connection number of private network services to the total RRC connection number of public network services connectable in the first hour.
Then, the carrier resource scheduling device calculates the user dependent parameter and the dependent parameter of the capacity target area according to the first number and the second number. Specifically, the capacity dependent parameter satisfies the formula
Figure BDA0002805164310000081
User number dependent parameters satisfy->
Figure BDA0002805164310000082
Wherein (1)>
Figure BDA0002805164310000083
Representing a first quantity, +.>
Figure BDA0002805164310000084
Representing a second number, Z T Representing capacity dependent parameters, Z R Indicating user number dependenceParameters.
Then, the carrier resource scheduling device judges whether load balancing is needed when carrier resource scheduling is performed. Specifically, the carrier resource scheduling device determines the total busy hour duration of the target area according to the acquired information such as the network type of the service accessed in the shared carrier base station, the RRC connection number of the service and the like. Specifically, the total busy time duration of the target area satisfies the formula h= Σ di H i Wherein d represents the number of days of collection, H i Indicating the ith acquisition hour.
And then, the carrier resource scheduling device judges whether load balancing is needed when the carrier resource scheduling is carried out according to the total busy hour time length, the first quantity and the second quantity of the target area. Specifically, if it is determined that the ratio of the first number to the total duration of busy hours is smaller than the third threshold value, or the ratio of the second number to the total duration of busy hours is smaller than the fourth threshold value, load balancing is required when scheduling carrier resources. The third threshold may be a default value, or may be a numerical value written by a relevant person according to an actual situation. For example, the third threshold is 0.3. The fourth threshold value may be a default value, or may be a numerical value written by a relevant person according to an actual situation. For example, the fourth threshold is 0.3.
Finally, the carrier resource scheduling device acquires the network information of each service flow after determining that load balancing is required.
The network information of the service flow includes public land mobile network (public land mobile network, PLMN) of the service flow, data network name (data network name, DNN) of the service flow, service quality identifier (5G QoS identifier,5QI) of the service flow, capacity requirement of the service flow, RRC connection number with data transmission of the service flow, arrival time of the service flow and requirement duration of the service flow.
Specifically, the method for the carrier resource scheduling device to obtain the network information of each service flow in at least one service flow includes the following step 301b.
301b, the carrier resource scheduling device determines that the service terminal has a service access requirement, and obtains information such as a system information block (system information block type, SIB 1), a protocol data unit (protocol data unit, PDU) session establishment request (PDU session establishment request), a session management function (session management function, SMF) -unified data management function (unified data management, UDM) registration (SMF-UDM registration) of each service flow in at least one service flow. Then, the carrier resource scheduling device extracts the PLMN of the service flow from SIB1, extracts the DNN of the service flow from PDU session establishment request, and extracts 5QI of the service flow, capacity requirement of the service flow, RRC connection number with data transmission of the service flow, arrival time of the service flow, and required duration of the service flow from SMF-UDM registration. Wherein, 5QI of the traffic flow is a scalar for indexing 5G QoS characteristics, and in this application, the 5QI parameter is a priority level corresponding to the traffic flow in the 5G QoS characteristics. In the TS23.501 Table 5.7.4-1 protocol, there is a standardized 5QI mapping relationship, in the 5G QoS characteristics, the priority level indicates a resource scheduling priority between 5G QoS flows, and the parameter is used to distinguish QoS flows of one service terminal from QoS flows of different terminals, and the smaller the value of the priority level is, the higher the priority is.
302. The carrier resource scheduling device executes first judgment on the network information of each service flow to obtain the network type of each service flow.
Specifically, the first judgment is: if the PLMN of the first service flow is determined to correspond to the first operator and the DNN of the first service flow is empty, determining that the network type of the first service flow is the public network of the first operator. If the PLMN of the first service flow is determined to correspond to the second operator and the DNN of the first service flow corresponds to the first private network, determining that the network type of the first service flow is the first private network of the second operator. Wherein the first traffic flow is any traffic flow in the at least one traffic flow.
303. The carrier resource scheduling device determines the priority parameter of each service flow according to the dependent parameters and the network information.
Specifically, the carrier resource scheduling device executes a first operation on each service flow to obtain a priority parameter of each service flow.
The first operation is that: firstly, the carrier resource scheduling device calculates key parameters of the second service flow according to the capacity requirement of the second service flow, the RRC connection number with data transmission, the capacity dependent parameters and the user number dependent parameters of the target area. Wherein the second traffic flow is any traffic flow of the at least one traffic flow. Specifically, the key parameters of the second traffic flow satisfy the formula
Figure BDA0002805164310000101
Wherein Z is Ti Representing a capacity dependent parameter of the target area, Z Ri User-dependent parameters, K, representing target areas i Representing key parameters of the second traffic flow, T i Representing capacity requirement of the second traffic flow, RRC i RRC connection number indicating second traffic flow, RSC i RRC connection number with data transmission, T, representing second traffic flow 1 ,T 2 ,…,T N Representing capacity requirement of each of at least one traffic flow, RRC 1 ,RRC 2 ,…,RRC N Representing the number of RRC connections per service flow in at least one service flow, RSC 1 ,RSC 2 ,…,RSC N The number of RRC connections with data transmission for each of the at least one traffic flow is indicated, the total number of traffic flows being N.
And then, the carrier resource scheduling device calculates the priority parameter of the second service flow according to the key parameter, the 5QI, the arrival time and the demand time of the second service flow. Wherein the second service flow is any service flow in the service flows. Specifically, the priority parameter of the second service flow satisfies the formula
Figure BDA0002805164310000111
Figure BDA0002805164310000112
Wherein (1)>
Figure BDA0002805164310000113
Representing the priority parameter, K, of the second traffic flow i Key parameter, time, representing the second traffic flow i Representing the arrival time of the second traffic flow, Last i Representing the length of time of demand of the second traffic flow PrL i 5QI, TTI representing second traffic flow pre The TTI represents the duration of one scheduling period, last, representing the difference between the arrival time of the second traffic stream and the time from the previous scheduling instant 1 ,Last 2 ,…,Last N The required time length of each service flow in at least one service flow is represented, and the total number of the service flows is N.
304. And the carrier resource scheduling device performs carrier resource scheduling on at least one service flow according to the priority parameter and the network type of each service flow.
Before carrying out carrier resource scheduling on at least one service flow, the carrier resource scheduling device needs to judge whether the shared carrier base station can access the service flow.
Specifically, when determining that at least one of the following parameters is greater than or equal to a corresponding preset threshold, the carrier resource scheduling device determines that the shared carrier base station cannot access the service flow, and refuses to access the at least one service flow.
The parameters include the total capacity of the accessed service, the number of connected RRC connection, the CPU occupation amount of the central processing unit and the key value. The key value is the sum of key parameters of the accessed traffic flow. The preset threshold corresponding to the parameter may be a default value, or may be a value set by a related person according to the parameter of the shared carrier base station. For example, ninety percent of the total capacity of the shared carrier base station that can access the service is determined as a threshold corresponding to the total capacity of the accessed service; ninety percent of the total number of RRC that can be connected by the shared carrier base station is determined as a threshold corresponding to the number of connected RRC connections; ninety percent of the total capacity of the CPUs of the shared carrier base station is determined as a threshold corresponding to the CPU occupancy.
And when the total capacity of the accessed service, the number of connected RRC connections, the CPU occupation amount and the key value are smaller than the corresponding preset threshold values, the carrier resource scheduling device accesses the service flows, and performs carrier resource scheduling on each service flow according to the priority parameter and the network type of each service flow.
Specifically, the carrier resource scheduling device sorts at least one service flow according to the size of the priority parameter based on the network type, and performs carrier resource scheduling on each service flow according to the sorted service flow sequence. More specifically, the carrier resource scheduling device orders the service flows according to the order from the big to the small by the priority parameter, and preferentially allocates carrier resources for the service flows with the earlier orders. Illustratively, the carrier resource scheduling device orders the traffic flows in at least one traffic flow according to the size of the priority parameter based on the network type of the traffic flow, and the order of the ordered traffic flows is shown in the following table 2:
TABLE 2
Figure BDA0002805164310000121
In the above scheme, the network type and the priority parameter of each service flow are determined according to the network information of at least one service flow and the dependent parameters of the target cell. And then, carrying out carrier resource scheduling on at least one service flow according to the priority parameter and the network type of each service flow. The scheduling method of the carrier resources in the public network service and the private network service of different operators is provided, the requirement that a plurality of operators simultaneously deploy the public network service and the private network service in the shared carrier base station is met, and the application range of the shared carrier base station is widened.
The method according to the embodiment of the present application may divide the functional modules of the carrier resource scheduling device according to the above embodiment of the method, 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 modules may be implemented in hardware or in software functional modules. It should be noted that, in the embodiment of the present application, the division of the modules is schematic, which is merely a logic function division, and other division manners may be implemented in actual implementation.
The method provided in the embodiment of the present application is described in detail above in connection with fig. 3. The carrier resource scheduling device provided in the embodiment of the present application is described in detail below with reference to fig. 4. It should be understood that the descriptions of the apparatus embodiments and the descriptions of the method embodiments correspond to each other, and thus, descriptions of details not described may be referred to the above method embodiments, which are not repeated herein for brevity.
Fig. 4 shows a schematic structure of a carrier resource scheduling apparatus. The carrier resource scheduling device is applied to a shared carrier base station, and the shared carrier base station covers a target area, and the carrier resource scheduling device comprises an acquisition module 41, a processing module 42 and a determining module 43.
An obtaining module 41, configured to obtain network information of each service flow in at least one service flow and a dependent parameter of a target area; the network information of the service flow comprises public land mobile network PLMN and data network name DNN; for example, referring to fig. 3, the acquisition module 41 is configured to perform step 301. A processing module 42, configured to perform a first determination on the network information of each service flow acquired by the acquiring module 41, to obtain a network type of each service flow; the first judgment is as follows: if the PLMN of the first service flow is determined to correspond to the first operator and DNN of the first service flow is empty, determining that the network type of the first service flow is the public network of the first operator; if the PLMN of the first service flow is determined to correspond to the second operator and the DNN of the first service flow corresponds to the first private network, determining the network type of the first service flow as the first private network of the second operator; the first service flow is any service flow in at least one service flow; for example, referring to FIG. 3, the processing module 42 is configured to perform step 302. A determining module 43, configured to determine a priority parameter of each service flow according to the dependent parameter and the network information acquired by the acquiring module 41; for example, referring to fig. 3, the determining module 43 is configured to perform step 303. The processing module 42 is further configured to schedule carrier resources for at least one service flow according to the priority parameter and the network type of each service flow. For example, referring to FIG. 3, the processing module 42 is also configured to perform step 304.
Optionally, the dependent parameters include a capacity dependent parameter and a user number dependent parameter; the network information of the service flow also comprises a service quality identifier (5 QI), capacity requirements, radio resource control protocol (RRC) connection number, RRC connection number with data transmission, arrival time and required duration; the determining module 43 is specifically configured to: executing a first operation on each service flow to obtain a priority parameter of each service flow; the first operation is as follows: calculating key parameters of the second service flow according to the capacity requirement of the second service flow, the RRC connection number with data transmission of the second service flow, the capacity dependent parameters and the user number dependent parameters; calculating a priority parameter of the second service flow according to the key parameter of the second service flow, the 5QI of the second service flow, the arrival time of the second service flow and the demand time of the second service flow; the second traffic stream is any traffic stream of the at least one traffic stream.
Optionally, the dependent parameters include a capacity dependent parameter and a user number dependent parameter; the obtaining module 41 is specifically configured to: acquiring a first number and a second number of target areas in a preset time period; the preset time period includes at least one hour; the first number is the number of hours, in at least one hour, for which the amount of transmitted data is greater than a first threshold; the second number is the number of hours, of at least one hour, for which the RRC connection number is greater than a second threshold; and calculating a capacity-dependent parameter and a user number-dependent parameter according to the first number and the second number.
Optionally, the determining module 43 is further configured to refuse to access at least one service flow when it is determined that at least one of the following parameters is greater than or equal to a corresponding preset threshold; parameters include the total capacity of accessed service, the number of connected RRC connections, CPU occupation amount and key value; the key value is the sum of key parameters of the accessed traffic flow.
Optionally, the processing module 42 is specifically configured to: based on the service flow type, sequencing the service flows in the service flows according to the size of the priority parameter; and carrying out carrier resource scheduling on at least one service flow according to the ordered service flow sequence.
Another embodiment of the present application also provides a computer readable storage medium having instructions stored therein which, when executed on a carrier resource scheduling device, performs steps in a carrier resource scheduling method of the embodiment shown in fig. 3.
In another embodiment of the present application, there is also provided a computer program product comprising computer-executable instructions stored in a computer-readable storage medium; the processor of the carrier resource scheduling apparatus may read the computer-executable instructions from the computer-readable storage medium, the processor executing the computer-executable instructions causing the carrier resource scheduling apparatus to perform the steps in the carrier resource scheduling method of the embodiment as shown in fig. 3.
All relevant contents of each step related to the above method embodiment may be cited to the functional descriptions of the corresponding functional modules, and their effects are not described herein.
It should be understood that, in various embodiments of the present application, the sequence numbers of the foregoing processes do not mean the order of execution, and the order of execution of the processes should be determined by the functions and internal logic thereof, and should not constitute any limitation on the implementation process of the embodiments of the present application.
Those of ordinary skill in the art will appreciate that the various illustrative modules, units, 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 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 application.
It will be clear to those skilled in the art that, for convenience and brevity of description, specific working procedures of the above-described systems, apparatuses and units may refer to corresponding procedures in the foregoing method embodiments, and are not repeated herein.
In the several embodiments provided in this application, it should be understood that the disclosed systems, devices, and methods may be implemented in other ways. For example, the device embodiments described above are merely illustrative, and for example, multiple units or components may be combined or may be integrated into another system, or some features may be omitted, or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be through some interface, indirect coupling or communication connection of devices or units, electrical, mechanical, or other form.
The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed over a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional unit in each embodiment of the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit.
The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer-readable storage medium. Based on such understanding, the technical solution of the present application may be embodied essentially or in a part contributing to the prior art or in a part of the technical solution, in the form of a software product stored in a storage medium, including several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the methods described in the embodiments of the present application. And the aforementioned storage medium includes: a usb disk, a removable hard disk, a read-only memory (ROM), a random access memory (random access memory), a magnetic disk or an optical disk, etc., which can store program codes.
The foregoing is merely specific embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily think about changes or substitutions within the technical scope of the present application, and the changes and substitutions are intended to be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims (8)

1. The carrier resource scheduling method is applied to a shared carrier base station and is characterized in that the shared carrier base station covers a target area; the carrier resource scheduling method comprises the following steps:
acquiring network information of each service flow in at least one service flow and dependent parameters of the target area, wherein the dependent parameters comprise capacity dependent parameters and user dependent parameters; the network information of the service flow comprises public land mobile network PLMN and data network name DNN;
executing first judgment on the network information of each service flow to obtain the network type of each service flow; the first judgment is as follows: if the PLMN of the first service flow is determined to correspond to a first operator and DNN of the first service flow is empty, determining that the network type of the first service flow is a public network of the first operator; if the PLMN of the first service flow is determined to correspond to a second operator and the DNN of the first service flow corresponds to a first private network, determining that the network type of the first service flow is the first private network of the second operator; the first service flow is any service flow in the at least one service flow;
determining a priority parameter of each service flow according to the dependent parameters and the network information;
and carrying out carrier resource scheduling on the at least one service flow according to the priority parameter and the network type of each service flow, wherein the carrier resource scheduling comprises the following steps: sorting the at least one traffic flow according to the size of the priority parameter based on the network type; scheduling carrier resources for the at least one service flow according to the ordered service flow sequence;
the network information of the service flow also comprises a service quality identifier (5 QI), capacity requirements, radio resource control protocol (RRC) connection number, RRC connection number with data transmission, arrival time and required duration; said determining a priority parameter for each traffic flow based on said dependent parameters and said network information, comprising:
executing a first operation on each service flow to obtain a priority parameter of each service flow;
the first operation is: calculating key parameters of a second service flow according to the capacity requirement of the second service flow, the RRC connection number with data transmission of the second service flow, the capacity dependent parameters and the user number dependent parameters; calculating a priority parameter of the second service flow according to the key parameter of the second service flow, the 5QI of the second service flow, the arrival time of the second service flow and the demand time of the second service flow; the second traffic flow is any traffic flow in the at least one traffic flow.
2. The carrier resource scheduling method of claim 1, wherein the dependent parameters include a capacity dependent parameter and a user dependent parameter; the obtaining the dependent parameters of the target area includes:
acquiring a first number and a second number of target areas in a preset time period; the preset time period includes at least one hour; the first number is the number of hours, in the at least one hour, for which the amount of transmission data is greater than a first threshold; the second number is the number of hours of the at least one hour for which the RRC connection number is greater than a second threshold;
and calculating the capacity dependent parameter and the user number dependent parameter according to the first quantity and the second quantity.
3. The carrier resource scheduling method of claim 1, further comprising:
rejecting access to the at least one service flow when it is determined that at least one of the following parameters is greater than or equal to a corresponding preset threshold; the parameters comprise the total capacity of accessed service, the number of connected RRC connection, the CPU occupation amount of a central processing unit and a key value; the key value is the sum of key parameters of the accessed service flow.
4. The carrier resource scheduling device is applied to a shared carrier base station and is characterized in that the shared carrier base station covers a target area; the carrier resource scheduling device comprises:
the acquisition module is used for acquiring network information of each service flow in at least one service flow and dependent parameters of the target area, wherein the dependent parameters comprise capacity dependent parameters and user dependent parameters; the network information of the service flow comprises public land mobile network PLMN and data network name DNN;
the processing module is used for executing first judgment on the network information of each service flow acquired by the acquisition module to acquire the network type of each service flow; the first judgment is as follows: if the PLMN of the first service flow is determined to correspond to a first operator and DNN of the first service flow is empty, determining that the network type of the first service flow is a public network of the first operator; if the PLMN of the first service flow is determined to correspond to a second operator and the DNN of the first service flow corresponds to a first private network, determining that the network type of the first service flow is the first private network of the second operator; the first service flow is any service flow in the at least one service flow;
the determining module is used for determining the priority parameter of each service flow according to the dependent parameters and the network information acquired by the acquiring module;
the processing module is further configured to perform carrier resource scheduling on the at least one service flow according to the priority parameter and the network type of each service flow;
the network information of the service flow also comprises a service quality identifier (5 QI), capacity requirements, radio resource control protocol (RRC) connection number, RRC connection number with data transmission, arrival time and required duration;
the determining module is specifically configured to:
executing a first operation on each service flow to obtain a priority parameter of each service flow;
the first operation is: calculating key parameters of a second service flow according to the capacity requirement of the second service flow, the RRC connection number with data transmission of the second service flow, the capacity dependent parameters and the user number dependent parameters; calculating a priority parameter of the second service flow according to the key parameter of the second service flow, the 5QI of the second service flow, the arrival time of the second service flow and the demand time of the second service flow; the second service flow is any service flow in the at least one service flow;
the processing module is specifically configured to:
sorting the at least one traffic flow according to the size of the priority parameter based on the network type;
and carrying out carrier resource scheduling on the at least one service flow according to the ordered service flow sequence.
5. The carrier resource scheduling apparatus of claim 4, wherein the dependent parameters include a capacity dependent parameter and a user number dependent parameter;
the acquisition module is specifically configured to:
acquiring a first number and a second number of target areas in a preset time period; the preset time period includes at least one hour; the first number is the number of hours, in the at least one hour, for which the amount of transmission data is greater than a first threshold; the second number is the number of hours of the at least one hour for which the RRC connection number is greater than a second threshold;
and calculating the capacity dependent parameter and the user number dependent parameter according to the first quantity and the second quantity.
6. The carrier resource scheduling apparatus of claim 4, wherein,
the determining module is further configured to refuse to access the at least one service flow when it is determined that at least one of the following parameters is greater than or equal to a corresponding preset threshold; the parameters comprise the total capacity of accessed service, the number of connected RRC connection, the CPU occupation amount of a central processing unit and a key value; the key value is the sum of key parameters of the accessed service flow.
7. A carrier resource scheduling apparatus comprising a processor which, when the carrier resource scheduling apparatus is operating, executes computer-executable instructions to cause the carrier resource scheduling apparatus to perform the carrier resource scheduling method of any one of claims 1-3.
8. A computer readable storage medium comprising instructions which, when run on a computer, cause the computer to perform the carrier resource scheduling method of any one of claims 1-3.
CN202011367993.8A 2020-11-27 2020-11-27 Carrier resource scheduling method and device Active CN112333835B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011367993.8A CN112333835B (en) 2020-11-27 2020-11-27 Carrier resource scheduling method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011367993.8A CN112333835B (en) 2020-11-27 2020-11-27 Carrier resource scheduling method and device

Publications (2)

Publication Number Publication Date
CN112333835A CN112333835A (en) 2021-02-05
CN112333835B true CN112333835B (en) 2023-05-16

Family

ID=74308426

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011367993.8A Active CN112333835B (en) 2020-11-27 2020-11-27 Carrier resource scheduling method and device

Country Status (1)

Country Link
CN (1) CN112333835B (en)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113115370B (en) * 2021-03-17 2022-06-07 中国联合网络通信集团有限公司 Resource block configuration method, device and storage medium
CN113453238B (en) * 2021-06-03 2022-08-12 中国联合网络通信集团有限公司 Configuration method and device of 5G private network
CN114513794A (en) * 2021-12-30 2022-05-17 华为技术有限公司 Wireless device, resource management method, and communication system
CN117715053A (en) * 2022-09-05 2024-03-15 中兴通讯股份有限公司 Data processing method, device, network equipment and storage medium

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1816883A1 (en) * 2006-02-03 2007-08-08 Matsushita Electric Industrial Co., Ltd. Uplink resource allocation in a mobile communication system
CN101860963A (en) * 2009-04-09 2010-10-13 大唐移动通信设备有限公司 Method and device for allocating wireless resources
CN102308625A (en) * 2009-02-04 2012-01-04 瑞典爱立信有限公司 Technique for anchor carrier selection in a telecommunication system
WO2015042868A1 (en) * 2013-09-27 2015-04-02 华为技术有限公司 Spectrum resource management method, device and system
CN108702697A (en) * 2016-03-01 2018-10-23 华为技术有限公司 Target cell determining method, base station and management equipment
CN110858958A (en) * 2018-08-23 2020-03-03 华为技术有限公司 Communication method and device of V2X
CN111818588A (en) * 2020-07-30 2020-10-23 中国联合网络通信集团有限公司 User access method and access network equipment

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8937970B2 (en) * 2012-11-14 2015-01-20 Telefonaktiebolaget L M Ericsson (Publ) Resource allocation for minimum satisfaction guarantees in multi-service and multi-antenna networks
EP3972347A1 (en) * 2017-12-08 2022-03-23 Comcast Cable Communications LLC User plane function selection for isolated network slice
US11729782B2 (en) * 2018-06-11 2023-08-15 Apple Inc. Enhanced uplink beam management

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1816883A1 (en) * 2006-02-03 2007-08-08 Matsushita Electric Industrial Co., Ltd. Uplink resource allocation in a mobile communication system
CN102308625A (en) * 2009-02-04 2012-01-04 瑞典爱立信有限公司 Technique for anchor carrier selection in a telecommunication system
CN101860963A (en) * 2009-04-09 2010-10-13 大唐移动通信设备有限公司 Method and device for allocating wireless resources
WO2015042868A1 (en) * 2013-09-27 2015-04-02 华为技术有限公司 Spectrum resource management method, device and system
CN108702697A (en) * 2016-03-01 2018-10-23 华为技术有限公司 Target cell determining method, base station and management equipment
CN110858958A (en) * 2018-08-23 2020-03-03 华为技术有限公司 Communication method and device of V2X
CN111818588A (en) * 2020-07-30 2020-10-23 中国联合网络通信集团有限公司 User access method and access network equipment

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
"Uplink Resource Scheduling Strategy in Wireless Networks";Yuting Wang等;《2020 IEEE 3rd International Conference on Computer and Communication Engineering Technology (CCET)》;全文 *
"载波智能调度系统的研发及应用";黄海晖等;《电信工程技术与标准化》;全文 *
China Mobile, Alibaba, Tencent, China Unicom, Huawei, HiSilicon, ZTE.S2-188028 "Discussion about network resource scheduling for operating slices".3GPP tsg_sa\wg2_arch.2018,(tsgs2_128bis_sophia_antipolis),全文. *

Also Published As

Publication number Publication date
CN112333835A (en) 2021-02-05

Similar Documents

Publication Publication Date Title
CN112333835B (en) Carrier resource scheduling method and device
CN111818588B (en) User access method and access network equipment
CN112469133B (en) Carrier resource scheduling method and device
CN111818585B (en) User access method and access network equipment
EP2519074B1 (en) Method and device for adjusting service processing resources in a multi-mode base station system
CN112333834B (en) Carrier resource scheduling method and device
CN111818581B (en) User access method and access network equipment
CN111818576B (en) User access method and access network equipment
CN111818584B (en) User access method and access network equipment
CN111586797B (en) Communication method and access network equipment
CN113055948B (en) Downlink resource block reservation method and device
CN112469132B (en) Carrier resource scheduling method and device
CN114679793A (en) Slice resource allocation method, device, terminal, network equipment and storage medium
CN110461023B (en) Cell residence method and device for voice service, storage medium and main base station
CN111818586B (en) User access method and access network equipment
CN113115376B (en) Downlink resource block reservation method and device
CN111818583B (en) User access method and access network equipment
CN105764118B (en) MOCN cell communication method and device
CN112996114B (en) Resource scheduling method, device, equipment and storage medium
CN113115373A (en) Co-construction shared resource block configuration method and access network equipment
CN111818578A (en) User access method and access network equipment
CN112616166A (en) Data processing method and device
CN112492670A (en) Energy-saving control method and device
CN111818580B (en) User access method and access network equipment
CN113115375B (en) Downlink resource block reservation method and 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