CN111385202A - Route distribution method based on virtual network function - Google Patents
Route distribution method based on virtual network function Download PDFInfo
- Publication number
- CN111385202A CN111385202A CN202010185421.1A CN202010185421A CN111385202A CN 111385202 A CN111385202 A CN 111385202A CN 202010185421 A CN202010185421 A CN 202010185421A CN 111385202 A CN111385202 A CN 111385202A
- Authority
- CN
- China
- Prior art keywords
- sfc
- node
- service function
- request
- vnf
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 20
- 238000013507 mapping Methods 0.000 claims abstract description 8
- 239000013256 coordination polymer Substances 0.000 claims description 9
- 238000012163 sequencing technique Methods 0.000 claims description 3
- 238000010276 construction Methods 0.000 claims description 2
- 238000011160 research Methods 0.000 description 7
- 238000010586 diagram Methods 0.000 description 4
- 238000004364 calculation method Methods 0.000 description 3
- 238000005457 optimization Methods 0.000 description 3
- 238000007726 management method Methods 0.000 description 2
- 239000011159 matrix material Substances 0.000 description 2
- 230000004075 alteration Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000013468 resource allocation Methods 0.000 description 1
- 238000010845 search algorithm Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- 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/124—Shortest path evaluation using a combination of metrics
-
- 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/125—Shortest path evaluation based on throughput or bandwidth
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
- H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to the technical field of computer networks, in particular to a routing distribution method based on virtual network functions, which comprises the steps of establishing a physical network model and defining service function chain SFC request flow; modeling according to the defined service function chain SFC to obtain a service function chain SFC model; acquiring the resource cost consumed by the service function chain SFC request flow in the physical network according to the service function chain SFC model; constructing a multi-stage directed graph, and mapping the resource cost consumed by the service function chain SFC request flow in the physical network to the multi-stage directed graph to obtain the relative cost of the service function chain SFC request flow; calculating a routing path with the lowest relative cost for acquiring the service function chain SFC request flow, and taking the path as a routing path distributed by the current routing; the invention realizes the virtual network function deployment and route distribution considering the global network resources, effectively realizes the load balance of the network resources and improves the request acceptance rate.
Description
Technical Field
The invention relates to the technical field of computer networks, in particular to a routing distribution method based on a virtual network function.
Background
In the existing Virtual Network Function (VNF) deployment policy research, most of the research only considers the constraint of one Network resource in the global Network to implement the VNF deployment, and does not comprehensively consider the constraint of the global Network resource. If a VNF deployment method based on a tabu search algorithm is provided for research, the method searches a deployment position with an optimal service function in a global network in a mode of setting a tabu table, but only considers the node resource utilization rate; some researches provide a service Function management mechanism facing the Network Function Virtualization (NFV) technical environment, and the mechanism mainly selects a node with the minimum deployment cost from candidate nodes as a Function node through a viterbi algorithm, so that the deployment cost of a service Function is effectively reduced, but the service Function management mechanism lacks consideration on link resource cost; some researches provide a service function deployment model, which adopts an Auxiliary Frequency Slot Matrix heuristic algorithm to solve, but an AFM (automatic Frequency Slot Matrix, AFM) only takes the calculation resource capacity of a physical node as a selection strategy, and does not consider the deployment problem of VNF from the utilization of global service path resources; some researches exhaust all service paths meeting resource constraint and connectivity through a Greedy algorithm, and select the service path with the minimum link resource occupation, but the method only focuses on the optimization selection problem of the link; some researches propose a service function deployment mechanism under an NFV architecture, the mechanism constructs a layered graph model, minimizes time delay as a basis for selecting a service path, and although the processing time of a service function chain is reduced, the mechanism lacks consideration of node resources.
The deployment strategies are researched from respective angles, but the considered resource optimization targets are single, and global network resources, such as only link bandwidth resources or only node resources, are not fully considered.
Disclosure of Invention
In order to effectively deploy virtual network functions and seek an optimal routing path for a service function chain request, and finally achieve load balancing of global network resources and improve the acceptance rate of the request, the invention provides a routing allocation method based on the virtual network functions, which comprises the following steps:
establishing a physical network model, and defining a Service Function Chain (SFC) request flow;
modeling according to the defined service function chain SFC to obtain a service function chain SFC model;
acquiring the resource cost consumed by the service function chain SFC request flow in the physical network according to the service function chain SFC model;
constructing a multi-stage directed graph, and mapping the resource cost consumed by the service function chain SFC request flow in the physical network to the multi-stage directed graph to obtain the relative cost of the service function chain SFC request flow;
and calculating a routing path with the lowest relative cost for acquiring the service function chain SFC request flow based on an integer linear programming model, and taking the path as a routing path allocated by the current routing.
Further, establishing the physical network model includes:
defining a physical network as an undirected graph G ═ V, L, where V and L represent a set of physical nodes and a set of physical links, respectively;
the nodes in the physical network are connected with one another to form a physical link;
defining N as a server set, wherein N is one server in the server set;
if the VNF is deployed on a physical node attached with a server and the physical node bears the VNF function, defining a set of the physical nodes with the VNF function as a function node set and defining other points as a switch node set;
the definition set M represents a set of VNF functions in all virtual networks, where M ∈ M represents one virtual network function in the set of VNFs;
and P represents the collection of the flow with the SFC request, and the construction of the physical network model is completed.
Further, defining the service function chain SFC request flows includes defining each SFC request flow to be composed of an ingress node, an egress node, and a service function chain composed of VNFs, and representing the SFC request flows and the service function chain as:
pi=(si,ti;SCi,bwi,CPi);
wherein p isiRepresenting a stream of SFC requests; siAn ingress node representing a request flow; t is tiAn egress node representing an SFC request flow; SC (Single chip computer)iOrdered VNF sequences, SC, representing the SFC request flow that must pass sequentiallyi,lThe i-th VNF request through which the SFC request flows is represented,<SCi,1,SCi,2,…,SCi,l>an ordered VNF sequence representing the sequential order in which SFC request streams must pass; lSCiRepresents the service function chain length, | SC, of the SFC request flowiI denotes SCiThe VNF request total of (a); bwiRepresenting SFC request stream piThe requested bandwidth resource of (2); CP (CP)iRepresenting SFC request stream piThe computing resources of (1).
Further, the service function chain SFC model is represented as:
wherein,resource cost consumed by a service function chain SFC request flow;representing the total cost of link bandwidth consumed by the SFC request stream routing path;the total cost of switch flow table entry resources consumed by the flow routing path for the SFC request;routing paths for SFC request streamsThe computational resources of the consumed functional nodes consume the total cost.
Further, the total cost of the link bandwidth consumed by the SFC request stream routing path is calculatedThe bandwidth resource consumption requested by the SFC cannot exceed the bandwidth resource remaining on the physical link,expressed as:
wherein,representing service function chain linksWhether or not to map onto a link uv in a physical network, when the service function chain linkWhen mapped onto a link uv in a physical networkOtherwiseL denotes the set of all links in the physical network,represents the set of all service function chain links;representing the bandwidth resource cost of the physical link uv.
Further, calculating switch flow table entries consumed by the SFC request flow routing pathTotal cost of resourcesThe flow table entry resources consumed by the SFC request cannot exceed the flow table entry resources remaining on the switch node,expressed as:
wherein, VsRepresenting a set of switch nodes;representing a flow table resource cost of the switch node u;to represent a linkWhether to traverse the binary variable of the physical node u, and if so, whether to traverse the binary variable of the physical node uOtherwise
Further, computing the total cost of computing the computing resources of the functional nodes that the SFC request flow consumes by the routing pathAt that time, all CPUs on the functional node requested by the SFC consume no more CPU than the remainder of the CPUs on the selected functional node,expressed as:
wherein, VmRepresents a collection of all the functional nodes that are,a VNF request in one service function chain representing a request flow i,representing a set of all VNF nodes in a service function chain of a request flow i, N representing one server, N being a set of all servers, M representing one of all VNF nodes, M representing a set of all VNF nodes;the computational resource cost of functional node u; h isn,vA binary variable representing whether server n is attached to physical node v, if so, h n,v1, otherwise hn,v=0;Presentation requestBinary variable of whether or not to be served by VNF node m, if being servedOtherwiseyn,mA binary variable representing whether or not the VNF node m is deployed on the server n, and when deployed y n,m1, otherwise yn,m=0。
Further, constructing a multi-stage directed graph and mapping resource costs consumed by service function chain SFC request flows in a physical network to the multi-stage directed graph comprises:
constructing a network graph from an original network graphA multi-stage directed graph of stages, wherein the first stage of the directed graph is an entry node, and the last stage of the directed graph is an exit node;
the jth stage of the directed graph is the j-1 VNF request of the SFC request flow deployed on the jth stage functional node,
for two adjacent stages, connecting each node in the ith stage to all points in the (i + 1) th stage in the direction from the ith stage to the (i + 1) th stage;
in a multi-stage directed graph, when a VNF request of one SFC request flow is served by a VNF on one functional node, that link will correspond to one functional node on the original network graph.
Further, the relative composition of the service function chain SFC request flow is represented as:
wherein,indicating a linkThe relative cost of (c);representing the resource cost of request i through link uv in the physical network,representing service function chain linksWhether or not to map onto a link uv in a physical network, when the service function chain linkWhen mapped onto a link uv in a physical networkOtherwise Representing the relative flow table resource cost of a switch node requesting i to traverse a link uv in the physical network;representing functional nodesRelative computing resource cost of;representing multi-stage directed graph inner function nodesThe cost of computing resources of (a);representing a set of all service function chain links in the multi-stage directed graph;represents the set of all VNF nodes in the service function chain requesting flow i in the multi-stage directed graph.
Further, calculating a routing path with the lowest relative cost for acquiring the service function chain SFC request flow based on the integer linear programming model comprises:
S2: set of all VNF nodes in the service function chain that will request flow iComputing resource demand d of VNF inmSequencing the data according to the sequence from small to large, and sequentially entering a queue Q;
s3: searching a set of functional nodes in a multi-stage directed graphIf all CPUs on the functional node requested by the SFC consume no more than the remaining CPUs on the selected functional node, adding the functional node to the set A;
s4: fetch the elements in queue Q and according toSearching the functional nodes in the mappable set A, and deploying the VNF to the functional nodesIn the above, if the VNF is successfully deployed to the function nodeIn the above, the node is then connectedAdding to collectionsPerforming the following steps; otherwise, getUpdating the queue Q and updating the residual computing resource quantity of the corresponding functional node;
s5: if VNFs in the queue Q are not completely deployed, returning to the step S4; otherwise, all VNF deployments are completed, and the final VNF deployment is obtainedGathering, finding an optimal routing path for the SFC request;
s6: searching all shortest paths in the multi-stage directed graph according to steps S1-S5;
s7: converting the shortest path obtained in the multi-stage directed graph into a physical network;
s8: judging whether the shortest path in the physical network is satisfied or not, and whether two end points of the selected path are also selected or not;
and whether the routing path of the SFC request flow is continuous;
and whether the bandwidth resource consumption requested by the SFC cannot exceed the bandwidth resource remaining on the physical link;
and the flow table entry resource consumption requested by the SFC cannot exceed the flow table entry resource remained on the switch node;
and all CPU consumption on the functional node requested by the SFC cannot exceed the residual CPU on the selected functional node;
if all the requirements are met, receiving request SFC request flow, updating residual bandwidth resources, calculating resources and flow table resources, and feeding back the routing path meeting the requirements; otherwise, the feedback route fails, and the request is rejected.
The invention realizes the scheme of optimizing the virtual network function deployment and route distribution considering the global network resources, effectively realizes the load balance of the network resources and improves the request acceptance rate.
Drawings
FIG. 1 is a schematic diagram of a service function chain;
FIG. 2 is a diagram of an original network;
FIG. 3 is a multi-stage directed graph illustration of the present invention;
fig. 4 is a schematic flow chart of a routing allocation method based on a virtual network function according to the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings 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 derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The invention provides a route distribution method based on virtual network function, as shown in fig. 4, which specifically comprises the following steps:
establishing a physical network model, and defining a Service Function Chain (SFC) request flow;
modeling according to the defined service function chain SFC to obtain a service function chain SFC model;
acquiring the resource cost consumed by the service function chain SFC request flow in the physical network according to the service function chain SFC model;
constructing a multi-stage directed graph, and mapping the resource cost consumed by the service function chain SFC request flow in the physical network to the multi-stage directed graph to obtain the relative cost of the service function chain SFC request flow;
and calculating the routing path with the lowest relative cost for acquiring the service function chain SFC request flow, and taking the path as the routing path allocated by the current route.
In this embodiment, a physical network is defined as an undirected graph G ═ V, L, where V and L respectively represent a physical node set and a physical link set, u and V represent physical nodes in the physical network, u and V ∈ V, one physical link formed by connecting a node u and a node V represents uv and uv ∈ L, if a set of all servers is N, N ∈ N, N represents one server in the server set, and if a VNF is deployed on a physical node to which a server is attached and the physical node carries a VNF function, a set of all such physical nodes is defined as a function node set V, and if a VNF is deployed on a physical node to which a server is attached, a set of all such physical nodes carries a VNF function, a set of all such physicalmDefining other physical nodes as a switch node set VsIn which V ism、VsAll belong to a physical node set V; setting one virtual network function in the VNF set as M, and setting the set of all the virtual network functions as M; the physical network G is provided with an SDN controller which monitors the computing resources and link bandwidth resources of the functional nodes in the physical network GThe source and switch flow table entry resources and perform resource allocation to meet the resource requirements of each request flow.
If the set of streams with SFC requests is P, one request stream in the set is denoted as PiFlow table traffic of switch node u isWhen the SFC requests a stream PiThe ratio of the remaining flow table resources of switch node u upon arrival isThe total amount of computing resources on the functional node isThe total bandwidth resource of the physical link uv isWhen the SFC requests a stream PiWhen arriving, the ratio of the residual computing resources on the functional node and the ratio of the residual bandwidth resources on the link uv are respectivelyAnd
in a network, a user-initiated flow should always traverse a set of VNFs connected in a predefined order to meet the user's needs. Assuming that all flows have SFC requests, each flow consisting of an ingress node, an egress node, and a service function chain consisting of VNFs, the flow of SFC requests may be represented by a five-tuple, and the flow of SFC requests and the service function chain may be represented as:
pi=(si,ti;SCi,bwi,CPi) (1)
wherein s isiEntry node, t, representing a request flowiAn egress node representing an SFC request flow; each SFC request stream is from source siTo the target tiMust pass through the corresponding functional nodes in sequence; the service function chain sequence of the request flow is defined as SCi,SCi,lThe i-th VNF request through which the SFC request flows is represented,<SCi,1,SCi,2,…,SCi,l>an ordered VNF sequence that represents the SFC request flow must pass sequentially, e.g. (Firewall → IDS → Proxy); represents the service function chain length, | SC, of the SFC request flowiI denotes SCiThe VNF request total of (a); for SFC request stream piIt requests bandwidth resources and computing resources bw respectivelyi、CPi。
Sequencing the VNF SC according to the service function chainiService function chain graph converted into directed acyclicWherein,representing a set of flow nodes (VNFS, ingress and egress switches),representing the set of links between these flow nodes. A simple SFC request service function chain as shown in FIG. 1, requests flow with SCi,1→SCi,2→SCi,3In order through the flow nodes of the chain, the SFC requests the flow to reach the node tiBefore, it must first traverse the nodes s in sequencei,SCi,1、SCi,2And SCi,3. A traffic model constructed in this way can ensure that the request flow passes through the correct sequence of service function chains.
When an SFC request stream arrives, the resource consumption of the network consists of four main parts: 1. the functional nodes are provided with computing resources required by a certain VNF; 2. the VNF on the functional node provides corresponding service computing resource consumption for the SFC request flow; 3. physical link bandwidth resource consumption; 4. switch node flow table resource consumption.
There is an important characteristic for resource usage on physical nodes and links in G: the marginal cost of resource usage expands as the load of the resource increases, and nodes and links that are more loaded will cost more overhead than nodes and links that are less loaded. Therefore, when receiving a request flow, a less loaded node and link should be used, and when an SFC request flow arrives, the available flow table entry of the switch node isThe remaining bandwidth resource of the link uv isDefining the amount of computing resources required to deploy a certain VNF on a functional node as dmRespectively characterizing the resource consumption cost of a flow table using the following functionLink bandwidth resource consumption costComputing resource consumption costExpressed as:
α is a minimum value to ensure that denominator is greater than zero, and flow table resource consumption costLink bandwidth resource consumption costComputing resource consumption costIs (1, ∞), and as flow table entries, link bandwidth, and consumption of computational resources, the corresponding resource marginal cost grows in a non-linear fashion, becoming larger and larger. Thus, the formula may adequately represent that the marginal cost of corresponding resource usage expands as the resource load increases.
The optimization model of the integer linear programming is to comprehensively consider the conditions of service resource requirements, network node resources, network link resources and the like, and find the optimal position of VNF deployment according to a specified objective function. The problem is characterized as an integer linear programming model with the aim of minimizing resource cost.
In integer linear programming, the following binary variables are defined:
binary variable h attached to physical node u on server nn,uExpressed as:
binary variable y of whether VNF node m is deployed on server nn,mExpressed as:
the following two variables represent logical links, respectivelyWhether via physical link uv or physical node u:
once a link is selected, the two endpoints of the link must also be selected, denoted as:
connectivity constraints, ensuring that the routing path of the SFC request stream is continuous:
for physical link uv, the bandwidth resource consumption requested by the SFC cannot exceed the bandwidth resource remaining on the physical link:
the flow table entry resource consumption of the SFC request cannot exceed the flow table entry resources remaining on the switch node, and the following constraints must be satisfied:
furthermore, all CPUs on the functional node requested by the SFC consume no more CPU than the remaining CPUs on the selected functional node, expressed as:
SFC requests total cost of link bandwidth consumed by the flow routing path:
SFC requests total cost of switch flow table entry resources consumed by flow routing path:
the SFC requests that the computing resources of the functional nodes consumed by the flow routing path consume the total cost:
total cost of resource consumption on the route path of the SFC request flow:
if the resource consumption cost of a certain path is low, it can be determined that the remaining resources on the path are rich, and the routing flow with the SFC request on the path does not cause network congestion. On the contrary, if the resource consumption cost of a certain path is very high, it can be determined that a bottleneck link or node exists on the path, and another path with lower resource consumption cost needs to be found to avoid network congestion and achieve load balancing.
After the above calculation of the total cost is completed, constructing a multi-stage directed graph and mapping the resource cost consumed by the service function chain SFC request flow in the physical network to the multi-stage directed graph, wherein the multi-stage directed graph comprises the following steps:
constructing a network graph from an original network graphA multi-stage directed graph of stages, wherein the first stage of the directed graph is an entry node, and the last stage of the directed graph is an exit node;
the j stage of the directed graph is an SFC request flow deployed on the j stage function nodeThe j-1 th VNF request,
for two adjacent stages, connecting each node in the ith stage to all points in the (i + 1) th stage in the direction from the ith stage to the (i + 1) th stage;
in a multi-stage directed graph, when a VNF request of one SFC request flow is served by a VNF on one functional node, that link will correspond to one functional node on the original network graph.
As in fig. 3, will be establishedThe multi-stage directed graph of the stages is represented asAndrespectively show diagramsNode and a link. The first stage and the last stage respectively have only one entrance nodeAnd an egress nodePhase j represents the j-1 st VNF request of the SFC request stream deployed on the j-th phase function node,after the node arrangement of all the stages is completed, each node in the previous column is connected to all the nodes in the next column for every two adjacent columns. The link direction is from the node of the previous column to the node of the next column.
In the figureIn the other stages, except that only one node is provided in the first stage and the last stage, functional nodes in the original network diagram are respectively placed in each stage, and the functional nodes can deploy certain VNFs. For two VNFs deployed on different functional nodes, a flow with an SFC request needs to traverse a complete path through both VNFs. Thus, the figuresVNF links connecting different functional nodes in the network correspond to respective paths on the original network graph. However, since one functional node may deploy multiple different VNFs, for the graphWhen a VNF request of an SFC request flow is served by a VNF on a functional node, the link will correspond to a functional node on the original network graph.
From the original network mesh G and the multi-stage directed graphThe sum of three relative resource costs, namely bandwidth resources, flow table resources and calculation resources in the original network graph can be used as the weight of the link in the multistage directed graph. For the figureIn (1),is defined as a link cost ofBinary variableIndicating whether or not to linkTraversing physical link uv ∈ L, binary variableIndicating whether or not to linkTraverse physical node u ∈ V in addition, define a mapping functionTo obtain a functional node deploying a VNF andrepresenting functional nodesRelative cost of computing resources. The following formulaRelative cost of the link
In the figureThe path minimum resource cost is calculated according to equation (21). Wherein, binary variablesIs shown in the figureIn (1)Whether to traverse the graphIn (1)
Finally, a routing path with the lowest relative cost for acquiring the service function chain SFC request flow is calculated based on an integer linear programming model, and the related algorithm for taking the path as the routing path allocated by the current routing comprises the following steps:
inputting: SFC request stream pi=(si,ti;SCi,bwi,CPi) Physical network G ═ V, L, service function chain graphResource capacity:resource surplus rate:
2. A VNF queue Q is initialized.
3. A set of mappable nodes a is initialized.
5. Computing resource demand d of VNF in set VmAnd the data are sorted from small to large and sequentially enter a queue Q.
6. A set of mappable nodes a is constructed. Search function node setIf the remaining amount of computing resources of the functional nodeThe constraint is satisfied (15), then this functional node is added to the set a.
7. Selecting a VNF optimal deployment locationFetch the elements in queue Q and according toSearching the functional nodes in the mappable set A, and deploying the VNF to the functional nodesIn the above, if the VNF is successfully deployed to the function nodeIn the above, the node is then connectedAdding to collectionsPerforming the following steps; otherwise, according toAnd obtaining the suboptimal solution, updating the queue Q, and updating the residual computing resource quantity of the corresponding functional node.
8. If VNFs in the queue Q do not complete deployment, step is returnedStep 7; otherwise, all VNF deployments are completed, and the final VNF deployment is obtainedAnd (4) collecting.
9. An optimal routing path is found for the SFC request.
10. The initialization k is 1.
11.While k≤K do
Returning a routing failure and rejecting the request.
In the pseudo code, K represents the total number of shortest paths searched, routGRepresenting the routing path in the original network G.
It should be noted that u in this embodiment represents a node in a physical network, i.e., a node in fig. 1;represents a node in a service function chain, i.e., a node in the original network shown in fig. 2;are nodes in a multi-stage directed graph, i.e., nodes in the network shown in fig. 3.
Although embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that changes, modifications, substitutions and alterations can be made in these embodiments without departing from the principles and spirit of the invention, the scope of which is defined in the appended claims and their equivalents.
Claims (10)
1. A route distribution method based on virtual network function is characterized by comprising the following steps:
establishing a physical network model, and defining a Service Function Chain (SFC) request flow;
modeling according to the defined service function chain SFC to obtain a service function chain SFC model;
acquiring the resource cost consumed by the service function chain SFC request flow in the physical network according to the service function chain SFC model;
constructing a multi-stage directed graph, and mapping the resource cost consumed by the service function chain SFC request flow in the physical network to the multi-stage directed graph to obtain the relative cost of the service function chain SFC request flow;
and calculating a routing path with the lowest relative cost for acquiring the service function chain SFC request flow based on an integer linear programming model, and taking the path as a routing path allocated by the current routing.
2. The routing distribution method based on virtual network function of claim 1, wherein establishing a physical network model comprises:
defining a physical network as an undirected graph G ═ V, L, where V and L represent a set of physical nodes and a set of physical links, respectively;
the nodes in the physical network are connected with one another to form a physical link;
defining N as a server set, wherein N is one server in the server set;
if the VNF is deployed on a physical node attached with a server and the physical node bears the VNF function, defining a set of the physical nodes with the VNF function as a function node set and defining other points as a switch node set;
the definition set M represents a set of VNF functions in all virtual networks, where M ∈ M represents one virtual network function in the set of VNFs;
and P represents the collection of the flow with the SFC request, and the construction of the physical network model is completed.
3. The virtual network function-based routing assignment method of claim 2, wherein defining service function chain SFC request flows comprises defining each SFC request flow to be composed of an ingress node, an egress node, and a service function chain composed of VNFs, and representing the SFC request flows and the service function chain as:
pi=(si,ti;SCi,bwi,CPi);
wherein p isiRepresenting a stream of SFC requests; siAn ingress node representing a request flow; t is tiAn egress node representing an SFC request flow; SC (Single chip computer)iOrdered VNF sequences, SC, representing the SFC request flow that must pass sequentiallyi,lThe i-th VNF request through which the SFC request flows is represented,<SCi,1,SCi,2,…,SCi,l>an ordered VNF sequence representing the sequential order in which SFC request streams must pass;represents the service function chain length, | SC, of the SFC request flowiI denotes SCiThe VNF request total of (a); bwiRepresenting SFC request stream piThe requested bandwidth resource of (2); CP (CP)iRepresenting SFC request stream piThe computing resources of (1).
4. The routing distribution method based on virtual network function of claim 1, wherein the Service Function Chain (SFC) model is expressed as:
wherein,resource cost consumed by a service function chain SFC request flow;representing the total cost of link bandwidth consumed by the SFC request stream routing path;the total cost of switch flow table entry resources consumed by the flow routing path for the SFC request;the computing resources of the functional nodes consumed for the SFC request flow routing path consume the total cost.
5. The virtual network function-based routing allocation method of claim 4, wherein the total cost of the link bandwidth consumed by the SFC request stream routing path is calculatedThe bandwidth resource consumption requested by the SFC cannot exceed the bandwidth resource remaining on the physical link,expressed as:
wherein,representing service function chain linksWhether or not to map onto a link uv in a physical network, when the service function chain linkWhen mapped onto a link uv in a physical networkOtherwiseL denotes the set of all links in the physical network,represents the set of all service function chain links;representing the bandwidth resource cost of the physical link uv.
6. The routing allocation method based on virtual network function of claim 4, wherein the total cost of switch flow table entry resources consumed by SFC request flow routing path is calculatedThe flow table entry resources consumed by the SFC request cannot exceed the flow table entry resources remaining on the switch node,expressed as:
wherein, VsRepresenting a set of switch nodes;a chain of service function links is represented,represents the set of all service function chain links;representing a flow table resource cost of the switch node u;to represent a linkWhether to traverse the binary variable of the physical node u, and if so, whether to traverse the binary variable of the physical node uOtherwise
7. The method of claim 4, wherein the total cost of computing resources of the functional nodes consumed by the SFC request stream routing path is calculatedAt that time, all CPUs on the functional node requested by the SFC consume no more CPU than the remainder of the CPUs on the selected functional node,expressed as:
wherein, VmRepresents a collection of all the functional nodes that are,a VNF request in one service function chain representing a request flow i,representing a set of all VNF nodes in a service function chain of a request flow i, N representing one server, N being a set of all servers, M representing one of all VNF nodes, M representing a set of all VNF nodes;the computational resource cost of functional node u; h isn,vA binary variable representing whether server n is attached to physical node v, if so, hn,v1, otherwise hn,v=0;Presentation requestBinary variable of whether or not to be served by VNF node m, if being servedOtherwiseyn,mA binary variable representing whether or not the VNF node m is deployed on the server n, and when deployed yn,m1, otherwise yn,m=0。
8. The virtual network function-based routing allocation method of claim 1, wherein constructing the multi-stage directed graph and mapping resource costs consumed by Service Function Chain (SFC) request flows in the physical network to the multi-stage directed graph comprises:
constructing a network graph from an original network graphA multi-stage directed graph of stages, wherein the first stage of the directed graph is an entry node, and the last stage of the directed graph is an exit node;
the j stage of the directed graph is the j-1 VNF request of the SFC request flow deployed on the j stage function node, j is 2,3, …,
for two adjacent stages, connecting each node in the ith stage to all points in the (i + 1) th stage in the direction from the ith stage to the (i + 1) th stage;
in a multi-stage directed graph, when a VNF request of one SFC request flow is served by a VNF on one functional node, that link will correspond to one functional node on the original network graph.
9. The virtual network function-based routing distribution method of claim 1, wherein the relative composition of Service Function Chain (SFC) request flow is represented as:
wherein,indicating a linkThe relative cost of (c);indicating that request i has passedThe resource cost of the link uv in the physical network,representing service function chain linksWhether or not to map onto a link uv in a physical network, when the service function chain linkWhen mapped onto a link uv in a physical networkOtherwise Representing the relative flow table resource cost of a switch node requesting i to traverse a link uv in the physical network;representing functional nodesRelative computing resource cost of;representing multi-stage directed graph inner function nodesThe cost of computing resources of (a);representing a set of all service function chain links in the multi-stage directed graph;represents the set of all VNF nodes in the service function chain requesting flow i in the multi-stage directed graph.
10. The routing distribution method based on virtual network functions of claim 1, wherein calculating the routing path with the lowest relative cost for acquiring the Service Function Chain (SFC) request flow based on the integer linear programming model comprises:
S2: set of all VNF nodes in the service function chain that will request flow iComputing resource demand d of VNF inmSequencing the data according to the sequence from small to large, and sequentially entering a queue Q;
s3: searching a set of functional nodes in a multi-stage directed graphIf all CPUs on the functional node requested by the SFC consume no more than the remaining CPUs on the selected functional node, adding the functional node to the set A;
s4: fetch the elements in queue Q and according toSearching the functional nodes in the mappable set A, and deploying the VNF to the functional nodesIn the above, if the VNF is successfully deployed to the function nodeIn the above, the node is then connectedAdding to collectionsPerforming the following steps; otherwise, getUpdating the queue Q and updating the residual computing resource quantity of the corresponding functional node;
s5: if VNFs in the queue Q are not completely deployed, returning to the step S4; otherwise, all VNF deployments are completed, and the final VNF deployment is obtainedGathering, finding an optimal routing path for the SFC request;
s6: searching all shortest paths in the multi-stage directed graph according to steps S1-S5;
s7: converting the shortest path obtained in the multi-stage directed graph into a physical network;
s8: judging whether the shortest path in the physical network is satisfied or not, and whether two end points of the selected path are also selected or not;
and whether the routing path of the SFC request flow is continuous;
and whether the bandwidth resource consumption requested by the SFC cannot exceed the bandwidth resource remaining on the physical link;
and the flow table entry resource consumption requested by the SFC cannot exceed the flow table entry resource remained on the switch node;
and all CPU consumption on the functional node requested by the SFC cannot exceed the residual CPU on the selected functional node;
if all the requirements are met, receiving request SFC request flow, updating residual bandwidth resources, calculating resources and flow table resources, and feeding back the routing path meeting the requirements; otherwise, the feedback route fails, and the request is rejected.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202010185421.1A CN111385202B (en) | 2020-03-17 | 2020-03-17 | Route distribution method based on virtual network function |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202010185421.1A CN111385202B (en) | 2020-03-17 | 2020-03-17 | Route distribution method based on virtual network function |
Publications (2)
Publication Number | Publication Date |
---|---|
CN111385202A true CN111385202A (en) | 2020-07-07 |
CN111385202B CN111385202B (en) | 2022-03-11 |
Family
ID=71221513
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202010185421.1A Active CN111385202B (en) | 2020-03-17 | 2020-03-17 | Route distribution method based on virtual network function |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN111385202B (en) |
Cited By (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN113259440A (en) * | 2021-05-18 | 2021-08-13 | 重庆邮电大学 | Load balancing-based dynamic deployment method and system for virtual network functions |
CN113411207A (en) * | 2021-05-28 | 2021-09-17 | 中国人民解放军战略支援部队信息工程大学 | Service function circulation arrangement basic platform and method of intelligent network service function chain |
CN113507412A (en) * | 2021-07-08 | 2021-10-15 | 中国人民解放军国防科技大学 | SRv6 router progressive deployment method, system and storage medium in network interconnection |
CN113556288A (en) * | 2021-07-23 | 2021-10-26 | 中国科学技术大学苏州高等研究院 | Device and method for updating service function link route in multi-tenant cloud |
CN114124796A (en) * | 2021-10-26 | 2022-03-01 | 清华大学 | Service chain deployment processing method and device, computer storage medium and terminal |
CN114257510A (en) * | 2021-11-12 | 2022-03-29 | 广东工业大学 | Network function chain optimization method for multicast routing |
CN114650234A (en) * | 2022-03-14 | 2022-06-21 | 中天宽带技术有限公司 | Data processing method and device and server |
CN115226044A (en) * | 2022-07-15 | 2022-10-21 | 重庆邮电大学 | Multicast routing method and system in NFV network |
US20230236948A1 (en) * | 2022-01-21 | 2023-07-27 | Dell Products L.P. | Cost-Optimized Recommendations from Inaccurate Event Logs |
Citations (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20160352634A1 (en) * | 2014-02-06 | 2016-12-01 | Nec Corporation | Network system, network control method and control apparatus |
US20170094002A1 (en) * | 2015-09-26 | 2017-03-30 | Dinesh Kumar | Technologies for offloading data object replication and service function chain management |
CN107332913A (en) * | 2017-07-04 | 2017-11-07 | 电子科技大学 | A kind of Optimization deployment method of service function chain in 5G mobile networks |
US20180159801A1 (en) * | 2016-12-07 | 2018-06-07 | Nicira, Inc. | Service function chain (sfc) data communications with sfc data in virtual local area network identifier (vlan id) data fields |
CN108260169A (en) * | 2018-01-26 | 2018-07-06 | 重庆邮电大学 | A kind of service function chain dynamic deployment method ensured based on QoS |
CN109981438A (en) * | 2019-03-22 | 2019-07-05 | 大连大学 | A kind of satellite network load-balancing method towards SDN and NFV cooperation deployment frame |
CN110178342A (en) * | 2017-01-14 | 2019-08-27 | 瑞典爱立信有限公司 | The scalable application level of SDN network monitors |
CN110198234A (en) * | 2019-05-15 | 2019-09-03 | 中国科学技术大学苏州研究院 | Virtual switch and virtual network function combine dispositions method in software defined network |
CN110505082A (en) * | 2019-07-26 | 2019-11-26 | 国家电网有限公司 | A kind of NFV service chaining mapping method towards cost and QoS |
-
2020
- 2020-03-17 CN CN202010185421.1A patent/CN111385202B/en active Active
Patent Citations (10)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20160352634A1 (en) * | 2014-02-06 | 2016-12-01 | Nec Corporation | Network system, network control method and control apparatus |
US20170094002A1 (en) * | 2015-09-26 | 2017-03-30 | Dinesh Kumar | Technologies for offloading data object replication and service function chain management |
CN107925677A (en) * | 2015-09-26 | 2018-04-17 | 英特尔公司 | For unloading the technology of data object replication and service function chain management |
US20180159801A1 (en) * | 2016-12-07 | 2018-06-07 | Nicira, Inc. | Service function chain (sfc) data communications with sfc data in virtual local area network identifier (vlan id) data fields |
CN110178342A (en) * | 2017-01-14 | 2019-08-27 | 瑞典爱立信有限公司 | The scalable application level of SDN network monitors |
CN107332913A (en) * | 2017-07-04 | 2017-11-07 | 电子科技大学 | A kind of Optimization deployment method of service function chain in 5G mobile networks |
CN108260169A (en) * | 2018-01-26 | 2018-07-06 | 重庆邮电大学 | A kind of service function chain dynamic deployment method ensured based on QoS |
CN109981438A (en) * | 2019-03-22 | 2019-07-05 | 大连大学 | A kind of satellite network load-balancing method towards SDN and NFV cooperation deployment frame |
CN110198234A (en) * | 2019-05-15 | 2019-09-03 | 中国科学技术大学苏州研究院 | Virtual switch and virtual network function combine dispositions method in software defined network |
CN110505082A (en) * | 2019-07-26 | 2019-11-26 | 国家电网有限公司 | A kind of NFV service chaining mapping method towards cost and QoS |
Non-Patent Citations (4)
Title |
---|
FAIZUL BARI ET AL.: "Orchestrating Virtualized Network Functions", 《IEEE TSNM》 * |
QIXIA ZHANG ET AL.: "Joint Optimization of Chain Placement and Request Scheduling for Network Function Virtualization", 《IEEE ICDCS》 * |
朱晓荣等: "面向多业务需求的NFV和SDN融合的资源优化算法", 《通信学报》 * |
王琛等: "一种基于动态规划的vEPC服务功能链部署方法", 《计算机应用研究》 * |
Cited By (14)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN113259440B (en) * | 2021-05-18 | 2022-04-22 | 重庆邮电大学 | Load balancing-based dynamic deployment method and system for virtual network functions |
CN113259440A (en) * | 2021-05-18 | 2021-08-13 | 重庆邮电大学 | Load balancing-based dynamic deployment method and system for virtual network functions |
CN113411207A (en) * | 2021-05-28 | 2021-09-17 | 中国人民解放军战略支援部队信息工程大学 | Service function circulation arrangement basic platform and method of intelligent network service function chain |
CN113411207B (en) * | 2021-05-28 | 2022-09-20 | 中国人民解放军战略支援部队信息工程大学 | Service function circulation arrangement basic platform and method of intelligent network service function chain |
CN113507412A (en) * | 2021-07-08 | 2021-10-15 | 中国人民解放军国防科技大学 | SRv6 router progressive deployment method, system and storage medium in network interconnection |
CN113556288A (en) * | 2021-07-23 | 2021-10-26 | 中国科学技术大学苏州高等研究院 | Device and method for updating service function link route in multi-tenant cloud |
CN114124796A (en) * | 2021-10-26 | 2022-03-01 | 清华大学 | Service chain deployment processing method and device, computer storage medium and terminal |
CN114257510A (en) * | 2021-11-12 | 2022-03-29 | 广东工业大学 | Network function chain optimization method for multicast routing |
CN114257510B (en) * | 2021-11-12 | 2024-05-24 | 广东工业大学 | Network function chain optimization method for multicast routing |
US20230236948A1 (en) * | 2022-01-21 | 2023-07-27 | Dell Products L.P. | Cost-Optimized Recommendations from Inaccurate Event Logs |
CN114650234A (en) * | 2022-03-14 | 2022-06-21 | 中天宽带技术有限公司 | Data processing method and device and server |
CN114650234B (en) * | 2022-03-14 | 2023-10-27 | 中天宽带技术有限公司 | Data processing method, device and server |
CN115226044A (en) * | 2022-07-15 | 2022-10-21 | 重庆邮电大学 | Multicast routing method and system in NFV network |
CN115226044B (en) * | 2022-07-15 | 2023-07-18 | 重庆邮电大学 | Multicast routing method and system in NFV network |
Also Published As
Publication number | Publication date |
---|---|
CN111385202B (en) | 2022-03-11 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN111385202B (en) | Route distribution method based on virtual network function | |
CN108260169B (en) | QoS guarantee-based dynamic service function chain deployment method | |
CN108566659B (en) | 5G network slice online mapping method based on reliability | |
CN109818786B (en) | Method for optimally selecting distributed multi-resource combined path capable of sensing application of cloud data center | |
CN107454019B (en) | Dynamic bandwidth allocation method, device, equipment and storage medium for software defined network | |
CN108965014B (en) | QoS-aware service chain backup method and system | |
CN108881207B (en) | Network security service realization method based on security service chain | |
CN106537824B (en) | Method and apparatus for the response time for reducing information centre's network | |
CN109412963B (en) | Service function chain deployment method based on stream splitting | |
CN100534059C (en) | Method for overcastting network router by optimized tree topology | |
Gong et al. | Revenue-driven virtual network embedding based on global resource information | |
CN111885493B (en) | Micro-cloud deployment method based on improved cuckoo search algorithm | |
CN105681153A (en) | Virtual network mapping method and device | |
CN112260950A (en) | Cloud storage network multicast stream scheduling method based on service priority differentiation | |
CN107979545A (en) | A kind of mapping method of virtual network based on nodal community | |
CN107124303A (en) | The service chaining optimization method of low transmission time delay | |
CN114071582A (en) | Service chain deployment method and device for cloud-edge collaborative Internet of things | |
CN111800352B (en) | Service function chain deployment method and storage medium based on load balancing | |
CN117097806A (en) | Micro-service call graph deployment and request route joint optimization method and system | |
CN110851235A (en) | Virtual network function deployment method suitable for multidimensional resource optimization configuration | |
Shi et al. | Coflow scheduling in data centers: routing and bandwidth allocation | |
CN113285832A (en) | NSGA-II-based power multi-mode network resource optimization allocation method | |
Fan et al. | DRL-D: Revenue-aware online service function chain deployment via deep reinforcement learning | |
CN117749697A (en) | Cloud network fusion pre-scheduling method, device and system and storage medium | |
CN108833297A (en) | Priority classification method, dispatching method and the device of big data flow |
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 |