CN109379230B - Service function chain deployment method based on breadth-first search - Google Patents

Service function chain deployment method based on breadth-first search Download PDF

Info

Publication number
CN109379230B
CN109379230B CN201811324613.5A CN201811324613A CN109379230B CN 109379230 B CN109379230 B CN 109379230B CN 201811324613 A CN201811324613 A CN 201811324613A CN 109379230 B CN109379230 B CN 109379230B
Authority
CN
China
Prior art keywords
node
deployment
service function
hop
function chain
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
CN201811324613.5A
Other languages
Chinese (zh)
Other versions
CN109379230A (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.)
University of Electronic Science and Technology of China
Original Assignee
University of Electronic Science and Technology of China
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 University of Electronic Science and Technology of China filed Critical University of Electronic Science and Technology of China
Priority to CN201811324613.5A priority Critical patent/CN109379230B/en
Publication of CN109379230A publication Critical patent/CN109379230A/en
Application granted granted Critical
Publication of CN109379230B publication Critical patent/CN109379230B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08—Configuration management of networks or network elements
    • H04L41/0803—Configuration setting
    • H04L41/0823—Configuration setting characterised by the purposes of a change of settings, e.g. optimising configuration for enhancing reliability
    • 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/123—Evaluation of link 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/20—Hop count for routing purposes, e.g. TTL
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/50—Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate

Landscapes

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

Abstract

The invention discloses a service function chain deployment method based on breadth-first search. The deployment algorithm provided by the invention does not restrict the scale, the sparse characteristic and the like of the network, so that the method can be suitable for most networks. The algorithm provided by the invention realizes the service function chain deployment based on the shortest path between the service terminal and the user, so that the bandwidth cost and the time delay consumed by the deployment can be reduced, and the deployment cost can be reduced. When the node is selected, the node load rate and the link load rate are considered, the optimal selection factor is designed to reflect the influence of the load rate on the node selection, and the load balance is optimized.

Description

Service function chain deployment method based on breadth-first search
Technical Field
The invention relates to the technical field of virtual networks, in particular to a service function chain deployment method based on breadth-first search.
Background
Network Function Virtualization (NFV) enables functions of network equipment to be independent of special hardware no longer through software and hardware decoupling and function abstraction, hardware resources can be fully and flexibly shared, and rapid development and deployment of new services are achieved. Based on actual traffic demands, multiple virtual network functions are grouped into Service Function Chains (SFCs) in a particular order and then deployed into the network to provide services to users.
With the increase of network users and the development of services, the telecommunication industry needs to store and transmit a large amount of data, and the hardware type network cannot bear the impact of the applications. In most conventional networks, each network function requires separate hardware and establishes a service chain to support applications on new network devices and integrate them into a cumbersome and error-prone sequence. These specialized hardware are closed and expensive, causing not only network rigidity, but also increased network capital and operating expenses. Network function virtualization can implement network function deployment in a shorter time by running virtual machines that perform various functions. Whenever a user requires a new network function, the service provider may automatically start a virtual machine that supports that function. Not only can the deployment time be reduced, but also the capital expenditure cost and the operating cost are reduced.
Deploying service function chains in a network is a hot spot of current research, and there have been many studies. For example, researchers have studied the deployment problem of a two-step service function chain with nodes and links considered separately, and proposed an algorithm based on greedy and simulated annealing to deploy the service function chain to reduce the deployment latency and bandwidth. This algorithm can reduce the overall deployment cost, but the authors do not consider node and link resources jointly. Researchers have modeled the deployment problem of service function chains as a mixed integer linear programming problem to optimize virtual network function deployment while satisfying constraints (e.g., bandwidth).
With the expansion of network size and the increase of requests for service function chains, how to guarantee the successful deployment of service function chains is a huge challenge. Many studies show that the service function chain deployment problem is an NP-Hard problem, a polynomial time algorithm does not exist to solve the problem, and an efficient heuristic algorithm is usually adopted to obtain an approximate solution. In addition, reducing the cost (e.g., delay, bandwidth) consumed by the service function chain deployment is another challenge, and is an important index for evaluating the deployment algorithm.
At present, there have been some studies on service function chain deployment methods, such as greedy and simulated annealing algorithms. The method mainly includes the steps that a greedy algorithm is used for finding out appropriate nodes to deploy VNFs, then the shortest path is found among the deployed nodes, and finally a scheme obtained by optimizing the greedy algorithm through a simulated annealing algorithm is used. Although the above method can implement deployment of service function chain, it does not consider node and link resources of the underlying topology at the same time, resulting in that the deployed path length is longer than the service function chain length, resulting in increase of delay and bandwidth cost.
For the deployment problem of the service function chain, related researchers also provide an ABA algorithm, and the main idea is to deploy by using a greedy algorithm and a tabu search algorithm, so that the success rate of deployment is increased, and the time delay and cost of deployment processing are reduced. Although the method can realize the deployment of the service function chain and bring about the optimization of the performance, the method only considers the node resource constraint in the bottom layer topology and does not process the link resource constraint in the topology. In addition, the order constraints of the VNFs in the service function chain are not considered in the model.
Disclosure of Invention
Aiming at the defects in the prior art, the service function chain deployment method based on breadth-first search solves the problems of high service function chain deployment consumption and high time delay.
In order to achieve the purpose of the invention, the invention adopts the technical scheme that: a service function chain deployment method based on breadth-first search comprises the following steps:
s1, invoking a breadth-first search algorithm between physical nodes deployed between a user and a service terminal to obtain a two-dimensional set of node distribution of the shortest hop count and different hop counts between the nodes;
and S2, comparing the shortest hop count with the length of the service function chain, obtaining three deployment schemes according to the comparison result, iteratively searching the node with the minimum link delay in a two-dimensional set of different hop count node distribution through a GRA algorithm, and finding the service function chain deployment path with the optimized delay through the node.
Further: the specific steps of step S1 are:
s11, initializing queue, two-dimensional set List<List<vi>>list1And List set<vi>list2Order count variable con1＝1，con2Adding a service terminal position node s into a queue (0);
s12, when the queue is not empty, the step S13 is carried out, otherwise, the algorithm is ended, and the step S2 is carried out;
s13, taking out a node v from the queue, and adding the node v into the set list2And mark node v as visited, let count variable con1Subtracting 1;
s14, when the node v is not equal to the user node d, the step S16 is executed, otherwise, the step S15 is executed;
s15, list set2Add to two-dimensional set list1In the method, the Hop count Hop and the two-dimensional set list where the user node d is located are output1Ending the algorithm, and proceeding to step S2;
s16, traversing all neighbor nodes of the node v, and entering the step S17 when all neighbor nodes are not traversed, or entering the step S19;
s17, when the current neighbor node z of the node v is not accessed, the step S18 is executed, otherwise, the step S16 is executed;
s18, adding the node z into the queue, and counting the variable con2Adding 1, returning to step S16;
s19, when counting variable con1When equal to 0, go to step S110, otherwise return to step S12;
s110, list set2Add to two-dimensional set list1In, order set list2For new empty sets, order count variable con1Equal to the count variable con2Order count variable con2Equal to 0, return to step S12.
Further: the specific steps of step S2 are:
s21, making the length SFCLEngth of the service function chain equal to the number of the service function chain links | ES |;
s22, when the Hop count Hop is SFCLength, the process proceeds to step S23, otherwise, the process proceeds to step S25;
s23, extracting service function chain virtual network function set VSIn the last virtual network function, when a node v is found in the node distribution set of the previous hop, the node v satisfies the deployment constraint CVSAnd CESAnd the optimum selection factor osf (v) is minimized, go to step S24, otherwise go to step S213;
s24, recording deployed nodes and links in a deployment scheme DS, subtracting 1 from both Hop count Hop and length SFCLength, and returning to the step S23;
s25, when the Hop count Hop > SFCLEnggth, the step S26 is executed, otherwise, the step S27 is executed;
s26 finding service function chain deployment request GSThe link e with the smallest bandwidth resource request extends the service function chainThe Hop-SFCLength | link with the bandwidth request of epsilon (e) is set, the newly added node request resources at the two ends of the link are set to be 0, so that the Hop is SFCLength, and the step S22 is returned;
s27, when Hop count Hop < SFCLEnggth, entering step S28, otherwise, entering step S213;
s28, extracting service function chain virtual network function set VSIn the last virtual network function, when a node v is found in the node distribution set of the hop, the node v satisfies the deployment constraint CVSAnd CESAnd the optimum selection factor osf (v) is minimized, go to step S29, otherwise go to step S211;
s29, recording deployed nodes and links in a deployment scheme DS, subtracting 1 from the length SFCLEngth, and entering the step S210;
s210, when Hop is SFCLEnggth, returning to the step S22, otherwise, returning to the step S27;
s211, when a node v is found in the node distribution set of the previous hop, the node v meets the deployment constraint CVSAnd CESAnd the optimum selection factor osf (v) is minimized, go to step S212, otherwise go to step S213;
s212, recording deployed nodes and links in a deployment scheme DS, subtracting 1 from both Hop count Hop and length SFCLength, and returning to the step S27;
and S213, when the deployment scheme DS meets the deployment constraint DC, deducting the resource consumption of the service function chain in the underlying network topology, counting the deployment cost, deploying the path delay and the load rate, outputting the deployment scheme DS, and ending the algorithm, otherwise, directly ending the algorithm.
Further: the calculation formula of the optimal selection factor OSF is as follows:
Figure BDA0001858376400000051
in the above formula, delay is a delay factor, b (v)k) Is a node vkLoad factor of b (v)c,vk) To connect nodes vcAnd node vkThe load rate of the link;
Figure BDA0001858376400000052
in the above formula, d (v)c,vm) To connect nodes vcAnd node vmDelay rate of the link, d (v)c,vk) To connect nodes vcAnd node vkThe delay rate of the link.
Further: the deployment constraint DC is specifically:
DC＝(CVS,CES,COR,LU,LT)
in the above formula, CVSResource constraints for virtual network functions, CESFor serving resource constraints of functional chain links, CORFor sequential constraint of service function chains, LUDeploying a user's location constraint, L, for a service function chain requestTThe location constraints of the service terminals in the request are deployed for the service function chain, wherein,
CVS＝{ε(vnf1),ε(vnf2),…,ε(vnf|VS|)}
CES＝{ε(e1),ε(e2),…,ε(e|ES|)}
COR＝{vnf1->vnf2->...->vnf|VS|}
in the above formula, { vnf1,vnf2,…,vnf|VS|V set of virtual network functions that deploy requests for service function chainsSAnd | VS | is the number of virtual network functions in the service function chain deployment request, { e1,e2,…,e|ES|Service function chain set of links E that deploy requests for service function chainsSAnd ES is the number of service function chain links, GS＝(VS,ES) And epsilon () is the requested resource requirement of the node or link.
The invention has the beneficial effects that:
(1) the application range is wide. Conventional service function chain deployment algorithms are proposed for a particular network. The deployment algorithm provided by the invention does not restrict the scale, the sparse characteristic and the like of the network, so that the method can be suitable for most networks.
(2) The deployment cost is low. The algorithm provided by the invention realizes service function chain deployment based on the shortest path between a service terminal and a user. That is, the path close to the shortest path length is preferentially selected to deploy the service function chain, so that the bandwidth cost and the time delay consumed by deployment are reduced, and the deployment cost is reduced accordingly.
(3) And (4) load balancing. In the algorithm design provided by the invention, when the node is selected, the node load rate and the link load rate are considered, and the optimal selection factor is designed to reflect the influence of the load rate on the node selection, so that the load balance is optimized.
Drawings
FIG. 1 is a general flow chart of the present invention;
FIG. 2 is a flowchart of step S1 according to the present invention;
FIG. 3 is a flowchart of step S2 according to the present invention.
Detailed Description
The following description of the embodiments of the present invention is provided to facilitate the understanding of the present invention by those skilled in the art, but it should be understood that the present invention is not limited to the scope of the embodiments, and it will be apparent to those skilled in the art that various changes may be made without departing from the spirit and scope of the invention as defined and defined in the appended claims, and all matters produced by the invention using the inventive concept are protected.
As shown in fig. 1, a service function chain deployment method based on breadth-first search includes the following steps:
s1, invoking a breadth-first search algorithm between physical nodes deployed between the user and the service terminal, to obtain a two-dimensional set of the shortest hop count and node distributions of different hop counts between nodes, as shown in fig. 2, the specific steps are:
s11, initializing queue, two-dimensional set List<List<vi>>list1And List set<vi>list2Order count variable con1＝1，con2Adding a service terminal position node s into a queue (0);
s12, when the queue is not empty, the step S13 is carried out, otherwise, the algorithm is ended, and the step S2 is carried out;
s13, taking out a node v from the queue, and adding the node v into the set list2And mark node v as visited, let count variable con1Subtracting 1;
s14, when the node v is not equal to the user node d, the step S16 is executed, otherwise, the step S15 is executed;
s15, list set2Add to two-dimensional set list1In the method, the Hop count Hop and the two-dimensional set list where the user node d is located are output1Ending the algorithm, and proceeding to step S2;
s16, traversing all neighbor nodes of the node v, and entering the step S17 when all neighbor nodes are not traversed, or entering the step S19;
s17, when the current neighbor node z of the node v is not accessed, the step S18 is executed, otherwise, the step S16 is executed;
s18, adding the node z into the queue, and counting the variable con2Adding 1, returning to step S16;
s19, when counting variable con1When equal to 0, go to step S110, otherwise return to step S12;
s110, list set2Add to two-dimensional set list1In, order set list2For new empty sets, order count variable con1Equal to the count variable con2Order count variable con2Equal to 0, return to step S12.
S2, comparing the shortest hop count with the length of the service function chain, obtaining three deployment schemes according to the comparison result, iteratively searching the node with the smallest link delay in the two-dimensional set of different hop count node distribution by the GRA algorithm, and finding the service function chain deployment path with the optimized delay by the node, as shown in fig. 3,
s21, making the length SFCLEngth of the service function chain equal to the number of the service function chain links | ES |;
s22, when the Hop count Hop is SFCLength, the process proceeds to step S23, otherwise, the process proceeds to step S25;
s23, extracting service function chain virtual network function set VSIn the last virtual network function, when a node v is found in the node distribution set of the previous hop, the node v satisfies the deployment constraint CVSAnd CESAnd the optimum selection factor osf (v) is minimized, go to step S24, otherwise go to step S213;
s24, recording deployed nodes and links in a deployment scheme DS, subtracting 1 from both Hop count Hop and length SFCLength, and returning to the step S23;
s25, when the Hop count Hop > SFCLEnggth, the step S26 is executed, otherwise, the step S27 is executed;
s26 finding service function chain deployment request GSExpanding a link with a bandwidth request of | Hop-SFCLength | in a service function chain, wherein the link with the minimum bandwidth resource request is the link with the bandwidth request of epsilon (e), setting the request resource of a newly added node at two ends of the link to be 0, enabling the Hop to be SFCLength, and returning to the step S22;
s27, when Hop count Hop < SFCLEnggth, entering step S28, otherwise, entering step S213;
s28, extracting service function chain virtual network function set VSIn the last virtual network function, when a node v is found in the node distribution set of the hop, the node v satisfies the deployment constraint CVSAnd CESAnd the optimum selection factor osf (v) is minimized, go to step S29, otherwise go to step S211;
s29, recording deployed nodes and links in a deployment scheme DS, subtracting 1 from the length SFCLEngth, and entering the step S210;
s210, when Hop is SFCLEnggth, returning to the step S22, otherwise, returning to the step S27;
s211, when a node v is found in the node distribution set of the previous hop, the node v meets the deployment constraint CVSAnd CESAnd the optimum selection factor osf (v) is minimized, go to step S212, otherwise go to step S213;
s212, recording deployed nodes and links in a deployment scheme DS, subtracting 1 from both Hop count Hop and length SFCLength, and returning to the step S27;
and S213, when the deployment scheme DS meets the deployment constraint DC, deducting the resource consumption of the service function chain in the underlying network topology, counting the deployment cost, deploying the path delay and the load rate, outputting the deployment scheme DS, and ending the algorithm, otherwise, directly ending the algorithm.
The deployment constraint DC is specifically:
DC＝(CVS,CES,COR,LU,LT)
in the above formula, CVSResource constraints for virtual network functions, CESFor serving resource constraints of functional chain links, CORFor sequential constraint of service function chains, LUDeploying a user's location constraint, L, for a service function chain requestTThe location constraints of the service terminals in the request are deployed for the service function chain, wherein,
CVS＝{ε(vnf1),ε(vnf2),…,ε(vnf|VS|)}
CES＝{ε(e1),ε(e2),…,ε(e|ES|)}
COR＝{vnf1->vnf2->...->vnf|VS|}
in the above formula, { vnf1,vnf2,…,vnf|VS|V set of virtual network functions that deploy requests for service function chainsSAnd | VS | is the number of virtual network functions in the service function chain deployment request, { e1,e2,…,e|ES|Service function chain set of links E that deploy requests for service function chainsSAnd ES is the number of service function chain links, GS＝(VS,ES) And epsilon () is the requested resource requirement of the node or link.
In the present invention, the underlying physical network can be modeled as an undirected weighted graph GP＝(VP,EP). Wherein, VP＝{v1,v2,…,v|VP|Denotes a set of physical nodes, EP＝{l1,l2,…,l|EP|Denotes the set of physical links. | VP | and | EP | represent the number of physical nodes and physical links, respectively.
Definition RC ═ (C)VP,CEP,LNP) Is a physical network resource constraint, wherein CVPRepresenting a collection of attributes of a physical network node, a typical attribute of a physical network node comprising the node's total resource capacity a (v)i) Node remaining resource capacity c (v)i) And node load rate b (v)i)。CEPRepresenting a collection of physical network link attributes, a typical attribute of a physical network link comprising two nodes v to which the link is linkedi，vjThe total bandwidth capacity of the link a (l)i)＝a(vi,vj) Residual bandwidth capacity of the link c (l)i)＝c(vi,vj) Link load rate b (l)i)＝b(vi,vj) And link delay d (l)i)＝d(vi,vj)。LVP＝{L(v1),L(v2),…,L(v|VP|) Denotes the set of all physical network node locations.
Wherein the node load rate b (v) in the service function chain deploymenti) And link load rate b (l)i) The calculation formula of (2) is as follows:
Figure BDA0001858376400000101
Figure BDA0001858376400000102
the implementation deployment environment of the invention:
the technology can be used in an SDN-based network to realize the deployment of service function chains. SDN-based networks — SDN is a revolutionary revolution over traditional network architectures. It separates the control functions from the network switching device, moves them into a logically separate control environment, the network control system, and the SDN network transmits messages based on the OpeNFlow protocol. The system can be operated on a general server, and any user can directly program the control function at any time. Thus, the control functions are no longer limited to routers, nor to the programming and definition that can only be made by the manufacturer of the device. The essence of SDN is the programmability of a logic centralized control layer.
SDN facilitates network virtualization, thereby implementing integration of computing and storage resources of a network, and finally implementing control and management of the entire network by using a combination of simple software tools. This is one of the many advantages of SDN based networks and is also a key factor in deciding the deployment in the network with which service function chaining can be implemented.
Implementation of service function chaining in SDN-based network deployment:
a network operator can deploy the method for deploying the service function chain in the SDN-based network on the SDN on a control layer in a control router of the SDN, and the SDN control router can schedule a control management function carried by the SDN control router to collect information of the whole network, and obtain information of resource conditions of all nodes in the network, resources of links, time delay and the like. The router can acquire the topology of the whole network and corresponding resource information by the centralized control mode.
When a service function chain request comes, the SDN control router may schedule a service function chain-based deployment method deployed on its control layer according to the information of the whole network grasped by the SDN control router, calculate key parameters such as deployment cost, rejection rate, load rate, and the like, and feed back the parameters to an operator.

Claims (3)

1. A service function chain deployment method based on breadth-first search is characterized by comprising the following steps:
s1, invoking a breadth-first search algorithm between physical nodes deployed between a user and a service terminal to obtain a two-dimensional set of node distribution of the shortest hop count and different hop counts between the nodes;
s2, comparing the shortest hop count with the length of the service function chain, obtaining three deployment schemes according to the comparison result, iteratively searching a node with the minimum link delay in a two-dimensional set of different hop count node distribution through a GRA algorithm, and finding a service function chain deployment path with the optimized delay through the node;
the specific steps of step S1 are:
s11, initializing queue, two-dimensional set List<List<vi>>list1And List set<vi>list2Order count variable con1＝1，con2Adding a service terminal position node s into a queue (0);
s12, when the queue is not empty, the step S13 is carried out, otherwise, the algorithm is ended, and the step S2 is carried out;
s13, taking out a node v from the queue, and adding the node v into the set list2And mark node v as visited, let count variable con1Subtracting 1;
s14, when the node v is not equal to the user node d, the step S16 is executed, otherwise, the step S15 is executed;
s15, list set2Add to two-dimensional set list1In the method, the Hop count Hop and the two-dimensional set list where the user node d is located are output1Ending the algorithm, and proceeding to step S2;
s16, traversing all neighbor nodes of the node v, and entering the step S17 when all neighbor nodes are not traversed, or entering the step S19;
s17, when the current neighbor node z of the node v is not accessed, the step S18 is executed, otherwise, the step S16 is executed;
s18, adding the node z into the queue, and counting the variable con2Adding 1, returning to step S16;
s19, when counting variable con1When equal to 0, go to step S110, otherwise return to step S12;
s110, list set2Add to two-dimensional set list1In, order set list2For new empty sets, order count variable con1Equal to the count variable con2Order count variable con2Equal to 0, return to step S12;
the specific steps of step S2 are:
s21, making the length SFCLEngth of the service function chain equal to the number of the service function chain links | ES |;
s22, when the Hop count Hop is SFCLength, the process proceeds to step S23, otherwise, the process proceeds to step S25;
s23, extracting service function chain virtual network function set VSIn the last virtual network function, when a node v is found in the node distribution set of the previous hop, the node v satisfies the deployment constraint CVSAnd CESAnd the optimum selection factor osf (v) is minimized, go to step S24, otherwise go to step S213;
s24, recording deployed nodes and links in a deployment scheme DS, subtracting 1 from both Hop count Hop and length SFCLength, and returning to the step S23;
s25, when the Hop count Hop > SFCLEnggth, the step S26 is executed, otherwise, the step S27 is executed;
s26 finding service function chain deployment request GSExpanding a link with a bandwidth request of | Hop-SFCLength | in a service function chain, wherein the link with the minimum bandwidth resource request is the link with the bandwidth request of epsilon (e), setting the request resource of a newly added node at two ends of the link to be 0, enabling the Hop to be SFCLength, and returning to the step S22;
s27, when Hop count Hop < SFCLEnggth, entering step S28, otherwise, entering step S213;
s28, extracting service function chain virtual network function set VSIn the last virtual network function, when a node v is found in the node distribution set of the hop, the node v satisfies the deployment constraint CVSAnd CESAnd the optimum selection factor osf (v) is minimized, go to step S29, otherwise go to step S211;
s29, recording deployed nodes and links in a deployment scheme DS, subtracting 1 from the length SFCLEngth, and entering the step S210;
s210, when Hop is SFCLEnggth, returning to the step S22, otherwise, returning to the step S27;
s211, when a node v is found in the node distribution set of the previous hop, the node v meets the deployment constraint CVSAnd CESAnd minimizing the optimal selection factor OSF (v), and entering stepStep S212, otherwise, go to step S213;
s212, recording deployed nodes and links in a deployment scheme DS, subtracting 1 from both Hop count Hop and length SFCLength, and returning to the step S27;
and S213, when the deployment scheme DS meets the deployment constraint DC, deducting the resource consumption of the service function chain in the underlying network topology, counting the deployment cost, the deployment path time delay and the load rate, outputting the deployment scheme DS, and ending the algorithm, otherwise, directly ending the algorithm.
2. The service function chain deployment method based on breadth-first search as claimed in claim 1, wherein the optimal selection factor OSF is calculated by the following formula:
Figure FDA0002386825740000032
set of candidate nodes
In the above formula, delay is a delay factor, b (v)k) Is a node vkLoad factor of b (v)c,vk) To connect nodes vcAnd node vkThe load rate of the link;
Figure FDA0002386825740000031
set of candidate nodes
In the above formula, d (v)c,vm) To connect nodes vcAnd node vmDelay rate of the link, d (v)c,vk) To connect nodes vcAnd node vkThe delay rate of the link.
3. The service function chain deployment method based on breadth-first search according to claim 1, wherein the deployment constraint DC is specifically:
DC＝(CVS,CES,COR,LU,LT)
in the above formula, CVSResource constraints for virtual network functions, CESResource constraints for serving function chain links，CORFor sequential constraint of service function chains, LUDeploying a user's location constraint, L, for a service function chain requestTThe location constraints of the service terminals in the request are deployed for the service function chain, wherein,
CVS＝{ε(vnf1),ε(vnf2),…,ε(vnf|VS|)}
CES＝{ε(e1),ε(e2),…,ε(e|ES|)}
COR＝{vnf1->vnf2->...->vnf|VS|}
in the above formula, { vnf1,vnf2,…,vnf|VS|V set of virtual network functions that deploy requests for service function chainsSAnd | VS | is the number of virtual network functions in the service function chain deployment request, { e1,e2,…,e|ES|Service function chain set of links E that deploy requests for service function chainsSAnd ES is the number of service function chain links, GS＝(VS,ES) And epsilon () is the requested resource requirement of the node or link.
CN201811324613.5A 2018-11-08 2018-11-08 Service function chain deployment method based on breadth-first search Active CN109379230B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811324613.5A CN109379230B (en) 2018-11-08 2018-11-08 Service function chain deployment method based on breadth-first search

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811324613.5A CN109379230B (en) 2018-11-08 2018-11-08 Service function chain deployment method based on breadth-first search

Publications (2)

Publication Number Publication Date
CN109379230A CN109379230A (en) 2019-02-22
CN109379230B true CN109379230B (en) 2020-05-22

Family

ID=65383756

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811324613.5A Active CN109379230B (en) 2018-11-08 2018-11-08 Service function chain deployment method based on breadth-first search

Country Status (1)

Country Link
CN (1) CN109379230B (en)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110022230B (en) * 2019-03-14 2021-03-16 北京邮电大学 Deep reinforcement learning-based service chain parallel deployment method and device
CN110535705B (en) * 2019-08-30 2022-04-26 西安邮电大学 Service function chain construction method capable of adapting to user time delay requirement
CN110851235B (en) * 2019-11-04 2022-06-03 中国人民解放军战略支援部队信息工程大学 Virtual network function deployment method suitable for multidimensional resource optimization configuration
CN113630792B (en) * 2021-07-19 2023-09-19 西安电子科技大学 Traffic load balancing breadth-first search optimization method, system and equipment
CN115580573A (en) * 2022-09-22 2023-01-06 中国人民解放军国防科技大学 Service function chain path planning method and related equipment

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103500168A (en) * 2013-09-02 2014-01-08 中国矿业大学 Method and system for discovering communities in overlapped complex networks according to topology potential
CN105141617A (en) * 2015-09-14 2015-12-09 上海华为技术有限公司 Deploying and adjusting method for service functions among data centers and deploying and adjusting device for service functions among data centers
WO2017107215A1 (en) * 2015-12-25 2017-06-29 华为技术有限公司 Method, device and controller for deploying service functions in data center
CN108111437A (en) * 2017-12-28 2018-06-01 电子科技大学 A kind of Optimization Scheduling of virtual network function

Family Cites Families (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10243835B2 (en) * 2017-02-02 2019-03-26 Fujitsu Limited Seamless service function chaining across domains
CN107395506B (en) * 2017-09-07 2020-04-21 电子科技大学 Service function chain deployment method for optimizing transmission delay
CN107769976B (en) * 2017-10-31 2020-06-26 电子科技大学 Service function chain mapping method based on transmission bandwidth optimization
CN107666412B (en) * 2017-11-20 2019-07-02 电子科技大学 The virtual network function dispositions method of service function chain
CN108040008B (en) * 2017-12-08 2020-02-07 电子科技大学 Cross-domain deployment method of online service function chain
CN108260169B (en) * 2018-01-26 2021-04-02 重庆邮电大学 QoS guarantee-based dynamic service function chain deployment method
CN108200202B (en) * 2018-02-06 2019-11-12 电子科技大学 A kind of service function chain security deployment method calculating network applied to cloud and mist
CN108768736B (en) * 2018-06-05 2021-04-23 中国人民解放军国防科技大学 Optimization method of hybrid service function chain embedding cost

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103500168A (en) * 2013-09-02 2014-01-08 中国矿业大学 Method and system for discovering communities in overlapped complex networks according to topology potential
CN105141617A (en) * 2015-09-14 2015-12-09 上海华为技术有限公司 Deploying and adjusting method for service functions among data centers and deploying and adjusting device for service functions among data centers
WO2017107215A1 (en) * 2015-12-25 2017-06-29 华为技术有限公司 Method, device and controller for deploying service functions in data center
CN108111437A (en) * 2017-12-28 2018-06-01 电子科技大学 A kind of Optimization Scheduling of virtual network function

Also Published As

Publication number Publication date
CN109379230A (en) 2019-02-22

Similar Documents

Publication Publication Date Title
CN109379230B (en) Service function chain deployment method based on breadth-first search
CN108260169B (en) QoS guarantee-based dynamic service function chain deployment method
CN107094115B (en) Ant colony optimization load balancing routing algorithm based on SDN
CN106161610A (en) A kind of method and system of distributed storage
US20040017783A1 (en) Network topologies
CN112738820A (en) Dynamic deployment method and device of service function chain and computer equipment
CN109412963B (en) Service function chain deployment method based on stream splitting
CN108366089B (en) CCN caching method based on content popularity and node importance
CN110417652B (en) Software defined network routing method based on segmented routing strategy
CN105677447B (en) Time delay minimization of bandwidth virtual machine deployment method in distributed cloud based on cluster
Yi et al. A multi-criteria decision approach for minimizing the influence of VNF migration
Nguyen et al. Efficient virtual network embedding with node ranking and intelligent link mapping
Nguyen et al. Rethinking virtual link mapping in network virtualization
Hou et al. A gnn-based approach to optimize cache hit ratio in ndn networks
CN108243066B (en) Low-delay network service request deployment method
Zhao et al. Flow aggregation through dynamic routing overlaps in software defined networks
CN112995032B (en) Segment routing traffic engineering method and device based on limited widest path
CN113259263B (en) Data packet scheduling method in deep packet inspection cluster
CN111490902B (en) 664 Network message construction algorithm
CN110213149B (en) Virtual network mapping method based on node entropy
JP5595342B2 (en) Multiple path search method and apparatus
CN107276780B (en) It is a kind of for topology not exclusively can survey grid network dynamic generation tree method
CN104486240A (en) Method and device for classifying data packets
CN105610712B (en) The method for reducing whole network data stream forward delay based on software defined network framework
CN113630792B (en) Traffic load balancing breadth-first search optimization method, system and equipment

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
CB03 Change of inventor or designer information

Inventor after: Xu Zhu

Inventor after: Sun Gang

Inventor after: Yu Hongfang

Inventor before: Sun Gang

Inventor before: Xu Zhu

Inventor before: Yu Hongfang

CB03 Change of inventor or designer information
GR01 Patent grant
GR01 Patent grant