CN112436991A - Virtual network mapping method based on energy consumption perception of enterprise network - Google Patents

Virtual network mapping method based on energy consumption perception of enterprise network Download PDF

Info

Publication number
CN112436991A
CN112436991A CN202011241244.0A CN202011241244A CN112436991A CN 112436991 A CN112436991 A CN 112436991A CN 202011241244 A CN202011241244 A CN 202011241244A CN 112436991 A CN112436991 A CN 112436991A
Authority
CN
China
Prior art keywords
node
mapping
energy consumption
virtual
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.)
Pending
Application number
CN202011241244.0A
Other languages
Chinese (zh)
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.)
Liaoning Technical University
Original Assignee
Liaoning Technical University
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 Liaoning Technical University filed Critical Liaoning Technical University
Priority to CN202011241244.0A priority Critical patent/CN112436991A/en
Publication of CN112436991A publication Critical patent/CN112436991A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/46—Interconnection of networks
    • H04L12/4641—Virtual LANs, VLANs, e.g. virtual private networks [VPN]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/14—Network analysis or design
    • H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H04L45/122—Shortest path evaluation by minimising distances, e.g. by selecting a route with minimum of number of hops
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/302—Route determination based on requested QoS

Landscapes

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

Abstract

The invention discloses a virtual network mapping method based on energy consumption perception of an enterprise network, which comprises the following steps: the invention builds a network model and an energy consumption model, and firstly carries out node mapping on the enterprise-level virtual network mapping problem by building a new network model and an energy consumption model, and carries out link mapping, and adopts a two-stage energy consumption perception mapping algorithm to provide an energy consumption perception model comprising node energy consumption and link energy consumption aiming at the enterprise-level network. By constructing the network model of the enterprise network, a new energy consumption model is constructed, the virtual network request is preferentially mapped to the physical network which has the minimum energy consumption and meets the requirement, the running time is reduced, the energy consumption of the virtual network mapping is obviously reduced, and the virtual network mapping success rate is higher.

Description

Virtual network mapping method based on energy consumption perception of enterprise network
Technical Field
The invention belongs to the technical field of virtual network mapping methods, and particularly relates to a virtual network mapping method based on energy consumption perception of an enterprise network.
Background
The internet brings great convenience to the life of people through long-term development, the internet is developed at a great speed in recent years, a lot of applications and a lot of network technologies are operated on the internet, and the increase of the network scale directly leads to the increase of energy consumption.
The increase of network scale can also lead to the generation of network rigidity, so in order to solve the generation of the internet rigidity problem and the increase of network energy consumption, a network virtualization technology appears, which mainly separates a service provider from an infrastructure provider, and mainly makes different virtual networks coexist on the same physical network, thereby realizing the special requirements of different service providers, and the network virtualization mainly has the virtual network mapping problem and can realize the requirements of diversified networks.
The network virtualization mainly comprises virtual network topologies which comprise different virtual nodes and virtual links of service providers, and different network topologies are provided for different service providers through infrastructure providers, so that decoupling of the service providers and the infrastructure providers can be realized, and different virtual networks are independent.
The virtual network mapping technology is used as a core problem, namely, mapping a virtual network request with node constraint and link constraint onto a physical network, the virtual network mapping problem is an NP-Hard problem, how to efficiently map the virtual network request with the constraint onto the physical network is a main problem, at present, many algorithms aim at reducing the cost of virtual network mapping, mainly aim at improving the mapping benefit of an underlying network, and few researches are made on considering the energy consumption problem of the virtual network mapping problem. The problem of energy consumption has become a considerable problem, and the existing energy-saving virtual network mapping methods are all used for reducing energy consumption and improving operator profits.
However, the energy consumption overhead accounts for 30% to 40% of the total energy consumption overhead of the data center, and accounts for 50% to 60% of the operation overhead of the enterprise, so that the enterprise optimizes the energy consumption in the virtual network mapping process in order to reduce the operation cost. On the basis of the existing virtual network mapping method, aiming at the characteristics of an enterprise network, an energy consumption perception virtual network mapping method based on the enterprise network is provided.
Most of the energy-saving virtual network mapping methods set all nodes of an underlying network to have the same power consumption, and then the main energy-saving technology is to achieve the aim of saving energy by closing nodes which do not work. Although these energy-saving algorithms can be well applied in the internet environment, in the enterprise network, because there is no non-working node in the underlying physical network, the energy consumption optimization problem is not to minimize the number of working nodes, so most of the currently proposed energy-saving virtual network mapping methods cannot be well applied in the energy consumption management of the enterprise network.
Disclosure of Invention
Based on the defects of the prior art, the technical problem to be solved by the invention is to provide the virtual network mapping method based on the energy consumption perception of the enterprise network, the energy consumption optimization virtual network mapping problem of the physical network at the bottom layer of the enterprise is researched, an energy consumption model of the physical network nodes and links is established, the minimum energy consumption is taken as a target, a mathematical optimization model of the virtual network mapping problem is constructed, and then the virtual network mapping method based on the energy consumption perception is designed.
In order to solve the technical problems, the invention is realized by the following technical scheme:
the invention provides an enterprise network-based energy consumption perception virtual network mapping method, which reconstructs a network model and an energy consumption model aiming at the characteristics of enterprise-level virtual network mapping, and is as follows:
building a network model
Constructing the network topology by using the knowledge of graph theory, and defining the physical network topology graph as a weighted undirected graph Gs＝(Ns,Ls) In which N issAnd LsRespectively representing nodes and links of a bottom-layer physical network; using weighted undirected graph Gv＝(Nv,Lv) A virtual network topology diagram is represented. Wherein N isvAnd LvRepresenting virtual nodes and virtual links. For virtual node nv∈Nv，cpu(nv) Slave cpu resource, loc (n), representing a requestv) Indicating a location requirement, Distance (n)v) Representing the location requirement for a virtual node to map to a physical node, for a virtual link lvIt has a bandwidth requirement bw (l)v) Each time a virtual network request comes, including the request arrival time and departure time, the virtual network request VNR may be denoted as VNR (G)v,Ta,Tb) Wherein T isaIndicating the arrival time, T, of the virtual network requestbIndicating the time of existence of the virtual network request.
2) Constructing an energy consumption model:
the virtual network mapping mainly comprises two parts of node energy consumption and link energy consumption.
Energy consumption in enterprise networks includes node energy consumption and link energy consumption, because computer nodes in enterprise networks need to meet the daily office use of enterprises and for the task of data analysis, we mainly aim at the latter to perform energy consumption optimization. In the total energy consumption of the server, many studies now show that the energy consumption of the server node is in a direct proportion relation with the CPU occupancy rate, and on the contrary, the power consumption of other memories in the server is smaller. Therefore, the energy consumption model of the physical network node is as follows:
Figure BDA0002768488340000031
the node is in an activated state;
wherein
Figure BDA0002768488340000032
Pb mBase representing a server nodeThe basic energy consumption is reduced,
Figure BDA0002768488340000033
representing the power consumption at full CPU utilization,
Figure BDA0002768488340000034
and the CPU represents the CPU utilization rate when the current node meets the daily work requirement. avl (n)m) Representing the CPU utilization of the current node m. PS (polystyrene) with high sensitivitymA value of 1 indicates that node m is in the active state.
PNm0, others;
by using
Figure BDA0002768488340000035
Representing the mapping relation between a physical node m and a virtual node i, and enabling the virtual node i to be mapped on the physical node m
Figure BDA0002768488340000041
Otherwise it makes
Figure BDA0002768488340000042
So that the nodes whose virtual network requests are mapped to the physical network consume energy of
Figure BDA0002768488340000043
S (t) is the number of virtual nodes mapped during virtual network mapping, avli(t) is the cpu utilization of the virtual request inode during virtual network mapping.
Physical link energy consumption model, mapping virtual links lijUsually, the link is mapped to the upper edge of a physical path at the bottom layer, and N at two ends of the paths mAnd NsnAs a host node, the energy consumption is set asConstant quantity
Figure BDA0002768488340000044
The energy consumption for mapping the virtual link is therefore:
Figure BDA0002768488340000045
wherein PLmE {0,1} represents whether physical node m is a forwarding node, if so, PLm1, otherwise PLm0, wherein
Figure BDA0002768488340000046
The invention aims to minimize the total energy consumption of virtual network mapping and perform integer linear programming on the virtual network mapping problem perceived by enterprise-level energy consumption, and particularly, the total energy consumption is not more than Q due to the existence of a positive integer Q:
El+En≤Q
subject to the following constraints:
Figure BDA0002768488340000047
representing node CPU resource constraints;
Figure BDA0002768488340000048
representing a constraint that satisfies the link bandwidth;
Figure BDA0002768488340000051
representing a location constraint of the virtual node;
Figure BDA0002768488340000052
connectivity constraints are expressed to ensure that traffic flowing into a node is equal to traffic flowing out of the node.
Figure BDA0002768488340000053
Figure BDA0002768488340000054
The virtual nodes from the same virtual network request can be mapped to different physical nodes and one virtual node can be assigned to correspond to one physical node.
Figure BDA0002768488340000055
Figure BDA0002768488340000056
Meaning that the value range of a binary variable can only be 0 and 1.
When in use
Figure BDA0002768488340000057
When the value is 1, the successful mapping of the virtual node u to the physical node j is shown, if
Figure BDA0002768488340000058
A mapping failure is indicated by 0; also when
Figure BDA0002768488340000059
When 1, the virtual link l is illustratedijSuccessful mapping to physical link/mnTo when
Figure BDA00027684883400000510
A value of 0 indicates a mapping failure.
Further, the specific process of node mapping is as follows:
11) for each virtualPseudo network request nv∈GvCalculating resource requirement NR (n) of each virtual nodev)；
12) Sorting the NR values of the virtual nodes from large to small, and storing the sorting result into a set R;
13) firstly, selecting nodes meeting the virtual network request constraint for the physical nodes to construct a candidate node set M;
14) the accumulated node in the candidate node set is calculated by NR (n)s) Sorting from big to small;
15) NR (n)v) Large-valued dummy nodes are preferentially mapped to NR (n)s) Physical nodes with large values;
16) after mapping is successful, C is calculatedcpu(nS)＝Ccpu(nv)-Ccpu(nS)；
17) And returning to the step 11), mapping each virtual node to the physical node one by one, deleting the physical node which is successfully mapped in the candidate node set M, and storing the physical node which is successfully mapped into the node mapping linked list Nodelist.
Further, after the virtual node mapping is successful, the virtual link mapping is performed:
21) virtual link lij∈LvSorting according to the bandwidth requirement from large to small;
22) finding each mapped physical node by obtaining the mapping chain table NodeList of the node mapping stage
Figure BDA0002768488340000061
And
Figure BDA0002768488340000062
then adopting k shortest path algorithm to calculate link l between each mapped physical nodemnPut into the set L;
23) and for each path L in the shortest path set L, according to the above-mentioned ElCalculating link energy consumption;
24) the links in the set are sorted from small to large according to the link energy consumption, and the virtual links are preferentially sortedLink lijMapping to the shortest path with the minimum energy consumption;
25) calculating the residual bandwidth resource BW (l) of the physical link after the mapping is successfulS)＝BW(ls)-BW(lV)；
26) And returning to the step 22), mapping the virtual links requested by the virtual network one by one to the physical paths of the physical network, and storing the successfully mapped physical links into a linked list LinkList.
Therefore, for the characteristics of the enterprise network, the virtual network mapping with the income as the target is not applicable to the enterprise level network, the traditional energy consumption model is redefined in the virtual network mapping stage of the enterprise network, compared with the traditional virtual network mapping mechanism, the enterprise level network has some differences, computer nodes can only provide limited resources, virtual network requests are dynamically arrived, the virtual network requests need to be mapped to specified candidate nodes so as to obtain higher service quality, a data center does not generate the income, and the traditional energy consumption model is redefined so that the virtual network mapping method is applicable to the energy consumption characteristics under the environment of the enterprise network. And the virtual network mapping is carried out under the condition of ensuring the minimum energy consumption, and the virtual network mapping energy consumption is reduced under the condition of ensuring the virtual network mapping rate. By establishing a new network model and an energy consumption model, node mapping is firstly carried out on the mapping problem of the enterprise-level virtual network, link mapping is carried out, a two-stage energy consumption perception mapping algorithm is adopted, an energy consumption perception model comprising node energy consumption and link energy consumption is provided for the enterprise-level network, the energy consumption model is used as a target function of virtual network mapping, high resource utilization rate is achieved, mapping time of virtual requests is shortened, and energy consumption of virtual network mapping in the enterprise network is effectively reduced.
In addition, the virtual network mapping method based on the energy consumption perception of the enterprise network constructs a new energy consumption model by constructing the network model of the enterprise network, preferentially maps the virtual network request to the physical network path which has the minimum energy consumption and meets the requirement, reduces the operation time, obviously reduces the energy consumption of the virtual network mapping, and has higher virtual network mapping success rate.
The foregoing description is only an overview of the technical solutions of the present invention, and in order to make the technical means of the present invention more clearly understood, the present invention may be implemented in accordance with the content of the description, and in order to make the above and other objects, features, and advantages of the present invention more clearly understood, the following detailed description is given in conjunction with the preferred embodiments, together with the accompanying drawings.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings of the embodiments will be briefly described below.
FIG. 1 is a diagram of a network model of the present invention, with a virtual network request at the top and a bottom physical network at the bottom;
FIG. 2 is a node map for energy consumption awareness in accordance with the present invention;
fig. 3 is a power consumption aware link map of the present invention.
Detailed Description
Other aspects, features and advantages of the present invention will become apparent from the following detailed description, taken in conjunction with the accompanying drawings, which form a part of this specification, and which illustrate, by way of example, the principles of the invention.
In the enterprise network, aiming at the network different from other networks of an enterprise, the server node in the enterprise network can only provide limited physical resources, the virtual network request is dynamically arrived, and the virtual network mapping method for sensing the energy consumption is used for mapping the virtual request to the specified candidate physical node so as to obtain higher service quality. Therefore, the requirement of minimizing energy consumption is met in the virtual network mapping process under the condition that the service quality must be considered, and an enterprise network-based energy consumption model and a virtual network mapping method are redefined according to the characteristics of the enterprise network.
The virtual network mapping stage comprises two stages of mapping, the requirement constraint of the virtual network is met, and a two-stage virtual network mapping method is designed according to the objective function of the invention content, wherein the two-stage virtual network mapping method comprises node mapping and link mapping.
Network mapping model
Weighted undirected graph G as in FIG. 1SAnd GvRepresenting a physical network and a virtual network, the physical network topology being defined as Gs＝(Ns,Ls) In which N issRepresents the underlying set of physical nodes, LsRepresenting the underlying set of physical links, the node attributes include CPU (n)s) Is a CPU computing resource and the link attributes include the bandwidth resource BW (l)s). Virtual network topology is defined as Gv＝(Nv,Lv)。
Wherein N isvRepresents the underlying set of physical nodes, LvRepresenting the underlying set of physical links, the node attributes include CPU (n)v) Is the virtual node CPU resource requirement, the link bandwidth requirement is BW (l)v)。
Secondly, the node mapping process is as shown in fig. 2, and the specific steps are as follows:
the virtual nodes with high resource requirement are preferentially mapped in the node mapping stage, so the resource capacity of the nodes is defined as
Figure BDA0002768488340000081
Wherein
Figure BDA0002768488340000082
The topological relation between the virtual node and the surrounding nodes is shown, and alpha and beta are weight coefficients.
Deleting physical nodes which do not meet the requirement constraint of the virtual network, sequencing the physical nodes and preferentially mapping the physical nodes to the physical nodes with more resources, and improving the mapping probability of the virtual network in a sequencing mode
Figure BDA0002768488340000091
Wherein H (n)s)＝res(BWl) Representing the remaining bandwidth resources, this method of ordering physical nodes may achieve a maximization of resource utilization, where
Figure BDA0002768488340000092
For the new power consumption when mapping virtual networks to physical networks, where λ → 0 prevents denominator 0, NR (n) is preferably chosens) The candidate physical nodes with large values can effectively save energy consumption.
The specific process of node mapping according to fig. 2 and the above-described sorting method is as follows.
1. For each virtual network request nv∈GvCalculating resource requirement NR (n) of each virtual nodev) Comprises the following steps:
Figure BDA0002768488340000093
2. and sorting the NR values of the virtual nodes from large to small, and storing the sorting result into a set R.
3. And for the physical nodes, firstly selecting the nodes meeting the virtual network request constraint to construct a candidate node set M.
4. Physical nodes in the candidate node set are calculated by NR (n)s) Sorting from large to small.
Figure BDA0002768488340000094
5. Reacting NR (n)v) Large-valued dummy nodes are preferentially mapped to NR (n)s) And on physical nodes with large values.
6. Computing C after successful mappingcpu(nS)＝Ccpu(nv)-Ccpu(nS)。
7. Returning to the step 1, mapping each virtual node to the physical node one by one, deleting the physical node which is successfully mapped in the candidate node set M, and storing the physical node which is successfully mapped into the node mapping linked list NodeList.
The link mapping phase refers to the process of fig. 3 as follows:
requesting virtual links because only bandwidth requirements need be considered without considering latency requirements of the links for virtual network mapping in an enterprise networkAnd sequencing according to the bandwidth requirements, and carrying out priority sequencing on the virtual nodes with high bandwidth requirements and carrying out priority mapping. Virtual link lij∈LvCalculating physical nodes by adopting k shortest path algorithm
Figure BDA0002768488340000101
And
Figure BDA0002768488340000102
set N of shortest paths between.
1. Virtual link lij∈LvAnd ordering according to the bandwidth requirement from large to small.
2. Finding each mapped physical node by obtaining mapping chain table NodeList of node mapping stage
Figure BDA0002768488340000103
And
Figure BDA0002768488340000104
then adopting k shortest path algorithm to calculate link l between each mapped physical nodemnPut into the set L.
3. For each path L in the shortest path set L, according to the above ElAnd calculating the link energy consumption.
Figure BDA0002768488340000105
4. The links in the set are sorted from small to large according to the link energy consumption, and the virtual link l is preferentially sortedijMapping to the shortest path with the least energy consumption.
5. Calculating the residual bandwidth resource BW (l) of the physical link after the mapping is successfulS)＝BW(ls)-BW(lV)。
6. Returning to the step 2, mapping the virtual links requested by the virtual network to the physical paths of the physical network one by one, and storing the physical links successfully mapped into the linked list LinkList.
While the foregoing is directed to the preferred embodiment of the present invention, other and further embodiments of the invention may be devised without departing from the basic scope thereof, and the scope thereof is determined by the claims that follow.

Claims (5)

1. A virtual network mapping method based on energy consumption perception of an enterprise network is characterized by comprising the following steps:
s1, constructing a network model: constructing the network topology by using the knowledge of graph theory, and defining the physical network topology graph as a weighted undirected graph Gs＝(Ns,Ls) In which N issAnd LsRespectively representing nodes and links of a bottom-layer physical network; using weighted undirected graph Gv＝(Nv,Lv) Representing a virtual network topology, where NvAnd LvRepresenting virtual nodes and virtual links;
s2, constructing an energy consumption model: the energy consumption in the enterprise network comprises node energy consumption and link energy consumption, and the node energy consumption model is as follows:
Figure FDA0002768488330000011
the node is in an activated state;
PNm0, others;
wherein
Figure FDA0002768488330000012
Pb mRepresenting the base energy consumption of the server node,
Figure FDA0002768488330000013
representing the power consumption at full CPU utilization,
Figure FDA0002768488330000014
the power consumption when the CPU utilization rate is minimum is represented, and the CPU represents the CPU utilization rate when the current node meets the daily work requirement; avl (n)m) Indicates the currentCPU utilization of node m, mapping virtual link energy consumption to
Figure FDA0002768488330000015
Wherein PLmE {0,1} represents whether physical node m is a forwarding node, if so, PLm1, otherwise PLm0, wherein
Figure FDA0002768488330000016
2. The enterprise network-based energy consumption aware virtual network mapping method of claim 1, wherein integer linear programming is performed on the enterprise level energy consumption aware virtual network mapping problem, specifically as follows, positive integers exist to make the total energy consumption no greater than Q:
El+En≤Q
subject to the following constraints:
Figure FDA0002768488330000021
representing node CPU resource constraints;
Figure FDA0002768488330000022
representing a constraint that satisfies the link bandwidth;
Figure FDA0002768488330000023
representing a location constraint of the virtual node;
Figure FDA0002768488330000024
connectivity constraints are expressed to ensure that traffic flowing into a node is equal to traffic flowing out of the node.
3. The method of claim 2, wherein the method comprises mapping the virtual network based on energy consumption awareness of the enterprise network
Figure FDA0002768488330000025
When the value is 1, the successful mapping of the virtual node u to the physical node j is shown, if
Figure FDA0002768488330000026
A mapping failure is indicated by 0; when in use
Figure FDA0002768488330000027
When 1, the virtual link l is illustratedijSuccessful mapping to physical link/mnTo when
Figure FDA0002768488330000028
A value of 0 indicates a mapping failure.
4. The enterprise network-based energy consumption aware virtual network mapping method according to claim 3, wherein the specific process of node mapping is as follows:
11) for each virtual network request nv∈GvCalculating resource requirement NR (n) of each virtual nodev)；
12) Sorting the NR values of the virtual nodes from large to small, and storing the sorting result into a set R;
13) firstly, selecting nodes meeting the virtual network request constraint for the physical nodes to construct a candidate node set M;
14) the accumulated node in the candidate node set is calculated by NR (n)s) Sorting from big to small;
15) NR (n)v) Large-valued dummy nodes are preferentially mapped to NR (n)s) Physical nodes with large values;
16) after mapping is successful, C is calculatedcpu(nS)＝Ccpu(nv)-Ccpu(nS)；
17) And returning to the step 11), mapping each virtual node to the physical node one by one, deleting the physical node which is successfully mapped in the candidate node set M, and storing the physical node which is successfully mapped into the node mapping linked list Nodelist.
5. The virtual network mapping method based on energy consumption perception of enterprise network as claimed in claim 4, wherein after the virtual node mapping is successful, the virtual link mapping is performed:
21) virtual link lij∈LvSorting according to the bandwidth requirement from large to small;
22) finding each mapped physical node by obtaining the mapping chain table NodeList of the node mapping stage
Figure FDA0002768488330000031
And
Figure FDA0002768488330000032
then adopting k shortest path algorithm to calculate link l between each mapped physical nodemnPut into the set L;
23) and for each path L in the shortest path set L, according to the above-mentioned ElCalculating link energy consumption;
24) sorting the links in the set from small to large according to link energy consumption, and preferentially sorting the virtual links lijMapping to the shortest path with the minimum energy consumption;
25) calculating the residual bandwidth resource BW (l) of the physical link after the mapping is successfulS)＝BW(ls)-BW(lV)；
26) And returning to the step 22), mapping the virtual links requested by the virtual network one by one to the physical paths of the physical network, and storing the successfully mapped physical links into a linked list LinkList.
CN202011241244.0A 2020-11-09 2020-11-09 Virtual network mapping method based on energy consumption perception of enterprise network Pending CN112436991A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011241244.0A CN112436991A (en) 2020-11-09 2020-11-09 Virtual network mapping method based on energy consumption perception of enterprise network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011241244.0A CN112436991A (en) 2020-11-09 2020-11-09 Virtual network mapping method based on energy consumption perception of enterprise network

Publications (1)

Publication Number Publication Date
CN112436991A true CN112436991A (en) 2021-03-02

Family

ID=74700431

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011241244.0A Pending CN112436991A (en) 2020-11-09 2020-11-09 Virtual network mapping method based on energy consumption perception of enterprise network

Country Status (1)

Country Link
CN (1) CN112436991A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115174499A (en) * 2022-06-28 2022-10-11 荆楚理工学院 Mapping algorithm of SDN network virtual switch and transmission link and evaluation method thereof

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2693704A2 (en) * 2011-04-28 2014-02-05 Huawei Technologies Co., Ltd. Method, correlative device and system for virtual network migration
CN103856355A (en) * 2014-03-12 2014-06-11 湖州师范学院 Energy consumption perceptive virtual network mapping transportation model and algorithm
CN104158717A (en) * 2014-07-08 2014-11-19 湖州师范学院 Energy-efficient virtual network mapping feedback control method
CN105429843A (en) * 2015-11-05 2016-03-23 北京邮电大学 Energy-saving virtual network mapping method under dynamic requirements
CN110061881A (en) * 2019-04-25 2019-07-26 西安邮电大学 A kind of energy consumption perception virtual network mapping algorithm based on Internet of Things

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2693704A2 (en) * 2011-04-28 2014-02-05 Huawei Technologies Co., Ltd. Method, correlative device and system for virtual network migration
CN103856355A (en) * 2014-03-12 2014-06-11 湖州师范学院 Energy consumption perceptive virtual network mapping transportation model and algorithm
CN104158717A (en) * 2014-07-08 2014-11-19 湖州师范学院 Energy-efficient virtual network mapping feedback control method
CN105429843A (en) * 2015-11-05 2016-03-23 北京邮电大学 Energy-saving virtual network mapping method under dynamic requirements
CN110061881A (en) * 2019-04-25 2019-07-26 西安邮电大学 A kind of energy consumption perception virtual network mapping algorithm based on Internet of Things

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
彭利民: "高效节能的虚拟网络重构算法", 《中山大学学报(自然科学版)》 *
赵季红等: "面向物联网的能耗感知虚拟网络映射算法", 《计算机工程》 *
陈晓华等: "虚拟网络映射高效节能运输模型及算法", 《电子学报》 *
龚水清等: "面向节点异构的能耗感知虚拟网络映射算法", 《电子与信息学报》 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115174499A (en) * 2022-06-28 2022-10-11 荆楚理工学院 Mapping algorithm of SDN network virtual switch and transmission link and evaluation method thereof
CN115174499B (en) * 2022-06-28 2023-09-19 荆楚理工学院 Mapping method and evaluation method for SDN network virtual switch and transmission link

Similar Documents

Publication Publication Date Title
WO2022021176A1 (en) Cloud-edge collaborative network resource smooth migration and restructuring method and system
CN104995870B (en) Multiple target server arrangement determines method and apparatus
WO2020199487A1 (en) Method, apparatus and device for responding to access request, and storage medium
CN110061881B (en) Energy consumption perception virtual network mapping algorithm based on Internet of things
CN106161610A (en) A kind of method and system of distributed storage
CN108199897A (en) A kind of OPC UA multiserver polymerizations for supporting cache management
CN110087250B (en) Network slice arranging scheme and method based on multi-objective joint optimization model
CN109672558B (en) Aggregation and optimal matching method, equipment and storage medium for third-party service resources
US10158709B1 (en) Identifying data store requests for asynchronous processing
CN101510144B (en) Distributed cache system based on distributed virtual machine manager and working method thereof
CN114637650B (en) Elastic expansion method based on Kubernetes cluster
Starks et al. Mobile distributed complex event processing—Ubi Sumus? Quo vadimus?
Fan et al. Dynamic virtual network embedding of mobile cloud system based on global resources in internet of vehicles
CN113328953B (en) Method, device and storage medium for network congestion adjustment
Guo et al. Mobile edge server placement based on meta-heuristic algorithm
CN112436991A (en) Virtual network mapping method based on energy consumption perception of enterprise network
Chen Design of computer big data processing system based on genetic algorithm
CN107040466B (en) Multi-domain cooperative data transmission path selection method based on layered architecture of Internet of things
WO2024045784A1 (en) Job scheduling method, scheduler, and related device
CN113159539A (en) Joint green energy scheduling and dynamic task allocation method in multilayer edge computing system
CN108833162B (en) Network node sequencing method and virtual network mapping method
CN116320033A (en) Resource scheduling optimization method and device
Guo et al. PARA: Performability‐aware resource allocation on the edges for cloud‐native services
Yin et al. An optimal image storage strategy for container-based edge computing in smart factory
CN107360210B (en) Virtual machine allocation method for cloud computing data center considering energy consumption and access delay

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
RJ01 Rejection of invention patent application after publication

Application publication date: 20210302

RJ01 Rejection of invention patent application after publication