CN112333826A - Service admission method and device - Google Patents

Service admission method and device Download PDF

Info

Publication number
CN112333826A
CN112333826A CN202011225067.7A CN202011225067A CN112333826A CN 112333826 A CN112333826 A CN 112333826A CN 202011225067 A CN202011225067 A CN 202011225067A CN 112333826 A CN112333826 A CN 112333826A
Authority
CN
China
Prior art keywords
service
resource
target slice
admitted
resources
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.)
Granted
Application number
CN202011225067.7A
Other languages
Chinese (zh)
Other versions
CN112333826B (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 CN202011225067.7A priority Critical patent/CN112333826B/en
Publication of CN112333826A publication Critical patent/CN112333826A/en
Application granted granted Critical
Publication of CN112333826B publication Critical patent/CN112333826B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/52—Allocation or scheduling criteria for wireless resources based on load
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08—Configuration management of networks or network elements
    • H04L41/0893—Assignment of logical groups to network elements

Landscapes

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

Abstract

The embodiment of the invention discloses a service admission method and a device, relating to the field of communication. The problem that the traditional service admission method is not applicable due to the change of a 5G QoS framework and the introduction of a slicing concept can be solved. The method comprises the following steps: determining a first remaining resource amount in the dedicated resources corresponding to the target slice; determining a second remaining resource amount in the common resource corresponding to the target slice; determining whether to bear the service to be admitted through the target slice or not according to the first residual resource amount, the second residual resource amount and the acquired resource requirement of the service to be admitted; wherein the resource requirement of the service to be admitted at least comprises the rate requirement for transmitting the service to be admitted. The embodiment of the invention is applied to a network system.

Description

Service admission method and device
Technical Field
The embodiment of the invention relates to the field of communication, in particular to a service admission method and a service admission device.
Background
When a new service needs to be transmitted, the network side device needs to evaluate whether there is available resource and whether the quality of service (QoS) of the existing service is affected after access. The conventional service admission method determines whether to admit a newly accessed bearer based on the angle between the UE and the cell. However, for the fifth generation mobile communication technology (5G) system, due to the change of the 5G QoS architecture and the introduction of the slicing concept, the conventional service admission method is not applicable.
Disclosure of Invention
The invention provides a service admission method and a device, which can realize service admission under a 5G QoS framework.
Ensuring that the service quality of the existing service is not influenced, and completing the admission of new services.
In order to achieve the purpose, the invention adopts the following technical scheme:
in a first aspect, a method for service admission is provided, where the method includes: firstly, determining a first residual resource amount in the special resources corresponding to the target slice; determining a second remaining resource amount in the common resource corresponding to the target slice; determining whether to bear the service to be admitted through the target slice or not according to the first residual resource amount, the second residual resource amount and the acquired resource requirement of the service to be admitted; wherein the resource requirement of the service to be admitted at least comprises the rate requirement for transmitting the service to be admitted.
Based on the method, considering that a conventional service admission method for determining whether to admit a newly accessed bearer based on the angles of the UE and the cell is not applicable to the 5G QoS architecture, embodiments of the present application provide a service admission method applicable to the 5G QoS architecture, and by monitoring the remaining amount of dedicated resources and the remaining amount of common resources of a target slice and combining with resource requirements of a service to be admitted, comprehensively determine whether the target slice can bear the service to be admitted, thereby implementing service admission under the 5G QoS architecture.
In a second aspect, a service admission apparatus is provided, which includes:
the acquisition unit is used for acquiring the resource requirement of the service to be admitted; wherein the resource requirement of the service to be admitted at least comprises the rate requirement for transmitting the service to be admitted.
A processing unit to determine a first amount of remaining resources in the dedicated resources corresponding to the target slice.
A processing unit further configured to determine a second amount of remaining resources in the common resource corresponding to the target slice.
And the processing unit is further configured to determine whether to bear the service to be admitted through the target slice according to the first remaining resource amount, the second remaining resource amount, and the resource requirement of the service to be admitted, which is acquired by the acquisition unit.
It can be understood that, the service admission apparatus provided above is configured to execute the method corresponding to the first aspect provided above, and therefore, the beneficial effects that can be achieved by the service admission apparatus may refer to the beneficial effects of the method corresponding to the first aspect above and the beneficial effects of the solutions corresponding to the following specific embodiments, which are not described herein again.
In a third aspect, a service admission apparatus is provided, where the structure of the service admission apparatus includes a processor, and the processor is configured to execute program instructions, so that the service admission apparatus executes the method of the first aspect.
In a fourth aspect, a computer-readable storage medium is provided, having computer program code stored therein, which, when run on a service accommodating apparatus, causes the service accommodating apparatus to perform the method of the first aspect described above.
In a fifth aspect, there is provided a computer program product having stored thereon the computer software instructions of the above-mentioned kind, which, when run on a service accommodating device, cause the service accommodating device to execute the procedure of the method of the above-mentioned first aspect.
Drawings
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Fig. 1 is a schematic structural diagram of a service admission system according to an embodiment of the present invention;
fig. 2 is a schematic structural diagram of a communication device according to an embodiment of the present invention;
fig. 3 is a schematic flow chart of a service admission method according to an embodiment of the present invention;
fig. 4 is a schematic diagram of a resource allocation structure according to an embodiment of the present invention;
fig. 5 is a schematic structural diagram of a service admission apparatus according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments.
It should be noted that, in the embodiments of the present invention, words such as "exemplary" or "for example" are used to indicate examples, illustrations or explanations. Any embodiment or design described as "exemplary" or "e.g.," an embodiment of the present invention is not necessarily to be construed as preferred or advantageous over other embodiments or designs. Rather, use of the word "exemplary" or "such as" is intended to present concepts related in a concrete fashion.
It should be noted that, in the embodiments of the present invention, "of", "corresponding" and "corresponding" may be sometimes used in combination, and it should be noted that, when the difference is not emphasized, the intended meaning is consistent.
In the embodiments of the present application, the terms "first", "second" are used 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 defined as "first" or "second" may explicitly or implicitly include one or more of that feature. In the description of the present application, "a plurality" means two or more unless otherwise specified.
In order to more clearly understand the optimization method of the power distribution network provided by the embodiment of the present application, the following briefly describes technical elements related to the embodiment of the present application.
QoS Flow (QoS Flow)
The 5G QoS model is based on QoS flow, the 5G QoS model supports QoS flow of guaranteed flow bit rate and QoS flow of non-guaranteed flow bit rate, and the 5G QoS model also supports reflection QoS.
The QoS flow is the finest QoS differentiation granularity in a Protocol Data Unit (PDU) session, that is, two PDU sessions are different in their QoS flows (specifically, the TFT parameters of the QoS flows are different in general); in a 5G system, a QoS flow ID is used to identify a QoS flow; the user plane data with the same QoS flow ID in the PDU session will get the same forwarding process (e.g. same scheduling, same admission threshold, etc.); the QoS flow Identity (ID) is unique within one PDU session, that is, one PDU session may have multiple QoS flows, but the ID of each QoS flow is different (value range 0-63), and the QoS flow IDs of two PDU sessions of the UE may be duplicated.
Referring to fig. 1, an embodiment of the present application provides a service admission system 10, where the system 10 includes a service admission apparatus 101, a base station 102, and a terminal 103. The service admission apparatus 101 may be a device (such as a server or a cloud device) which is set up separately as shown in fig. 1, or may be an apparatus installed in a base station, and here, no limitation is imposed on the specific form of the service admission apparatus 101.
In addition, the terminal 103 may be a device having a wireless transceiving function. The terminal 103 may be referred to by different names such as access terminal, terminal unit, terminal station, mobile station, remote terminal, mobile device, wireless communication device, terminal agent, or terminal device. The terminal 103 comprises a handheld device, a vehicle mounted device, a wearable device or a computing device with wireless communication functionality. Illustratively, the terminal 103 may be a mobile phone (mobile phone), a tablet computer or a computer with wireless transceiving function. The terminal 103 may also be a Virtual Reality (VR) terminal device, an Augmented Reality (AR) terminal device, a wireless terminal in industrial control, a wireless terminal in unmanned driving, a wireless terminal in telemedicine, a wireless terminal in smart grid, a wireless terminal in smart city (smart city), a wireless terminal in smart home (smart home), and so on. In addition, the terminal 103 may be a communication device having a wired communication function, such as a desktop wired computer. In the embodiment of the present application, the apparatus for implementing the function of the terminal 103 may be a terminal, or may be an apparatus capable of supporting the terminal 103 to implement the function, such as a chip system. In the embodiment of the present application, the chip system may be composed of a chip, and may also include a chip and other discrete devices. In the embodiment of the present application, a device for implementing the function of the terminal 103 is taken as an example, and the technical solution provided in the embodiment of the present application is described.
Base station 102 may include various forms of base stations, such as: macro base stations, micro base stations (also referred to as small stations), relay stations, access points, etc. The method specifically comprises the following steps: the Base Station may be an Access Point (AP) in a Wireless Local Area Network (WLAN), a Base Transceiver Station (BTS) in a Global System for Mobile Communications (GSM) or Code Division Multiple Access (CDMA), a Base Station (NodeB, NB) in a Wideband Code Division Multiple Access (WCDMA), an Evolved Node B (eNB, eNodeB) in LTE, or a relay Station or Access point, or a Base Station in a vehicle-mounted device, a wearable device, and a Next Generation Node B (The Next Generation Node B, gbb) in a 5G Network, or a Base Station in a future-evolution Public Land Mobile Network (PLMN) Network.
The base station 102 generally includes a Base Band Unit (BBU), a Radio Remote Unit (RRU), an antenna, and a feeder for connecting the RRU and the antenna. Wherein, the BBU is used for being responsible for signal modulation. The RRU is responsible for radio frequency processing. The antenna is responsible for the conversion between guided waves on the cable and space waves in the air. On one hand, the length of a feeder line between the RRU and the antenna is greatly shortened by the distributed base station, so that the signal loss can be reduced, and the cost of the feeder line can also be reduced. On the other hand, the RRU and the antenna are smaller, so that the RRU can be installed anywhere, and the network planning is more flexible. Besides RRU remote, BBUs can be centralized and placed in a Central Office (CO), and the centralized mode can greatly reduce the number of base station rooms, reduce the energy consumption of supporting equipment, particularly air conditioners, and reduce a large amount of carbon emission. In addition, after the scattered BBUs are collected and become the BBU baseband pool, unified management and scheduling can be realized, and resource allocation is more flexible. In this mode, all physical base stations evolve into virtual base stations. All virtual base stations share information of data receiving and sending, channel quality and the like of users in a BBU baseband pool, and cooperate with each other to realize joint scheduling.
In some deployments, the base station 102 may include a Centralized Unit (CU) and a Distributed Unit (DU). The base station 102 may also include an Active Antenna Unit (AAU). The CU realizes part of the functions of the base station and the DU realizes part of the functions of the base station. For example, the CU is responsible for processing non-real-time protocols and services, and implementing functions of a Radio Resource Control (RRC) layer and a Packet Data Convergence Protocol (PDCP) layer. The DU is responsible for processing a physical layer protocol and a real-time service, and implements functions of a Radio Link Control (RLC), a Media Access Control (MAC), and a Physical (PHY) layer. The AAU implements part of the physical layer processing functions, radio frequency processing and active antenna related functions. Since the information of the RRC layer eventually becomes or is converted from the information of the PHY layer, the higher layer signaling, such as RRC layer signaling or PDCP layer signaling, can also be considered to be sent by the DU or from the DU + AAU under this architecture. It is understood that in the embodiment of the present application, the access network device may be a device including one or more of a CU node, a DU node, and an AAU node. In addition, a CU may be divided into network devices in the RAN, and may also be divided into network devices in a Core Network (CN), which is not limited herein.
Here, the system architecture and the service scenario described in the embodiment of the present invention are for more clearly illustrating the technical solution of the embodiment of the present application, and do not constitute a limitation to the technical solution provided in the embodiment of the present application, and it can be known by a person skilled in the art that the technical solution provided in the embodiment of the present application is also applicable to similar technical problems along with the evolution of the network architecture and the appearance of a new service scenario.
Alternatively, all the devices or apparatuses mentioned in the embodiments of the present application, such as a service admission apparatus, a terminal or a base station, may be implemented by the communication apparatus 20 shown in fig. 2.
As shown in fig. 2, the apparatus 20 includes at least one processor 201, a communication link 202, a memory 203, and at least one communication interface 204.
The processor 201 may be a general processing unit (CPU), a microprocessor, an application-specific integrated circuit (ASIC), or one or more ics for controlling the execution of programs in accordance with the present invention.
The communication link 202 may include a path for transmitting information between the aforementioned components.
The communication interface 204 may be any device, such as a transceiver, for communicating with other devices or communication networks, such as an ethernet, a Radio Access Network (RAN), a Wireless Local Area Network (WLAN), etc.
The memory 203 may be a read-only memory (ROM) or other type of static storage device that can store static information and instructions, a Random Access Memory (RAM) or other type of dynamic storage device that can store information and instructions, an electrically erasable programmable read-only memory (EEPROM), a compact disc read-only memory (CD-ROM) 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 program code in the form of instructions or data structures and that can be accessed by a computer, but is not limited to these. The memory may be separate and coupled to the processor via communication line 202. The memory may also be integral to the processor.
The memory 203 is used for storing computer execution instructions for executing the scheme of the application, and is controlled by the processor 201 to execute. The processor 201 is configured to execute computer-executable instructions stored in the memory 203, so as to implement the service admission method provided by the following embodiments of the present application.
Optionally, the computer-executable instructions in the embodiments of the present application may also be referred to as application program codes, which are not specifically limited in the embodiments of the present application.
In particular implementations, processor 201 may include one or more CPUs such as CPU0 and CPU1 in fig. 2, for example, as one embodiment.
In particular implementations, apparatus 200 may include multiple processors, such as processor 201 and processor 207 in FIG. 2, for example, as an example. Each of these processors may be a single-core (single-CPU) processor or a multi-core (multi-CPU) processor. A processor herein may refer to one or more devices, circuits, and/or processing cores for processing data (e.g., computer program instructions).
In one implementation, the apparatus 200 may further include an output device 205 and an input device 206, as an example. The output device 205 is in communication with the processor 201 and may display information in a variety of ways. For example, the output device 205 may be a Liquid Crystal Display (LCD), a Light Emitting Diode (LED) display device, a Cathode Ray Tube (CRT) display device, a projector (projector), or the like. The input device 206 is in communication with the processor 201 and may receive user input in a variety of ways. For example, the input device 206 may be a mouse, a keyboard, a touch screen device, or a sensing device, among others.
The service admission method provided in the embodiment of the present application is specifically described below with reference to fig. 1 and fig. 2. The problem that the traditional service admission method for judging whether a newly accessed bearer can be admitted or not based on the angles of the UE and the cell is not suitable for a 5G QoS framework is solved.
Optionally, names of the messages or names of the parameters in the messages in the following embodiments of the present application are only examples, and other names may also be used in specific implementations, and this is not specifically limited in the embodiments of the present application.
The principle of the method in the embodiment of the application is as follows: aiming at a 5G QoS framework, when a new service needs to be transmitted, the method comprises the steps of firstly calculating the surplus of a special resource and the surplus of a public resource of a target slice, and then comprehensively evaluating whether the target slice can bear the service to be admitted or not through the acquired resource requirement of the service to be admitted and the surplus of the service to be admitted.
As shown in fig. 3, an embodiment of the present invention provides a service admission method, where the method includes:
s301, acquiring the resource requirement of the service to be admitted.
Wherein the resource requirement of the service to be admitted at least comprises the rate requirement for transmitting the service to be admitted.
S302, determining a first residual resource amount in the special resources corresponding to the target slice.
Optionally, the number of resources used in the dedicated resources of the target slice is determined according to the priority of the target slice, the number of resource blocks RB of the QoS Flow allocated to the target slice, the actual rate of the QoS Flow allocated to the target slice, and the minimum rate of the QoS Flow allocated to the target slice. And determining a first residual resource amount according to the number of utilized resources in the special resources of the target slice.
Specifically, the number of resources already utilized in the dedicated resources of the target slice is calculated according to the following formula 1:
Figure BDA0002763387390000081
wherein R isoccupy_slice_nIndicates the number of resources utilized in the dedicated resources of the target slice n,
Figure BDA0002763387390000082
represents the lowest Qos Flow to which the target slice n has been assignedThe sum of the rates, N is more than or equal to 1; numRBThe number of resource Blocks (BR) of the allocated Qos Flow representing the target slice n; ratetotalRepresents the sum of the actual rates of all Qos flows in the dedicated resource of the target slice n; cslice_nThe constant is determined according to the priority of the target slice.
In addition, the first remaining resource amount is determined based on a difference between the total number of resources of the dedicated resources of the target slice and the number of resources already used in the dedicated resources of the target slice.
And S303, determining a second residual resource amount in the public resources corresponding to the target slice.
Optionally, determining the size of the common resource corresponding to the target slice according to the proportion of the utilized resource in the dedicated resource of the target slice and the proportion of the utilized resource in the dedicated resources of all slices; and determining a second remaining resource amount according to the size of the common resource corresponding to the target slice. Wherein all slices include the target slice and other slices that may share common resources with the target slice.
Specifically, the proportion of the utilized resources in the dedicated resources of the target slice is determined by calculation according to the following formula 2:
Figure BDA0002763387390000091
wherein, Pslice_nRepresenting the occupation ratio of the utilized resources in the special resources of the target slice n; roccupy_slice_nIndicating the number of resources used in the dedicated resources of the target slice n; roccupy_stastic_nThe amount of resources actually allocated among the dedicated resources of the target slice n; cSLAExpressed as a constant, specifically, the service-level agreement (SLA) completion amount of the target slice n.
It should be noted that each network slice has its service level agreement SLA specifying the level of quality of service it should provide to the user. The metrics of different slices may be different, so the SLA metrics of different QoS of different slices need to be split and the SLA needs to be abstracted into calculation metrics that the wireless side can use for admission.
And calculating and determining the size of the common resource corresponding to the target slice according to the following formula 3:
Figure BDA0002763387390000092
wherein R isslice_dynamicRepresenting a common resource corresponding to the target slice n; roccupy_slice_nIndicating the number of resources used in the dedicated resources of the target slice n;
Figure BDA0002763387390000093
representing the sum of the proportions of the utilized resources in the dedicated resources of all slices.
S304, determining whether to bear the service to be admitted through the target slice or not according to the first residual resource amount, the second residual resource amount and the resource requirement of the service to be admitted.
Specifically, firstly, according to the resource requirement of the service to be admitted, the resource amount corresponding to the service to be admitted is determined.
Specifically, the resource amount corresponding to the service to be admitted is determined according to formula 4:
Figure BDA0002763387390000094
wherein R isnewRepresenting the resource quantity corresponding to the service to be admitted; numRBThe number of BRs representing the allocated Qos Flow of the target slice n; ratetotalRepresents the sum of the actual rates of all Qos flows in the dedicated resource of the target slice n; ratenewIndicating the lowest rate corresponding to the service to be admitted.
Display device
In one implementation, if the first remaining resource amount is greater than a resource amount corresponding to the service to be admitted, the service to be admitted is loaded in a dedicated resource corresponding to the target slice.
In another implementation manner, if the first remaining resource amount is less than the resource amount corresponding to the service to be admitted, and the sum of the first remaining resource amount and the second remaining resource amount is greater than the resource amount corresponding to the service to be admitted, the service to be admitted is admitted in the common resource corresponding to the target slice.
It should be noted that whether QoS Flow is newly added in the target slice is mainly determined according to the following three conditions:
(1) the number of QoS flows or the number of UEs of the target slice does not exceed the set upper limit of the target slice.
(2) The target slice is determined according to the priority ranking of all slices.
(3) The bit rate corresponding to the QoS Flow of the target slice is less than the configured maximum bit rate.
In addition, as is known by standards within the industry, different slices share different radio resources. The whole frequency domain resource is divided into two parts of dedicated resource and public resource as shown in fig. 4, the dedicated resource part is non-preemptible resource and comprises M slice dedicated resources (M is more than or equal to 1); the public resource is shared resource among slices, and can dynamically occupy resource under the condition of considering multiple slices according to slice priority and load balance. When the special resources in the slices are congested, the current load and priority of each slice are considered in a balanced manner, and the resources which can be served for the current slice in the public resource area are adjusted.
In summary, based on the above method, considering that a conventional service admission method for determining whether a newly accessed bearer can be admitted based on the angles of the UE and the cell is not applicable to the 5G QoS architecture, embodiments of the present application provide a service admission method applicable to the 5G QoS architecture, where whether a target slice can bear a service to be admitted is comprehensively determined by monitoring the remaining amount of dedicated resources and the remaining amount of common resources of the target slice in combination with resource requirements of the service to be admitted, so as to implement service admission in the 5G QoS architecture.
The embodiment of the present invention may perform the division of the function modules on the service receiving apparatus 101 according to the method embodiment, for example, each function module may be divided corresponding to each function, or two or more functions may be integrated into one processing module. The integrated module can be realized in a hardware mode, and can also be realized in a software functional module mode. It should be noted that, the division of the modules in the embodiment of the present invention is schematic, and is only a logic function division, and there may be another division manner in actual implementation.
As shown in fig. 5, which is a schematic structural diagram of a service admission device 101 according to an embodiment of the present invention, the service admission device 101 specifically includes an obtaining unit 501 and a processing unit 502.
An obtaining unit 501, configured to obtain a resource requirement of a service to be admitted; wherein the resource requirement of the service to be admitted at least comprises the rate requirement for transmitting the service to be admitted. For example, the acquiring unit 501 may be used to implement step S301 shown in fig. 3.
A processing unit 502 for determining a first remaining amount of resources in the dedicated resources corresponding to the target slice. For example, the processing unit 502 may be used to implement step S302 shown in fig. 3.
The processing unit 502 is further configured to determine a second remaining amount of resources in the common resource corresponding to the target slice. For example, the processing unit 502 may be used to implement step S303 as shown in fig. 3.
The processing unit 502 is further configured to determine whether to bear the service to be admitted through the target slice according to the first remaining resource amount, the second remaining resource amount, and the resource requirement of the service to be admitted, which is acquired by the acquiring unit 501. For example, the processing unit 502 may be used to implement step S304 as shown in fig. 3.
In an implementation scheme, the processing unit 502 is specifically configured to determine the number of resources that have been utilized in the dedicated resources of the target slice according to the priority of the target slice, the number of resource blocks RB of the QoS Flow that has been allocated by the target slice, the actual rate of the QoS Flow that has been allocated by the target slice, and the minimum rate of the QoS Flow that has been allocated by the target slice.
The processing unit 502 is further configured to determine a first remaining resource amount according to the number of utilized resources in the dedicated resources of the target slice.
In an implementation scheme, the processing unit 502 is specifically configured to determine the size of the common resource corresponding to the target slice according to the occupied ratio of the utilized resources in the dedicated resources of the target slice and the occupied ratios of the utilized resources in the dedicated resources of all slices; wherein all slices include the target slice and other slices that may share common resources with the target slice.
The processing unit 502 is further configured to determine a second remaining resource amount according to a size of the common resource corresponding to the target slice.
In an implementation scheme, the processing unit 502 is further configured to determine, according to a resource requirement of the service to be admitted, a resource amount corresponding to the service to be admitted.
The processing unit 502 is further configured to, if the first remaining resource amount is greater than the resource amount corresponding to the service to be admitted, bear the service to be admitted in the dedicated resource corresponding to the target slice.
The processing unit 502 is further configured to, if the first remaining resource amount is less than the resource amount corresponding to the service to be admitted, and the sum of the first remaining resource amount and the second remaining resource amount is greater than the resource amount corresponding to the service to be admitted, bear the service to be admitted in the common resource corresponding to the target slice.
Of course, the service admission apparatus 101 provided in the embodiment of the present invention includes, but is not limited to, the above modules, for example, the service admission apparatus 101 may further include a sending unit 503 and a storage unit 504. The sending unit 503 may be configured to perform sending the data in the service admission apparatus 101 to other devices or apparatuses. The storage unit 504 may be configured to store program codes of the service accommodating apparatus 101, and may also be configured to store data generated by the service accommodating apparatus 101 during operation, such as data in a write request.
The above description is only an embodiment of the present invention, but the scope of the present invention is not limited thereto, and any changes or substitutions within the technical scope of the present invention are intended to be covered by the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the appended claims.

Claims (11)

1. A method for service admission, comprising:
acquiring the resource requirement of a service to be admitted; wherein the resource requirements of the service to be admitted at least comprise the rate requirement for transmitting the service to be admitted;
determining a first remaining resource amount in the dedicated resources corresponding to the target slice;
determining a second amount of remaining resources in a common resource corresponding to the target slice;
and determining whether to bear the service to be admitted through the target slice or not according to the first residual resource amount, the second residual resource amount and the resource requirement of the service to be admitted.
2. The method of claim 1, wherein determining the first amount of remaining resources in the dedicated resources corresponding to the target slice comprises:
determining the number of resources used in the dedicated resources of the target slice according to the priority of the target slice, the number of Resource Blocks (RB) of a quality of service (QoS) Flow allocated to the target slice, the actual rate of the QoS Flow allocated to the target slice and the minimum rate of the QoS Flow allocated to the target slice;
and determining the first residual resource amount according to the number of utilized resources in the special resources of the target slice.
3. The method of claim 2, wherein the determining a second amount of remaining resources in the common resources corresponding to the target slice comprises:
determining the size of the public resource corresponding to the target slice according to the occupied ratio of the utilized resource in the special resource of the target slice and the occupied ratios of the utilized resource in the special resources of all slices; wherein the all slices include the target slice and other slices that may share common resources with the target slice;
and determining the second residual resource amount according to the size of the public resource corresponding to the target slice.
4. The method according to claim 1, wherein the determining whether to carry the service to be admitted through the target slice according to the first remaining resource amount, the second remaining resource amount, and the resource requirement of the service to be admitted comprises:
determining the resource quantity corresponding to the service to be admitted according to the resource requirement of the service to be admitted;
if the first remaining resource amount is larger than the corresponding resource amount for bearing the service to be admitted, bearing the service to be admitted in the special resource corresponding to the target slice;
and if the first remaining resource amount is less than the resource amount corresponding to the service to be admitted, and the sum of the first remaining resource amount and the second remaining resource amount is greater than the resource amount corresponding to the service to be admitted, carrying the service to be admitted in the common resource corresponding to the target slice.
5. A service admission apparatus, comprising:
the acquisition unit is used for acquiring the resource requirement of the service to be admitted; wherein the resource requirements of the service to be admitted at least comprise the rate requirement for transmitting the service to be admitted;
a processing unit for determining a first remaining resource amount in dedicated resources corresponding to a target slice;
the processing unit is further configured to determine a second remaining resource amount in the common resource corresponding to the target slice;
the processing unit is further configured to determine whether to bear the service to be admitted through the target slice according to the first remaining resource amount, the second remaining resource amount, and the resource requirement of the service to be admitted, which is acquired by the acquiring unit.
6. Service admission device according to claim 5, characterized in that it comprises:
the processing unit is specifically configured to determine, according to the priority of the target slice, the number of resource blocks RB of the QoS Flow allocated to the target slice, the actual rate of the QoS Flow allocated to the target slice, and the minimum rate of the QoS Flow allocated to the target slice, the number of resources already used in the dedicated resources of the target slice;
the processing unit is further configured to determine the first remaining resource amount according to the number of resources already utilized in the dedicated resources of the target slice.
7. The service admission device of claim 6, comprising:
the processing unit is specifically configured to determine the size of a common resource corresponding to the target slice according to the occupied ratio of the utilized resource in the dedicated resources of the target slice and the occupied ratios of the utilized resources in the dedicated resources of all slices; wherein the all slices include the target slice and other slices that may share common resources with the target slice;
the processing unit is further configured to determine the second remaining resource amount according to a size of a common resource corresponding to the target slice.
8. Service admission device according to claim 5, characterized in that it comprises:
the processing unit is further configured to determine, according to a resource requirement of a service to be admitted, a resource amount corresponding to the service to be admitted;
the processing unit is further configured to, if the first remaining resource amount is greater than the resource amount corresponding to the service to be admitted, bear the service to be admitted in the dedicated resource corresponding to the target slice;
the processing unit is further configured to, if the first remaining resource amount is smaller than the resource amount corresponding to the service to be admitted, and the sum of the first remaining resource amount and the second remaining resource amount is greater than the resource amount corresponding to the service to be admitted, bear the service to be admitted in the common resource corresponding to the target slice.
9. A service admission device configured to include a processor for executing program instructions to cause the service admission device to perform the service admission method according to any one of claims 1-4.
10. A computer-readable storage medium, having stored thereon computer program code which, when run on a service admitting apparatus, causes the service admitting apparatus to execute the service admitting method according to any one of claims 1-4.
11. A computer program product having stored computer software instructions for causing a service hosting device to perform the service hosting method according to any one of claims 1-4 when the computer software instructions are run on the service hosting device.
CN202011225067.7A 2020-11-05 2020-11-05 Service admission method and device Active CN112333826B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011225067.7A CN112333826B (en) 2020-11-05 2020-11-05 Service admission method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011225067.7A CN112333826B (en) 2020-11-05 2020-11-05 Service admission method and device

Publications (2)

Publication Number Publication Date
CN112333826A true CN112333826A (en) 2021-02-05
CN112333826B CN112333826B (en) 2023-08-11

Family

ID=74316774

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011225067.7A Active CN112333826B (en) 2020-11-05 2020-11-05 Service admission method and device

Country Status (1)

Country Link
CN (1) CN112333826B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113115374A (en) * 2021-03-17 2021-07-13 中国联合网络通信集团有限公司 Co-construction shared resource block configuration method and access network equipment
CN113115370A (en) * 2021-03-17 2021-07-13 中国联合网络通信集团有限公司 Resource block configuration method, device and storage medium

Citations (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101557605A (en) * 2008-04-11 2009-10-14 大唐移动通信设备有限公司 Method for realizing admission control and device thereof
CN103857050A (en) * 2012-12-07 2014-06-11 普天信息技术研究院有限公司 Method for scheduling resources in TD-LTE trunking communication system
WO2015157200A1 (en) * 2014-04-06 2015-10-15 Hughes Network Systems, Llc Apparatus and method for an adaptive periodic bandwidth allocation approach in a shared bandwidth communications system
US9338811B2 (en) * 2009-03-06 2016-05-10 Apple Inc. Methods and apparatus for providing selective access to wireless network resources using detailed information
US9699069B1 (en) * 2011-08-22 2017-07-04 Star2Star Communications, LLC Systems and methods for optimizing application data delivery over third party networks
CN107734703A (en) * 2016-08-11 2018-02-23 华为技术有限公司 A kind of resource regulating method and device
CN109247076A (en) * 2016-08-12 2019-01-18 华为技术有限公司 Selection method, radio reception device and the terminal of network slice
CN109756949A (en) * 2017-08-22 2019-05-14 大唐移动通信设备有限公司 A kind of resource allocation methods and device
WO2019170039A1 (en) * 2018-03-06 2019-09-12 华为技术有限公司 Communication method and communication device
CN110383885A (en) * 2017-01-11 2019-10-25 瑞典爱立信有限公司 5G QoS flow remaps to radio bearer
CN110650454A (en) * 2018-06-27 2020-01-03 华为技术有限公司 V2X communication method, device and system
CN110769469A (en) * 2019-10-08 2020-02-07 中国联合网络通信集团有限公司 Resource allocation method and base station
CN111818588A (en) * 2020-07-30 2020-10-23 中国联合网络通信集团有限公司 User access method and access network equipment

Patent Citations (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101557605A (en) * 2008-04-11 2009-10-14 大唐移动通信设备有限公司 Method for realizing admission control and device thereof
US9338811B2 (en) * 2009-03-06 2016-05-10 Apple Inc. Methods and apparatus for providing selective access to wireless network resources using detailed information
US9699069B1 (en) * 2011-08-22 2017-07-04 Star2Star Communications, LLC Systems and methods for optimizing application data delivery over third party networks
CN103857050A (en) * 2012-12-07 2014-06-11 普天信息技术研究院有限公司 Method for scheduling resources in TD-LTE trunking communication system
WO2015157200A1 (en) * 2014-04-06 2015-10-15 Hughes Network Systems, Llc Apparatus and method for an adaptive periodic bandwidth allocation approach in a shared bandwidth communications system
CN107734703A (en) * 2016-08-11 2018-02-23 华为技术有限公司 A kind of resource regulating method and device
CN109247076A (en) * 2016-08-12 2019-01-18 华为技术有限公司 Selection method, radio reception device and the terminal of network slice
CN110383885A (en) * 2017-01-11 2019-10-25 瑞典爱立信有限公司 5G QoS flow remaps to radio bearer
CN109756949A (en) * 2017-08-22 2019-05-14 大唐移动通信设备有限公司 A kind of resource allocation methods and device
WO2019170039A1 (en) * 2018-03-06 2019-09-12 华为技术有限公司 Communication method and communication device
CN110650454A (en) * 2018-06-27 2020-01-03 华为技术有限公司 V2X communication method, device and system
CN110769469A (en) * 2019-10-08 2020-02-07 中国联合网络通信集团有限公司 Resource allocation method and base station
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
CRISTINA MARQUEZ等: ""Resource Sharing Efficiency in Network Slicing"", 《IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT ( VOLUME: 16, ISSUE: 3, SEPTEMBER 2019)》 *
O. SALLENT等: ""On the configuration of radio resource management in a sliced RAN"", 《NOMS 2018 - 2018 IEEE/IFIP NETWORK OPERATIONS AND MANAGEMENT SYMPOSIUM》 *
杨红梅等: ""5G网络切片应用及安全研究"", 《信息通信技术与政策》 *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113115374A (en) * 2021-03-17 2021-07-13 中国联合网络通信集团有限公司 Co-construction shared resource block configuration method and access network equipment
CN113115370A (en) * 2021-03-17 2021-07-13 中国联合网络通信集团有限公司 Resource block configuration method, device and storage medium
CN113115370B (en) * 2021-03-17 2022-06-07 中国联合网络通信集团有限公司 Resource block configuration method, device and storage medium

Also Published As

Publication number Publication date
CN112333826B (en) 2023-08-11

Similar Documents

Publication Publication Date Title
CN110278563B (en) Method and device for determining frequency spectrum resources
US20210314808A1 (en) BSR Reporting Method and Apparatus
CN112911691B (en) Cell energy saving method, equipment and storage medium
CN111586797B (en) Communication method and access network equipment
EP3001746A1 (en) Embms management method, multimedia broadcast multicast service coordination entity and base station
JP2022531268A (en) Pending SR Cancellation method and device
CN112333826B (en) Service admission method and device
CN112399484A (en) Data transmission method, device, storage medium and electronic equipment
US20230376358A1 (en) Method and apparatus for managing load of network node
CN110139370B (en) Information indication method, communication device and communication system
US10104573B2 (en) Wireless network throughput estimation
EP3739981A1 (en) Method and apparatus for transmitting paging message
CN111565437B (en) Communication method and access network equipment
US20230350724A1 (en) Node determination method for distributed task and communication device
CN114503467B (en) Data transmission method and device
WO2023029757A1 (en) Resource estimation method and related device
US20230074305A1 (en) Resource determining method, apparatus, and system
CN111565438B (en) Communication method and access network equipment
CN111565434B (en) Communication method and access network equipment
WO2019214593A1 (en) Communication method and apparatus
US20220225345A1 (en) Method, network device and network node for scheduling terminal devices
CN111885636B (en) Drive test method and device
WO2019192465A1 (en) Method and device for requesting for and scheduling relay resource
CN113938902A (en) Cell selection method and device
CN108370558A (en) Information source determines method, resource allocation methods 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