CN112636961B - 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
CN112636961B
CN112636961B CN202011478834.5A CN202011478834A CN112636961B CN 112636961 B CN112636961 B CN 112636961B CN 202011478834 A CN202011478834 A CN 202011478834A CN 112636961 B CN112636961 B CN 112636961B
Authority
CN
China
Prior art keywords
virtual
reliability
node
links
link
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202011478834.5A
Other languages
Chinese (zh)
Other versions
CN112636961A (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 distribution 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 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 shunting 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 success rate of virtual Network mapping, documents [ 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. In order to improve the utilization rate of underlying network resources, the relation between a network resource allocation problem and a convolutional neural network model is analyzed in the literature [ Dolati M, hassanpor S B, ghaderi M, et al. DeepVinE: virtual network allocation with depth requirement learning [ C ]// IEEE INFOCOM 2019-IEEE Conference on Computer Communications workstations (INFOCOM WKSHPS) ] 2019-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 consideration of the problem of resource allocation influenced by the dynamics of the underlying network, documents [ 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] propose a resource allocation algorithm based on a genetic algorithm, and the algorithm has better dynamic adaptation capability. In terms of resource allocation in a dynamic network environment, the problem is solved by adopting a dynamic programming theory in the document [ 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, in a document [ Soto P, body J f, green random planned path-transmitting virtual optical network embedding on to EON-based substrate network [ C ] In:2017IEEE collective connectivity on Communications and Computing (colocom). Colombia: IEEE,2017, 1-6 ], a network virtualization technology is applied to the field of resource management of an optical network, and a resource allocation algorithm with a migration function is proposed, 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 slicing based on complex network technology [ J ]. IEEE Access,2018,6, 19691-19701 ] performs joint modeling on virtual network resource management and end-to-end resource management problems, and provides an end-to-end resource deployment algorithm based on a network slicing technique. 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 2015 1st IEEE Conference on Network resource transfer (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 layer node according to the CPU resource of the bottom layer node and the bandwidth resource of the bottom layer link, and acquiring a bottom layer node reliability sequencing set according to the reliability of the bottom layer 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 obtained in the step S2 and the bottom-layer node reliability sequencing set;
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 links in the alternative paths, and resources are distributed for 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.
Figure 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 of the 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 a network slice environment, and the underlying network uses G S ＝(N S ,E S ) Watch (A)Virtual network usage G V ＝(N V ,E V ) Representing; 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 is S Representing a set of underlying nodes, E S Representing a set of underlying links, N V Representing a set of virtual nodes, E V Representing 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 →N S ,E V →P S ) Is shown in which N is V →N S Indicating that the underlying node allocates CPU resources for the virtual node, E V →P S Representing the underlying path P S Allocating bandwidth resources for the virtual link, the bottom layer path P S Is a path formed by the underlying links connected by the two underlying nodes mapped by the two endpoints of the virtual link.
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 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 a descending order according to the numerical value of the reliability to obtain a bottom node reliability sequencing set N order And bottom layer link reliability ordering set E order 。
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 of reliability, and
Figure BDA0002836736530000044
s z representing underlying nodes
Figure BDA0002836736530000045
The reliability probability value in the geographic position region 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 one 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 many 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
In the above-described manner, the reliability of (2),
Figure BDA00028367365300000421
representing underlying links
Figure BDA00028367365300000422
Degree of link of, is the underlying link
Figure BDA00028367365300000423
Of the two end points, η 1 Denotes a modulation factor, s 'for adjusting the degree of the bottom link' z Representing underlying links
Figure BDA00028367365300000424
The reliability probability value in the geographic position region 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 sequencing set
Figure BDA0002836736530000051
And virtual link reliability ordered sets
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
In the above-described manner, the reliability of (2),
Figure BDA00028367365300000521
representing virtual links
Figure BDA00028367365300000522
Is the sum of the degrees of the two end points of the virtual link, eta 2 Indicating 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: and allocating resources to the virtual nodes in the virtual network in sequence according to the virtual node reliability sequencing set obtained in the step S2 and the bottom layer node reliability sequencing set, wherein the method comprises the following steps:
s31, sorting sets from the reliability of the virtual nodes
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 reliability of the bottom layer nodes according to the CPU resource required by the virtual node taken out in the step S31 order Selecting 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 node order Marking the bottom node as unavailable;
when CPU resources are distributed to each virtual node, firstly confirming a bottom-layer node reliability sequencing set N order Judging whether the bottom node with the maximum middle reliability value is an available node or not, judging whether the bottom node can meet the CPU resource required by the virtual node or not, 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 nodes order And sequentially judging whether other bottom-layer nodes can meet the CPU resources required by the virtual nodes or not according to the sequence of the medium reliability, and selecting the available bottom-layer node which can meet the maximum reliability of the CPU resources required by the virtual nodes to allocate resources to the virtual nodes. If the bottom node reliability ordering set N order If 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 N order Underlying nodes marked as unavailable and not yet assigned to virtual nodesIs an available node.
S33, judging a virtual node reliability sequencing set
Figure BDA0002836736530000061
And (4) whether the virtual nodes are empty or not, if so, finishing the resource allocation of the virtual nodes in the virtual network, and if not, sequentially allocating resources 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 finished.
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 reliability of the virtual link
Figure BDA0002836736530000062
The first virtual link is taken out, and the reliability sequencing set of the virtual links is updated
Figure BDA0002836736530000063
S42, searching two bottom layer nodes respectively mapped in the bottom layer network by the two end points of the virtual link taken out in the step S41
Figure BDA0002836736530000064
And the bottom node
Figure BDA0002836736530000065
Wherein the bottom node
Figure BDA0002836736530000066
Denotes the ith 1 A bottom node, a bottom node
Figure BDA0002836736530000067
Represents i 2 A bottom node, i 1 ≠i 2 ；
S43, searching two bottom-layer 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
to representFrom the bottom level 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 range of 0,1]，
Figure BDA00028367365300000721
Representing underlying links
Figure BDA00028367365300000722
The probability of whether the mobile terminal belongs to the geographical 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 links by adopting a shunting strategy according to the bandwidth resources required by the virtual links taken out in the step S41 and the reliability coefficients 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 alternate 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 alternative paths in (2) are assigned to the virtualA link for executing step S46; 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 a virtual link reliability sequencing set
Figure BDA0002836736530000083
And if the virtual link is empty, the resource allocation of each virtual link in the virtual network is finished, and if the virtual link is not empty, the resources are sequentially allocated to other virtual links according to the method of the steps S41 to S45 until the resource allocation of all the virtual links is finished.
In this embodiment, the bottom node
Figure BDA0002836736530000084
Bottom level 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-layer nodes is increased from 100 to 600 for a bottom-layer network, and the bottom-layer network is used for simulating network environments of different scales; the bottom link is generated by connecting any two bottom 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 request of the virtual node is subjected to uniform distribution of [1,5], and the bandwidth resource request of the virtual link is 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 be uniform distribution subject to [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 also gradually improved, but 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 is a diagram illustrating 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 their corresponding reliability probability values 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), (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 (1)

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 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 performing descending order on the reliability of the bottom nodes and the reliability of the bottom links according to the numerical value of the reliability to obtain a bottom node reliability ordering set and a bottom link reliability ordering set; 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 a descending order according to the numerical value of the reliability to obtain a virtual node reliability sequencing set and a virtual link reliability sequencing set;
s3, sequentially allocating resources for the virtual nodes in the virtual network according to the virtual node reliability sequencing set obtained in the step S2 and the bottom-layer node reliability sequencing set;
s4, alternative paths among 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 for the virtual links by adopting a flow distribution strategy according to the reliability coefficient of each alternative path and the reliability sequencing set of the virtual links;
the reliability calculation formula of the bottom node is as follows:
Figure FDA0003739310720000011
in the formula (I), the compound is shown in the specification,
Figure FDA0003739310720000012
represents the ith underlying node
Figure FDA0003739310720000013
Reliability of (1), s z Representing underlying nodes
Figure FDA0003739310720000014
The reliability probability value in the geographical location area z,
Figure FDA0003739310720000015
representing underlying nodes
Figure FDA0003739310720000016
The CPU resource is provided, and the CPU resource,
Figure FDA0003739310720000017
representing underlying nodes
Figure FDA0003739310720000018
Adjacent link bandwidth resources;
the reliability of the virtual node is calculated according to the following formula:
Figure FDA0003739310720000019
in the formula (I), the compound is shown in the specification,
Figure FDA00037393107200000110
representing the ith virtual node
Figure FDA00037393107200000111
The reliability of the operation of the system is improved,
Figure FDA00037393107200000112
representing virtual nodes
Figure FDA00037393107200000113
The CPU resources that need to be applied for the underlying node,
Figure FDA00037393107200000114
representing virtual nodes
Figure FDA00037393107200000115
Adjacent link bandwidth resources;
the reliability of the virtual link is calculated by the following formula:
Figure FDA00037393107200000116
in the formula (I), the compound is shown in the specification,
Figure FDA00037393107200000117
representing virtual links
Figure FDA00037393107200000118
In the above-described manner, the reliability of (2),
Figure FDA00037393107200000119
representing virtual links
Figure FDA00037393107200000120
Degree of link, eta 2 An adjustment factor representing the degree of the virtual link to be adjusted;
the bottom layer node
Figure FDA0003739310720000021
Adjacent link bandwidth resources of
Figure FDA0003739310720000022
The calculation formula of (2) is as follows:
Figure FDA0003739310720000023
in the formula (I), the compound is shown in the specification,
Figure FDA0003739310720000024
represents the jth underlying link, an
Figure FDA0003739310720000025
Figure FDA0003739310720000026
Representing underlying links
Figure FDA0003739310720000027
The bandwidth resources that are available for the user,
Figure FDA0003739310720000028
representing underlying nodes
Figure FDA0003739310720000029
Of adjacent links, E S Representing a set of underlying links;
the virtual node
Figure FDA00037393107200000210
The calculation formula of the adjacent link bandwidth resource is as follows:
Figure FDA00037393107200000211
in the formula (I), the compound is shown in the specification,
Figure FDA00037393107200000212
represents the jth virtual link, an
Figure FDA00037393107200000213
Figure FDA00037393107200000214
Representing virtual nodes
Figure FDA00037393107200000215
Of the set of adjacent links of the network,
Figure FDA00037393107200000216
representing virtual links
Figure FDA00037393107200000217
Bandwidth resources requiring application to the underlying link, E V Representing a set of virtual links;
the step S3 includes the steps of:
s31, taking out a 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 resource required by the virtual node taken out in the step S31 to allocate the CPU resource to the virtual node;
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 to 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;
the step S4 includes the steps of:
s41, taking out the first virtual link from the virtual link reliability sequencing set, and updating the virtual link reliability sequencing set;
s42, searching two bottom layer nodes respectively mapped in the bottom layer network by the two end points of the virtual link taken out in the step S41
Figure FDA00037393107200000218
And the bottom node
Figure FDA00037393107200000219
Wherein i 1 ≠i 2 ；
S43, searching two bottom-layer nodes
Figure FDA00037393107200000220
And the bottom node
Figure FDA00037393107200000221
All alternative paths in betweenPut in the alternative path set
Figure FDA00037393107200000222
S44, according to the alternative path set obtained in the step S43
Figure FDA00037393107200000223
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 links by adopting a shunting strategy according to the bandwidth resources required by the virtual links taken out in the step S41 and the reliability coefficient of each alternative path obtained in the step S44;
s46, judging whether the reliability sequencing set of the virtual links is empty, if so, finishing the allocation of the resources of the virtual links in the virtual network, and if not, allocating the resources of other virtual links in sequence according to the method of the steps S41-S45 until the allocation of the resources of all the virtual links is finished;
the calculation formula of the reliability coefficient of the alternative path is as follows:
Figure FDA0003739310720000031
in the formula (I), the compound is shown in the specification,
Figure FDA0003739310720000032
represents the mth alternative path
Figure FDA0003739310720000033
In the above-described manner, the reliability of (2),
Figure FDA0003739310720000034
representing from the underlying node
Figure FDA0003739310720000035
To the bottom layer node
Figure FDA0003739310720000036
The m-th alternative path of (2),
Figure FDA0003739310720000037
representing a set of alternate paths
Figure FDA0003739310720000038
The sum of the reliabilities of all the alternative paths in (c),
Figure FDA0003739310720000039
representing from the underlying node
Figure FDA00037393107200000310
To the bottom layer node
Figure FDA00037393107200000311
The set of alternative paths of (a) is,
Figure FDA00037393107200000312
represents the mth alternative path
Figure FDA00037393107200000313
The reliability coefficient of (2);
the alternative path
Figure FDA00037393107200000314
Reliability of (2)
Figure FDA00037393107200000315
The calculation formula of (2) is as follows:
Figure FDA00037393107200000316
in the formula (I), the compound is shown in the specification,
Figure FDA00037393107200000317
representing the current alternative path
Figure FDA00037393107200000318
The k-th underlying link included in (a),
Figure FDA00037393107200000319
representing underlying links
Figure FDA00037393107200000320
The reliability probability value of the geographical location area in which it is located,
Figure FDA00037393107200000321
representing underlying links
Figure FDA00037393107200000322
Probability of whether or not to belong to geographic location area z;
the distribution strategy is that when the resources are distributed to the virtual links, N bottom layer paths are selected to distribute the resources to the virtual links according to the bandwidth resources required by the virtual links and the reliability coefficient, and the method comprises the following steps:
s45.1, collecting from alternative paths
Figure FDA00037393107200000323
The alternative path with the maximum reliability coefficient is selected and put into the optimal path set
Figure FDA00037393107200000324
Updating alternate path sets
Figure FDA00037393107200000325
S45.2, judging whether the bandwidth resource of the alternative path selected in the step S45.1 meets the bandwidth resource required by the virtual link, and if so, collecting the optimal path
Figure FDA00037393107200000326
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, collecting the updated alternative paths
Figure FDA00037393107200000327
Selecting the alternative path with the maximum reliability coefficient, and adding the alternative path to the optimal path set
Figure FDA00037393107200000328
In (3), the set of candidate paths is updated again
Figure FDA00037393107200000329
S45.4, judging whether the bandwidth resource of the alternative path selected in the step S45.3 meets the first difference value calculated in the step S45.2, and if so, collecting the optimal path
Figure FDA00037393107200000330
All the alternative paths in (1) are allocated to the virtual link, and step S46 is executed; if not, calculating a second difference between the first difference and the bandwidth resource of the alternative path selected in the step S45.3 again, and selecting the alternative path for the virtual link according to the methods of the step S45.3 to the step S45.4 until the optimal path set
Figure FDA00037393107200000331
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 CN112636961A (en) 2021-04-09
CN112636961B true 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)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113163498B (en) * 2021-05-26 2022-09-30 广东电网有限责任公司电力调度控制中心 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
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

Citations (9)

* 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
CN103532816A (en) * 2013-10-09 2014-01-22 电子科技大学 Virtual network reliable mapping method capable of considering constraint of geographic position
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
CN111935748A (en) * 2020-08-18 2020-11-13 国网河南省电力公司信息通信公司 Virtual network resource allocation method with high reliability and load balance

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8990397B2 (en) * 2009-07-31 2015-03-24 Ntt Docomo, Inc. Resource allocation protocol for a virtualized infrastructure with reliability guarantees
EP2633643B1 (en) * 2010-10-29 2019-05-08 Nokia Solutions and Networks GmbH & Co. KG Control mechanism for reliability and availability setting in virtual networks
CN104243258B (en) * 2013-06-20 2017-10-31 中国科学院声学研究所 A kind of mapping method of virtual network and system based on classification
EP3121997B3 (en) * 2015-07-20 2024-04-10 Koninklijke KPN N.V. Service provisioning in a communication network
CN111756656B (en) * 2020-06-05 2023-02-03 深圳供电局有限公司 Power communication network resource allocation method based on reliability and historical data

Patent Citations (9)

* 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
CN102075429A (en) * 2011-01-21 2011-05-25 北京邮电大学 Virtual network mapping method based on principle of proximity
CN103532816A (en) * 2013-10-09 2014-01-22 电子科技大学 Virtual network reliable mapping method capable of considering constraint of geographic position
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
CN111935748A (en) * 2020-08-18 2020-11-13 国网河南省电力公司信息通信公司 Virtual network resource allocation method with high reliability and load balance

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
一种改进的高可靠性虚拟网络映射算法研究;童绪军等;《湖南师范大学自然科学学报》;20190929(第01期);全文 *
虚拟网络的高效和可靠映射算法研究;狄浩;《中国博士学位论文全文数据库》;20140515;全文 *
面向可靠性的5G网络切片重构及映射算法;赵国繁等;《电子与信息学报》;20200615(第06期);全文 *

Also Published As

Publication number Publication date
CN112636961A (en) 2021-04-09

Similar Documents

Publication Publication Date Title
CN112636961B (en) Virtual network resource allocation method based on reliability and distribution strategy under network slice
CN108076486B (en) Dynamic wireless resource allocation algorithm based on load balancing
CN111984419B (en) Complex task computing migration method for edge environment reliability constraint
CN111182570A (en) User association and edge computing unloading method for improving utility of operator
JPH11341154A (en) Resource allocation and route selection method for multiple service virtual private network
CN112312444B (en) Resource backup method under 5G network slice
CN113163498B (en) Virtual network resource allocation method and device based on genetic algorithm under 5G network slice
CN110557345B (en) Power communication network resource allocation method
CN110061881A (en) A kind of energy consumption perception virtual network mapping algorithm based on Internet of Things
CN111935748B (en) Virtual network resource allocation method with high reliability and load balance
CN111245701B (en) Link priority virtual network mapping method based on maximum weighted matching
Zhang Reliable virtual network mapping algorithm with network characteristics and associations
Zheng et al. An RBF neural network–based dynamic virtual network embedding algorithm
CN114615705B (en) Single-user resource allocation strategy method based on 5G network
CN111752707B (en) Power communication network resource allocation method based on mapping relation
Xiao et al. A dynamic and resource sharing virtual network mapping algorithm
CN115361453A (en) Load fair unloading and transferring method for edge service network
Lei et al. A heuristic services binding algorithm to improve fault-tolerance in microservice based edge computing architecture
CN115499876A (en) Computing unloading strategy based on DQN algorithm under MSDE scene
CN110933728B (en) Mapping method, device and storage medium of virtualized wireless sensor network
CN113301583B (en) Network slice remapping method, device and storage medium
CN112600708A (en) Delay-sensitive virtual network resource allocation method under network slice
Guo et al. Probabilistic-assured resource provisioning with customizable hybrid isolation for vertical industrial slicing
Baek et al. d-Agent: an approach to mobile agent planning for distributed information retrieval
CN114422375B (en) Virtual network resource allocation method, device, medium and program product

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