CN115460088A - 5G power multi-service slice resource allocation and isolation method - Google Patents
5G power multi-service slice resource allocation and isolation method Download PDFInfo
- Publication number
- CN115460088A CN115460088A CN202210874625.5A CN202210874625A CN115460088A CN 115460088 A CN115460088 A CN 115460088A CN 202210874625 A CN202210874625 A CN 202210874625A CN 115460088 A CN115460088 A CN 115460088A
- Authority
- CN
- China
- Prior art keywords
- slice
- network
- resource
- resources
- isolation
- 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.)
- Pending
Links
- 238000002955 isolation Methods 0.000 title claims abstract description 117
- 238000013468 resource allocation Methods 0.000 title claims abstract description 45
- 238000000034 method Methods 0.000 claims abstract description 71
- 238000013507 mapping Methods 0.000 claims abstract description 48
- 230000008569 process Effects 0.000 claims abstract description 31
- 238000005457 optimization Methods 0.000 claims abstract description 13
- 230000010354 integration Effects 0.000 claims abstract description 10
- 238000012545 processing Methods 0.000 claims abstract description 10
- 238000004364 calculation method Methods 0.000 claims description 14
- 230000005540 biological transmission Effects 0.000 claims description 9
- 238000004422 calculation algorithm Methods 0.000 claims description 9
- 230000002068 genetic effect Effects 0.000 claims description 4
- 230000007246 mechanism Effects 0.000 claims description 4
- 238000006243 chemical reaction Methods 0.000 claims description 3
- 241001181114 Neta Species 0.000 claims 1
- 238000005516 engineering process Methods 0.000 description 11
- 238000004088 simulation Methods 0.000 description 7
- 238000007726 management method Methods 0.000 description 6
- 230000008901 benefit Effects 0.000 description 4
- 238000013461 design Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 4
- 238000011161 development Methods 0.000 description 3
- 239000003795 chemical substances by application Substances 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000002474 experimental method Methods 0.000 description 2
- 239000012634 fragment Substances 0.000 description 2
- 238000005192 partition Methods 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 230000004044 response Effects 0.000 description 2
- 206010033799 Paralysis Diseases 0.000 description 1
- 230000005856 abnormality Effects 0.000 description 1
- 230000002411 adverse Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000002860 competitive effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 238000013467 fragmentation Methods 0.000 description 1
- 238000006062 fragmentation reaction Methods 0.000 description 1
- 238000013508 migration Methods 0.000 description 1
- 230000005012 migration Effects 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 239000002245 particle Substances 0.000 description 1
- 230000001737 promoting effect Effects 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0893—Assignment of logical groups to network elements
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/12—Computing arrangements based on biological models using genetic models
- G06N3/126—Evolutionary algorithms, e.g. genetic algorithms or genetic programming
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/46—Interconnection of networks
- H04L12/4641—Virtual LANs, VLANs, e.g. virtual private networks [VPN]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- 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/0803—Configuration setting
- H04L41/0823—Configuration setting characterised by the purposes of a change of settings, e.g. optimising configuration for enhancing reliability
- H04L41/0826—Configuration setting characterised by the purposes of a change of settings, e.g. optimising configuration for enhancing reliability for reduction of network costs
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0896—Bandwidth or capacity management, i.e. automatically increasing or decreasing capacities
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/16—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks using machine learning or artificial intelligence
-
- 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/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
- H04L41/5041—Network service management, e.g. ensuring proper service fulfilment according to agreements characterised by the time relationship between creation and deployment of a service
- H04L41/5051—Service on demand, e.g. definition and deployment of services in real time
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W12/00—Security arrangements; Authentication; Protecting privacy or anonymity
- H04W12/30—Security of mobile devices; Security of mobile applications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/02—Resource partitioning among network components, e.g. reuse partitioning
- H04W16/10—Dynamic resource partitioning
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/50—Service provisioning or reconfiguring
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Life Sciences & Earth Sciences (AREA)
- Health & Medical Sciences (AREA)
- Biophysics (AREA)
- Computer Security & Cryptography (AREA)
- Evolutionary Computation (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Bioinformatics & Computational Biology (AREA)
- Evolutionary Biology (AREA)
- Theoretical Computer Science (AREA)
- Software Systems (AREA)
- Artificial Intelligence (AREA)
- Biomedical Technology (AREA)
- Data Mining & Analysis (AREA)
- Computational Linguistics (AREA)
- General Health & Medical Sciences (AREA)
- Molecular Biology (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- Genetics & Genomics (AREA)
- Physiology (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Databases & Information Systems (AREA)
- Medical Informatics (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to a 5G multi-service slice resource allocation and isolation method, which comprises the following steps: step 1, building a 5G network slice structure; step 2, designing a resource allocation controller on the NFV virtual layer; step 3, performing resource mapping integration processing on the data with the minimum total bandwidth consumption as an optimization target, and improving the resource utilization rate of the whole mapping process; step 4, selecting a resource allocation channel; step 5, calculating the user priority according to the required service; step 6, scheduling resources in the partitioned resource allocation channel; step 7, performing resource optimization allocation; and 8, carrying out slice isolation according to the service requirement. The invention can provide networks with different use cases as services through 5G network slices, and supports operators to establish a plurality of virtual networks. The application and the service of the network slice can be dynamically and flexibly deployed through the network slice, and various service requirements are met.
Description
Technical Field
The invention belongs to the technical field of 5G-based multi-service slice and channel isolation, and relates to a 5G-oriented power multi-service slice resource allocation and isolation method, in particular to a 5G-oriented power multi-service slice resource allocation and isolation method based on SDN and NFV.
Background
With the rapid development of mobile communication technology, various service requirements appear in people's life, and in order to meet the requirements, the 5G technology provides ultrahigh-bandwidth and lower-delay connection with a novel network architecture. Nowadays, 5G has gradually become a key technology for promoting the development of multi-service requirements. On one hand, it has more flexible characteristics with respect to previous 4G networks; on the other hand, the unique customized function of the system can also meet the requirements of various vertical industries and can be used for solving the requirement of multi-service resource allocation.
Different industries have different requirements on networks, and aiming at a multi-service scene, the 5G network can construct a network channel according to service requirements, provide differentiated resource allocation according to different service requirements and service scenes, and can more effectively meet the diversified requirements of the multi-service scene. Currently, in a smart grid scene, the application research of a 5G network fragmentation technology in the aspect of resource allocation is still in a development stage. In the current mature network fragment resource allocation model, there are allocation models based on a continuous domain, a game theory and a pricing mechanism, but the traditional allocation model generates too large amount of calculation in practical application, and even falls into local optimum, so that the performance of the algorithm cannot be effectively improved.
In the face of the severe business safety problem of the energy internet, the deep research of the 5G-based multi-business slicing technology and the channel isolation technology is an urgent need. The 5G network slices are divided into eMBB slices, uRLLC slices and mMTC slices, and the three types of slices are different from each other in the power service suitable for bearing. The simple explanation of the network slice is to use different networks under different scene requirements according to the scene to realize the division of a physical network at a logic level. The network slice can perfect the network resource allocation, the slice example is the collection of network function and required resource, and the management of the end-to-end slice is realized through the network slice management function.
The network slice is a basic structure of a 5G network communication system, and can flexibly set network functions according to basic service requirements, but during the operation of each slice, if the security of isolation between slices is not good, corresponding security threats can be generated, and the network security can be seriously influenced.
In the multi-service network environment, the traditional mode of response to the demand has been transited to multifunctional comprehensive demand response. The requirement mixing of a plurality of complex services may cause a competitive relationship between resources, and if the isolation between 5G slices is not well done, resource contention may occur between slices, thereby affecting the normal deployment and operation of a network and seriously causing the paralysis of the services.
The good isolation technology can also avoid adverse effects caused by the abnormality of a certain slice, such as malicious attack occurring inside, and can effectively prevent security threats such as attack large-scale and slice data leakage.
The existing isolation technology only aims at the performance isolation requirement or the safety isolation requirement and cannot consider both the performance isolation requirement and the safety isolation requirement. When a user accesses a plurality of network slices, the confidentiality of data information between the slices may be attacked, and the leakage of network or user data may be caused.
Through searching, the patent documents of the prior art which are the same as or similar to the invention are not found.
Disclosure of Invention
The invention aims to overcome the defects of the prior art and provides a 5G power multi-service slice resource allocation and isolation method which is reasonable in design, high in business safety and capable of effectively improving allocation of slice resources and is based on SDN and NFV.
The invention solves the practical problem by adopting the following technical scheme:
A5G multi-service slice resource allocation and isolation method based on SDN and NFV comprises the following steps:
step 4, after the resource mapping and integrating treatment is carried out, a resource allocation channel is selected;
step 5, calculating the user priority according to the required service;
step 6, taking the resources after the mapping processing as objects, and scheduling the resources in the partitioned resource allocation channel to maximize the utility function;
step 7, performing resource optimization allocation according to the processing results of the steps;
Moreover, the 5G network slice structure of step 1 is composed of a basic architecture layer, an NFV virtual layer, a network slice layer and an actual service layer;
moreover, the resource allocation controller of the step 2 is divided into a central controller and a plurality of local controllers connected with the central controller; and the central controller and the local controller in the step 2 interact in real time to acquire all information of the whole network, give a corresponding distribution scheme according to the information, and then output the distribution scheme to the local controller, thereby realizing dynamic distribution of slice resources of each local bearer network service.
Further, the specific steps of step 3 include:
(1) Decomposing the network mapping request into a plurality of star sub-virtual network requests:
using undirected graph G p To represent a 5G slice network, assume that the total amount of allocated resources of the slice network is W (m) j p ) Distributed over the network node, using bandwidth B (m) j p ,m k p ) Denotes the bottom level node m j p And m k p Physical link between them, thereby obtaining a fragmented structure in the multi-service network, wherein the virtual layer uses an undirected graph G d The process of mapping from the virtual layer request to the underlying physical resource network is shown as follows:
G d ＝(N v ,E v )→G p ＝(N p ,E p ) (1)
n in the formula (1) v And E v Respectively, a set of virtual layer nodes and links.
(2) Performing source mapping integration treatment by taking the minimum total bandwidth consumption as an optimized target resource:
during the resource mapping integration, the residual bandwidth resources of the virtual node links are calculated as follows:
in the formula (2), the reaction solution is,
and
respectively representing the total link and the occupied bandwidth, M v The set of virtual nodes in the mapping process at the moment; in this process, resource constraint is required, that is, the underlying physical network needs to have enough remaining resources to satisfy the consumption of the virtual network, which is expressed as:
R E (M E (e v ))≥c(e v ) (3)
when the virtual resource request has a plurality of effective mappings, the resource utilization rate of the whole mapping process can be improved by taking the minimum total bandwidth consumption as a target, so that the mapping result of each block resource in the power multi-service section network is obtained, and each block resource can be classified according to the mapping characteristics.
Further, the specific steps of step 4 include:
(1) Assigning a time-varying random channel:
taking into account the time-varying random channel in the allocation process, order g ks (t) is the channel gain of user k when the time slot requests service, and satisfies the following conditions:
in equation (4), G is the channel state set, P (G) i ) Indicates that the channel state is g i The probability of (d); order to
Representing the gain of each user at time t;
(2) According to the result of allocating time-varying random channels, considering whether the average gain of the channels calculates the residual bandwidth of the link meets the requirement of slice resource amount, selecting the allocation channels of the resources:
the formula for calculating the remaining bandwidth of the link is:
in (5), BW (l) s ) Is the total bandwidth of the channel and,
the bandwidth used for the link. In the real-time resource allocation process, real-time gains existing in different time slots are considered, and if the quantity of slice resources to be allocated is less than that of slice resources to be allocated
The channel can be selected as a transmission channel of the resource, otherwise, other allocation channels meeting the conditions need to be reselected.
Moreover, the specific method of the step 5 is as follows:
and taking the weight omega of the slice to which the user belongs as a unit, and allocating network resources according to the priority of the service required by the user: comparing the priorities of the users by using the interval time of resource scheduling transmission, allocating resources according to the calculation result of the priorities, and expressing the priorities of the users by using the calculation mode of (6):
wherein the variable S u And S U The total demand for user u and all users in the entire 5G network.
Moreover, the specific method of the step 6 is as follows:
using utility function V (E) s ) Describing the advantages and disadvantages of the slice scheduling process, the goal of resource scheduling to be achieved is to make V (E) s ) The sum of (a) and (b) is maximum, i.e.:
in the formula, E s E is the transmission efficiency of a single slice, and E is the sum of the resource scheduling efficiencies. The slice weight ω is used to describe the smart grid's ability to slice at a certain time. The expression of the mesh weight value is:
wherein, P 0 Number of bandwidth resource blocks, P, calculated for a slice i Representing the average of the bandwidth resource blocks during the time when i varies from 0 to i-1. The weighting coefficients being alpha, N 0 And N i-1 Is the number of bandwidth resource blocks, lambda, in the whole resource scheduling process and i-1 scheduling time interval i Is the utilization of the bandwidth resource block.
Moreover, the specific method of step 7 is:
distributing resources required by users by using a semi-static method, setting the total number of the owned resources to be L, and performing fixed distribution according to factors such as slice types, network capacity and the like to meet the minimum essential requirements required by each user; and recording the remaining available resources as L' after the first round of distribution, and distributing again from large to small according to the priority result until all distribution is finished. And (3) performing channel optimization by the user with high priority, wherein in each network slice, the resources are sequentially allocated to the users of each network slice according to the priority obtained by the formula (6), and the users with higher priority can obtain good channels until the residual resources are 0.
Moreover, the specific steps of step 8 include two parts of slicing soft isolation and slicing hard isolation:
the specific implementation steps of slice soft isolation comprise:
(1) Determination of isolation level
Example slice representation y i Isolation class of chip H i v Class P of isolation by its performance i v Level of security isolation S i v Determined together, and is formulated as H i v ＝κ 1 P i v +κ 2 S i v Wherein κ is 1 +κ 2 ＝1，κ 1 、κ 2 The value of (a) is determined according to the actual situation. Both isolation levels can be divided into 5 levels, the higher the level, the corresponding isolationThe greater the departure demand;
(1) determination of performance isolation level:
setting the ratio of the resources needed by the virtual node to the rest of the resources as a performance isolation coefficient, and setting y i A total of k virtual nodes, when the first virtual node n y il Is arranged at server n s l When above, n y i,l Coefficient of performance isolation of
As follows:
for different virtual nodes, the weight coefficient beta is adopted to adjust the virtual nodes, and beta 1 +β 2 +β 3 ＝1。
The closer to 0, the higher the isolation of performance. The requirements of each node on resources are different, the obtained performance isolation coefficient calculation results are naturally different, and the maximum value in each node is taken
Value as y i Judging the performance isolation level; according to
Value of (d) is to isolate the performance class P i v There are 5 levels.
(2) Determination of the security isolation level:
for y i The k virtual nodes are deployed on the servers, and the maximum deployment is set on each server
A virtual node, thus i The number of network slice instances that can coexist is:
according to
The value range of (A) divides the security isolation level S into 5 levels
(2) Setting of variables
Now the ith network slice instance y i Is laid out from physical to network u s Upper, y i Total of k virtual nodes, u s There are n physical nodes, and two variables are set:
①α i,l,k : if y i The first virtual node n of v i，l Normal mapping to u s Of the kth server
When above, α i,l,k 1 is taken, and alpha is not taken i,l,k ＝0；
②β i,ef,ζ : if y i The virtual link of (a) is,
normal mapping to u s When the physical link is zeta, take beta i,ef,ζ Is 1;
(3) Establishing an objective function
From a cost perspective, minimizing the cost required for deployment is targeted
In the above equation, a virtual node n is deployed v i,l The cost is omega y i,l Deploying virtual links
The total cost of
(4) Establishing constraint conditions
Formula (12) shows that when y i The first virtual node of (1), n v i，l Mapping to u s The kth server
When the water-saving agent is used in the water-saving process,
the residual resources are more than or equal to the corresponding virtual resources required by the resources; equation (13) shows that the performance isolation coefficients of the new and old nodes are less than or equal to the value of the acceptable maximum coefficient when the nodes are deployed; equation (14) indicates the isolation class requirement, indicating that no other NSI coexisting with the new and old NSI exceeds the corresponding maximum; equation (15) is a constraint condition for the isolation level, and guarantees the overall requirement.
According to the constraint conditions and the objective function, a final deployment result is obtained by using a genetic algorithm, and based on the existing network mechanism, VLAN (virtual local area network) tags and slice marks are used for realizing the deployment; different network slices have unique labels; different VLANs are used for isolation, so that logical channel division and network isolation are realized, and network bandwidth resources are shared.
The specific implementation method of the slice hard isolation comprises the following steps:
by means of a time Slot-based Flexe isolation technique, flexe is divided into 20 slots per 100G physical PMD, and the Shim layer of the Flexe has n multiplied by 10 time slots of 5G; the Slot configuration of the Shim layer can support the requirements of various services, and the hard isolation between the network slices of the power multi-service is realized.
The invention has the advantages and beneficial effects that:
1. the invention provides a 5G multi-service slice-oriented resource allocation and isolation method based on SDN and NFV, which can provide network services of different cases through 5G network slices and support operators to establish a plurality of virtual networks. The application and the service of the network slice can be dynamically and flexibly deployed through the network slice, and various service requirements are met.
2. The invention designs the resource allocation controller from two aspects of the central controller and the local controller respectively, and under the control of the hardware equipment, the resource is collected and mapped, thereby reducing the occurrence probability of allocation congestion. And selecting a resource allocation channel, calculating the priority of the user, and combining the calculation result to realize the optimal allocation of the 5G network slice resources in a semi-dynamic scheduling mode. Compared with the traditional model, the slice resource allocation based on the SDN and the NFV has lower probability of congestion and service, can be allocated according to the predefined priority, and is more reasonable and efficient.
3. The invention aims at the weighting of the performance isolation level and the security isolation level and realizes the isolation level of the network slice example, the minimum deployment cost is taken as a target function, the division of a logic channel and the network sharing of network bandwidth resources are realized through VLAN isolation, and the isolation requirements of users in the aspects of safety and performance are ensured. And for the uRLLC network slice with extremely high time delay and reliability requirements, physical isolation is realized by adopting a time slot-based Flexe isolation technology.
Drawings
FIG. 1 is a 5G network slice architecture diagram of the present invention;
FIG. 2 is a diagram of a simulation experiment network scenario of the present invention;
FIG. 3 is a graph illustrating the statistical comparison of the resource allocation of network slices according to the present invention;
FIG. 4 is a flow chart of the slice isolation class GA-PSO algorithm of the present invention;
FIG. 5 is a diagram of a deployment cost simulation result of the present invention;
FIG. 6 is a graph of revenue versus cost simulation results for the present invention;
fig. 7 is a schematic diagram of a slot-based FlexE isolation scheme of the present invention.
Detailed Description
The embodiments of the invention will be described in further detail below with reference to the accompanying drawings:
A5G multi-service slice resource allocation and isolation method based on SDN and NFV comprises the following steps:
The 5G network slice structure consists of a basic framework layer, an NFV virtual layer, a network slice layer and an actual service layer;
in this embodiment, a network slice structure is first constructed according to the "5G white paper", and generally includes a basic architecture layer, an NFV virtual layer, a network slice layer, and an actual service layer.
A base framework layer: and the network element is connected with the NFV virtual layer and provides resources including physical resources, calculation and storage resources, network element components, driving and sensing equipment and the like required by the NFV process.
NFV virtual layer: depending on the implementation of the SDN and the NFV, the SDN refers to a software defined network, the NFV is a network virtualization layer, a basic structure layer and other planes can be separated according to the SDN, the NFV can separate required network functions from hardware resources, and the NFV can coordinate the life cycle of network segments and manage and control virtual network functions.
Network slicing layer: the fragments are composed of virtual network functions VNFs, which are implemented on a virtual structure, and then network function unit entities are selected to implement corresponding service needs.
And (3) an actual service layer: after the service is distributed with the corresponding slice, the corresponding network connection is formed, and the message transmission is realized, thereby realizing wide application.
the resource allocation controller in the step 2 is divided into a central controller and a plurality of local controllers connected with the central controller;
the central controller interacts with the local controller in real time, and is used for acquiring all information of the whole network, giving out a corresponding distribution scheme according to the information, and then outputting the distribution scheme to the local controller, thereby realizing dynamic distribution of slice resources of each local bearer network service.
In this embodiment, the local controller is configured to receive an instruction sent by the central controller, perform corresponding allocation according to the instruction, perform arrangement and management on resources of each virtual network element in a network slice, and implement allocation of end-to-end network slice resources according to user endpoint requirements; and collects resource usage of the infrastructure and virtual network elements and uploads it to the central controller.
Based on this, the central controller can allocate resources according to various requirements, and after judging whether the services before and after switching meet the service requirements, the central controller can formulate a corresponding resource allocation strategy according to the user requirements, the network state of each local partition, the resource conditions and the like, aiming at the resource allocation algorithm deployed in each region by comprehensive consideration, and send the allocation mode to the local controller. The local controller collects the resource use conditions of the infrastructure and the virtual network elements and uploads the resource use conditions to the central controller, and the local controller can dynamically allocate resources to the virtual network elements according to the received allocation strategies to meet service requirements, so that network virtualization calculation, storage and resource management and control operations are realized.
In this embodiment, a resource allocation controller is designed, which is divided into central and local control. The central controller can interact with the local controller in real time through a corresponding program interface, can acquire all information of the whole network, gives a corresponding distribution scheme according to the information, and then transmits the corresponding distribution scheme to the local controller through the interface, thereby realizing the dynamic distribution of slice resources of each local bearer network service.
The local control mainly receives an instruction sent by a control center, performs corresponding distribution according to the instruction, performs arrangement and management on resources of each virtual network element in the network slice, realizes flexible expansion of the resources, and realizes distribution of end-to-end network slice resources according to the requirements of user endpoints. Based on this, the central controller can allocate resources according to various requirements, and after judging whether the services before and after switching meet the service requirements, the central control part can make a corresponding resource allocation strategy according to the user requirements, the network states of the local partitions, the resource conditions and the like, by aiming at the resource allocation algorithm deployed in each region in comprehensive consideration, and send the allocation mode to the local controller. The local controller collects the resource use conditions of the infrastructure and the virtual network elements and uploads the resource use conditions to the central end, and the local controller can dynamically allocate resources to the virtual network elements according to the received allocation strategies to meet service requirements, so that network virtualization calculation, storage and resource management and control operations are realized.
the specific steps of the step 3 comprise:
(1) Decomposing the network mapping request into a plurality of star sub-virtual network requests:
using undirected graph G p To represent a 5G slice network, assume that the total amount of allocated resources of the slice network is W (m) j p ) Distributed over the network node, using bandwidth B (m) j p ,m k p ) Denotes the bottom level node m j p And m k p The physical link between them, thereby obtaining the slicing structure in the multi-service network, wherein the virtual layer uses undirected graph G d The process of mapping from the virtual layer request to the underlying physical resource network is shown as follows:
G d ＝(N v ,E v )→G p ＝(N p ,E p ) (1)
n in the formula (1) v And E v Are respectively virtualA set of layer nodes and links.
In this embodiment, a star topology structure is adopted, and the topology characteristics of the virtual network need to be considered in the virtual network, so as to prevent network channel congestion caused by unreasonable utilization of the underlying links.
(2) Performing source mapping integration treatment by taking the minimum total bandwidth consumption as an optimized target resource:
during the resource mapping integration, the residual bandwidth resources of the virtual node links are calculated as follows:
in the formula (2), the reaction solution is,
and
respectively representing the total link and the occupied bandwidth, M v Is the set of virtual nodes in the mapping process at this time. In this process, resource constraint is required, that is, the underlying physical network needs to have enough remaining resources to satisfy the consumption of the virtual network, which is expressed as:
R E (M E (e v ))≥c(e v ) (3)
when multiple effective mappings exist for a virtual resource request, the resource utilization rate of the whole mapping process can be improved by taking the minimum total bandwidth consumption as a target. Therefore, the mapping result of each block resource in the power multi-service slice network is obtained, and each block resource can be classified according to the mapping characteristics.
Step 4, selecting a resource allocation channel after resource mapping and integrating processing;
the specific steps of the step 4 comprise:
(1) Assigning a time-varying random channel:
taking into account the time-varying random channel in the allocation process, order g ks (t) channel increase for user k when requesting traffic for a timeslotBeneficial and meets the following conditions:
in equation (4), G is the set of channel states, P (G) i ) Indicates that the channel state is g i The probability of (c). Order to
Indicating the gain of each user at time t.
(2) According to the result of allocating time-varying random channels, considering whether the average gain of the channels calculates the residual bandwidth of the link to meet the requirement of slice resource amount, selecting the allocation channels of the resources:
the formula for calculating the remaining bandwidth of the link is:
in (5), BW (l) s ) Is the total bandwidth of the channel and,
the bandwidth used for the link. In the real-time resource allocation process, the real-time gains existing in different time slots are considered, and if the quantity of slice resources to be allocated is less than that
This channel can be selected as the transport channel for the resource, otherwise the eligible other allocation channels need to be reselected.
Step 5, calculating the user priority according to the self required service;
the specific method of the step 5 comprises the following steps:
and (3) taking the weight omega of the slice to which the user belongs as a unit, and distributing network resources according to the priority of the service required by the user: and comparing the priorities of the users by using the interval time of resource scheduling transmission, and allocating the resources according to the calculation result of the priorities. Representing user priority by using the calculation mode of (6)
Wherein, the variable S u And S U Is the total demand of user u and all users in the entire 5G network.
Step 6, taking the resource which is mapped and processed as the object, carrying out resource scheduling in the partitioned resource distribution channel to make the utility function maximum
The specific method of the step 6 comprises the following steps:
using utility function V (E) s ) Describing the advantages and disadvantages of the slice scheduling process, the goal of resource scheduling to be achieved is to make V (E) s ) The sum of which is maximum, namely:
in the formula, E s E is the sum of the resource scheduling efficiency for the transmission efficiency of a single slice. The slice weight ω is used to describe the smart grid's ability to slice at a certain time. The expression of the mesh weight value is:
wherein, P 0 Number of bandwidth resource blocks, P, calculated for a slice i Representing the average value of the bandwidth resource blocks during the time when i varies from 0 to i-1. The weighting coefficients being alpha, N 0 And N i-1 Is the number of bandwidth resource blocks, lambda, in the whole resource scheduling process and i-1 scheduling time interval i Is the utilization of the bandwidth resource block.
Step 7, performing resource optimization allocation according to the processing result of the step
The specific method of the step 7 comprises the following steps:
the method comprises the steps of distributing resources required by users by using a semi-static method, setting the total number of the resources owned by the users to be L, and performing fixed distribution according to factors such as slice types and network capacity to meet the minimum essential requirements required by each user. And recording the remaining available resources as L' after the first round of distribution, and distributing again from large to small according to the priority result until all distribution is finished. And (3) performing channel optimization by the user with high priority, wherein in each network slice, the resources are sequentially allocated to the users of each network slice according to the priority obtained by the formula (6), and the users with higher priority can obtain good channels until the residual resources are 0.
Aiming at different requirements of each service in the network on safety, the problems of safety and the like caused by influencing normal operation of the service due to possible resource contention among slices of the 5G network are avoided. The performance and security requirements of network slices are considered to allocate slice resources, and then isolation is performed. In 5G slice application, an isolation method mainly uses soft slices, different service levels are provided according to service performance and safety requirements, and end-to-end differentiated services are provided as required in a logic isolation mode, so that the method is easy to implement. If the slices are to realize physical isolation such as network special isolation, namely hard isolation, completely exclusive network resources are distributed in the network for different network slices, but due to the fact that the cost is high, generally aiming at services with extremely high safety requirements, the slices are provided according to the cost and according to the needs by combining with actual service scenes of users.
The specific steps of the step 8 comprise a slicing soft isolation part and a slicing hard isolation part:
the specific implementation steps of slice soft isolation comprise:
(1) Determination of isolation level
Example slice representation y i Isolation class of chip H i v By its performance isolation level P i v Level of security isolation S i v Determined together, and is formulated as H i v ＝κ 1 P i v +κ 2 S i v Therein is disclosedMedium kappa 1 +κ 2 ＝1，κ 1 、κ 2 The value of (b) is determined according to actual conditions. Both isolation classes can be divided into 5 classes, the higher the class, the greater the corresponding isolation requirements.
Determination of performance isolation level:
and setting the ratio of the resources required by the virtual nodes to the remaining resources as a performance isolation coefficient. Let y i A total of k virtual nodes, when the first virtual node n y il Is arranged at server n s l When above, n y i,l Coefficient of performance isolation of
As follows:
for different virtual nodes, the weight coefficient beta is adopted to adjust the virtual nodes, and beta 1 +β 2 +β 3 ＝1。
The closer to 0, the higher the isolation of performance. The requirements of each node on resources are different, the obtained performance isolation coefficient calculation results are naturally different, and the maximum value in each node is taken
Value as y i And judging the performance isolation level. According to
Value of (d) isolates the performance class P i v Is divided into 5 grades
Determination of the security isolation level:
for a certain Network Slice Instance (NSI), if the number of slices with which it shares resources is larger, it is more likely to encounter a malicious attack. For y i K virtual nodes in the network, deploying them on respective serversSetting up maximum deployment on each server
A virtual node, thus with y i The number of network slice instances that can coexist is:
according to
The value range of (A) divides the security isolation level S into 5 levels
(2) Setting of variables
Now the ith network slice instance y i Is laid out physically to network u s Upper, y i There are k virtual nodes, u s There are n physical nodes, and two variables are set. (1) Alpha is alpha i,l,k : if y i The first virtual node n v i，l Normal mapping to u s The kth server
When above, α i,l,k 1 is taken, and alpha is not taken i,l,k ＝0。②β i,ef,ζ : if y i Virtual link of l u i,ef Normal mapping to u s When the physical link is zeta, take beta i,ef,ζ Is 1.
(3) Establishing an objective function
From a cost perspective, minimizing the cost required for deployment is our goal
In the above formula, virtual nodes are deployed
The cost is omega y i,l Deploying virtual links
The total cost of
(4) Establishing constraint conditions
Formula (12) shows that when y i The first virtual node of (1), n v i，l Mapping to u s The kth server
When the water-saving agent is used in the water-saving process,
the residual resources are more than or equal to the corresponding virtual resources required by the resources; equation (13) shows that the performance isolation coefficients of the new and old nodes are less than or equal to the value of the acceptable maximum coefficient when the nodes are deployed; equation (14) indicates the isolation class requirement, indicating that none of the other NSIs that coexist with the new and old NSIs exceed the corresponding maximum. Equation (15) is a constraint condition for the isolation level, and guarantees the overall requirement.
And (4) solving a final deployment result by using a genetic algorithm according to the constraint condition and the objective function, and realizing by using VLAN (virtual local area network) tags and slice marks based on the existing network mechanism. Different network slices have unique labels. And different VLANs are used for isolation, so that logical channel division and network isolation are realized, and network bandwidth resources are shared.
The specific implementation method of the hard isolation of the slices comprises the following steps:
with the Slot-based FlexE isolation technique, flexE is divided into 20 slots per 100G physical PMD, with its Shim layer having n × 10 slots of 5G. The Slot configuration of the Shim layer can support the requirements of various services, and the hard isolation between the network slices of the power multi-service is realized.
In this embodiment, fig. 1 shows a 5G network slicing technology architecture constructed according to a "white paper of 5G network architecture design".
In order to verify the effectiveness of the proposed method, it is assumed that an operator simultaneously constructs a plurality of network slices, the total number of resources is 16, the number of resources allocated to each network slice is 5, the remaining resources need to be allocated according to the priority of users, and each network slice has 6 online users.
Fig. 2 shows the scenario we construct.
Table 1 values of the parameters we set in the network slice simulation.
Table 1 simulation parameter setting table
The test results of the distribution congestion interruption probability of the three resource distribution models are obtained according to the application of the risk evaluation method, the results are obtained according to the average value of the experiments after 7 times of experiments, as shown in table 2, the average congestion interruption probability distribution of the three resource distribution models is 0.24, 0.17 and 0.03, and the congestion probability of the design model is obviously lower than that of the two comparison models, so that the efficiency and the safety are higher.
TABLE 2 assignment of Congestion interruption probability quantitative comparison results
Fig. 3 shows statistical comparison results of network slice resource allocation amounts of the three allocation methods, and three experimental results are combined, so that the constructed 5G network slice resource optimal allocation model based on the smart grid has more resource allocation amounts, that is, has greater throughput.
Fig. 4 is a flow chart of a discrete particle swarm optimization algorithm based on genetic algorithm optimization, which is used in the solution of the soft isolation constraint conditions, and the final deployment result is solved by using the method.
Fig. 5 shows the variation of the sum of the deployment costs of different methods, as shown by the simulation results. It can be seen that as the number of NSI requests increases, the sum of deployment costs tends to increase, but the sum of deployment costs of the method herein increases at a rate lower than that of the security level-based virtual machine live migration method and the coexistence minimization method, and the coexistence minimization method increases at the highest rate.
Fig. 6 shows simulation results, which show the comparison of the profit and cost under different methods. It can be seen that as the number of required network slice instances increases, the revenue cost increases for all three methods, but the revenue cost of the method proposed by us is the highest, and the effect is the best.
Fig. 7 shows that a flexible ethernet (FlexE) -based technology is adopted in the hard isolation scheme, and a physical ethernet port is divided into a plurality of hard isolation pipelines, so that the network has the advantage of ethernet statistical multiplexing, and has good exclusive timeslot and isolation.
It should be emphasized that the embodiments described herein are illustrative and not restrictive, and thus the present invention includes, but is not limited to, the embodiments described in this detailed description, as well as other embodiments that can be derived by one skilled in the art from the teachings herein, and are within the scope of the present invention.
Claims (9)
1. A5G multi-service slice resource allocation and isolation method is characterized in that: the method comprises the following steps:
step 1, building a 5G network slice structure;
step 2, building a 5G network slice structure based on the step 1, and designing a resource allocation controller on an NFV virtual layer;
step 3, slice resources are collected at the NFV layer, and resource mapping integration processing is carried out on the slice resources with the minimum total bandwidth consumption as an optimization target, so that the resource utilization rate of the whole mapping process is improved;
step 4, selecting a resource allocation channel after resource mapping and integrating processing;
step 5, calculating the user priority according to the required service;
step 6, taking the resource which is mapped and processed as an object, and scheduling the resource in the partitioned resource distribution channel to maximize the utility function;
step 7, performing resource optimization allocation according to the processing results of the steps;
and 8, after the resource allocation is completed, carrying out slice isolation according to the service requirement.
2. The method for allocating and isolating resources of a 5G multi-service slice according to claim 1, wherein: the 5G network slice structure in the step 1 consists of a basic framework layer, an NFV virtual layer, a network slice layer and an actual service layer;
3. the method for allocating and isolating resources of a 5G multi-service slice according to claim 1, wherein: the resource allocation controller in the step 2 is divided into a central controller and a plurality of local controllers connected with the central controller; and the central controller and the local controller in the step 2 interact in real time to acquire all information of the whole network, give a corresponding distribution scheme according to the information, and then output the distribution scheme to the local controller, thereby realizing dynamic distribution of slice resources of each local bearer network service.
4. The method for allocating and isolating resources of a 5G multi-service slice according to claim 1, wherein: the specific steps of the step 3 comprise:
(1) Decomposing the network mapping request into a plurality of star sub-virtual network requests:
using undirected graph G p To represent a 5G slice network, assume that the total amount of allocated resources of the slice network is W (m) j p ) Distributed over the network node, using bandwidth B (m) j p ,m k p ) Represents the underlying node m j p And m k p The physical link between them, thereby obtaining the slicing structure in the multi-service network, wherein the virtual layer uses undirected graph G d The process of mapping from the virtual layer request to the underlying physical resource network is shown as follows:
G d ＝(N v ,E v )→G p ＝(N p ,E p ) (1)
n in the formula (1) v And E v Respectively, a set of virtual layer nodes and links.
(2) Performing source mapping integration treatment by taking the minimum total bandwidth consumption as an optimized target resource:
during the resource mapping integration, the residual bandwidth resources of the virtual node links are calculated as follows:
in the formula (2), the reaction solution is,
and
respectively representing the total link and the occupied bandwidth, M v Is the set of virtual nodes in the mapping process at the moment; in this process, resource constraint is required, that is, the underlying physical network needs to have enough remaining resources to satisfy the consumption of the virtual network, which is expressed as:
R E (M E (e v ))≥c(e v ) (3)
when the virtual resource request has a plurality of effective mappings, the resource utilization rate of the whole mapping process can be improved by taking the minimum total bandwidth consumption as a target, so that the mapping result of each block resource in the power multi-service slice network is obtained, and each block resource can be classified according to the mapping characteristics.
5. The method for allocating and isolating resources of a 5G multi-service slice according to claim 1, wherein: the specific steps of the step 4 comprise:
(1) Allocating a time-varying random channel:
taking into account the time-varying random channel in the allocation process, order g ks (t) is the channel gain of user k when the time slot requests service, and satisfies the following conditions:
in equation (4), G is the channel state set, P (G) i ) Indicates that the channel state is g i The probability of (d); order to
Representing the gain of each user at time t;
(2) According to the result of allocating time-varying random channels, considering whether the average gain of the channels calculates the residual bandwidth of the link meets the requirement of slice resource amount, selecting the allocation channels of the resources:
the formula for calculating the remaining bandwidth of the link is:
in (5), BW (l) s ) Is the total bandwidth of the channel and,
the bandwidth used for the link. In the real-time resource allocation process, the real-time gains existing in different time slots are considered, and if the quantity of slice resources to be allocated is less than that
The channel can be selected as a transmission channel of the resource, otherwise, other allocation channels meeting the conditions need to be reselected.
6. The method for allocating and isolating resources of a 5G multi-service slice according to claim 1, wherein: the specific method of the step 5 comprises the following steps:
and (3) taking the weight omega of the slice to which the user belongs as a unit, and distributing network resources according to the priority of the service required by the user: comparing the priorities of the users by using the interval time of resource scheduling transmission, allocating resources according to the calculation result of the priorities, and expressing the priorities of the users by using the calculation mode of (6):
wherein the variable S u And S U The total demand for user u and all users in the entire 5G network.
7. The method for allocating and isolating resources of a 5G multi-service slice according to claim 1, wherein: the specific method of the step 6 comprises the following steps:
using utility function V (E) s ) Describing the quality of the slice scheduling process, the goal of resource scheduling to be realized is to make V (E) s ) The sum of which is maximum, namely:
in the formula, E s E is the sum of the resource scheduling efficiency for the transmission efficiency of a single slice. The slice weight ω is used to describe the smart grid's ability to slice at a certain time. The expression of the mesh weight value is:
wherein, P 0 Number of bandwidth resource blocks, P, calculated for a slice i Representing the average value of the bandwidth resource blocks during the time when i varies from 0 to i-1. The weighting coefficients being alpha, N 0 And N i-1 Is the number of bandwidth resource blocks, lambda, in the whole resource scheduling process and i-1 scheduling time interval i Is the utilization of the bandwidth resource block.
8. The method for allocating and isolating resources of a 5G multi-service slice according to claim 1, wherein: the specific method of the step 7 comprises the following steps:
distributing resources required by users by using a semi-static method, setting the total number of the owned resources to be L, and performing fixed distribution according to factors such as slice types, network capacity and the like to meet the minimum essential requirements required by each user; and recording the remaining available resources as L' after the first round of distribution, and distributing again from large to small according to the priority result until all distribution is finished. And (4) performing channel optimization by the users with high priority, wherein in each network slice, the users of each network slice are sequentially allocated with resources according to the priority obtained by the formula (6), and the users with higher priority can obtain good channels until the residual resources are 0.
9. The method for allocating and isolating resources of a 5G multi-service slice according to claim 1, wherein: the specific steps of the step 8 comprise a slicing soft isolation part and a slicing hard isolation part:
the specific implementation steps of slice soft isolation comprise:
(1) Determination of isolation level
Example slice representation y i Isolation class H of slice i v By its performance isolation level P i v Level of security isolation S i v Determined together, and is formulated as H i v ＝κ 1 P i v +κ 2 S i v Wherein κ is 1 +κ 2 ＝1，κ 1 、κ 2 The value of (a) is determined according to the actual situation. The two isolation grades can be divided into 5 grades, and the higher the grade is, the greater the corresponding isolation requirement is;
(1) determination of performance isolation level:
setting the ratio of the resources required by the virtual nodes to the rest of the resources as a performance isolation coefficient, and setting y i A total of k virtual nodes, when the first virtual node n y il Is arranged at server n s l When above, n y i,l Coefficient of performance isolation of
As follows:
for different virtual nodes, the weight coefficient beta is adopted to adjust the virtual nodes, and beta 1 +β 2 +β 3 ＝1。
Closer to 0, the higher the isolation of performance. The requirements of each node on resources are different, the obtained performance isolation coefficient calculation results are naturally different, and the maximum value in each node is taken
Value as y i Judging the performance isolation level; according to
Value of (d) is to isolate the performance class P i v There are 5 levels.
(2) Determination of the security isolation level:
for y i The k virtual nodes are deployed on the servers, and the maximum number of the virtual nodes is arranged on each serverDeploying a net
A virtual node, thus i The number of network slice instances that can coexist is:
according to
The value range of (A) divides the security isolation level S into 5 levels
(2) Setting of variables
Now the ith network slice instance y i Is laid out physically to network u s Upper, y i There are k virtual nodes, u s There are n physical nodes, and two variables are set:
①α i,l,k : if y i The first virtual node n v i，l Normal mapping to u s Of the kth server
When above, α i,l,k 1 is taken, if not, alpha is taken i,l,k ＝0；
②β i,ef,ζ : if y i Virtual link of l u i,ef Normal mapping to u s When the physical link is zeta, take beta i,ef,ζ Is 1;
(3) Establishing an objective function
From a cost perspective, minimizing the cost required for deployment is targeted
In the above equation, a virtual node n is deployed v i,l The cost is omega y i,l Deploying virtual links
The total cost of (A) is
(4) Establishing constraint conditions
Formula (12) shows that when y i The first virtual node of (1), n v i，l Mapping to u s The kth server
When the pressure is applied to the upper part of the body,
the residual resources are more than or equal to the corresponding virtual resources required by the residual resources; equation (13) illustrates that the performance isolation coefficients of the new node and the old node are less than or equal to the value of the acceptable maximum coefficient when the nodes are deployed; equation (14) indicates the isolation class requirement, indicating that no other NSI coexisting with the new and old NSI exceeds the corresponding maximum; equation (15) is a constraint condition for the isolation level, and guarantees the overall requirement.
According to the constraint conditions and the objective function, a final deployment result is obtained by using a genetic algorithm, and based on the existing network mechanism, VLAN (virtual local area network) tags and slice marks are used for realizing the deployment; different network slices have unique labels; and different VLANs are used for isolation, so that logical channel division and network isolation are realized, and network bandwidth resources are shared.
The specific implementation method of the hard isolation of the slices comprises the following steps:
by means of a time Slot-based Flexe isolation technique, flexe is divided into 20 slots per 100G physical PMD, and the Shim layer of the Flexe has n multiplied by 10 time slots of 5G; the Slot configuration of the Shim layer can support the requirements of various services, and the hard isolation between the network slices of the power multi-service is realized.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210874625.5A CN115460088A (en) | 2022-07-25 | 2022-07-25 | 5G power multi-service slice resource allocation and isolation method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210874625.5A CN115460088A (en) | 2022-07-25 | 2022-07-25 | 5G power multi-service slice resource allocation and isolation method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115460088A true CN115460088A (en) | 2022-12-09 |
Family
ID=84296228
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210874625.5A Pending CN115460088A (en) | 2022-07-25 | 2022-07-25 | 5G power multi-service slice resource allocation and isolation method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115460088A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116208959A (en) * | 2023-05-04 | 2023-06-02 | 中建五洲工程装备有限公司 | Digital intelligent manufacturing management method and system based on 5G private network |
| CN116436782A (en) * | 2023-06-09 | 2023-07-14 | 中国电信股份有限公司四川分公司 | Deterministic network transmission method for embodying business willingness |
| CN117098239A (en) * | 2023-10-17 | 2023-11-21 | 国网信息通信产业集团有限公司 | Power scene-oriented wireless resource double-layer isolation distribution method and system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111131258A (en) * | 2019-12-26 | 2020-05-08 | 中移(成都)信息通信科技有限公司 | Safe private network architecture system based on 5G network slice |
| CN113055887A (en) * | 2021-05-18 | 2021-06-29 | 全球能源互联网研究院有限公司 | Network channel safety protection system for electric power 5G application |
| CN114268548A (en) * | 2021-12-24 | 2022-04-01 | 国网河南省电力公司信息通信公司 | Network slice resource arranging and mapping method based on 5G |
-
2022
- 2022-07-25 CN CN202210874625.5A patent/CN115460088A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111131258A (en) * | 2019-12-26 | 2020-05-08 | 中移(成都)信息通信科技有限公司 | Safe private network architecture system based on 5G network slice |
| CN113055887A (en) * | 2021-05-18 | 2021-06-29 | 全球能源互联网研究院有限公司 | Network channel safety protection system for electric power 5G application |
| CN114268548A (en) * | 2021-12-24 | 2022-04-01 | 国网河南省电力公司信息通信公司 | Network slice resource arranging and mapping method based on 5G |
Non-Patent Citations (4)
| Title |
|---|
| 李锦煊等: "基于智能电网的5G网络切片资源优化分配模型构建及仿真", 自动化与仪器仪表, no. 11, pages 36 - 39 * |
| 段宏等: "FlexE技术及其在5G承载网中的应用探析", 邮电设计技术, no. 3, pages 80 - 85 * |
| 潘启润等: "基于隔离等级的网络切片部署方法", 网络与信息安全学报, vol. 6, no. 2, pages 96 - 105 * |
| 陶志强等: "泛在电力物联网前沿安全技术", 中国电信业, no. 7, 31 July 2020 (2020-07-31), pages 71 - 73 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116208959A (en) * | 2023-05-04 | 2023-06-02 | 中建五洲工程装备有限公司 | Digital intelligent manufacturing management method and system based on 5G private network |
| CN116436782A (en) * | 2023-06-09 | 2023-07-14 | 中国电信股份有限公司四川分公司 | Deterministic network transmission method for embodying business willingness |
| CN116436782B (en) * | 2023-06-09 | 2023-09-29 | 中国电信股份有限公司四川分公司 | Deterministic network transmission method for embodying business willingness |
| CN117098239A (en) * | 2023-10-17 | 2023-11-21 | 国网信息通信产业集团有限公司 | Power scene-oriented wireless resource double-layer isolation distribution method and system |
| CN117098239B (en) * | 2023-10-17 | 2024-03-19 | 国网信息通信产业集团有限公司 | Power scene-oriented wireless resource double-layer isolation distribution method and system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN115460088A (en) | 5G power multi-service slice resource allocation and isolation method | |
| CN111246586B (en) | Method and system for distributing smart grid resources based on genetic algorithm | |
| Cicconetti et al. | Bandwidth balancing in multi-channel IEEE 802.16 wireless mesh networks | |
| CN107113243A (en) | For the system and method using Virtual network operator managing network flow | |
| CN113784373B (en) | Combined optimization method and system for time delay and frequency spectrum occupation in cloud edge cooperative network | |
| EP1690350A1 (en) | Methods and systems fro frequency and time division access | |
| CN107135056B (en) | Anycast service resource allocation method for reducing frequency spectrum fragments and time delay | |
| CN109743751B (en) | Resource allocation method and device for wireless access network | |
| CN112291791B (en) | Power communication mesh bandwidth resource allocation method based on 5G slice | |
| CN105897612A (en) | Multi-service dynamic bandwidth allocation method and system based on SDN (Software Defined Network) | |
| CN105898807A (en) | Access point selection and resource distribution combined self-healing method in ultra-dense network | |
| Ayyagari et al. | Admission control with priorities: Approaches for multi‐rate wireless systems | |
| RU2598293C1 (en) | Method and apparatus for transmitting standard configuration data of improved system of selecting a transmitting protocol | |
| CN113709885B (en) | Multi-service network resource allocation method | |
| CN108880895B (en) | SDN joint routing selection and network function deployment method based on user flow transmission overhead optimization | |
| Shi et al. | Hierarchical auction and dynamic programming based resource allocation (HA&DP-RA) algorithm for 5G RAN slicing | |
| CN113890827B (en) | Power communication resource allocation method, device, storage medium and electronic equipment | |
| Zhang et al. | Energy efficiency and delay optimization of virtual slicing of fog radio access network | |
| CN114884818A (en) | Three-layer soft slicing system and method based on time slot fine granularity in deterministic network | |
| Wang et al. | Radio resource management methods for ultra-reliable low-latency communications in 5G LTE narrowband industrial internet of things | |
| Webster et al. | Optimal resource allocation for smart grid applications in high traffic wireless networks | |
| Parzy et al. | QoS support in radio resource sharing with Cournot competition | |
| TWI239740B (en) | Method and apparatus for priority management of system algorithms in real time | |
| Aissa et al. | Dynamic spectrum hole management in cognitive radio | |
| Wang et al. | Improving the data scheduling efficiency of the ieee 802.16 (d) mesh network |
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 |