CN108737261A - A kind of two stage virtual network function forwarding G- Design method - Google Patents

A kind of two stage virtual network function forwarding G- Design method Download PDF

Info

Publication number
CN108737261A
CN108737261A CN201810442401.0A CN201810442401A CN108737261A CN 108737261 A CN108737261 A CN 108737261A CN 201810442401 A CN201810442401 A CN 201810442401A CN 108737261 A CN108737261 A CN 108737261A
Authority
CN
China
Prior art keywords
vnf
sfc
integrated
group
network function
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
Application number
CN201810442401.0A
Other languages
Chinese (zh)
Other versions
CN108737261B (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 CN201810442401.0A priority Critical patent/CN108737261B/en
Publication of CN108737261A publication Critical patent/CN108737261A/en
Application granted granted Critical
Publication of CN108737261B publication Critical patent/CN108737261B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

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/02—Topology update or discovery
    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/12—Discovery or management of network topologies
    • 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/18—Loop-free operations
    • 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/24—Multipath
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/82—Miscellaneous aspects
    • H04L47/827—Aggregation of resource allocation or reservation requests

Abstract

The invention discloses a kind of two stage virtual network functions to forward G- Design method, simultaneously in view of there are dependences between the part VNF in network service request, and flow rate of change caused by difference VNF working characteristics has differences, and VNF-FG designs are divided into two stages.First stage designs single SFC structures, minimizes logical links bandwidth wastage in bulk or weight；Second stage integrates a plurality of SFC, reduces VNF interstitial contents.In mappings work, each logical links needs to be mapped on one or more bottom physical link, and bandwidth allocation resource；VNF nodes need to be mapped on bottom physical server, and each VNF nodes need to operate in the virtual machine of instantiation.Therefore link bandwidth consumption and VNF interstitial contents are reduced to the greatest extent in VNF-FG designs, the cost of link maps cost and virtual machine instantiation can be reduced in follow-up mapping process.

Description

A kind of two stage virtual network function forwarding G- Design method
Technical field
The invention belongs to virtual network function technical fields, and in particular to a kind of two stage virtual network function forwarding figure The design of design method.
Background technology
The rapid expanding of adjoint network scale and the iterative innovation of network technology, the increasingly lengthy and jumbled deadlock of the old network architecture Change.To solve this problem, it is attempted to reconstruct existing network framework, NFV (Network Function Virtualization, network function virtualization) it is used as core technology therein, receive the close attention of the communications industry.NFV Network function is pulled out to come from dedicated hardware by technology, decouples the hardware and software of traditional equipment, such as multimedia caching, clothes Be engaged in quality monitor, video code translator, gateway and various agencies etc..Network Element Function is deployed in void by NFV by virtualization technology In quasi- machine, virtual resource layer separates Network Element Function and underlying resource, and the Network Element Function on upper layer is can not to perceive bottom hardware Physical resource, and operator only need to manage and safeguard the hardware physical resource of bottom.
In existing carrier network, the message that teleservice transmits is needed according to some specific sequence, if experience Dry function module node, the concept of SFC (Service Function Chain, service function chain) are just come into being.SFC It is the ordered set for including network function, data flow is a succession of according to the classifying rules and strategy progress provided in advance Network function processing.SFC is used widely under NFV environment, is compiled with software as a kind of presentation mode of network service The mode of journey realizes the network function realized in the past with hardware, i.e. VNF (Virtualized Network Function, Virtual network function), there is dynamic creation and delete, flexibility height and expansible characteristic.SFC logically illustrates number According to the VNF types and order passed through needed for stream.VNF-FG (VNF Forwarding Graph, virtual network function forwarding figure) And the logical topology chart for characterizing VNF connection relations and flux and flow direction, it can include that multiple SFC flow, and provide multiple clothes Business.
The structure of VNF-FG determines specific presentation mode (tandem of VNF processing, the connection pass of VNF of service System).VNF-FG has source eye end system, and end system here may be a functional entity, it is also possible to a device port, Such as endpoint of a tunnel, Microsoft Loopback Adapter etc., show physical resource mesh position of the network flow in bottom-layer network.
The network service request that user is disposed on bottom-layer network, carries out resource allocation, can be split as following four step Suddenly：
(1) user is to service provider request network function, which can include functional demand simultaneously and non- Functional demand, functional demand refer to specific network function, for example deep message detects (Deep Packet Inspection, DPI), fire wall (Firewall, FW) etc., and non-functional requirement is commonly referred to as service quality (Quality of Service, QoS).
(2) service provider designs VNF-FG topological structures according to the network service request of user, wherein critically important Any is to calculate resource needed for it for each functional demand, to meet non-functional requirement.
(3) service provider formulate deployment scheme, by VNF-FG VNF and virtual link be mapped to NFVI (NFV Infrastructure, network function virtualized infrastructure) on, assurance function demand nand function demand obtains simultaneously Meet.
(4) according to deployment scheme, service provider distributes resource on physics host, starts virtual machine and disposes VNF Software connects these virtual machines finally by virtual link.
In four steps of above-mentioned service arrangement, second step the result is that input as third step, and this two step Largely affect the QoS entirely serviced and totle drilling cost.What is mainly studied in Web Service Deployment at present is third step VNF-FG mapping problems, and the VNF-FG Design Work Studies of second step compare missing.
VNF-FG contains VNF nodes and its connection relation in logic, and specifies time of wherein each stream after VNF Sequence.VNF-FG designs refer to the network service request according to user, design and meet VNF type demands, and meet VNF dependences The topological structure of relationship, VNF-FG are the input parameters as mapping phase.
If VNF dependences refer to that VNF2 depends on VNF1, then after customer flow must first pass through the processing of VNF1 It could receive the processing (for example decoder is had to after encoder) of VNF2.
The flow rate of change of VNF refer to the flow velocity rate left after VNF is handled with enter the VNF flow velocity rate it Than.VNF can influence to go out by the flow of its processing rate, and (for example fire wall can reduce data volume, and VPN agencies can be to datagram The newly-increased IPsec header overheads of text cause data volume to increase), going out the link bandwidth demand on side can change, therefore in VNF-FG Make the bandwidth demand of logical links small in design, it is possible to reduce link maps bottleneck and saving link maps cost.
VNF nodes in VNF-FG are finally physical nodes to be mapped to, and VNF running softwares are on a virtual machine to provide clothes Business, there are certain costs for instantiation virtual machine and virtual machine operation itself, therefore reduction VNF-FG interior joints number can subtract The number for instantiating virtual machine less, to achieve the purpose that cut operating costs.
Invention content
The purpose of the present invention proposes that a kind of two stage virtual network function forwards G- Design method, designs in offline field The virtual network function forwarding figure of logical links bandwidth wastage in bulk or weight and VNF interstitial contents is minimized under scape.
The technical scheme is that：A kind of two stage virtual network function forwarding G- Design method, including following step Suddenly：
S1, single SFC designs：VNF dependence graphs are constructed according to the VNF dependences in network service request, and right VNF dependence graphs carry out topological sorting, VNF dependence graphs are converted into VNF topological sequences, using VNF topological sequences as The order of VNF in SFC, designs single SFC.
Step S1 include it is following step by step：
S11, according to the VNF dependences in network service request, construct the VNF dependence graphs of directed acyclic.
Using each required VNF in network service request as a node in VNF dependence graphs, each rely on is closed System is directed toward dependence item as a line in VNF dependence graphs, by being relied on item, and the VNF to construct directed acyclic is relied on Relational graph.
S12, VNF dependence graphs all in-degrees be 0 node in choose flow rate of change minimum node be put into VNF topological sequences.
S13, the in-degree of the descendant node of the node selected in step S12 is subtracted 1.
S14, judge whether also have remaining node, if then return to step S12, otherwise enter step in VNF dependence graphs Rapid S15.
S15, using VNF topological sequences as the order of VNF in SFC, design single SFC；
S16, judge whether not carry out the network service request of SFC designs also, if then return to step S11, otherwise into Enter step S2.
S2, a plurality of SFC are integrated：All SFC are grouped, the SFC for possessing identical sources eye end system is divided into one group, SFC is integrated in every group, obtains VNF-FG.
Step S2 include it is following step by step：
S21, all SFC are grouped, the SFC for possessing identical sources eye end system is divided into one group.
S22, judge whether otherwise to terminate virtual net if then entering step S23 there is also the group for not carrying out SFC integration Network function forwards G- Design.
S23, one group of SFC is chosen, the SFC in group is integrated, the VNF-FG of the group, return to step S22 are obtained.
Step S23 include it is following step by step：
S231, one group of SFC is chosen, takes out the wherein SFC of VNF nodes at most as initial VNF-FG.
S232, judge that whether there is also remaining SFC in this group of SFC, if then entering step S233, otherwise complete the group The integration of SFC, return to step S22.
S233, the most SFC conducts SFC to be integrated of VNF nodes in this group of SFC is taken out.
All paths of S234, the current VNF-FG of traversal, and calculate the longest common subsequence in each path and SFC to be integrated Lcs。
S235, the longest Lcs of selection are denoted as Lcs_max, and Lcs_max and SFC to be integrated are integrated, formed new VNF-FG, return to step S232.
If the VNF in SFC to be integrated, which is the VNF, SFC to be integrated and current VNF-FG for including in Lcs_max, shares this VNF；If the VNF in SFC to be integrated is the VNF not included in Lcs_max, the VNF nodes are increased newly simultaneously in current VNF-FG Add link.
The beneficial effects of the invention are as follows：
(1) present invention compensates for the missing of VNF-FG design links in current service deployment and resource allocation work, provides VNF-FG structures are calculated according to the network service request of user under offline scenario and (represent the specific provider of network service Formula) entire flow.
(2) Consideration is comprehensive：The present invention considers the VNF in network service request there are dependence, and the stream of VNF Amount rate of change has differences, and the single SFC design phases make logical links bandwidth in SFC always disappear under the premise of ensureing dependence Consumption is minimum；In view of the end system of SFC is determined in bottom physical location, in SFC conformity stages, identical sources eye end system will be possessed SFC point be one group, integrated in group, the SFC integration because of not homologous eye end system can be prevented, cause subsequently to map work The a plurality of SFC of end system relatively far apart needs to share a VNF example and additional link is caused to consume in work.Ensure simultaneously Ring is not present in the VNF-FG that SFC is integrally formed, link disappears caused by the flow in mapping process can also be avoided to generate circuit Consumption.
(3) mapping cost can be reduced：The present invention ensure that logical links bandwidth wastage in bulk or weight when designing single SFC most It is small, and it polymerize identical VNF as far as possible in a plurality of SFC conformity stages, link maps cost and virtual machine instantiation can be reduced Cost.
Description of the drawings
Fig. 1 show a kind of two stage virtual network function forwarding G- Design method flow provided in an embodiment of the present invention Figure.
Fig. 2 show the schematic diagram provided in an embodiment of the present invention that dependence graph is constructed according to network service request.
Fig. 3 show the flow chart step by step of step S23 provided in an embodiment of the present invention.
Fig. 4 show VNF-FG path schematic diagrams provided in an embodiment of the present invention.
Fig. 5 show SFC schematic diagrames to be integrated provided in an embodiment of the present invention.
Fig. 6 show the new VNF-FG schematic diagrames after SFC polymerizations provided in an embodiment of the present invention.
Specific implementation mode
Carry out detailed description of the present invention illustrative embodiments with reference to the drawings.It should be appreciated that shown in attached drawing and The embodiment of description is only exemplary, it is intended that is illustrated the principle and spirit of the invention, and is not limited the model of the present invention It encloses.
An embodiment of the present invention provides a kind of two stage virtual network functions to forward G- Design method, as shown in Figure 1, packet Include following steps S1-S2：
S1, single SFC designs：In view of part VNF is there are dependence and VNF flows rate of change the two factors, In the embodiment of the present invention, VNF dependence graphs are constructed according to the VNF dependences in network service request, and rely on VNF and close System's figure carries out topological sorting, VNF dependence graphs is converted to VNF topological sequences, using VNF topological sequences as VNF in SFC Order designs single SFC.
Step S1 includes following S11-S16 step by step：
S11, according to the VNF dependences in network service request, construct the VNF dependence graphs of directed acyclic.
Can include existing dependence between the required VNF types of this request and VNF in network service request, Give the example of a network service request as shown in Figure 2, using each required VNF in network service request as VNF according to Rely relational graph in a node, each dependence be used as a line in VNF dependence graphs, by be relied on item direction according to Rely item (such as VNF3 depends on VNF1 in Fig. 2, then adds a side for being directed toward VNF3 from VNF1), is closed to construct VNF dependences System's figure.Since Circular dependency is not present in network service request, that is, such as A being not present and relies on B, B relies on C, and C relies on A such cases, Therefore the VNF dependence graphs constructed must be acyclic.
S12, VNF dependence graphs all in-degrees be 0 node in choose flow rate of change minimum node be put into VNF topological sequences.
S13, the in-degree of the descendant node of the node selected in step S12 is subtracted 1.
S14, judge whether also have remaining node, if then return to step S12, otherwise enter step in VNF dependence graphs Rapid S15.
S15, using VNF topological sequences as the order of VNF in SFC, design single SFC.
Step S12-S15 is to carry out topological sorting operation to the VNF dependence graphs of step S11 constructions.In order to ensure The dependence of VNF makes to be relied on item in relying on before item, and the present invention is by the way of topological sorting, to step S11 structures The VNF dependence graphs made carry out topological sorting, and enter topological sequences every time is the point that in-degree is 0 in VNF dependence graphs, After the element for popping up sequence header, the in-degree of descendant node subtracts 1, if there is the node that new in-degree is 0 to generate, is put into topological order In row, relied on before item this ensure that being relied on item and being in always.
Meet the sequence results of dependence there are many topological sorting is possible, in order to obtain logical links bandwidth wastage in bulk or weight BtotalMinimum SFC structures, it is necessary to the VNF of flow rate of change minimum be made to be placed on position forward in SFC as possible.The present invention is real Apply logical links bandwidth wastage in bulk or weight B in exampletotalIt is defined as follows：
Wherein EsIndicate that logical links set in SFC, e are the logical links in SFC, B (e) indicates the band of logical links e Wide demand.Therefore when the VNF dependence graphs constructed to step S11 carry out topological sorting, the node team for being every time 0 from in-degree The VNF that flow rate of change minimum is popped up in row is put into topological sorting sequence.In this way under the premise of ensureing that dependence meets, to the greatest extent The VNF of flow rate of change minimum may be made to be placed on position forward in SFC.
S16, judge whether not carry out the network service request of SFC designs also, if then return to step S11, to next A network service request carries out SFC designs, and otherwise explanation is completed carries out SFC designs to all-network service request, into step Rapid S2.
S2, a plurality of SFC are integrated：All SFC are grouped, the SFC for possessing identical sources eye end system is divided into one group, SFC is integrated in every group, obtains acyclic VNF-FG, ensures that mapping phase not will produce circuit, leads to additional chain Road consumes.
Step S2 includes following S21-S23 step by step：
S21, all SFC are grouped, the SFC for possessing identical sources eye end system is divided into one group.With identical sources mesh End system grouping be in order to avoid because of the SFC of not homologous eye end system integration, cause in follow-up mappings work end system be separated by compared with Far more SFC needs to share a VNF example and additional link is caused to consume.
S22, judge whether otherwise to terminate virtual net if then entering step S23 there is also the group for not carrying out SFC integration Network function forwards G- Design.
S23, one group of SFC is chosen, the SFC in group is integrated, the VNF-FG of the group, return to step S22 are obtained.
SFC is integrated into VNF-FG, problem to be solved is：In SFC to be integrated which VNF node respectively with Which VNF node aggregation in VNF-FG.In order to polymerize the VNF nodes of greater number, source node in VNF-FG is needed to be traversed for To all paths between destination node, the VNF in each path constitute successively in sequence a L1, SFC to be integrated VNF according to One sequence L2 of secondary composition calculates the longest common subsequence Lcs of L1 and L2.In VNF-FG each path with it is to be integrated SFC is there are one Lcs, in the embodiment of the present invention, chooses wherein longest Lcs as integrated scheme Lcs_max.
As shown in figure 3, step S23 includes following S231-S235 step by step：
S231, one group of SFC is chosen, takes out the wherein SFC of VNF nodes at most as initial VNF-FG.
S232, judge that whether there is also remaining SFC in this group of SFC, if then entering step S233, otherwise complete the group The integration of SFC, return to step S22.
S233, the most SFC conducts SFC to be integrated of VNF nodes in this group of SFC is taken out.
All paths of S234, the current VNF-FG of traversal, and calculate the longest common subsequence in each path and SFC to be integrated Lcs。
In VNF-FG, there may be more than one paths from source node to destination node.In the embodiment of the present invention, such as Fig. 4 Shown in VNF-FG, there are 3 paths, respectively L1：{ VNF1, VNF2, VNF4, VNF7 }, L2：VNF1, VNF2, VNF5, VNF7 }, L3:{ VNF1, VNF3, VNF6, VNF7 }.In order to which the identical VNF of polymerization as much as possible is to reduce interstitial content, then need Path all in VNF-FG is traversed, the longest common subsequence of the VNF sequences of SFC to be integrated and the VNF sequences in path is calculated Lcs.SFC as shown in Figure 5：{ VNF1, VNF3, VNF6, VNF8 }, the longest of it and three paths in the VNF-FG in Fig. 4 Common subsequence is respectively Lcs1：{ VNF1 }, Lcs2：{ VNF1 }, Lcs3：{ VNF1, VNF3, VNF6 }.
S235, the longest Lcs of selection are denoted as Lcs_max, and Lcs_max and SFC to be integrated are integrated, formed new VNF-FG, return to step S232.
The Lcs that longest (number of nodes for including is most) are selected from each Lcs in step S234, is denoted as Lcs_ SFC is integrated into according to the element in Lcs_max in corresponding path by max.For example, SFC as shown in Figure 5 is as shown in fig. 4 The Lcs_max of VNF-FG is Lcs3：{ VNF1, VNF3, VNF6 }, thus by SFC on the L3 of path according to the node in Lcs3 into Row is integrated.Integration process is the VNF occurred in Lcs3, then SFC to be integrated and original VNF-FG shares the VNF；If to be integrated There is the VNF that Lcs3 does not include in SFC, then increase the VNF nodes newly in VNF-FG and adds link.Integrated results as shown in fig. 6, SFC to be integrated shares VNF1, VNF3 and the VNF6 on L3 in original VNF-FG, has increased VNF8 nodes and VNF6 and VNF8 newly Between, the both links between VNF8 and destination node.
Every SFC in organizing is integrated according to the step of step S233-S235, is integrally formed a new VNF- every time FG, and VNF-FG when being integrated as next SFC.When all SFC, which are integrated, to be completed, finally formed VNF-FG is to press Group divides the VNF-FG of design.
In the NFV frameworks of ETSI, MANO (Management and Orchestration, management and layout) is by VIM (Virtualized Infrastructure Manager, virtualized infrastructure management), VNFM (VNF Manager, virtually Network function manager) and NFVO (Network Function Virtualization Orchestration, network function Virtualize composer) composition, VIM is for managing virtual resource, and VNFM is for managing network function, and NFVO is for network service Life cycle management and global cross-domain resource are dispatched.The embodiment of the present invention can be deployed under NFV environment in MANO frameworks NFVO determines the specific presentation mode (determining VNF number, connection relation) of network service by VNF-FG designs.
Currently, the VIM of industry is based on OpenStack more carries out commercialization.Therefore OpenStack can be used as NFV The VIM modules of cloud platform, Tacker projects carry out the exploitation of NFVO modules on this basis as VNFM, and network service provides The two stage virtual network function forwarding G- Design method that quotient can be proposed the embodiment of the present invention is deployed in MANO frameworks In NFVO in, NFVO is saved as VNF-FG descriptors (VNF-FG Descriptor, VNF- after making VNF-FG FGD), it is used for subsequent network service orchestration and mappings work.
For under offline scenario, when there is multiple network service requests to arrive, NFVO calling is deployed in virtual net therein Network function forwards figure mapping method, respectively each request to design corresponding SFC structures, this is the work of first stage；So It is integrated after being grouped afterwards to SFC with identical sources eye end system, one VNF-FG of every group of construction, this is the work of second stage. The VNF-FG designed is finally saved as into VNF-FGD templates, is used for mapping phase.
Those of ordinary skill in the art will understand that the embodiments described herein, which is to help reader, understands this hair Bright principle, it should be understood that protection scope of the present invention is not limited to such specific embodiments and embodiments.This field Those of ordinary skill can make according to the technical disclosures disclosed by the invention various does not depart from the other each of essence of the invention The specific variations and combinations of kind, these variations and combinations are still within the scope of the present invention.

Claims (6)

1. a kind of two stage virtual network function forwards G- Design method, which is characterized in that include the following steps：
S1, single SFC designs：According in network service request VNF dependences construct VNF dependence graphs, and to VNF according to Rely relational graph to carry out topological sorting, VNF dependence graphs is converted into VNF topological sequences, using VNF topological sequences as in SFC The order of VNF designs single SFC；
S2, a plurality of SFC are integrated：All SFC are grouped, the SFC for possessing identical sources eye end system are divided into one group, every SFC is integrated in group, obtains VNF-FG.
2. virtual network function according to claim 1 forwards G- Design method, which is characterized in that the step S1 includes Below step by step：
S11, according to the VNF dependences in network service request, construct the VNF dependence graphs of directed acyclic；
S12, VNF dependence graphs all in-degrees be 0 node in choose the node of flow rate of change minimum and be put into VNF and open up Flutter sequence；
S13, the in-degree of the descendant node of the node selected in step S12 is subtracted 1；
S14, judge whether there be remaining node in VNF dependence graphs, if then return to step S12, otherwise enters step S15；
S15, using VNF topological sequences as the order of VNF in SFC, design single SFC；
S16, judge whether not carry out the network service request of SFC designs also, if then return to step S11, otherwise enter step Rapid S2.
3. virtual network function according to claim 2 forwards G- Design method, which is characterized in that the step S11 tools Body is：Using each required VNF in network service request as a node in VNF dependence graphs, each dependence As a line in VNF dependence graphs, it is directed toward dependence item by being relied on item, the VNF to construct directed acyclic, which is relied on, to close System's figure.
4. virtual network function according to claim 1 forwards G- Design method, which is characterized in that the step S2 includes Below step by step：
S21, all SFC are grouped, the SFC for possessing identical sources eye end system is divided into one group；
S22, judge whether that there is also the groups for not carrying out SFC integration, if then entering step S23, otherwise terminate virtual network work( G- Design can be forwarded；
S23, one group of SFC is chosen, the SFC in group is integrated, the VNF-FG of the group, return to step S22 are obtained.
5. virtual network function according to claim 4 forwards G- Design method, which is characterized in that the step S23 packets Include it is following step by step：
S231, one group of SFC is chosen, takes out the wherein SFC of VNF nodes at most as initial VNF-FG；
S232, judge whether there is also remaining SFC in this group of SFC, if then entering step S233, otherwise complete this group of SFC's It integrates, return to step S22；
S233, the most SFC conducts SFC to be integrated of VNF nodes in this group of SFC is taken out；
All paths of S234, the current VNF-FG of traversal, and calculate the longest common subsequence Lcs in each path and SFC to be integrated；
S235, the longest Lcs of selection are denoted as Lcs_max, and Lcs_max and SFC to be integrated are integrated, new VNF- is formed FG, return to step S232.
6. virtual network function according to claim 5 forwards G- Design method, which is characterized in that the step S235 tools Body is：If the VNF in SFC to be integrated, which is the VNF, SFC to be integrated and current VNF-FG for including in Lcs_max, shares the VNF； If the VNF in SFC to be integrated is the VNF not included in Lcs_max, increases the VNF nodes newly in current VNF-FG and add Link.
CN201810442401.0A 2018-05-10 2018-05-10 Two-stage virtual network function forwarding graph design method Active CN108737261B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810442401.0A CN108737261B (en) 2018-05-10 2018-05-10 Two-stage virtual network function forwarding graph design method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810442401.0A CN108737261B (en) 2018-05-10 2018-05-10 Two-stage virtual network function forwarding graph design method

Publications (2)

Publication Number Publication Date
CN108737261A true CN108737261A (en) 2018-11-02
CN108737261B CN108737261B (en) 2020-03-17

Family

ID=63937200

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810442401.0A Active CN108737261B (en) 2018-05-10 2018-05-10 Two-stage virtual network function forwarding graph design method

Country Status (1)

Country Link
CN (1) CN108737261B (en)

Citations (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104092609A (en) * 2014-07-24 2014-10-08 苏州大学 Method and device for building IP over WDM network
CN104363159A (en) * 2014-07-02 2015-02-18 北京邮电大学 Virtual open network building system and method based on software definition network
CN105681216A (en) * 2016-04-27 2016-06-15 赛特斯信息科技股份有限公司 System and method for network service access control and load balance under NFV (network functions virtualization) architecture
CN106161049A (en) * 2015-03-27 2016-11-23 中兴通讯股份有限公司 A kind of method and device realizing that Web Service Deployment specification configures
CN106209402A (en) * 2015-04-30 2016-12-07 华为技术有限公司 The telescopic method of a kind of virtual network function and equipment
CN106411678A (en) * 2016-09-08 2017-02-15 清华大学 Bandwidth guarantee type virtual network function (VNF) deployment method
CN106856438A (en) * 2015-12-09 2017-06-16 华为技术有限公司 A kind of method of Network instantiation, device and NFV systems
CN106921977A (en) * 2015-12-26 2017-07-04 华为技术有限公司 A kind of service quality planing method, apparatus and system based on Business Stream
CN106992944A (en) * 2017-05-04 2017-07-28 南京邮电大学 A kind of method for mapping resource in wireless dummy network
CN107005480A (en) * 2015-01-20 2017-08-01 华为技术有限公司 The system and method cooperated for SDT and NFV and SDN
CN107113232A (en) * 2015-01-20 2017-08-29 华为技术有限公司 The method and apparatus that NFV manages layout
WO2017176557A1 (en) * 2016-04-04 2017-10-12 Brocade Communications Systems, Inc. Constraint-based virtual network function placement
CN107666412A (en) * 2017-11-20 2018-02-06 电子科技大学 The virtual network function dispositions method of service function chain

Patent Citations (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104363159A (en) * 2014-07-02 2015-02-18 北京邮电大学 Virtual open network building system and method based on software definition network
CN104363159B (en) * 2014-07-02 2018-04-06 北京邮电大学 A kind of opening virtual network constructing system and method based on software defined network
CN104092609A (en) * 2014-07-24 2014-10-08 苏州大学 Method and device for building IP over WDM network
CN107005480A (en) * 2015-01-20 2017-08-01 华为技术有限公司 The system and method cooperated for SDT and NFV and SDN
CN107113232A (en) * 2015-01-20 2017-08-29 华为技术有限公司 The method and apparatus that NFV manages layout
CN106161049A (en) * 2015-03-27 2016-11-23 中兴通讯股份有限公司 A kind of method and device realizing that Web Service Deployment specification configures
CN106209402A (en) * 2015-04-30 2016-12-07 华为技术有限公司 The telescopic method of a kind of virtual network function and equipment
CN106856438A (en) * 2015-12-09 2017-06-16 华为技术有限公司 A kind of method of Network instantiation, device and NFV systems
CN106921977A (en) * 2015-12-26 2017-07-04 华为技术有限公司 A kind of service quality planing method, apparatus and system based on Business Stream
WO2017176557A1 (en) * 2016-04-04 2017-10-12 Brocade Communications Systems, Inc. Constraint-based virtual network function placement
CN105681216A (en) * 2016-04-27 2016-06-15 赛特斯信息科技股份有限公司 System and method for network service access control and load balance under NFV (network functions virtualization) architecture
CN106411678A (en) * 2016-09-08 2017-02-15 清华大学 Bandwidth guarantee type virtual network function (VNF) deployment method
CN106992944A (en) * 2017-05-04 2017-07-28 南京邮电大学 A kind of method for mapping resource in wireless dummy network
CN107666412A (en) * 2017-11-20 2018-02-06 电子科技大学 The virtual network function dispositions method of service function chain

Also Published As

Publication number Publication date
CN108737261B (en) 2020-03-17

Similar Documents

Publication Publication Date Title
Vieira et al. Fast packet processing with ebpf and xdp: Concepts, code, challenges, and applications
US8949364B2 (en) Apparatus, method and system for rapid delivery of distributed applications
US9742668B1 (en) Packet forwarding path programming using a high-level description language
CN107566271B (en) Method and apparatus for computing and propagating network forwarding state using transactions
CN107104894B (en) Controller in network control system
CN109479012A (en) The network packet repeater system and method for being pushed to network shunt device for preprocessing tasks will to be grouped
RU2734023C1 (en) Methods for determining a network service descriptor (nsd) for a network service (ns) and orchestrator (nfvo) of network function virtualisation (nfv) using said nsd descriptor
CN104012063A (en) Controller for flexible and extensible flow processing in software-defined networks
CN105610715B (en) A kind of cloud data center multi-dummy machine migration scheduling method of planning based on SDN
CN113169899B (en) Determining the size of a Network Service (NS)
CN103763174B (en) Virtual network mapping method based on function block
US20200186442A1 (en) Derivation of network service descriptor from network service requirements
US20190377759A1 (en) Efficient graph database traversal
Zhang et al. TCAM space-efficient routing in a software defined network
CN109412963A (en) A kind of service function chain dispositions method split based on stream
WO2019007403A1 (en) Service configuration-driven flow table method and device
US10505760B2 (en) Hierarchical encapsulation acceleration
Himmelspach et al. Parallel and distributed simulation of parallel DEVS models
CN108737261A (en) A kind of two stage virtual network function forwarding G- Design method
Mena et al. Enhancing the performance of 5G slicing operations via multi-tier orchestration
Sonkoly et al. FERO: Fast and efficient resource orchestrator for a data plane built on Docker and DPDK
CN106533720B (en) Compiling method and device for network service request and controller
Sur et al. Full-stack SDN
CN107103058A (en) Big data service combining method and composite service combined method based on Artifact
Bellavista et al. Quality-of-service in data center stream processing for smart city applications

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