CN112636961A - Virtual network resource allocation method based on reliability and distribution strategy under network slice - Google Patents

Virtual network resource allocation method based on reliability and distribution strategy under network slice Download PDF

Info

Publication number
CN112636961A
CN112636961A CN202011478834.5A CN202011478834A CN112636961A CN 112636961 A CN112636961 A CN 112636961A CN 202011478834 A CN202011478834 A CN 202011478834A CN 112636961 A CN112636961 A CN 112636961A
Authority
CN
China
Prior art keywords
virtual
reliability
node
link
network
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202011478834.5A
Other languages
Chinese (zh)
Other versions
CN112636961B (en
Inventor
陆继钊
孟慧平
吴晨光
李文萃
刘越
党芳芳
邵苏杰
徐思雅
杨勇
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
State Grid Corp of China SGCC
Information and Telecommunication Branch of State Grid Henan Electric Power Co Ltd
Original Assignee
State Grid Corp of China SGCC
Information and Telecommunication Branch of State Grid Henan Electric Power Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by State Grid Corp of China SGCC, Information and Telecommunication Branch of State Grid Henan Electric Power Co Ltd filed Critical State Grid Corp of China SGCC
Priority to CN202011478834.5A priority Critical patent/CN112636961B/en
Publication of CN112636961A publication Critical patent/CN112636961A/en
Application granted granted Critical
Publication of CN112636961B publication Critical patent/CN112636961B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08—Configuration management of networks or network elements
    • H04L41/0893—Assignment of logical groups to network elements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention discloses a virtual network resource allocation algorithm based on reliability and a shunting strategy under network slicing, which comprises the following steps: establishing a virtual network resource allocation model comprising an underlying network and a virtual network; calculating the reliability of the bottom node according to the CPU resource of the bottom node and the bandwidth resource of the bottom link, and acquiring a bottom node reliability sequencing set; calculating the reliability of the virtual nodes and the virtual links according to the CPU resources required by the virtual nodes and the bandwidth resources required by the virtual links, and acquiring a virtual node reliability sequencing set and a virtual link reliability sequencing set; allocating resources for the virtual nodes according to the virtual node reliability sequencing set and the bottom layer node reliability sequencing set; and searching for an alternative path mapped by the virtual link, calculating a reliability coefficient according to the reliability probability value of the bottom link in the alternative path, and distributing resources for the virtual link by adopting a shunt strategy. The invention improves the reliability of the underlying network resources distributed by the virtual network.

Description

Virtual network resource allocation method based on reliability and distribution strategy under network slice
Technical Field
The invention relates to the technical field of power communication network resource management, in particular to a virtual network resource allocation method based on reliability and a shunting strategy under network slicing.
Background
The network slicing technique is a core technique of the 5G network. In a network slicing environment, existing underlying networks are divided into an underlying network and a virtual network. The underlying network provider is responsible for building basic network resources, and the virtual network provider rents the underlying network resources from the underlying network provider to quickly build a virtual network and deploy specific virtual network services, so that services are provided for users. How to allocate underlying network resources to a virtual network has become an important research content.
In order to improve the mapping success rate of the virtual Network, a document [ Chowdhury S R, Ahmed R, Shahrair N, et al.Revine: reaction of virtual Network embedding to elimination substrate bottonecks [ C ]//2017IFIP/IEEE Symposium on Integrated Network and Service Management (IM). IEEE,2017: 116-. In order to improve the resource utilization rate of the underlying network, the relation between a network resource allocation problem and a convolutional neural network model is analyzed in the documents [ Dolati M, Hassanpor S B, Ghaderi M, et al. DeepVinE: Virtual network allocation with depth requirement learning left [ C ]// IEEE INFOCOM 2019-IEEE Conference on Computer Communications workstations (INFOCOM WKSHPS) ] IEEE 2019:879 and 885 ], the network resource allocation problem is modeled by using an image recognition method, and a resource allocation algorithm based on deep learning is proposed. In view of the problem of resource allocation affected by the dynamics of the underlying network, the literature [ Jahani A, Khanli L M, Hagh M T, et al EE-CTA: Energy efficiency, current and topology-aware virtual network embedding as a multi-objective optimization algorithm [ J ]. Computer Standards & Interfaces,2019.1-17] proposes a resource allocation algorithm based on genetic algorithm, which has better dynamic adaptability. In terms of resource allocation in a dynamic network environment, the problem is solved by adopting a dynamic programming theory in the literature [ Dehury C K, Sahoo P K.DYVINE: fixed-based dynamic network embedding in closed computing [ J ]. IEEE Journal on Selected Areas in Communications,2019,37(5):1029-1045 ]. In the aspect of specific network environment application, a document [ Soto P, Botero J F.Greeny random sized path-transmitting virtual optical network embedding on EON-based substrate network [ C ] In:2017IEEE collective connectivity on Communications and Computing (COLCOM). Colombia: IEEE,2017:1-6 ] applies a network virtualization technology to the field of resource management of an optical network, and proposes a resource allocation algorithm with a migration function, so that the resource utilization rate of the optical network is better improved. For a specific end-to-end network resource allocation problem, a document [ w.guan, x.wen, l.wang, et al.a service-oriented deployment policy of end-to-end network sliding on complex network the problem of virtual network resource management [ J ]. IEEE Access,2018,6: 19691-. In the field of distributed resource management, documents [ Mijumbi R, Serratat J, Gorricho J L, et al. design and evaluation of algorithms for mapping and scheduling of virtual Network functions [ C ]// procedures of the 20151 st IEEE Conference on Network software (NetSoft). IEEE 2015:1-9 ] propose an adaptive virtual Network resource allocation algorithm to solve the problem of low Network reliability.
Currently, a lot of research results have been obtained in the existing research, but because the reliability requirement of part of the virtual network services on the underlying network is high, the existing research solves the problem of low network reliability, but still does not well solve the problem of improving the reliability of the virtual network for obtaining the underlying network resources.
Disclosure of Invention
The invention provides a virtual network resource allocation method based on reliability and a shunting strategy under a network slice, aiming at the technical problem that a lower layer network often allocates network resources which can not meet the reliability requirement for more virtual networks.
A virtual network resource allocation method based on reliability and a distribution strategy under a network slice comprises the following steps:
s1, establishing a virtual network resource allocation model, wherein the virtual network resource allocation model comprises an underlying network and a virtual network, the underlying network comprises underlying nodes and underlying links, and the virtual network comprises virtual nodes and virtual links;
s2, calculating the reliability of the bottom node according to the CPU resource of the bottom node and the bandwidth resource of the bottom link, and acquiring a bottom node reliability sequencing set according to the reliability of the bottom node; respectively calculating the reliability of the virtual nodes and the reliability of the virtual links according to the CPU resources required by the virtual nodes and the bandwidth resources required by the virtual links, and acquiring a virtual node reliability sequencing set and a virtual link reliability sequencing set according to the reliability of the virtual nodes and the virtual links;
s3, sequentially allocating resources for the virtual nodes in the virtual network according to the virtual node reliability sequencing set and the bottom layer node reliability sequencing set obtained in the step S2;
s4, alternative paths between bottom layer nodes mapped by virtual links in the virtual network are searched, the reliability coefficient of each alternative path is calculated according to the reliability probability value of the bottom layer link in the alternative paths, and resources are distributed to the virtual links by adopting a shunt strategy according to the reliability coefficient of each alternative path and the virtual link reliability sequencing set.
The invention has the beneficial effects that:
according to the reliability of the geographical location area where the underlying network resources are located, the reliability of the underlying network resources is analyzed and calculated, the resources are distributed to the virtual nodes according to the calculated reliability of the underlying network resources, and the reliability of the virtual network is improved. The resources are distributed to the virtual links by adopting the shunt strategy based on the reliability coefficient and the virtual link reliability sequencing set, so that the method has better application effect and performance, can distribute the underlying network resources meeting the reliability requirement for more virtual networks under different network scales and network reliability environments, and improves the reliability of the underlying network resources distributed by the virtual networks.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
FIG. 1 is a schematic flow chart of the present invention.
Fig. 2 is a schematic diagram of the impact of underlying network size on algorithm performance.
Fig. 3 is a schematic diagram of the impact of underlying network reliability on algorithm performance.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to fig. 1 to 3 in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all embodiments. All other embodiments, which can be obtained by a person skilled in the art without inventive effort based on the embodiments of the present invention, are within the scope of the present invention.
A method for allocating virtual network resources based on reliability and offloading strategies under a network slice, as shown in FIG. 1, includes the following steps:
s1, establishing a virtual network resource allocation model, wherein the virtual network resource allocation model comprises an underlying network and a virtual network under the network slice environment, and the underlying network uses GS＝(NS,ES) Representing, virtual network usage GV＝(NV,EV) Represents; the underlying network comprises underlying nodes and underlying links, the underlying nodes and the underlying links respectively provide CPU resources and bandwidth resources for the virtual network, and the virtual network comprises virtual nodes and virtual links which can respectively apply for the CPU resources of the virtual nodes and the bandwidth resources of the virtual links from the underlying network; wherein N isSRepresenting a set of underlying nodes, ESRepresenting a set of underlying links, NVRepresenting a set of virtual nodes, EVRepresenting a set of virtual links.
The method for distributing resources for virtual network by underlying network is virtual network mapping method, and adopts Map (N)V→NS,EV→PS) Is shown in which N isV→NSIndicating that the underlying node allocates CPU resources for the virtual node, EV→PSRepresents the underlying path PSAllocating bandwidth resources for the virtual link, the bottom path PSIs a path formed by the bottom layer links connected by the two bottom layer nodes mapped by the two end points of the virtual links.
S2, evaluating the reliability of the network: calculating the reliability of the bottom node according to the CPU resource of the bottom node and the bandwidth resource of the bottom link, and acquiring a bottom node reliability sequencing set according to the reliability of the bottom node; respectively calculating the reliability of the virtual nodes and the reliability of the virtual links according to the CPU resources required by the virtual nodes and the bandwidth resources required by the virtual links, and acquiring a virtual node reliability sequencing set and a virtual link reliability sequencing set according to the reliability of the virtual nodes and the virtual links, wherein the method comprises the following steps:
s21, calculating all bottom base according to the CPU resource of the bottom node and the bandwidth resource of the bottom linkThe reliability of the layer nodes and the bottom layer links is respectively arranged in descending order according to the numerical value of the reliability, and a bottom layer node reliability sequencing set N is obtainedorderAnd bottom layer link reliability ordering set Eorder。
The reliability calculation formula of the bottom node is as follows:
Figure BDA0002836736530000041
in the formula (I), the compound is shown in the specification,
Figure BDA0002836736530000042
represents the ith underlying node
Figure BDA0002836736530000043
Is reliable, and
Figure BDA0002836736530000044
szrepresenting underlying nodes
Figure BDA0002836736530000045
The reliability probability value in the geographic position area z is in the range of [0, 1%]，
Figure BDA0002836736530000046
Representing underlying nodes
Figure BDA0002836736530000047
The CPU resource is provided, and the CPU resource,
Figure BDA0002836736530000048
representing underlying nodes
Figure BDA0002836736530000049
Adjacent link bandwidth resources.
The reliability probability value is obtained by calculation according to the fault occurrence probability, the sum of the reliability probability value of a geographic position area and the fault occurrence probability of the geographic position area is 1, and the fault occurrence probability can be obtained by an underlying network operator according to operation experience of years. For example, for the bottom link, when the optical fiber resource of the geographic location area z belongs to an overhead resource, the probability of failure of the bottom link of the geographic location area z is high; for the bottom layer nodes, when the power supply of the geographic position area Z belongs to civil electricity, the probability of the failure of the bottom layer nodes of the geographic position area Z is high, Z belongs to Z, and Z represents the set of all the geographic position areas.
The bottom layer node
Figure BDA00028367365300000410
Adjacent link bandwidth resources of
Figure BDA00028367365300000411
The calculation formula of (2) is as follows:
Figure BDA00028367365300000412
in the formula (I), the compound is shown in the specification,
Figure BDA00028367365300000413
represents the jth underlying link, an
Figure BDA00028367365300000414
Representing underlying links
Figure BDA00028367365300000415
The bandwidth resources that are available for the user,
Figure BDA00028367365300000416
representing underlying nodes
Figure BDA00028367365300000417
Of the neighboring links.
Because the reliability of the bottom node is related to the CPU resource and the adjacent link bandwidth resource, when the CPU resource of the bottom node is more, the bottom node has more redundant resources, and the reliability of the bottom node can be improved; when the bandwidth resources of the adjacent links of the bottom node are more, the bottom node has more bottom link routing strategies, and the reliability of the bottom node is also improved.
The reliability of the bottom link is calculated by the following formula:
Figure BDA00028367365300000418
in the formula (I), the compound is shown in the specification,
Figure BDA00028367365300000419
representing underlying links
Figure BDA00028367365300000420
The reliability of the operation of the system is improved,
Figure BDA00028367365300000421
representing underlying links
Figure BDA00028367365300000422
Degree of link of, is the underlying link
Figure BDA00028367365300000423
Of the two end points, η1Denotes a modulation factor, s 'for adjusting the degree of the bottom link'zRepresenting underlying links
Figure BDA00028367365300000424
The reliability probability value in the geographic position area z is in the range of [0, 1%]。
Because the reliability of the bottom layer link is related to the link degree and the bandwidth resource of the bottom layer link, the larger the link degree of the bottom layer link is, the more the number of the selectable links of the current bottom layer link is, thereby improving the reliability of the bottom layer link; the larger the bandwidth resource of the bottom layer link is, the more the bandwidth resource of the bottom layer link is, the better the reliability is.
S22, calculating the reliability of all virtual nodes and virtual links according to the CPU resource required by the virtual nodes and the bandwidth resource required by the virtual links, and respectively arranging the reliability of the virtual nodes and the reliability of the virtual links in descending order according to the numerical value of the reliability to obtain a virtual node reliability ordering set
Figure BDA0002836736530000051
And virtual link reliability ordered set
Figure BDA0002836736530000052
The reliability of the virtual node is calculated according to the following formula:
Figure BDA0002836736530000053
in the formula (I), the compound is shown in the specification,
Figure BDA0002836736530000054
representing the ith virtual node
Figure BDA0002836736530000055
Is reliable, and
Figure BDA0002836736530000056
representing virtual nodes
Figure BDA0002836736530000057
The CPU resources that need to be applied for the underlying node,
Figure BDA0002836736530000058
representing virtual nodes
Figure BDA0002836736530000059
Adjacent link bandwidth resources.
The virtual node
Figure BDA00028367365300000510
Adjacent link bandwidth resources of
Figure BDA00028367365300000511
The calculation formula of (2) is as follows:
Figure BDA00028367365300000512
in the formula (I), the compound is shown in the specification,
Figure BDA00028367365300000513
represents the jth virtual link, an
Figure BDA00028367365300000514
Representing virtual nodes
Figure BDA00028367365300000515
Of the set of adjacent links of the network,
Figure BDA00028367365300000516
representing virtual links
Figure BDA00028367365300000517
Bandwidth resources are required to be applied for the underlying link.
The reliability of the virtual link is calculated by the following formula:
Figure BDA00028367365300000518
in the formula (I), the compound is shown in the specification,
Figure BDA00028367365300000519
representing virtual links
Figure BDA00028367365300000520
The reliability of the operation of the system is improved,
Figure BDA00028367365300000521
representing virtual links
Figure BDA00028367365300000522
Is the sum of the degrees of the two end points of the virtual link, eta2Indicating an adjustment factor to adjust the degree of the virtual link.
Because the geographical location area of the virtual network resource is determined by the resource allocation algorithm, the reliability probability value of the geographical location area of the network resource is not considered when the reliability of the virtual node and the reliability of the virtual link are calculated.
S3, virtual node resource allocation: allocating resources to the virtual nodes in the virtual network in sequence according to the virtual node reliability ordered set and the bottom layer node reliability ordered set obtained in the step S2, including the following steps:
s31, sorting the set from the virtual node reliability
Figure BDA00028367365300000523
The first virtual node is taken out, and the reliability sequencing set of the virtual nodes is updated
Figure BDA00028367365300000524
S32, sorting the set N from the bottom level node reliability according to the CPU resource needed by the virtual node taken out in the step S31orderSelecting the bottom node with the highest reliability to allocate CPU resource to the virtual node, and then sorting the set N in the reliability of the bottom nodeorderMarking the bottom node as unavailable;
when CPU resources are distributed to each virtual node, firstly confirming a bottom-layer node reliability sequencing set NorderJudging whether the bottom node with the maximum middle reliability value is an available node, judging whether the bottom node can meet the CPU resource required by the virtual node, and if so, allocating the bottom node to the virtual node; if not, sorting the set N according to the reliability of the bottom layer nodesorderThe magnitude sequence of the medium reliability is judged in turnWhether the bottom node can meet the CPU resource required by the virtual node or not is judged, and the available bottom node which can meet the requirement of the virtual node and has the maximum reliability of the CPU resource required by the virtual node is selected to allocate the resource for the virtual node. If the bottom node reliability ordering set NorderIf the CPU resource required by the virtual node cannot be met, the resource allocation of the virtual network fails. When allocating resources for virtual nodes, in order to ensure that different virtual nodes cannot be mapped to the same bottom node, when allocating resources for virtual nodes, the virtual nodes need to be sorted from the bottom node reliability ordering set NorderThe underlying nodes marked as unavailable and not yet assigned to a virtual node are available nodes.
S33, judging the reliability ordering set of the virtual nodes
Figure BDA0002836736530000061
And if the virtual node is not empty, resources are sequentially allocated to other virtual nodes according to the methods of the step S31 and the step S32 until the resource allocation of all the virtual nodes is completed.
S4, virtual link resource allocation: searching alternative paths corresponding to virtual links in a virtual network, calculating the reliability coefficient of each alternative path according to the reliability probability value of bottom layer links in the alternative paths, and distributing resources for each virtual link by adopting a shunt strategy according to the reliability coefficient of each alternative path and a virtual link reliability sequencing set, wherein the method comprises the following steps:
s41, sorting the set from the virtual link reliability
Figure BDA0002836736530000062
The first virtual link is taken out, and the reliability sequencing set of the virtual links is updated
Figure BDA0002836736530000063
S42, finding out two bottom nodes respectively mapped by the two end points of the virtual link taken out in the step S41 in the bottom network
Figure BDA0002836736530000064
And the bottom node
Figure BDA0002836736530000065
Wherein the bottom node
Figure BDA0002836736530000066
Denotes the ith1A bottom node, a bottom node
Figure BDA0002836736530000067
Represents i2A bottom node, i1≠i2；
S43, finding two bottom nodes
Figure BDA0002836736530000068
And the bottom node
Figure BDA0002836736530000069
All the alternative paths in between, put into the alternative path set
Figure BDA00028367365300000610
The alternative path is a bottom layer path, and the bottom layer path is formed by one or more bottom layer links. In an underlying network, there are typically multiple alternative routing paths from one node to another. The set of alternative paths
Figure BDA00028367365300000611
All alternative paths in (2) are optional paths.
S44, according to the alternative path set obtained in the step S43
Figure BDA00028367365300000612
Calculating the reliability coefficient of each alternative path according to the reliability of each alternative path;
the calculation formula of the reliability coefficient of the alternative path is as follows:
Figure BDA0002836736530000071
in the formula (I), the compound is shown in the specification,
Figure BDA0002836736530000072
represents the mth alternative path
Figure BDA0002836736530000073
The reliability of the operation of the system is improved,
Figure BDA0002836736530000074
representing from the underlying node
Figure BDA0002836736530000075
To the bottom layer node
Figure BDA0002836736530000076
The m-th alternative path of (2),
Figure BDA0002836736530000077
representing a set of alternate paths
Figure BDA0002836736530000078
The sum of the reliabilities of all the alternative paths in (c),
Figure BDA0002836736530000079
representing from the underlying node
Figure BDA00028367365300000710
To the bottom layer node
Figure BDA00028367365300000711
The set of alternative paths of (a) is,
Figure BDA00028367365300000712
represents the mth alternative path
Figure BDA00028367365300000713
The reliability coefficient of (2).
Mth alternative path
Figure BDA00028367365300000714
Reliability of (2)
Figure BDA00028367365300000715
The calculation formula of (2) is as follows:
Figure BDA00028367365300000716
in the formula (I), the compound is shown in the specification,
Figure BDA00028367365300000717
representing the current alternative path
Figure BDA00028367365300000718
The k-th underlying link included in (a),
Figure BDA00028367365300000719
representing underlying links
Figure BDA00028367365300000720
The reliability probability value of the geographical position area is in the value range of [0, 1%]，
Figure BDA00028367365300000721
Representing underlying links
Figure BDA00028367365300000722
The probability of whether the mobile terminal belongs to the geographic position area z is set to be {0,1 }; if it is
Figure BDA00028367365300000723
Representing underlying links
Figure BDA00028367365300000724
Belongs to a geographic location area z; if it is
Figure BDA00028367365300000725
Representing underlying links
Figure BDA00028367365300000726
Not in the geographical location area z.
S45, distributing resources for the virtual link by adopting a shunting strategy according to the bandwidth resources required by the virtual link taken out in the step S41 and the reliability coefficient of each alternative path obtained in the step S44;
the shunting strategy is that when resources are allocated to a virtual link, N bottom layer paths are selected to allocate the resources to the virtual link according to bandwidth resources required by the virtual link and the size of a reliability coefficient, wherein N is a positive integer, and the method comprises the following steps:
s45.1, from the alternative path set
Figure BDA00028367365300000727
The alternative path with the maximum reliability coefficient is selected and put into the optimal path set
Figure BDA00028367365300000728
Updating candidate path sets
Figure BDA00028367365300000729
S45.2, judging whether the bandwidth resources of the alternative paths selected in the step S45.1 meet the bandwidth resources required by the virtual links, and if so, collecting the optimal paths
Figure BDA00028367365300000730
The alternative path in (4) is allocated to the virtual link, and step S46 is executed; if not, calculating a first difference value between the bandwidth resource required by the virtual link and the bandwidth resource of the alternative path;
s45.3, from the updated alternative path set
Figure BDA00028367365300000731
The alternative path with the maximum reliability coefficient is selected, and the alternative path is added to the optimal path set
Figure BDA00028367365300000732
In (3), the set of candidate paths is updated again
Figure BDA00028367365300000733
S45.4, judging whether the bandwidth resources of the alternative paths selected in the step S45.3 meet the first difference calculated in the step S45.2, and if so, collecting the optimal paths
Figure BDA00028367365300000734
All the alternative paths in (a) are allocated to the virtual link, and step S46 is executed; if not, calculating a second difference value between the first difference value and the bandwidth resource of the alternative path selected in step S45.3 again, and selecting the alternative path for the virtual link according to the method of steps S45.3-S45.4 until the optimal path set
Figure BDA0002836736530000081
The sum of the bandwidth resources of all the alternative paths in (b) satisfies the bandwidth resources required by the virtual link.
If the alternative path set
Figure BDA0002836736530000082
If all the alternative paths in the network can not meet the bandwidth resource required by the virtual link, the resource allocation of the virtual network fails, and the resource is allocated to the next virtual network again.
And the distribution strategy is adopted to select the bottom layer path with high reliability to distribute the bottom layer path for the virtual link, so that the reliability and the distribution success rate of the virtual link can be obviously improved.
S46, judging the virtual link reliability ordering set
Figure BDA0002836736530000083
And if the virtual link is not empty, resources are sequentially allocated to other virtual links according to the method of the steps S41-S45 until the resource allocation of all the virtual links is completed.
In this embodiment, the bottom node
Figure BDA0002836736530000084
Bottom node
Figure BDA0002836736530000085
And the bottom node
Figure BDA0002836736530000086
All belong to a bottom node in a bottom network, and
Figure BDA0002836736530000087
the present embodiment uses GT-ITM tools to create both the underlying network and the virtual network. In terms of network topology, the number of bottom nodes is increased from 100 to 600 for an underlying network, and the bottom nodes are used for simulating network environments of different scales; the bottom layer link is generated by connecting any two bottom layer nodes with the probability of 0.2. For a virtual network, the number of virtual nodes obeys a uniform distribution of [5,10], and virtual links are generated by connecting any two virtual nodes with a probability of 0.3. In terms of network resources, the CPU resources of the underlying nodes and the bandwidth resources of the underlying links are subject to a uniform distribution [20,40] for the underlying network. For the virtual network, the CPU resource requests of the virtual nodes are subjected to uniform distribution of [1,5], and the bandwidth resource requests of the virtual links are subjected to uniform distribution of [1,10 ]. In order to simulate the reliability of the bottom nodes, 30% of the bottom nodes are randomly selected as unreliable nodes, and the reliability probability value of the geographical location area where the bottom nodes are located is set to obey the uniform distribution of [0.4,0.6 ].
The method comprises the steps of comparing the Virtual network resource allocation algorithm (VNRAAoRDS) with a constraint condition-based Virtual network resource allocation algorithm (VNRAoR) to achieve resource utilization maximization under the condition that the constraint condition of the Virtual network request is met, wherein the comparison index is the reliability of the Virtual network. The virtual network reliability refers to the reliability of the underlying network resources obtained by the virtual network, and the calculation method is the sum of the reliability probability values of the underlying network resources obtained by all the virtual networks and adopts normalization for processing. The larger the value of the virtual network reliability is, the more reliable the underlying network resources allocated by the virtual network are.
Fig. 2 shows the influence of the scale of the underlying network on the performance of the algorithm, the X axis represents the number of the underlying nodes, the value range is increased from 100 to 600, and the Y axis represents the reliability of the virtual network. As can be seen from fig. 2, the reliability of the underlying network resources obtained by the virtual network in the present invention is high, and with the increase of the number of underlying nodes, the reliability of the virtual network is gradually improved, and the correlation between the reliability of the virtual network and the network scale under the VNRAoR algorithm is not obvious. This is because the present invention fully considers the reliability of the underlying network resources when allocating resources to the virtual network, and adopts a offloading policy to perform resource allocation. When the network scale is increased, the alternative underlying network resources are correspondingly increased, so that more optimal underlying network resources can be selected for the virtual network. The VNRAoR algorithm aims at the utilization rate of the underlying network resources, and the correlation between the reliability of the underlying resources allocated to the virtual network and the network scale is not obvious.
Fig. 3 shows the influence of the reliability of the underlying network on the performance of the algorithm, where the X axis represents six reliability types of the underlying network when the number of the underlying nodes is 200, and the reliability probability values corresponding to the six reliability types respectively obey the uniform distribution of (0.6, 0.8), (0.5, 0.7), (0.4, 0.6), (0.3, 0.5), (0.2, 0.4), and (0.1, 0.3) for analyzing the influence of the reliability types of the underlying network on the reliability of the virtual network. As can be seen from fig. 3, as the reliability of the underlying network decreases, the reliability of the virtual network under both algorithms decreases. This is because when the underlying network reliability is reduced, the reliability of the underlying network resources allocated for the virtual network is reduced, but in all six underlying network environments, the virtual network reliability of the present invention is higher than the algorithm VNRAoR. The invention adopts the reliability evaluation and the shunting strategy to distribute the underlying network resources with higher reliability for the virtual network.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents, improvements and the like that fall within the spirit and principle of the present invention are intended to be included therein.

Claims (9)

1. A virtual network resource allocation method based on reliability and a distribution strategy under a network slice is characterized by comprising the following steps:
s1, establishing a virtual network resource allocation model, wherein the virtual network resource allocation model comprises an underlying network and a virtual network, the underlying network comprises underlying nodes and underlying links, and the virtual network comprises virtual nodes and virtual links;
s2, calculating the reliability of the bottom node according to the CPU resource of the bottom node and the bandwidth resource of the bottom link, and acquiring a bottom node reliability sequencing set according to the reliability of the bottom node; respectively calculating the reliability of the virtual nodes and the reliability of the virtual links according to the CPU resources required by the virtual nodes and the bandwidth resources required by the virtual links, and acquiring a virtual node reliability sequencing set and a virtual link reliability sequencing set according to the reliability of the virtual nodes and the virtual links;
s3, sequentially allocating resources for the virtual nodes in the virtual network according to the virtual node reliability sequencing set and the bottom layer node reliability sequencing set obtained in the step S2;
s4, alternative paths between bottom layer nodes mapped by virtual links in the virtual network are searched, the reliability coefficient of each alternative path is calculated according to the reliability probability value of the bottom layer link in the alternative paths, and resources are distributed to the virtual links by adopting a shunt strategy according to the reliability coefficient of each alternative path and the virtual link reliability sequencing set.
2. The method for allocating virtual network resources based on reliability and offloading policy under network slice according to claim 1, wherein the step S2 includes the following steps:
s21, calculating the reliability of all bottom nodes and bottom links according to the CPU resource of the bottom nodes and the bandwidth resource of the bottom links, and respectively arranging the reliability of the bottom nodes and the reliability of the bottom links in descending order according to the numerical value of the reliability to obtain a bottom node reliability ordering set and a bottom link reliability ordering set;
s22, calculating the reliability of all virtual nodes and virtual links according to the CPU resource required by the virtual nodes and the bandwidth resource required by the virtual links, and respectively arranging the reliability of the virtual nodes and the reliability of the virtual links in descending order according to the numerical value of the reliability to obtain a virtual node reliability ordering set and a virtual link reliability ordering set.
3. The method for allocating virtual network resources based on reliability and offload policy under network slice according to claim 1, wherein the reliability of the bottom node is calculated by the following formula:
Figure FDA0002836736520000011
in the formula (I), the compound is shown in the specification,
Figure FDA0002836736520000012
represents the ith underlying node
Figure FDA0002836736520000013
Reliability of (1), szRepresenting underlying nodes
Figure FDA0002836736520000014
The reliability probability value in the geographical location area z,
Figure FDA0002836736520000015
representing underlying nodes
Figure FDA0002836736520000016
The CPU resource is provided, and the CPU resource,
Figure FDA0002836736520000017
representing underlying nodes
Figure FDA0002836736520000018
Adjacent link bandwidth resources;
the reliability of the virtual node is calculated according to the following formula:
Figure FDA0002836736520000019
in the formula (I), the compound is shown in the specification,
Figure FDA0002836736520000021
representing the ith virtual node
Figure FDA0002836736520000022
The reliability of the operation of the system is improved,
Figure FDA0002836736520000023
representing virtual nodes
Figure FDA0002836736520000024
The CPU resources that need to be applied for the underlying node,
Figure FDA0002836736520000025
representing virtual nodes
Figure FDA0002836736520000026
Adjacent link bandwidth resources;
the reliability of the virtual link is calculated by the following formula:
Figure FDA0002836736520000027
in the formula (I), the compound is shown in the specification,
Figure FDA0002836736520000028
representing virtual links
Figure FDA0002836736520000029
The reliability of the operation of the system is improved,
Figure FDA00028367365200000210
representing virtual links
Figure FDA00028367365200000211
Degree of link, η2Indicating an adjustment factor to adjust the degree of the virtual link.
4. The method of claim 3, wherein the bottom node allocates resources of the virtual network based on reliability and offload policy under the network slice
Figure FDA00028367365200000212
Adjacent link bandwidth resources of
Figure FDA00028367365200000213
The calculation formula of (2) is as follows:
Figure FDA00028367365200000214
in the formula (I), the compound is shown in the specification,
Figure FDA00028367365200000215
represents the jth underlying link, an
Figure FDA00028367365200000216
Representing underlying links
Figure FDA00028367365200000217
The bandwidth resources that are available for the user,
Figure FDA00028367365200000218
representing underlying nodes
Figure FDA00028367365200000219
A set of adjacent links;
the virtual node
Figure FDA00028367365200000220
The calculation formula of the adjacent link bandwidth resource is as follows:
Figure FDA00028367365200000221
in the formula (I), the compound is shown in the specification,
Figure FDA00028367365200000222
represents the jth virtual link, an
Figure FDA00028367365200000223
Representing virtual nodes
Figure FDA00028367365200000224
Of the set of adjacent links of the network,
Figure FDA00028367365200000225
representing virtual links
Figure FDA00028367365200000226
Bandwidth resources are required to be applied for the underlying link.
5. The method for allocating virtual network resources based on reliability and offloading policy under network slice according to claim 1, wherein the step S3 includes the following steps:
s31, taking out the first virtual node from the virtual node reliability sequencing set, and updating the virtual node reliability sequencing set;
s32, selecting the bottom node with the highest available reliability from the bottom node reliability sequencing set according to the CPU resources required by the virtual node taken out in the step S31 to allocate the CPU resources to the virtual node;
and S33, judging whether the reliability sequencing set of the virtual nodes is empty, if so, finishing the resource allocation of the virtual nodes in the virtual network, and if not, allocating resources for other virtual nodes in sequence according to the methods of the step S31 and the step S32 until the resource allocation of all the virtual nodes is finished.
6. The method for allocating virtual network resources based on reliability and offloading policy under network slice according to claim 1, wherein the step S4 includes the following steps:
s41, taking out the first virtual link from the virtual link reliability sequencing set, and updating the virtual link reliability sequencing set;
s42, finding out two bottom nodes respectively mapped by the two end points of the virtual link taken out in the step S41 in the bottom network
Figure FDA0002836736520000031
And the bottom node
Figure FDA0002836736520000032
Wherein i1≠i2；
S43, finding two bottom nodes
Figure FDA0002836736520000033
And the bottom node
Figure FDA0002836736520000034
All the alternative paths in between, put into the alternative path set
Figure FDA0002836736520000035
S44, according to the alternative path set obtained in the step S43
Figure FDA0002836736520000036
Calculating the reliability coefficient of the alternative path according to the reliability probability value of the bottom link corresponding to each alternative path;
s45, distributing resources for the virtual link by adopting a shunting strategy according to the bandwidth resources required by the virtual link taken out in the step S41 and the reliability coefficient of each alternative path obtained in the step S44;
s46, judging whether the virtual link reliability sequencing set is empty, if so, finishing the virtual link resource allocation in the virtual network, and if not, allocating resources for other virtual links in sequence according to the method of the steps S41-S45 until the resource allocation of all virtual links is finished.
7. The method according to claim 6, wherein the reliability coefficient of the alternative path is calculated by the following formula:
Figure FDA0002836736520000037
in the formula (I), the compound is shown in the specification,
Figure FDA0002836736520000038
represents the mth alternative path
Figure FDA0002836736520000039
The reliability of the operation of the system is improved,
Figure FDA00028367365200000310
representing from the underlying node
Figure FDA00028367365200000311
To the bottom layer node
Figure FDA00028367365200000312
The m-th alternative path of (2),
Figure FDA00028367365200000313
representing a set of alternate paths
Figure FDA00028367365200000314
The sum of the reliabilities of all the alternative paths in (c),
Figure FDA00028367365200000315
representing from the underlying node
Figure FDA00028367365200000316
To the bottom layer node
Figure FDA00028367365200000317
The set of alternative paths of (a) is,
Figure FDA00028367365200000318
represents the mth alternative path
Figure FDA00028367365200000319
The reliability coefficient of (2).
8. The method of claim 7, wherein the alternative path is a path of the virtual network resource allocation based on reliability and offloading policy
Figure FDA00028367365200000320
Reliability of (2)
Figure FDA00028367365200000321
The calculation formula of (2) is as follows:
Figure FDA00028367365200000322
in the formula (I), the compound is shown in the specification,
Figure FDA00028367365200000323
representing the current alternative path
Figure FDA00028367365200000324
The k-th underlying link included in (a),
Figure FDA00028367365200000325
representing underlying links
Figure FDA00028367365200000326
The reliability probability value of the geographical location area in which it is located,
Figure FDA00028367365200000327
representing underlying links
Figure FDA00028367365200000328
Probability of whether or not to belong to geographical location area z.
9. The method for allocating virtual network resources based on reliability and offloading policy under network slice according to claim 6, wherein the offloading policy is to select N bottom layer paths according to bandwidth resources required by a virtual link and according to the size of the reliability coefficient to allocate resources to the virtual link when allocating resources to the virtual link, and the method comprises the following steps:
s45.1, from the alternative path set
Figure FDA0002836736520000041
The alternative path with the maximum reliability coefficient is selected and put into the optimal path set
Figure FDA0002836736520000042
Updating candidate path sets
Figure FDA0002836736520000043
S45.2, judging whether the bandwidth resources of the alternative paths selected in the step S45.1 meet the bandwidth resources required by the virtual links, and if so, collecting the optimal paths
Figure FDA0002836736520000044
The alternative path in (4) is allocated to the virtual link, and step S46 is executed; if not, calculating a first difference value between the bandwidth resource required by the virtual link and the bandwidth resource of the alternative path;
s45.3, from the updated alternative path set
Figure FDA0002836736520000045
The alternative path with the maximum reliability coefficient is selected, and the alternative path is added to the optimal path set
Figure FDA0002836736520000046
In (3), the set of candidate paths is updated again
Figure FDA0002836736520000047
S45.4, judging whether the bandwidth resources of the alternative paths selected in the step S45.3 meet the first difference calculated in the step S45.2, and if so, collecting the optimal paths
Figure FDA0002836736520000048
All alternative paths in (2) are allocated to the virtual linkStep S46 is performed; if not, calculating a second difference value between the first difference value and the bandwidth resource of the alternative path selected in step S45.3 again, and selecting the alternative path for the virtual link according to the method of steps S45.3-S45.4 until the optimal path set
Figure FDA0002836736520000049
The sum of the bandwidth resources of all the alternative paths in (b) satisfies the bandwidth resources required by the virtual link.
CN202011478834.5A 2020-12-15 2020-12-15 Virtual network resource allocation method based on reliability and distribution strategy under network slice Active CN112636961B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011478834.5A CN112636961B (en) 2020-12-15 2020-12-15 Virtual network resource allocation method based on reliability and distribution strategy under network slice

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011478834.5A CN112636961B (en) 2020-12-15 2020-12-15 Virtual network resource allocation method based on reliability and distribution strategy under network slice

Publications (2)

Publication Number Publication Date
CN112636961A true CN112636961A (en) 2021-04-09
CN112636961B CN112636961B (en) 2022-11-08

Family

ID=75313396

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011478834.5A Active CN112636961B (en) 2020-12-15 2020-12-15 Virtual network resource allocation method based on reliability and distribution strategy under network slice

Country Status (1)

Country Link
CN (1) CN112636961B (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113163498A (en) * 2021-05-26 2021-07-23 广东电网有限责任公司电力调度控制中心 Virtual network resource allocation method and device based on genetic algorithm under 5G network slice
CN114157583A (en) * 2021-11-18 2022-03-08 广东电网有限责任公司 Reliability-based network resource heuristic mapping method and system
CN115225500A (en) * 2022-06-20 2022-10-21 中国电信股份有限公司 Network slice allocation method and device
WO2023084725A1 (en) * 2021-11-12 2023-05-19 日本電気株式会社 Network configuration device, information system, network configuration method, and recording medium

Citations (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2008211551A (en) * 2007-02-27 2008-09-11 Nippon Telegr & Teleph Corp <Ntt> Virtual network topology designing apparatus and virtual network topology design method
CN102075429A (en) * 2011-01-21 2011-05-25 北京邮电大学 Virtual network mapping method based on principle of proximity
US8289878B1 (en) * 2007-05-09 2012-10-16 Sprint Communications Company L.P. Virtual link mapping
US20130212285A1 (en) * 2010-10-29 2013-08-15 Nokia Siemens Networks Gmbh & Co. Kg Control mechanism for reliability and availability setting in virtual networks
CN103532816A (en) * 2013-10-09 2014-01-22 电子科技大学 Virtual network reliable mapping method capable of considering constraint of geographic position
US20140365664A1 (en) * 2009-07-31 2014-12-11 Wai-Leong Yeow Resource allocation protocol for a virtualized infrastructure with reliability guarantees
WO2014202016A1 (en) * 2013-06-20 2014-12-24 中国科学院声学研究所 Classification-based virtual network mapping method and system
US20170026235A1 (en) * 2015-07-20 2017-01-26 Koninklijke Kpn N.V. Service Provisioning In A Communication Network
CN108260169A (en) * 2018-01-26 2018-07-06 重庆邮电大学 A kind of service function chain dynamic deployment method ensured based on QoS
CN108566659A (en) * 2018-01-09 2018-09-21 重庆邮电大学 A kind of online mapping method of 5G networks slice based on reliability
CN108989126A (en) * 2018-08-13 2018-12-11 北京邮电大学 A kind of mapping method of virtual network
JP2020120269A (en) * 2019-01-23 2020-08-06 Kddi株式会社 Cooperative virtual network allocation method and device
CN111756656A (en) * 2020-06-05 2020-10-09 深圳供电局有限公司 Power communication network resource allocation method based on reliability and historical data
CN111935748A (en) * 2020-08-18 2020-11-13 国网河南省电力公司信息通信公司 Virtual network resource allocation method with high reliability and load balance

Patent Citations (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2008211551A (en) * 2007-02-27 2008-09-11 Nippon Telegr & Teleph Corp <Ntt> Virtual network topology designing apparatus and virtual network topology design method
US8289878B1 (en) * 2007-05-09 2012-10-16 Sprint Communications Company L.P. Virtual link mapping
US20140365664A1 (en) * 2009-07-31 2014-12-11 Wai-Leong Yeow Resource allocation protocol for a virtualized infrastructure with reliability guarantees
US20130212285A1 (en) * 2010-10-29 2013-08-15 Nokia Siemens Networks Gmbh & Co. Kg Control mechanism for reliability and availability setting in virtual networks
CN102075429A (en) * 2011-01-21 2011-05-25 北京邮电大学 Virtual network mapping method based on principle of proximity
WO2014202016A1 (en) * 2013-06-20 2014-12-24 中国科学院声学研究所 Classification-based virtual network mapping method and system
CN103532816A (en) * 2013-10-09 2014-01-22 电子科技大学 Virtual network reliable mapping method capable of considering constraint of geographic position
US20170026235A1 (en) * 2015-07-20 2017-01-26 Koninklijke Kpn N.V. Service Provisioning In A Communication Network
CN108566659A (en) * 2018-01-09 2018-09-21 重庆邮电大学 A kind of online mapping method of 5G networks slice based on reliability
CN108260169A (en) * 2018-01-26 2018-07-06 重庆邮电大学 A kind of service function chain dynamic deployment method ensured based on QoS
CN108989126A (en) * 2018-08-13 2018-12-11 北京邮电大学 A kind of mapping method of virtual network
JP2020120269A (en) * 2019-01-23 2020-08-06 Kddi株式会社 Cooperative virtual network allocation method and device
CN111756656A (en) * 2020-06-05 2020-10-09 深圳供电局有限公司 Power communication network resource allocation method based on reliability and historical data
CN111935748A (en) * 2020-08-18 2020-11-13 国网河南省电力公司信息通信公司 Virtual network resource allocation method with high reliability and load balance

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
刘光远等: "面向底层单节点失效的轻量级可靠虚拟网络映射算法", 《电子与信息学报》 *
狄浩: "虚拟网络的高效和可靠映射算法研究", 《中国博士学位论文全文数据库》 *
童绪军等: "一种改进的高可靠性虚拟网络映射算法研究", 《湖南师范大学自然科学学报》 *
赵国繁等: "面向可靠性的5G网络切片重构及映射算法", 《电子与信息学报》 *

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113163498A (en) * 2021-05-26 2021-07-23 广东电网有限责任公司电力调度控制中心 Virtual network resource allocation method and device based on genetic algorithm under 5G network slice
WO2023084725A1 (en) * 2021-11-12 2023-05-19 日本電気株式会社 Network configuration device, information system, network configuration method, and recording medium
CN114157583A (en) * 2021-11-18 2022-03-08 广东电网有限责任公司 Reliability-based network resource heuristic mapping method and system
CN114157583B (en) * 2021-11-18 2023-10-24 广东电网有限责任公司 Reliability-based network resource heuristic mapping method and system
CN115225500A (en) * 2022-06-20 2022-10-21 中国电信股份有限公司 Network slice allocation method and device

Also Published As

Publication number Publication date
CN112636961B (en) 2022-11-08

Similar Documents

Publication Publication Date Title
CN112636961B (en) Virtual network resource allocation method based on reliability and distribution strategy under network slice
CN111182570A (en) User association and edge computing unloading method for improving utility of operator
CN111682962B (en) Power data network fault recovery method, system and storage medium
CN108076486A (en) A kind of dynamic radio resource allocation algorithm based on load balancing
CN112312444B (en) Resource backup method under 5G network slice
CN110557345B (en) Power communication network resource allocation method
CN113163498B (en) Virtual network resource allocation method and device based on genetic algorithm under 5G network slice
CN111831445B (en) Edge server optimal deployment method
CN113347267A (en) MEC server deployment method in mobile edge cloud computing network
CN111935748B (en) Virtual network resource allocation method with high reliability and load balance
Zhang Reliable virtual network mapping algorithm with network characteristics and associations
Zheng et al. An RBF neural network–based dynamic virtual network embedding algorithm
CN111245701B (en) Link priority virtual network mapping method based on maximum weighted matching
Lei et al. A heuristic services binding algorithm to improve fault-tolerance in microservice based edge computing architecture
CN111752707B (en) Power communication network resource allocation method based on mapping relation
Xiao et al. A dynamic and resource sharing virtual network mapping algorithm
CN115796680A (en) Large-scale constellation efficiency evaluation method
CN115361453A (en) Load fair unloading and transferring method for edge service network
CN113301583B (en) Network slice remapping method, device and storage medium
CN114554496A (en) 5G network slice resource allocation method based on machine learning
CN112600708A (en) Delay-sensitive virtual network resource allocation method under network slice
CN114422375B (en) Virtual network resource allocation method, device, medium and program product
Guan et al. Multidimensional resource fragmentation-aware virtual network embedding for IoT applications in MEC networks
CN112653580B (en) Virtual network resource allocation method based on active detection under network slice
Li et al. Virtual network embedding based on multi-objective group search optimizer

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