CN108833162B - Network node sequencing method and virtual network mapping method - Google Patents

Network node sequencing method and virtual network mapping method Download PDF

Info

Publication number
CN108833162B
CN108833162B CN201810600998.7A CN201810600998A CN108833162B CN 108833162 B CN108833162 B CN 108833162B CN 201810600998 A CN201810600998 A CN 201810600998A CN 108833162 B CN108833162 B CN 108833162B
Authority
CN
China
Prior art keywords
node
network
importance
nodes
virtual
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
CN201810600998.7A
Other languages
Chinese (zh)
Other versions
CN108833162A (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.)
Xian Jiaotong University
Original Assignee
Xian Jiaotong 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 Xian Jiaotong University filed Critical Xian Jiaotong University
Priority to CN201810600998.7A priority Critical patent/CN108833162B/en
Publication of CN108833162A publication Critical patent/CN108833162A/en
Application granted granted Critical
Publication of CN108833162B publication Critical patent/CN108833162B/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/12—Discovery or management of network topologies
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/44—Arrangements for executing specific programs
    • G06F9/455—Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
    • G06F9/45504—Abstract machines for programme code execution, e.g. Java virtual machine [JVM], interpreters, emulators
    • 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
    • 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

Abstract

The invention discloses a network node sequencing method and a virtual network mapping method, the method is a node importance index calculation method based on vector centrality, calculates importance indexes of network nodes, considers the influence of self resource attributes of the network nodes, direct-connected nodes on the importance of the nodes and the influence of non-direct-connected neighbor network nodes on the importance of the current nodes, and finally determines the mapping sequence of the virtual network nodes according to the importance indexes of the network nodes. The method can limitedly consider the bottom-layer physical network nodes and links with rich resources, and effectively reduce the probability of network fragmentation; and physical network resources are reasonably utilized.

Description

Network node sequencing method and virtual network mapping method
Technical Field
The invention belongs to the technical field of virtual network construction; in particular to a network node sequencing method and a virtual network mapping method.
Background
In order to build a completely new internet architecture, a team beginning with professor Larry Peterson, university of princeton proposed in 2005 a fundamental revolution to push future network architectures using network virtualization technology. Virtualization technology is a high abstraction, hiding the implementation details of the underlying layers, a virtual network is like a real physical network in a virtualized environment, and multiple virtual networks can simultaneously use the underlying physical infrastructure. The basic entity of network virtualization is a virtual network, a virtual network being a virtual topology formed by a set of virtual nodes and virtual links. A plurality of logic networks on the same physical network belong to different service providers, infrastructure providers can provide different network topology resources for different virtual networks, and the use and management of different virtual networks are independent and do not influence each other. In recent years, countries around the world and many international organizations have recognized the important significance of network virtualization technology for future networks, and many relevant large research projects, such as GENI, 4WARD, PlanetLab, vitrro, etc., are successively developed, which greatly promote the development of network virtualization.
An important technology in a network virtualization environment is virtual network mapping, which is an uncertainty due to a large number of uncertain factors existing in the network during operation, such as changes in cache queues of nodes in the network, changes in bandwidth and delay of links, and the like, resulting in dynamic changes of resources in a physical network. How to efficiently manage and distribute underlying resources, complete processing of Virtual Network requests, provide required Network resources for users, and ensure service quality is a problem that needs to be solved in Network virtualization, and such problems are widely called Virtual Network Mapping problem (Virtual Network Mapping) or Virtual Network Embedding problem (Virtual Network Embedding)
In the virtual network mapping problem, there is a typical algorithm called a two-stage mapping algorithm, which performs virtual network mapping and is divided into two steps of node mapping and link mapping, where nodes need to be sorted according to their resources when performing node mapping, and then mapping is performed, and a shortest path algorithm or a multi-commodity flow algorithm is used when performing link mapping. The execution strategy of the algorithm is that when virtual network mapping is carried out, nodes and links rich in underlying physical resources are occupied preferentially, so that fragmentation of physical network resources caused by premature consumption of resources of certain nodes and links can be avoided, total resources are sufficient, and the situation that the total resources cannot be allocated occurs.
Disclosure of Invention
The invention provides a network node sequencing method; the mapping sequence of the network nodes and the corresponding mapping relation are determined at the node mapping stage in the virtual network mapping process, so that the resources are reasonably utilized, and the situation that network fragmentation is caused by the exhaustion of local node or link resources is reduced.
The invention also provides a virtual network mapping method, which constructs a virtual network based on the network node sorting method, can limitedly consider the bottom-layer physical network nodes and links with rich resources and effectively reduce the probability of network fragmentation; and physical network resources are reasonably utilized.
The technical scheme of the invention is as follows: a network node sequencing method comprises the steps of calculating an importance index of a network node based on a vector centrality thought, wherein a calculation formula is as follows:
Figure GDA0002573622020000021
wherein
Figure GDA0002573622020000022
γi-1>γi，Ni(n) is a node set of i hops of the current node; wherein gamma is0R (n) represents the resource size of the node itself, and r (n) is the local resource of the network node n after normalization;
Figure GDA0002573622020000023
representing the contribution of the neighbor node to the importance of the current node; and calculating to obtain the importance of all the nodes, and performing descending ordering on the virtual network nodes and the physical network nodes according to the importance of the nodes.
Furthermore, the invention is characterized in that:
the contribution of the neighbor node to the importance of the current node comprises the contribution of a direct-connected neighbor node to the importance of the current node and the contribution of a non-direct-connected neighbor node to the importance of the current node; expressed as:
Figure GDA0002573622020000024
the importance index of the network node is expressed in a matrix form as follows: v ═ γ0·R+γ1·P1·V-γ2·P2V; wherein V ═ V (x)1),v(x2),…,v(xn))，R＝(r(x1),r(x2),…,r(xn))，
Figure GDA0002573622020000031
Figure GDA0002573622020000032
Wherein the calculation formula of the importance index of the network node is further expressed as: v ═ y (I-y)1·P1-γ2·P2)-1·γ0R; wherein gamma is1And gamma2Respectively expressed as the proportion of each item in the calculation of the node importance index, I is an identity matrix, and I-gamma is1·P1-γ2·P2Is an invertible matrix.
The calculation mode of the local resources of the network node n is as follows:
Figure GDA0002573622020000033
wherein N (n) is a neighbor node set of the node n, cpu (n) is an available computing resource of the node n, and bw (n, m) is a residual bandwidth of a link between the nodes n and m; then, the local resources c (n) of the network node n are normalized to obtain r (n), specifically
Figure GDA0002573622020000034
The other technical scheme of the invention is as follows: a virtual network mapping method using the network node ranking method of claim 1 to obtain a ranking of network node importance, mapping virtual network nodes onto a physical network according to the ranking.
Compared with the prior art, the invention has the beneficial effects that: according to the method, through the idea of vector centrality, in the virtual network node mapping stage, reasonable measurement is carried out on the network nodes and the surrounding resources thereof by calculating the importance indexes of the network nodes and sequencing according to the importance indexes, so that the bottom-layer physical network nodes and links with rich resources can be considered in a limited manner in the virtual network mapping process, the probability of network fragmentation is effectively reduced, and the physical network resources are reasonably utilized.
Furthermore, according to the network node sequencing method, virtual network nodes are further constructed, and reasonable distribution of physical network resources can be achieved.
Drawings
FIG. 1 is a diagram of a network virtualization architecture in the present invention.
FIG. 2 is a topology diagram of a virtual network according to the present invention;
FIG. 3 is a diagram of a physical network topology according to the present invention;
fig. 4 is a mapping result diagram of the virtual network and the physical network according to the present invention.
Detailed Description
The technical solution of the present invention is further explained with reference to the accompanying drawings and specific embodiments.
In the virtual network mapping process, the network node mapping stage calculates the importance indexes of the virtual nodes and the corresponding physical nodes according to the resource attributes of the network nodes, and then sorts the network nodes according to the importance indexes. The invention provides a network node sequencing method, which is a node importance index calculation method based on vector centrality, calculates importance indexes of network nodes, considers the resource attributes of the network nodes, the influence of direct-connected nodes on the importance of the nodes and the influence of non-direct-connected neighbor network nodes on the importance of the current nodes, and finally determines the mapping sequence of virtual network nodes according to the importance indexes of the network nodes. The method comprises the following specific processes:
step S1, calculating local resources of the network node, which are represented by c (n), and specifically includes:
Figure GDA0002573622020000041
where n (n) is a set of neighbor nodes of node n, cpu (n) is an available computing resource of node n, and bw (n, m) is a remaining bandwidth of a link between nodes n and m.
Step S2, normalizing c (n), using r (n) to represent the local resource of the normalized node n, and
Figure GDA0002573622020000042
step S3The importance index of the network node is calculated according to the idea of vector centrality, and the vector centrality indicates that the importance of one node is not only related to the number of neighbor nodes but also related to the importance of the neighbor nodes. In the case of virtual network mapping, the resource occupancy of a network node represents the size of the importance of that network node. V (n) is used for expressing the importance of the node, and in order to introduce the idea of vector centrality into the calculation of the importance of the node, the calculation formula is as follows:
Figure GDA0002573622020000043
wherein:
Figure GDA0002573622020000044
γi-1>γi，Ni(n) is a node set which is i hops away from the current node; wherein gamma is0R (n) represents the resource size of the node itself,
Figure GDA0002573622020000051
representing the contribution of neighbor nodes to the importance of the current node.
And step S4, performing descending ordering on the virtual network nodes and the physical network nodes according to the node importance indexes to obtain the importance ordering of the virtual network nodes.
In the present invention, the contribution of the neighbor node to the importance of the current node in step S3 includes a contribution of the direct-connected neighbor node to the importance of the current node and a contribution of the non-direct-connected neighbor node to the importance of the current node. Namely, on the basis of considering the direct connection neighbor node, the calculation of the non-direct connection neighbor node is increased, so that the method is suitable for the case that the direct connection neighbor node is considered
Figure GDA0002573622020000052
When the radiation range of i in (a) increases, and when i is 2, the following results:
Figure GDA0002573622020000053
the temporal complexity of the algorithm increases with increasing i; for each increase of i by 1, the complexity of the calculation method is multiplied by o (n), which is a description of the temporal complexity.
The above calculation method can also be expressed in a matrix form as: v ═ γ0·R+γ1·P1·V+γ2·P2V; wherein V ═ V (x)1),v(x2),…,v(xn))，R＝(r(x1),r(x2),…,r(xn))；
Figure GDA0002573622020000054
Figure GDA0002573622020000055
Further, the matrix form is expressed as:
Figure GDA0002573622020000056
transforming the above matrix formula can also obtain: v ═ y (I-y)1·P1-γ2·P2)-1·γ0R; wherein gamma is1，γ2Respectively representing the proportion of each item in the calculation of the node importance index, wherein I is an identity matrix and I-gamma1·P1-γ2·P2And the reversible matrix can also obtain the importance indexes of the respective network nodes through the calculation formula.
The invention also provides a virtual network mapping method, which obtains the ranking of the importance of the network nodes by the network node ranking method and maps the virtual network nodes to the physical network according to the ranking.
As shown in fig. 1, two physical networks respectively map two virtual networks, which coexist on the same physical network, the physical network abstracts underlying physical facilities through virtualization technology and then provides differentiated services to the virtual networks, and the virtual networks are isolated from each other.
Figures 2, 3 and 4 depict simple virtual network mapping diagrams, figure 2 showing an example of a virtual SDN network data layer request, numbers near a node indicating CPU resources requested by the node, numbers on the link indicating bandwidth resources required by the link, figure 3 showing the underlying network topology before mapping; figure 2 shows the mapped underlying network topology. The mapping scheme of the node in this example is shown in fig. 4, { a → a, B → B, c → D }, and the mapping scheme of the link is { (a, B) → (a, B), (a, c) → (a, D), (B, c) → (B, D) }. The quality of the virtual network mapping algorithm determines the number of virtual networks that the physical network can carry, and ultimately determines the benefit of the physical infrastructure provider. Therefore, in a network virtualization environment, the virtual network mapping algorithm is very important, and the efficient virtual network mapping algorithm can increase the profit of an infrastructure provider to the maximum extent and improve the utilization rate of physical resources.

Claims (4)

1. A network node sequencing method is characterized by comprising the step of calculating an importance index of a network node based on a vector centrality thought, wherein a calculation formula is as follows:
Figure FDA0002573622010000011
wherein
Figure FDA0002573622010000012
γi-1>γi，Ni(n) is a node set of i hops of the current node; wherein gamma is0R (n) represents the resource size of the node itself, and r (n) is the local resource of the network node n after normalization;
Figure FDA0002573622010000013
representing the contribution of the neighbor node to the importance of the current node; calculating to obtain the importance of all the nodes, and performing descending ordering on the virtual network nodes and the physical network nodes according to the importance of the nodes; the contribution of the neighbor node to the importance of the current node comprises the contribution of a direct-connected neighbor node to the importance of the current node and the contribution of a non-direct-connected neighbor node to the importance of the current node; expressed as:
Figure FDA0002573622010000014
the importance index of the network node is a momentThe form of the array is represented as: v ═ γ0·R+γ1·P1·V+γ2·P2V; wherein V ═ V (x)1),v(x2),…,v(xn))，R＝(r(x1),r(x2),…,r(xn))，
Figure FDA0002573622010000015
2. The method of claim 1, wherein the formula for calculating the importance indicator of the network node is further expressed as: v ═ y (I-y)1·P1-γ2·P2)-1·γ0R; wherein gamma is1And gamma2Respectively expressed as the proportion of each item in the calculation of the node importance index, I is an identity matrix, and I-gamma is1·P1-γ2·P2Is an invertible matrix.
3. The method according to claim 1, wherein the local resources of the network node n are calculated in the following manner:
Figure FDA0002573622010000016
wherein N (n) is a neighbor node set of the node n, cpu (n) is an available computing resource of the node n, and bw (n, m) is a residual bandwidth of a link between the nodes n and m; then, the local resources c (n) of the network node n are normalized to obtain r (n), specifically
Figure FDA0002573622010000017
4. A virtual network mapping method, characterized in that a ranking of network node importance is obtained using the network node ranking method according to claim 1, and virtual network nodes are mapped onto a physical network according to the ranking.
CN201810600998.7A 2018-06-12 2018-06-12 Network node sequencing method and virtual network mapping method Active CN108833162B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810600998.7A CN108833162B (en) 2018-06-12 2018-06-12 Network node sequencing method and virtual network mapping method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810600998.7A CN108833162B (en) 2018-06-12 2018-06-12 Network node sequencing method and virtual network mapping method

Publications (2)

Publication Number Publication Date
CN108833162A CN108833162A (en) 2018-11-16
CN108833162B true CN108833162B (en) 2020-10-27

Family

ID=64145065

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810600998.7A Active CN108833162B (en) 2018-06-12 2018-06-12 Network node sequencing method and virtual network mapping method

Country Status (1)

Country Link
CN (1) CN108833162B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112653580B (en) * 2020-12-16 2022-11-08 国网河南省电力公司信息通信公司 Virtual network resource allocation method based on active detection under network slice
CN113852515B (en) * 2021-08-26 2023-05-09 西安电子科技大学广州研究院 Node state management and control method and system for digital twin network

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105591876A (en) * 2016-03-04 2016-05-18 重庆邮电大学 Virtual network mapping method
CN107979545A (en) * 2017-10-17 2018-05-01 南京邮电大学 A kind of mapping method of virtual network based on nodal community

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105591876A (en) * 2016-03-04 2016-05-18 重庆邮电大学 Virtual network mapping method
CN107979545A (en) * 2017-10-17 2018-05-01 南京邮电大学 A kind of mapping method of virtual network based on nodal community

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
可重构网络中基于中心度与拓扑势排序的资源分配算法;王子厚等;《通信学报》;20120825;10-19 *
基于网络中心性分析的虚拟网络映射算法;王文钊等;《计算机应用研究》;20140827;565-568 *
网络重要节点排序方法综述;任晓龙;《科学通报》;20140510;1175-1197 *

Also Published As

Publication number Publication date
CN108833162A (en) 2018-11-16

Similar Documents

Publication Publication Date Title
Wang et al. Resource-efficient federated learning with hierarchical aggregation in edge computing
CN113193984B (en) Air-space-ground integrated network resource mapping method and system
CN108566659B (en) 5G network slice online mapping method based on reliability
CN107566194A (en) A kind of method for realizing the mapping of cross-domain virtual network network
CN107196806B (en) Topological proximity matching virtual network mapping method based on sub-graph radiation
CN108833162B (en) Network node sequencing method and virtual network mapping method
CN107979545A (en) A kind of mapping method of virtual network based on nodal community
CN111327708B (en) Optical network virtual mapping method based on topology perception
CN109347657B (en) Method for constructing virtual data domain of scientific and technological service under SDN mode
CN113645076B (en) Virtual network resource allocation method based on hypergraph matching algorithm
CN111935748B (en) Virtual network resource allocation method with high reliability and load balance
CN102427420B (en) Virtual network mapping method and device based on graph pattern matching
CN109787836A (en) Based on the determination method and device of the VNF scheduling scheme of genetic algorithm
Yang et al. Trust-based scheduling strategy for cloud workflow applications
Ghebleh et al. A multi-criteria method for resource discovery in distributed systems using deductive fuzzy system
CN104348695A (en) Artificial immune system-based virtual network mapping method and system thereof
Nguyen et al. RT-VNE: A real-time strategy for Virtual Network Embedding towards resource efficiency
CN104022937B (en) A kind of mapping method of virtual network based on cellular type P system
CN115361453A (en) Load fair unloading and transferring method for edge service network
CN109831337B (en) Grouping mapping method for adjacent nodes in wireless network virtualization
CN108809699B (en) Method for realizing large-scale virtual network node repeated mapping
CN107360210B (en) Virtual machine allocation method for cloud computing data center considering energy consumption and access delay
Lim et al. Reinforcement learning-based virtual network embedding: A comprehensive survey
CN112436991A (en) Virtual network mapping method based on energy consumption perception of enterprise network
Li et al. An efficient Virtual Network embedding algorithm based on subgraph

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