CN111741536B - Dynamic network slicing method and system for 5G network - Google Patents
Dynamic network slicing method and system for 5G network Download PDFInfo
- Publication number
- CN111741536B CN111741536B CN202010846225.4A CN202010846225A CN111741536B CN 111741536 B CN111741536 B CN 111741536B CN 202010846225 A CN202010846225 A CN 202010846225A CN 111741536 B CN111741536 B CN 111741536B
- Authority
- CN
- China
- Prior art keywords
- scheduling
- network
- priority
- network slice
- slice
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
- H04W72/566—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient
- H04W72/569—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient of the traffic information
-
- 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/56—Allocation or scheduling criteria for wireless resources based on priority criteria
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W76/00—Connection management
- H04W76/10—Connection setup
- H04W76/11—Allocation or use of connection identifiers
Abstract
The invention provides a dynamic network slicing method and a system for a 5G network, wherein the dynamic network slicing method comprises the following steps: step S1, creating a network slice; step S2, realizing scheduling according to the logical channel priority MLCP, judging whether spare resources exist, if yes, jumping to step S3, and if not, jumping to step S4; step S3, judging whether all the bearers are scheduled, if not, returning to the step S2, and if so, jumping to the step S4'; step S4, judging whether the minimum guaranteed rate GBR is satisfied, if yes, adjusting the scheduling priority, otherwise, ending the scheduling; step S4', determine whether the minimum guaranteed rate GBR is satisfied, if yes, adjust its scheduling priority, and return to query whether there is remaining logical channel priority MLCP not scheduled. The invention realizes the scheduling resource sharing among the network slices in a logic channel priority mode, and effectively avoids the problems of wireless resource waste and the like.
Description
Technical Field
The present invention relates to a network slicing method, and more particularly, to a dynamic network slicing method for a 5G network, and further to a dynamic network slicing system using the dynamic network slicing method for the 5G network.
Background
The network slice is introduced by standard organization as a key technology of 5G to meet the application scene requirements of diversified industries, a customized network can be provided for an operator through the network slice, and the requirements of differentiation of users in the aspects of priority, charging, policy control, safety, mobility, time delay, reliability, speed and other performances are met.
Three typical scenarios for 5G networks include: the system comprises a mobile broadband, a large-scale Internet of things and low-delay and high-reliability communication. The requirements of three application scenarios on network services are different: the first is a mobile broadband, which is oriented to applications such as 4K/8K ultra-high-definition video, holographic technology, augmented reality/virtual reality and the like, and has higher requirements on network bandwidth and rate. Secondly, the mass sensors of the internet of things are deployed in the fields of measurement, construction, agriculture, logistics, smart cities, families and the like, and the sensors are very dense and large in scale, most of the sensors are static, and the requirements on time delay and mobility are not high. And thirdly, the communication with low time delay and high reliability is mainly applied to the fields of unmanned driving, Internet of vehicles, automatic factories, telemedicine and the like, and the ultra-low time delay and the high reliability are required.
Therefore, how to guarantee the quality of service between different slices in the 5G network and maximize network resources is one of the key points of current business research.
Disclosure of Invention
The technical problem to be solved by the present invention is to provide a dynamic network slicing method for 5G network, which can realize scheduling resource sharing among network slices and avoid wireless resource waste, and further provide a dynamic network slicing system using the dynamic network slicing method for 5G network.
In view of the above, the present invention provides a dynamic network slicing method for a 5G network, comprising the steps of:
step S1, creating a network slice, and initializing the created network slice;
step S2, scheduling is realized according to the logical channel priority MLCP, whether vacant resources can be scheduled or not is judged, if yes, the step S3 is skipped, and if not, the step S4 is skipped;
step S3, judging whether all the bearers are scheduled, if not, returning to the step S2, and if so, jumping to the step S4';
step S4, judging whether the scheduling rate of the network slice meets the requirement of the minimum guaranteed rate GBR, if so, adjusting the scheduling priority of the network slice, reducing the scheduling priority to the tail of the queue, otherwise, ending the scheduling;
step S4', judging whether the scheduling rate of the network slice meets the requirement of the minimum guaranteed rate GBR, if so, adjusting the scheduling priority of the network slice, reducing the scheduling priority to the tail of the queue, and then jumping to step S5, otherwise, directly jumping to step S5;
and step S5, returning to inquire whether the remaining logical channel priority MLCPs are not scheduled, if so, returning to step S2, and if not, ending the scheduling.
A further refinement of the invention is that said step S1 comprises the following sub-steps:
step S101, creating a network slice;
step S102, determining the proportion of static wireless resources according to the attribute of the network slice;
step S103, setting slice priority according to the attribute of the network slice;
and step S104, weighting the logical channel priority MLCP according to the slice priority.
The further improvement of the present invention is that in step S101, when a cell is created, a network slice creation procedure of a radio access network RAN is initiated, and after network authentication is performed, a bound single network slice selection auxiliary information identification set NASSI is acquired.
The further improvement of the present invention lies in that, in step S102, the static radio resource ratio is determined according to the static reserved radio resource ratio contained in the QoS parameter preconfigured by the network slice; in step S103, the network slice is mapped to the slice priority by the attribute of the network slice, or the slice priority is differentiated according to the application when creating the network slice.
In the step S2, in the process of implementing scheduling according to the logical channel priority MLCP, the scheduler performs high-to-low sequencing and scheduling according to the logical channel priority MLCP priority order, and performs scheduling according to any one of a slice round robin scheduling algorithm (RR), a maximum carrier-to-interference ratio scheduling algorithm (MAX CI), and a proportional fair scheduling algorithm (PFS) for a plurality of bearers in each logical channel priority MLCP, and performs QoS constraint on the scheduling of each bearer according to the QoS parameter.
The invention is further improved in that when the proportional fair scheduling algorithm PFS is adopted to realize the scheduling, the formula is adopted
Defining the scheduling priority
Wherein, in the step (A),
is the instantaneous rate under the current channel conditions,
for logical channelsjIn a time slotn-1 smoothing the processed historical flow,jis a logical channel number that is a logical channel number,nthe time slots are numbered.
The invention is further improved by the formula
Calculating the smoothed historical flow
Wherein, in the step (A),
is a smoothing coefficient of historical flow
The value range of (1) is 0-1;
for logical channelsjIn a time slotn-an instantaneous rate at 2,
for logical channelsjIn a time slotnInstantaneous rate at 1.
The invention is further improved by the formula
Calculating instantaneous rate under current channel conditions
Wherein B is the total bandwidth,Nthe number of carriers and the SINR is the signal-to-noise ratio.
The invention is further improved in that in the process of realizing scheduling, the scheduling flow of the network slice is limited not to exceed the speed-limiting requirement of the maximum guaranteed rate MBR.
The invention also provides a dynamic network slicing system for a 5G network, which adopts the dynamic network slicing method for the 5G network, and comprises the following steps:
the network slice creating module is used for creating a network slice and initializing the created network slice;
the scheduling module is used for realizing scheduling according to the logical channel priority MLCP and judging whether vacant resources can be scheduled or not, if so, the scheduling module jumps to the bearing scheduling judging module, and if not, the scheduling module jumps to the scheduling priority adjusting module;
the bearing scheduling judging module is used for judging whether all bearing scheduling is finished, if not, returning to the scheduling module, and if so, skipping to the scheduling priority adjusting module;
the scheduling priority adjusting module is used for judging whether the scheduling rate of the network slice meets the requirement of the minimum guaranteed rate GBR (guaranteed bit rate), if so, adjusting the scheduling priority of the network slice to reduce the scheduling priority to the tail of the queue, and otherwise, finishing the scheduling;
and the logical channel priority query module returns to query whether the remaining logical channel priorities (MLCPs) are not scheduled, returns to the scheduling module if the logical channel priorities are not scheduled, and finishes the scheduling if the logical channel priorities are not scheduled.
Compared with the prior art, the invention has the beneficial effects that: the scheduling mode among network slices is limited to realize scheduling resource sharing among the network slices through the logic channel priority mode, the problems of wireless resource waste and the like caused by static slices are effectively solved, on the basis, the historical flow of each logic channel is counted in the scheduling process, if the scheduling flow of a certain network slice reaches the minimum guaranteed rate GBR, the scheduling priority related to the network slice is reduced to the tail of a queue, the scheduling flow of the network slice is limited not to exceed the speed limit requirement of the maximum guaranteed rate MBR in the scheduling process, the actual requirement of the 5G network is further met, the dynamic resource matching degree of the 5G network is improved, and the reliability of the 5G network is guaranteed.
Drawings
FIG. 1 is a schematic workflow diagram of one embodiment of the present invention;
fig. 2 is a schematic diagram of a network slice creation workflow according to an embodiment of the present invention.
Detailed Description
Preferred embodiments of the present invention will be described in further detail below with reference to the accompanying drawings.
The network slicing is to divide a physical network of an operator into a plurality of virtual networks, and each virtual network is divided according to different service requirements, such as time delay, bandwidth, security, reliability and the like, so as to flexibly deal with different network application scenarios, and to improve the value of a client to the maximum extent.
Conventional methods for implementing virtual networks by Network slicing are Network Function Virtualization (NFV) and sdn (soft Definition Network) technologies. By virtualizing various physical or logical network resources, such as frequency band, time, equipment, ports, bandwidth and the like, network slicing divides the network resources into finer granularity or aggregates the network resources into coarser granularity, and flexibly allocates the network resources to different users as required by means of related software, so that the individualized requirements of each user are met, and the mutual isolation of the network resources among different users is ensured.
The 5G network slice comprises end-to-end management of virtual network resources, and the whole network slice is divided into a wireless network, a bearer network and a core network; the emphasis of this example is on wireless network slicing for radio resource management.
In the standard definition, a 5G network slice is a slice network based on per PDU SEESION, and needs to be processed jointly by the RAN side and the CN side of the radio access network to achieve differentiated processing of admission/rejection/preemption, resource allocation/scheduling, and routing for different user data and user types, where each network slice is identified by a unique S-NSSAI ID, where the S-NSSAI ID refers to an ID identified by a single network slice selection assistance information.
The service type corresponding to each network slice is defined by SLA (service Level agent), the same radio access network RAN can support a plurality of network slices, the radio resource management among the network slices is not specified in the protocol, the shared dynamic radio resource can be selected, the independent fixed radio resource can be selected, and even the network slices can be realized by hardware isolation.
The granularity of the network slice is in units of SESSION PDU SESSION, the temporary UE identity may establish multiple SESSION PDU SESSIONs, and each SESSION PDU SESSION may consist of multiple bearer DRBs on the RAN side of the radio access network.
Network slices of a wireless network can be classified according to objects as: network slicing based on service quality, namely slicing based on different QoS (quality of service), can provide customized service for users; resource-based network slices, i.e., slices that include radio resources and physical resources; a Virtual Operator-based Network slice, i.e. a subset of Network resources allocated to a Virtual Operator (MVNO).
Typical 5G application scenarios expected in the future include traditional communication, industrial internet, remote medical treatment, etc., and there are great differences in application requirements such as service mode, available bandwidth, transmission rate, security and reliability, etc., and thus, high requirements are placed on network slicing technology.
For example, a low-delay slice, a high-bandwidth slice, and a large number of connection slices may be cut. The user may also be given end-to-end exclusive slices if the user has extreme requirements for security.
Through network slicing, the user can obtain the following three values: ensuring SLA of service, including bandwidth, delay, packet loss and jitter and other traditional network indexes; isolation is carried out, a logically independent network is obtained, network risks are avoided, and secret leakage is avoided; and the slice tenant can check the network statistical indexes and states related to the slice by the self-operation and maintenance.
The isolation of radio resources in an access network can be divided into physical isolation and logical isolation. The physical isolation is to allocate dedicated spectrum bandwidth to network slices, and the logical isolation is to allocate radio resources as required according to the requirements of different slices, where the resource blocks allocated to each slice may be static or dynamic.
The physical isolation mode is high in implementation cost and inflexible in resource allocation, and the logical isolation can dynamically allocate resource blocks by a base station scheduler under the condition of sharing a frequency spectrum so as to meet the transmission requirements of different slices, which is beneficial to improving the utilization rate of frequency spectrum resources.
In the logical isolation scheme, the resource allocation between slices in the 5G network may be static or dynamic. Taking dynamic resource sharing in high-bandwidth sub-slices as an example, how to guarantee the service quality among different slices and maximize network resources is one of the key points of current business research.
As shown in fig. 1, this example provides a dynamic network slicing method for a 5G network, comprising the steps of:
step S1, creating a network slice, and initializing the created network slice;
step S2, scheduling is realized according to the logical channel priority MLCP, whether vacant resources can be scheduled or not is judged, if yes, the step S3 is skipped, and if not, the step S4 is skipped;
step S3, judging whether all the bearers are scheduled, if not, returning to the step S2 to schedule the bearers in the logical channel priority MLCP, judging whether the vacant resources can be scheduled, if so, jumping to the step S4';
step S4, judging whether the scheduling rate of the network slice meets the requirement of the minimum guaranteed rate GBR, if so, adjusting the scheduling priority of the network slice, reducing the scheduling priority to the tail of the queue, otherwise, ending the scheduling;
step S4', judging whether the scheduling rate of the network slice meets the requirement of the minimum guaranteed rate GBR, if so, adjusting the scheduling priority of the network slice, reducing the scheduling priority to the tail of the queue, and then jumping to step S5, otherwise, directly jumping to step S5;
and step S5, returning to inquire whether the remaining logical channel priority MLCPs are not scheduled, if so, returning to step S2 to implement scheduling according to the logical channel priority MLCPs from high to low, scheduling a plurality of bearers in the logical channel priority MLCPs, judging whether spare resources can be scheduled, and if not, ending the scheduling.
The dynamic network slice method for the 5G network in this example is also a method for dynamically allocating radio resources between network slices, and network slice 1 and network slice 2 belong to slices in the same type of slices in the 5G network. When the terminal accesses the network, the terminal allocates a set of slice resources through the identification of the S-NSSAI ID of the network slice, wherein the SLA information of the slice comprises the minimum guaranteed rate GBR and the maximum guaranteed rate MBR of the uplink and the downlink, and each network slice comprises the load of a plurality of users.
As shown in fig. 2, step S1 in this example includes the following sub-steps:
step S101, creating a network slice;
step S102, determining the proportion of static wireless resources according to the attribute of the network slice;
step S103, setting slice priority according to the attribute of the network slice;
and step S104, weighting the logical channel priority MLCP according to the slice priority.
In step S101 in this example, when a cell is created, a network slice creation procedure of a radio access network RAN is initiated, and a UE acquires a single network slice selection assistance information identifier set NASSI after performing network authentication; the binding of a single network slice selection auxiliary information identification set NASSI, which refers to a set of single network slice selection auxiliary information identifications S-NASSI, can also be synchronously realized in the UE (terminal) network registration process.
In step S102, the static radio resource ratio is determined according to the static reserved radio resource ratio contained in the QoS parameter preconfigured in the network slice, and if the configuration of the QoS parameter is 0, it indicates that static resource reservation is not performed; in step S103, the slice priority is mapped into the slice priority through the attribute of the network slice, or the slice priority is differentiated according to the application when creating, for example, the priority of the URLLC slice (ultra-Reliable Low latency Communications slice) may be configured to be the highest, and the slice priority may be differentiated between multiple network slices of the same type enhanced mobile broadband eMBB, or the slice priority may be differentiated according to the application when creating, and this is finally mapped into the logical channel priority MLCP.
In step S104 in this example, in the scheduling process, the priority of the network slice is embodied in the logical channel priority MLCP in a weighting manner
For example, mapping of network slice priority to logical channel priority is implemented by pre-configuration or specific mapping rules, where there may be two ways to map network slice priority to logical channel priority, one is to preset fixed mapping rules, for example, according to 5QI (5G QoS index) information contained in a slice type, the mapping should be directly mapped to logical channel priority, and the other is to design a dynamic mapping formula to weight parameters such as slice priority, slice type, and 5QI into the calculation of logical channel priority. This mapping rule may be preset and adjusted, or the first way may be directly employed. Wherein the content of the first and second substances,
refers to the logical channel priority MLCP of logical channel i.
In step S2, in the process of implementing scheduling according to logical channel priority MLCP, the scheduler is based on the logical channel priority MLCP
The priority sequence is sorted and scheduled from high to low, and aiming at a plurality of loads in each logical channel priority MLCP, a time slice round-robin scheduling algorithm (RR), a maximum carrier-to-interference ratio scheduling algorithm (MAXCI) and a proportional fair scheduling algorithm are adopted(PFS), and scheduling of each bearer is quality of service constrained by QoS parameters. The implementation of multi-bearer scheduling for multiple bearers specifically includes scheduling by any one of a time slice round robin scheduling algorithm RR, a maximum carrier-to-interference ratio scheduling algorithm MAX CI, and a proportional fair scheduling algorithm PFS.
When the proportional fair scheduling algorithm PFS is adopted to realize scheduling, the formula is adopted
Defining the scheduling priority
Wherein, in the step (A),
is the instantaneous rate under the current channel conditions,
for logical channelsjIn a time slotn-1 smoothing the processed historical flow,jis a logical channel number that is a logical channel number,nthe time slots are numbered.
This example is given by the formula
Calculating the smoothed historical flow
Wherein, in the step (A),
is a smoothing coefficient of historical flow
The value range of (1) is 0-1;
for logical channelsjIn a time slotnInstantaneous Rate at-2，
For logical channelsjIn a time slotnInstantaneous rate at 1.
This example is given by the formula
Calculating instantaneous rate under current channel conditions
Wherein B is the total bandwidth,Nthe number of carriers and the SINR is the signal-to-noise ratio.
In step S3, it is determined whether all bearers in the logical channel priority MLCP have been scheduled, and the manner of determining that all bearers in the logical channel priority MLCP have been scheduled is that all bearers in the logical channel priority MLCP have already obtained scheduling opportunities, otherwise, the step S2 is returned to implement scheduling of other bearers, where the other bearers include any one of a time slice round robin scheduling algorithm RR, a maximum carrier-to-interference ratio scheduling algorithm CI and a proportional fair scheduling algorithm PFS for bearer scheduling, and if so, the step S4' is skipped; in the step S4', it is determined whether the scheduling rate of the current network slice meets the requirement of the minimum guaranteed rate GBR, if so, the scheduling priority of the network slice is adjusted, and after the scheduling priority is reduced to the end of the queue, the step S5 is skipped to, otherwise, the step S5 is directly skipped to; in the step S5, the query is returned to determine whether there are remaining logical channel priorities MLCPs for non-scheduling, if yes, the step S2 is returned to, otherwise, the scheduling is ended. The current network slice refers to the current time slotnThe corresponding network slice.
In step S4, it is determined whether the scheduling rate of the network slice meets the requirement of the minimum guaranteed rate GBR, if yes, the scheduling priority of the network slice is adjusted to reduce it to the end of the queue, otherwise, the scheduling is ended.
In the scheduling process, the historical traffic of each logical channel is automatically counted, and if the scheduling traffic of a certain network slice reaches the minimum guaranteed rate GBR, the historical traffic of each logical channel is automatically countedRelating the network slices
The priority is reduced to the tail of the queue, and the minimum guaranteed rate GBR parameter is pre-configured when a network slice is created and is used for describing the QoS guarantee of the slice; and in the process of realizing scheduling, the scheduling flow of the network slice is limited not to exceed the speed limit requirement of the maximum guaranteed rate MBR.
This example also provides a dynamic network slicing system for a 5G network, which adopts the dynamic network slicing method for a 5G network described above and includes:
the network slice creating module is used for creating a network slice and initializing the created network slice;
the scheduling module is used for realizing scheduling according to the logical channel priority MLCP and judging whether vacant resources can be scheduled or not, if so, the scheduling module jumps to the bearing scheduling judging module, and if not, the scheduling module jumps to the scheduling priority adjusting module;
the bearing scheduling judging module is used for judging whether all bearing scheduling is finished, if not, returning to the scheduling module, and if so, skipping to the scheduling priority adjusting module;
the scheduling priority adjusting module is used for judging whether the scheduling rate of the network slice meets the requirement of the minimum guaranteed rate GBR (guaranteed bit rate), if so, adjusting the scheduling priority of the network slice to reduce the scheduling priority to the tail of the queue, and otherwise, finishing the scheduling;
and the logical channel priority query module returns to query whether the remaining logical channel priorities (MLCPs) are not scheduled, returns to the scheduling module if the logical channel priorities are not scheduled, and finishes the scheduling if the logical channel priorities are not scheduled.
In summary, the present embodiment defines a scheduling manner among network slices to implement scheduling resource sharing among the network slices through a logical channel priority manner, and effectively avoids the problems of radio resource waste and the like caused by static slices, on this basis, the historical traffic of each logical channel is also counted in the scheduling process, if the scheduling traffic of a certain network slice reaches the minimum guaranteed rate GBR, the scheduling priority related to the network slice is reduced to the tail of the queue, and the scheduling traffic of the network slice is simultaneously limited not to exceed the speed limit requirement of the maximum guaranteed rate during scheduling, so as to meet the actual requirement of the 5G network, improve the resource dynamic matching degree of the MBR 5G network, and ensure the reliable performance of the MBR 5G network.
The foregoing is a more detailed description of the invention in connection with specific preferred embodiments and it is not intended that the invention be limited to these specific details. For those skilled in the art to which the invention pertains, several simple deductions or substitutions can be made without departing from the spirit of the invention, and all shall be considered as belonging to the protection scope of the invention.
Claims (7)
1. A dynamic network slicing method for a 5G network, comprising the steps of:
step S1, creating a network slice, and initializing the created network slice;
step S2, scheduling is realized according to the logical channel priority MLCP, whether vacant resources can be scheduled or not is judged, if yes, the step S3 is skipped, and if not, the step S4 is skipped;
step S3, judging whether all the bearers are scheduled, if not, returning to the step S2, and if so, jumping to the step S4';
step S4, judging whether the scheduling rate of the network slice meets the requirement of the minimum guaranteed rate GBR, if so, adjusting the scheduling priority of the network slice, reducing the scheduling priority to the tail of the queue, otherwise, ending the scheduling;
step S4', judging whether the scheduling rate of the network slice meets the requirement of the minimum guaranteed rate GBR, if so, adjusting the scheduling priority of the network slice, reducing the scheduling priority to the tail of the queue, and then jumping to step S5, otherwise, directly jumping to step S5;
step S5, returning to inquire whether the remaining logical channel priority MLCP is not scheduled, if so, returning to step S2, otherwise, ending the scheduling;
in step S2, in the process of implementing scheduling according to the logical channel priority MLCP, the scheduler performs high-to-low sequencing and scheduling according to the logical channel priority MLCP priority order, performs scheduling on a plurality of bearers in each logical channel priority MLCP through any one of a time slice round robin scheduling algorithm RR, a maximum carrier-to-interference ratio scheduling algorithm MAX CI, and a proportional fair scheduling algorithm PFS, and performs QoS constraint on the scheduling of each bearer through QoS parameters;
when the proportional fair scheduling algorithm PFS is adopted to realize scheduling, the formula is adopted
Defining the scheduling priority
Wherein, in the step (A),
is the instantaneous rate under the current channel conditions,
for logical channelsjIn a time slotn-1 smoothing the processed historical flow,jis a logical channel number that is a logical channel number,nnumbering time slots;
by the formula
Calculating the smoothed historical flow
Wherein, in the step (A),
is a smoothing coefficient of historical flow
The value range of (1) is 0-1;
for logical channelsjIn a time slotn-an instantaneous rate at 2,
for logical channelsjIn a time slotn-instantaneous rate at 1;
in the scheduling process, the historical flow of each logic channel is automatically counted, and when the scheduling flow of the network slice reaches the minimum guaranteed rate GBR, the network slice is correlated
The priority is lowered to the end of the queue.
2. The dynamic network slicing method for 5G network as claimed in claim 1, wherein said step S1 comprises the following sub-steps:
step S101, creating a network slice;
step S102, determining the proportion of static wireless resources according to the attribute of the network slice;
step S103, setting slice priority according to the attribute of the network slice;
and step S104, weighting the logical channel priority MLCP according to the slice priority.
3. The dynamic network slice method of claim 2, wherein in step S101, when a cell is created, a network slice creation procedure of a radio access network RAN is initiated, and after network authentication, a bound single network slice selection assistance information identifier set NASSI is obtained.
4. The dynamic network slicing method for 5G network as claimed in claim 2, wherein in step S102, the static radio resource ratio is determined according to the static reserved radio resource ratio contained in the QoS parameter preconfigured in the network slice; in step S103, the network slice is mapped to the slice priority by the attribute of the network slice, or the slice priority is differentiated according to the application when creating the network slice.
5. The dynamic network slicing method for 5G network as claimed in any one of claims 1 to 4, characterized by the formula
Calculating instantaneous rate under current channel conditions
Wherein B is the total bandwidth,Nthe number of carriers and the SINR is the signal-to-noise ratio.
6. The dynamic network slicing method for 5G network as claimed in any one of claims 1 to 4, wherein in the process of implementing scheduling, the scheduling traffic by limiting the network slice does not exceed the speed limit requirement of the maximum guaranteed rate MBR.
7. A dynamic network slicing system for a 5G network, wherein the dynamic network slicing method for a 5G network according to any one of claims 1 to 6 is adopted, and comprises:
the network slice creating module is used for creating a network slice and initializing the created network slice;
the scheduling module is used for realizing scheduling according to the logical channel priority MLCP and judging whether vacant resources can be scheduled or not, if so, the scheduling module jumps to the bearing scheduling judging module, and if not, the scheduling module jumps to the scheduling priority adjusting module;
the bearing scheduling judging module is used for judging whether all bearing scheduling is finished, if not, returning to the scheduling module, and if so, skipping to the scheduling priority adjusting module;
the scheduling priority adjusting module is used for judging whether the scheduling rate of the network slice meets the requirement of the minimum guaranteed rate GBR (guaranteed bit rate), if so, adjusting the scheduling priority of the network slice to reduce the scheduling priority to the tail of the queue, and otherwise, finishing the scheduling;
and the logical channel priority query module returns to query whether the remaining logical channel priorities (MLCPs) are not scheduled, returns to the scheduling module if the logical channel priorities are not scheduled, and finishes the scheduling if the logical channel priorities are not scheduled.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010846225.4A CN111741536B (en) | 2020-08-21 | 2020-08-21 | Dynamic network slicing method and system for 5G network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010846225.4A CN111741536B (en) | 2020-08-21 | 2020-08-21 | Dynamic network slicing method and system for 5G network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111741536A CN111741536A (en) | 2020-10-02 |
| CN111741536B true CN111741536B (en) | 2020-12-18 |
Family
ID=72658640
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010846225.4A Active CN111741536B (en) | 2020-08-21 | 2020-08-21 | Dynamic network slicing method and system for 5G network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111741536B (en) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112423347B (en) * | 2020-11-02 | 2023-08-11 | 中国联合网络通信集团有限公司 | QoS guarantee method and device |
| WO2022134085A1 (en) * | 2020-12-25 | 2022-06-30 | 深圳市大疆创新科技有限公司 | Data sending method, and device |
| CN112600695B (en) * | 2021-01-15 | 2022-05-24 | 北京邮电大学 | RAN side network slice resource allocation method and device and electronic equipment |
| CN113746677B (en) * | 2021-09-01 | 2023-09-01 | 之江实验室 | 5G new air interface-oriented network intra-slice resource allocation method |
| CN113811008A (en) * | 2021-09-16 | 2021-12-17 | 郑州轻工业大学 | Quick-response wireless resource management method |
| CN114585024B (en) * | 2022-02-10 | 2023-03-31 | 电子科技大学 | Slice access control method of 5G/B5G network |
| CN117478208B (en) * | 2023-12-26 | 2024-03-19 | 中国电子科技集团公司第五十四研究所 | Dynamic resource allocation satellite mobile communication system for differentiated user group |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106454947A (en) * | 2016-06-29 | 2017-02-22 | 英骅信息科技（上海）有限公司 | AP access load balancing method |
| CN108282868A (en) * | 2017-01-05 | 2018-07-13 | 中兴通讯股份有限公司 | Control signaling configuration method and device |
| CN109552370A (en) * | 2018-12-12 | 2019-04-02 | 交控科技股份有限公司 | Train operation drawing generating method based on the volume of the flow of passengers |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107743100B (en) * | 2017-09-30 | 2020-11-06 | 重庆邮电大学 | Online adaptive network slice virtual resource allocation method based on service prediction |
| CN117651306A (en) * | 2018-05-21 | 2024-03-05 | 华为技术有限公司 | Method and device for establishing GBR QoS flow in session |
| EP3864804A1 (en) * | 2018-10-11 | 2021-08-18 | Koninklijke KPN N.V. | Dynamic slice priority handling |
| CN111278016B (en) * | 2018-12-04 | 2023-03-21 | 中国电信股份有限公司 | Network slice processing method, system and storage medium |
| CN111464890B (en) * | 2020-03-31 | 2021-09-07 | 烽火通信科技股份有限公司 | Dynamic bandwidth allocation method for network slice and OLT (optical line terminal) |
-
2020
- 2020-08-21 CN CN202010846225.4A patent/CN111741536B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106454947A (en) * | 2016-06-29 | 2017-02-22 | 英骅信息科技（上海）有限公司 | AP access load balancing method |
| CN108282868A (en) * | 2017-01-05 | 2018-07-13 | 中兴通讯股份有限公司 | Control signaling configuration method and device |
| CN109552370A (en) * | 2018-12-12 | 2019-04-02 | 交控科技股份有限公司 | Train operation drawing generating method based on the volume of the flow of passengers |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111741536A (en) | 2020-10-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111741536B (en) | Dynamic network slicing method and system for 5G network | |
| EP3554125B1 (en) | Data processing method, apparatus and system | |
| Chang et al. | Radio access network resource slicing for flexible service execution | |
| EP3840512A1 (en) | Sidelink resource allocation method and terminal | |
| US7860002B2 (en) | Priority-based admission control in a network with variable channel data rates | |
| CN101189842B (en) | Method and apparatus for enhanced delivery of content over a data network | |
| EP2517518B1 (en) | Method and apparatus for ensuring access in a communication system for a plurality of groups | |
| Khatibi et al. | Modelling and implementation of virtual radio resources management for 5G Cloud RAN | |
| CN104969648A (en) | Method and system for scheduling radio resources in cellular networks | |
| CN113115370B (en) | Resource block configuration method, device and storage medium | |
| CN113711643A (en) | Resource allocation in network slices | |
| Richart et al. | Slicing in wifi networks through airtime-based resource allocation | |
| CN104427630B (en) | A kind of grouping scheduling method and device | |
| CN112469132A (en) | Carrier resource scheduling method and device | |
| CN115211197A (en) | Mini token bucket for uplink transmission | |
| CN112702109A (en) | User equipment access method and device, and user equipment switching method and device | |
| Saini et al. | An efficient multicode design for real time QoS support in OVSF based CDMA networks | |
| CN105764118B (en) | MOCN cell communication method and device | |
| Al-Dulaimi et al. | Construction and Analysis of Dynamic Distribution for Resource Blocks of Real-Time and Data Elastic Traffic in IMS/LTE networks | |
| Ayaz et al. | Analysis of deficit round robin scheduling for future aeronautical data link | |
| CN107969033B (en) | Resource scheduling method and device | |
| CN113709759A (en) | Network slice management method and device and computer readable storage medium | |
| EP2009943B1 (en) | Uplink transmission in mobile networks | |
| CN114630441B (en) | Resource scheduling method and device | |
| Bénézit et al. | Modelling load balancing and Carrier Aggregation in mobile networks |
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 | ||
| CB03 | Change of inventor or designer information |
Inventor after: Zhou Hongfeng Inventor after: Li Shiping Inventor before: Zhou Hongfeng Inventor before: Wang Ning |
|
| CB03 | Change of inventor or designer information |