WO2024042347A1 - Décomposition de fonctions de réseau virtuel - Google Patents

Décomposition de fonctions de réseau virtuel Download PDF

Info

Publication number
WO2024042347A1
WO2024042347A1 PCT/IB2022/057904 IB2022057904W WO2024042347A1 WO 2024042347 A1 WO2024042347 A1 WO 2024042347A1 IB 2022057904 W IB2022057904 W IB 2022057904W WO 2024042347 A1 WO2024042347 A1 WO 2024042347A1
Authority
WO
WIPO (PCT)
Prior art keywords
vnf
dsc
vnfs
chain
sub
Prior art date
Application number
PCT/IB2022/057904
Other languages
English (en)
Inventor
Amin EBRAHIMZADEH
Róbert SZABÓ
Ákos RECSE
Wubin LI
Carla MOURADIAN
Roch Glitho
Original Assignee
Telefonaktiebolaget Lm Ericsson (Publ)
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 Telefonaktiebolaget Lm Ericsson (Publ) filed Critical Telefonaktiebolaget Lm Ericsson (Publ)
Priority to PCT/IB2022/057904 priority Critical patent/WO2024042347A1/fr
Publication of WO2024042347A1 publication Critical patent/WO2024042347A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/12—Discovery or management of network topologies
    • H04L41/122—Discovery or management of network topologies of virtualised topologies, e.g. software-defined networks [SDN] or network function virtualisation [NFV]
    • 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/40—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks using virtualisation of network functions or resources, e.g. SDN or NFV entities
    • 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/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
    • H04L41/5041—Network service management, e.g. ensuring proper service fulfilment according to agreements characterised by the time relationship between creation and deployment of a service
    • H04L41/5054—Automatic deployment of services triggered by the service manager, e.g. service implementation by automatic configuration of network components

Definitions

  • VNFs virtual network functions
  • a Network Service (NS) request generally contains a set of VNFs with some dependencies and Service Level Agreement (SLA) requirements.
  • SLA Service Level Agreement
  • An incoming NS can be described by either a chain of VNFs (commonly referred to as a Service Function Chain (SFC)) or a more general graph topology, which is known as Virtual Network Function – Forwarding Graph (VNF-FG).
  • SFC Service Function Chain
  • VNF-FG Virtual Network Function – Forwarding Graph
  • each VNF may be associated with multiple realizations, commonly referred to as decomposition options.
  • Each decomposition option may comprise one or multiple subfunctions/subcomponents.
  • the intrusion detection system can be realized via either a single IDS function (as shown in FIG.52(a)) or a combination of IDS of multiple subfunctions, namely, controller, deep packet inspection (DP), firewall (FW), and network element (NE) functions (as shown in FIG.52(b)).
  • IDS intrusion detection system
  • controller controller
  • DP deep packet inspection
  • FW firewall
  • NE network element
  • a method of decomposing one or more chains of virtual network functions, VNFs includes a first VNF and a second VNF.
  • the method comprises identifying a first set of decomposition sub-components, DSCs, included in the first VNF, wherein the first set of DSCs includes a first DSC and a second DSC; identifying a second set of DSCs included in the second VNF, wherein the second set of DSCs includes a third DSC; obtaining a first forward weight value for a first forward path from the first DSC to the third DSC; and obtaining a second forward weight value for a second forward path from the second DSC to the third DSC.
  • the method further comprises performing a first comparison based on the first forward weight value and the second forward weight value; using a result of the first comparison based on the first forward weight value and the second forward weight value, selecting first forward path; and configuring a connection between the first VNF and the second VNF based on the selection of the first forward path.
  • a computer program comprising instructions which when executed by processing circuitry cause the processing circuitry to perform the method of any one of the embodiments described above.
  • an apparatus for decomposing one or more chains of virtual network functions, VNFs includes a first VNF and a second VNF.
  • the apparatus is configured to: identify a first set of decomposition sub-components, DSCs, included in the first VNF, wherein the first set of DSCs includes a first DSC and a second DSC; identify a second set of DSCs included in the second VNF, wherein the second set of DSCs includes a third DSC; and obtain a first forward weight value for a first forward path from the first DSC to the third DSC.
  • the apparatus is further configured to obtain a second forward weight value P104419WO01 (3602-2429WO1) Page 2 of 38 for a second forward path from the second DSC to the third DSC; perform a first comparison based on the first forward weight value and the second forward weight value; using a result of the first comparison based on the first forward weight value and the second forward weight value, select first forward path; and configure a connection between the first VNF and the second VNF based on the selection of the first forward path.
  • the apparatus comprises a processing circuitry; and a memory, said memory containing instructions executable by said processing circuitry, whereby the apparatus is operative to perform the method of any one of the embodiments described above.
  • Embodiments of this disclosure provide an improved way of decomposing one or more chains of VNFs. As compared to the existing decomposition solution, the embodiments provide improvements with respect to flexibility, scalability, compatibility, and robustness.
  • Flexibility The method and apparatus for decomposing VNFs according to the embodiments of this disclosure are applicable to network services provided by a chain of VNFs (a.k.a., an SFC) with a configuration of single-source and single-destination, and network services provided by more general topology (e.g., VNF-FGs) with a configuration of single-source and multi-destination, a configuration of multi-source and multi-destination, or a configuration of multi-source and single-destination.
  • a chain of VNFs a.k.a., an SFC
  • more general topology e.g., VNF-FGs
  • the embodiments address the compatibility constraints in VNF-FGs with a wide variety of sub-structures including split, merge, split-and-merge, hybrid split-merge, and connected split-and-merge.
  • Scalability Conventional algorithms enumerate all possible decomposition options using brute-force approach. However, solving the VNF-FG decomposition problem using brute- force approach is computationally inefficient, especially for large scale problems. Hence, in the embodiments, an efficient and scalable heuristic is provided to solve the VNF-FG decomposition problem in a computationally efficient manner.
  • Compatibility Considering multiple options to realize a given VNF type, in the embodiments, an option is selected by taking into account the compatibility constraint which ensures that an option of a VNF can be realized with the selected option of the predecessor/successor VNF.
  • Robustness It is inevitable, in some cases, that the service provider is unable to embed a given VNF-FG decomposition recommendation of an NS. This may happen due to many reasons including lack of capacity, sudden increase of load, failure of a substrate node/link, and/or returning an infeasible solution by the underlying embedding algorithm.
  • FIG.1(a) shows a use-case of a system.
  • FIG.1(b) shows a service function chain.
  • FIG.1(c) shows a traditional approach of implementing a network service.
  • FIG.1(d) shows an approach of implementing a network service.
  • FIGS.2(a)-2(d) show different configurations for implementing a network service.
  • FIG.3 shows a multi-stage graph model.
  • FIGS.4-6 show outcomes of pruning processes.
  • FIGS.7(a)-7(b) show decision graphs.
  • FIG.8 shows a flow chart.
  • FIGS.9(a)-9(e) show different sub-structures of a network service.
  • FIG.10 shows a split sub-structure.
  • FIGS.11(a) and 11(b) show multi-stage graph models.
  • FIGS.12(a) and (b) show outcomes of pruning processes.
  • FIG.13 shows a union graph.
  • FIGS.14(a) and (b) show outcomes of pruning processes.
  • FIGS.15, 16(a), and 16(b) show union graphs.
  • FIGS.17(a)-(d) show a process of forming a final decision graph.
  • FIG.18 shows a merge sub-structure.
  • FIGS.19(a) and (b) show multi-stage graph models.
  • FIGS.20(a) and (b) show outcomes of pruning processes.
  • FIG.21 shows a union graph.
  • FIGS.22(a) and (b) show outcomes of pruning processes.
  • FIGS.23, 24(a), and 24(b) show union graphs.
  • FIGS.25(a)-(c) show a process of forming a final decision graph.
  • FIG.26 shows a split-and-merge sub-structure.
  • FIGS.27(a) and (b) show multi-stage graph models.
  • FIGS.28(a) and (b) show outcomes of pruning processes.
  • FIG.29 shows a union graph.
  • FIGS.30(a) and (b) show outcomes of pruning processes.
  • FIGS.31, 32(a), and 32(b) show union graphs.
  • FIGS.33(a)-(d) show a process of forming a final decision graph.
  • FIGS.34(a)-(d) show a de-pruning process.
  • FIG.35 shows a hybrid split-merge sub-structure.
  • FIGS.36(a) and (b) show multi-stage graph models.
  • FIGS.37(a) and (b) show outcomes of pruning processes.
  • FIGS.38, 39(a), and 39(b) show union graphs.
  • FIGS.40(a) and 40(b) show a process of forming a final decision graph.
  • FIGS.42(a)-42(c) show multi-stage graph models.
  • FIGS.43(a) and (b) show outcomes of pruning processes.
  • FIG.44 shows a union graph.
  • FIGS.45(a) and (b) show outcomes of pruning processes.
  • FIG.46 is a union graph.
  • FIGS.47(a) and (b) show outcomes of pruning processes.
  • FIG.48 is a union graph.
  • FIGS.49(a)-(c) show a process of forming a final decision graph.
  • FIG.50 shows a process according to some embodiments.
  • FIG.51 shows an apparatus according to some embodiments.
  • FIGS.52(a) and (b) show different options of realizing an IDS.
  • DETAILED DESCRIPTION [0064]
  • Network Function Virtualization (NFV) is a concept of decoupling network functions from proprietary hardware such that the network functions can run on standardized hardware, thereby reducing dependency on hardware and making the network more flexible.
  • FIG. 1(c) in a traditional implementation approach, a plurality of proprietary hardware 152-160 each of which is configured to perform a particular function is provided.
  • FIG.1(d) in a NFV implementation approach, one or more standard hardware 162-164 is provided.
  • FIG. 1(a) illustrates an example use-case of a system 100 according to some embodiments.
  • System 100 comprises four VNFs 102-108, which are used for network virtualization (meaning that system 100 is used for providing a network service). More specifically, in system 100, VNF 102 is configured to serve as a load balancer, VNF 104 is configured to serve as a firewall, VNF 106 is configured to serve as intrusion detection system (IDS) / intrusion prevention system (IPS), and VNF 108 is configured to serve as a wide area network (WAN) accelerator.
  • IDS intrusion detection system
  • IPS intrusion prevention system
  • WAN wide area network
  • FIGS. 2(a)-(e) show simplified diagrams of a chain of VNFs and VNF-FG.
  • the chain of VNFs a.k.a., “SFC”
  • VNF-FG a general topology that is more general than SFC
  • an SFC represents a single-source single-destination (sSsD) network service while VNF-FG may represent a single-source multi-destination service (sSmD), a multi-source single-destination service (mSmD), or a multi-source multi-destination service (mSsD).
  • FIG.2(a) shows an sSsD network service which can be realized by an SFC comprising VNFs A, B, C, and D arranged in a sequence.
  • FIGS. 2(b)-2(e) show different VNF-FGs each describing a specific type of network services. More specifically, FIG.2(a) shows an sSsD network service, FIG.
  • FIG. 2(b) shows an sSmD network service
  • FIG. 2(c) shows an mSsD network service
  • FIG.2(d) shows an mSmD network service.
  • the service provider may configure a given type of VNF (e.g., VNF A shown in FIG. 2(a)) via selecting an option (a.k.a., sub-function or sub-component) among multiple options.
  • VNFs A-D shown in FIG.1(b) may include n_A number of sub- components, n_B number of sub-components, n_C number of sub-components, and n_D number of sub-components, respectively.
  • n_A number of sub- components n_B number of sub-components
  • n_C number of sub-components n_D number of sub-components, respectively.
  • n_D number of sub-components may include n_A number of sub- components, n_B number of sub-components, n_C number of sub-components, and n_D number of sub-components, respectively.
  • the selection of the sub-components should satisfy the so-called compatibility constraint, which imposes a restriction on selecting sub-component of a VNF if it cannot be realized along with sub-component j of its predecessor VNF.
  • an SFC or a VNF-FG is expressed using a multi-stage graph G(V,E), where each stage of the graph represents a VNF and each node at a given stage represents a subcomponent of that VNF.
  • the realization of the SFC or the VNF-FG P104419WO01 (3602-2429WO1) Page 7 of 38 (i.e., selecting one or more sub-components of a VNF for coupling with one or more sub- components of another VNF) can be achieved using the multi-stage graph.
  • the multi-stage graph G(V,E) is a directed graph where vertices are partitioned into K (where K > 1) disjoint subsets s1 , s2 , s3 , ..., sK .
  • sub-component q of VNF i is compatible with sub-component p of VNF i ⁇ 1, then there is an edge (u, v) in E that connects node p of stage i ⁇ 1 to node q of stage i.
  • the number K of disjoint subsets is equal to the total number of VNFs plus two (which takes into account the source and destination nodes), meaning that
  • 1.
  • the vertices S ⁇ s1 and T ⁇ s K are called source and sink nodes.
  • the compatible constraints of sub-components are specified by directional edges between the nodes of a stage and those of its predecessor stage. For example, in FIG.3, there is no edge between node 2 at stage C and node 3 at stage D, meaning that subcomponent 3 of VNF D cannot be realized along with subcomponent 2 of VNF C.
  • Some embodiments of this disclosure are directed to a method of decomposing VNF- FG by selecting appropriate sub-components for each VNF to minimize the service provider’s objective function (e.g., embedding cost) while satisfying the compatibility constraint.
  • the ideal solution is expected to give the service provider N best paths from the source to sink node in the multi-stage graph so that the service provider has enough flexibility to switch to the fall-back options, if needed.
  • a viable approach to solve the VNF-FG decomposition problem is to use the brute- force approach, which finds the best N paths in terms of the given objective function by enumerating all the possible paths running from the source node to the sink node.
  • FIG. 1(b) shows an example of an SFC
  • FIG. 3 shows a multi-stage graph corresponding to the SFC shown in FIG.1(b).
  • the multi-stage graph shows compatible constraints of sub-components of VNFs included in the SFC. For example, as shown in FIG.3, there is no directional edge between sub-component 2 of VNF B and sub-component 2 of VNF C, meaning that the sub-component 2 of VNF B is not compatible with the sub-component 2 of VNF C.
  • fitness score ⁇ ⁇ , ⁇ , ⁇ of the edge between node (i.e., sub- component) p at stage (i.e., VNF) i and i-1 represents the fitness of selecting the sub-component p of VNF i with the sub-component q of VNF i-1.
  • DSC Decomposition Score Calculation
  • the sub-component 1 of VNF B has two incoming edges 308 and 310.
  • P104419WO01 (3602-2429WO1) Page 9 of 38 [0085]
  • the best incoming edge ⁇ ⁇ ⁇ , ⁇ is selected as follows: ⁇ ⁇ ⁇ , ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ , ⁇ , ⁇ , ⁇ ⁇ [0086] and prune all other [0087] For example, let’s assume ⁇ ⁇ , ⁇ , ⁇ ⁇ ⁇ ⁇ , ⁇ , ⁇ , ⁇ , ⁇ , ⁇ , ⁇ , ⁇ , ⁇ , ⁇ , ⁇ , ⁇ , ⁇ , ⁇ , ⁇ , ⁇ , ⁇ , ⁇ , ⁇ , ⁇ , ⁇ , ⁇ , ⁇ , ⁇ , ⁇ , ⁇ , ⁇ , ⁇ , and ⁇ ⁇ , ⁇ , ⁇ , ⁇ ⁇ ⁇ [0088] Based on comparisons of the fitness scores of the edges, pruning process may be performed.
  • the sub-component 1 of VNF B has two incoming edges 308 and 310.
  • the edge 308 has a weight value ⁇ ⁇ , ⁇ , ⁇ , ⁇
  • the edge 310 has a weight value ⁇ ⁇ , ⁇ , ⁇ , ⁇ . Since ⁇ ⁇ , ⁇ , ⁇ , ⁇ ⁇ ⁇ ⁇ , ⁇ , ⁇ , ⁇ , the is selected for the sub-component 1 of This pruning process is repeated for all sub-components of VNF B-D.
  • FIG. 4 shows a graph resulting from performing the pruning process for all sub-components of VNF B
  • FIG. 5 shows a graph resulting from performing the pruning process for all sub-components of VNFs B-D.
  • the outcome of the pruning process is a spanning tree, where there is at most N1 paths from the source node to the last VNF, and N1 is the total number of sub-components of the last VNF -- VND D.
  • the sub-components that are not part of any path in the tree may be identified. For example, since no edge is selected from the sub-component 2 of VNF A to any sub-component of VNF B, the sub-component 2 of VNF B is identified.
  • FIG.6 shows an output of the pruning process performed in the backward direction.
  • the pruning process performed in the backward direction can be used for identifying less efficient edges and/or sub-components.
  • the sub-components P104419WO01 (3602-2429WO1) Page 10 of 38 3 and 4 of VNF B, the sub-component 1 of VNF C, and the sub-component 3 of VNF D are identified to be less efficient sub-components.
  • the information obtained from the two tree graphs may be merged, thereby determining an ultimate graph (a.k.a., a decision graph or a union graph).
  • the decision graph may be used to determine the best decomposition of VNF-FGs to be selected by the service provider.
  • the decision graph is built as the union of the tree graphs associated with the forward and backward directions. While the nodes of the decision graph are those of the initial multi-stage graph, the links of the decision tree graph are the ones that exist in the tree graph of either forward or backward direction. Taking the tree graphs of forward and backward directions shown in FIGS. 5 and 6, the decision graph shown in FIG.7(a) can be built. [0094] In the decision graph (e.g., shown in FIG.7(a)), the nodes that are less useful in both forward and backward directions can be identified and pruned.
  • the sub-component 4 of VNF B is detected as being less useful in both forward and backward directions.
  • the sub-component may be pruned from the decision graph.
  • those edges that compass the removed sub-component should also be removed/pruned from the decision graph.
  • the resulting decision graph is shown in FIG.7(b).
  • a total of 9 paths from the source node to the destination node (sink) can be identified.
  • FIG.8 shows a flow chart of the multi-directional topological decomposition algorithm for SFCs according to some embodiments.
  • VNF-FGs Embodiments below are for realizing decomposition of sSmD, mSsD, and mSmD NSs in general VNF-FG topologies.
  • general VNF-FG topology may comprise any one or a combination of the following sub-structures: (a) split; (2) merge; (3) split- and-merge; (4) hybrid split-merge; and (5) connected split-and-merge.
  • FIG.10 shows an example of the split sub-structure corresponding to an sSmD NS. As shown in FIG.
  • the NS comprises VNFs A, B, C, and D which have 3, 4, 3, and 4 sub- components, respectively.
  • the NS comprises two SFCs -- source-to destination 1 (S-to-D1) SFC and source-to-destination 2 (S-to-D2) SFC.
  • Multi-stage graph models with S-to-D1 SFC and S-to- D2 SFC are shown in FIG.11.
  • the sSmD NS shown in FIG.10 may be decomposed as explained below.
  • the fitness scores (the weights) of edges are obtained from an entity (e.g., a DSC module), and a pruning process in both forward and reverse directions is applied to the S-to-D1 SFC based on the fitness scores.
  • FIGS.12(a) and 12(b) The outcome of the pruning process is shown in FIGS.12(a) and 12(b). More specifically, the output of the pruning process in the forward direction is shown in FIG.12(a) while the output of the pruning process in the reverse direction is shown in FIG.12(b).
  • the set of DSCs that are identified as being useless for the S- to-D1 SFC ( ⁇ ⁇ ⁇ ) in the forward direction is ⁇ A1, B1, C3, ⁇
  • the set of DSCs that are identified as being useless for the S-to-D1 SFC ( ⁇ ⁇ ⁇ ) in the backward direction is ⁇ B4, C2 ⁇ .
  • FIG. 14(a) and (b) show the outcome of the pruning process applied to the S-to-D2 SFC in the forward and backward directions.
  • the set of DSCs that are identified as being useless for the S-to-D2 SFC ( ⁇ ⁇ ⁇ ) in the forward direction is ⁇ A1, B2, B4, ⁇
  • the pruned sub-component B4 belongs to the split point (i.e., VNF B), it makes sense to prune B4 from the other union graph (i.e., ⁇ ⁇ ⁇ ) as well. Subsequently, ⁇ ⁇ ⁇ and ⁇ ⁇ ⁇ shown in FIGS.16(a) and 16(b) are obtained. [0107] After obtaining the union graphs ⁇ ⁇ ⁇ and ⁇ ⁇ ⁇ , a final decision graph may be determined based on the obtained union graphs. In determining the final decision graph, in order to resolve compatibility conflicts that may arise at the split point, the notion of hyper-graphs may be used.
  • a hyper-edge is an edge whose one (or both) ends may comprise more than one node.
  • the next stages of the final decision graph can be built based on compatibility between VNFs B and C, and between VNFs B and D. To do so, a hyper-node between sub-component i of VNF B and sub-component j of VNF C is formed if there is an edge between these sub-componets in the union graph ⁇ ⁇ ⁇ (shown in FIG.16(a)). According to FIG.16(a), since there are three edges between the sub-components of VNF B and the sub-components of VNF C, there will be three hyper-nodes in the final decision graph, as shown in FIG.17(c).
  • Each hyper-node comprises two sub-components, one from VNF B and the other from VNF C.
  • a hyper-node is connected to sub-component k of VND D if and only if there is an P104419WO01 (3602-2429WO1) Page 13 of 38 edge between the B sub-component of that hyper-node with sub-component k of VNF D in the union graph ⁇ ⁇ ⁇ .
  • P104419WO01 3602-2429WO1
  • FIG.18 shows an example of the merge sub-structure corresponding to an mSsD NS.
  • the NS comprises VNFs A, B, C, and D which have 3, 2, 4, and 3 sub-components, respectively.
  • the NS comprises two SFCs -- source1-to-destination (S1-to-D) SFC and source2-to-destination (S2-to-D) SFC.
  • the S1-to-D SFC comprises source 1, VNF A, VNF C, VNF D, and destination
  • the S2-to-D SFC comprises source 2, VNF B, VNF C, VNF D, and destination.
  • Multi-stage graph model associated with the S1-to-D SFC is shown in FIG. 19(a) and multi-stage graph model associated with the S2-to-D SFC is shown in FIG.19(b).
  • the mSsD NS shown in FIGS. 19(a) and (b) may be decomposed using a decomposition process explained below. [0116] Similar to the split sub-structure discussed in section 2.1 above, the decomposition process may begin with performing a pruning process on the first SFC -- the S1-to-D SFC.
  • the fitness scores (the weights) of edges of the S1-to-D SFC are obtained from an entity (e.g., a DSC module). Then, a pruning process in both forward and reverse directions is applied to the S1- to-D SFC based on the fitness scores.
  • the outcome of the pruning process is shown in FIGS.20(a) P104419WO01 (3602-2429WO1) Page 14 of 38 and (b). More specifically, the output of the pruning process in the forward direction is shown in FIG.20(a) while the output of the pruning process in the reverse direction is shown in FIG.20(b). [0117] As shown in FIG.
  • the pruning process to the S1-to-D SFC may also be applied to the S2-to-D DFC. More specifically, the pruning process in both forward and reverse directions may be applied to the S2-to-D SFC based on the fitness scores.
  • the outcome of the pruning process is shown in FIGS. 22(a) and (b). More specifically, the output of the pruning process in the forward direction is shown in FIG.22(a) while the output of the pruning process in the reverse direction is shown in FIG.22(b). [0119] As shown in FIG.
  • the pruned sub-component C2 belongs to the merging point (i.e., VNF C)
  • the pruned sub-component C2 is pruned from the other union graph (i.e., ⁇ ⁇ ⁇ ).
  • the two union graphs ⁇ ⁇ ⁇ and ⁇ ⁇ ⁇ are obtained as shown in and (b).
  • the final decision graph may be generated based on the union graphs ⁇ ⁇ ⁇ and ⁇ ⁇ ⁇ .
  • hyper-nodes comprising sub-components of VNFs A and B are created.
  • the sub-components C4 is connected to the sub-components A3 and B1, and thus the hyper-node consisting of A3 and B1 should be connected to C4, as shown in FIG.25(b).
  • the hyper-node is connected to the sub-component k of VNF D if and only if there is an edge between any sub-component in VNF C of that hyper-node and the sub-component k of VNF D in either union graph ⁇ ⁇ ⁇ and ⁇ ⁇ ⁇ .
  • the final decision graph shown in FIG. 25(c) is obtained.
  • FIG.26 shows an example of the split-merge sub-structure corresponding to an sSsD NS.
  • the NS comprises VNFs A, B, C, D, and E which have 3, 4, 3, 2, and 4 sub-components, respectively.
  • the NS comprises two SFCs -- source-A-B-C-E- destination SFC (referred to as “SFC1” in section 2.3) and source-A-B-D-E-destination SFC (“SFC2”).
  • Multi-stage graph model associated with the SFC1 is shown in FIG.27(a) and multi- stage graph model associated with the SFC2 is shown in FIG.27(b).
  • the sSsD NS shown in FIGS. 27(a)-(b) may be decomposed via a decomposition process described below.
  • the decomposition process may begin with running the pruning process on the SFC1 in both forward and reverse directions. Like the decomposition processes described in sections 2.1-2.2 above, the pruning process may be performed based on the fitness scores (the weights) of edges of the SFC1. The fitness scores may be obtained from an entity (e.g., a DSC module).
  • the outcome of the pruning process is shown in FIGS.28(a) and (b).
  • FIG. 28(a) shows the outcome of the pruning process in the forward direction
  • FIG. 28(b) shows the outcome of running the pruning process in the reverse direction.
  • the set of sub-components of the SFC1 ( ⁇ ⁇ ⁇ ) which are identified as being less useful in the forward direction is ⁇ B1, B3, C1 ⁇
  • the set of sub-components of the SFC1 ( ⁇ ⁇ ⁇ ) which are identified as being less useful in the backward direction is ⁇ B3, E1 ⁇ .
  • FIGS.30(a) and (B) show the outcome of the pruning process performed on the SFC2 in the forward direction and the reverse direction, respectively.
  • the set of sub-components of the SFC2 ( ⁇ ⁇ ⁇ ) which are identified as being less useful in the forward direction is ⁇ B1, B3 ⁇ and, as shown in FIG.
  • VNF B the splitting point
  • the union graphs ⁇ ⁇ ⁇ and ⁇ ⁇ ⁇ are obtained as shown in FIG.32.
  • the final decision graph of the given NS can be created. In order to create the final decision graph, it is necessary to resolve the compatibility conflicts that may arise at the splitting and merging points -- i.e., VNFs B and E.
  • the first step of generating the final decision graph is by making links between the sub-components of VNF A and the sub-components of VNF B in either union graph ⁇ ⁇ ⁇ or ⁇ ⁇ ⁇ . More specifically, a link between the sub-component i of VNF A and the sub-component j of VNF B is established if there is a link between the sub-component i of VNF A and the sub-component j of VNF B in either union graph ⁇ ⁇ ⁇ or ⁇ ⁇ ⁇ , as shown in FIG.33(a).
  • the second step of generating the final decision graph is resolving the conflict in the splitting point (i.e., VNF B).
  • hyper-nodes comprising the sub-components of VNFs B and C may be created using the union graphs ⁇ ⁇ ⁇ .
  • the sub-component i of VNF B and the sub-component j of VNF C form a hyper-node if there is a link between them in the union graph ⁇ ⁇ ⁇ .
  • the outcome of the second step is shown in FIG. 33(b).
  • the third step of generating the final decision graph is to resolve the conflicts at the merging point (i.e., VNF E).
  • the union graphs ⁇ ⁇ ⁇ and ⁇ ⁇ ⁇ are used to identify the links between the sub-components of VNF E and the sub-components of VNFs C and D. Then a hyper-node comprising the sub-component i of VNF C and the sub-component j of VNF D is formed and the hyper-node is connected to the sub-component k of VNF E if the following three conditions are met: (i) the sub-component k of VNF E is connected to the sub-component i of VNF C in the union graph ⁇ ⁇ ⁇ ; (ii) the sub-component k of VNF E is connected to the sub- component j of VNF D in graph ⁇ ⁇ ⁇ ; and (iii) the sub-component i of VNF C is connected to the sub-component j of the decision graph.
  • the sub-component E1 i.e., the sub-component 1 of VNF E
  • the sub-component E2 is connected to the sub-component C2 in the union graph ⁇ ⁇ ⁇ (as shown in FIG.32(a)) and the sub-component D2 in the union graph ⁇ ⁇ ⁇ (shown in FIG.32(b)).
  • the sub-components C2 and D2 are also connected in the decision graph (shown in FIG.33(c)).
  • a hyper-node may be formed between the sub- components C2 and D2, and the node can be connected to the sub-component E2 (as shown in FIG.33(d)).
  • the final decision graph is shown in FIG.33(d).
  • a path from VNF A to VNF E is formed.
  • the path represents a feasible, low-cost VNF-FG comprising sub- components A2, B2, C2, D2, and E2.
  • decomposition method described above may lead to 0 or only 1 feasible VNF-FG, especially given that the union graphs and decision graph are all gone through many pruning steps.
  • the service provider may be interested in having multiple VNF-FGs instead of only one.
  • de-pruning step may be performed.
  • the de-pruning step may be started from the obtained union graphs ⁇ ⁇ ⁇ and ⁇ ⁇ ⁇ .
  • the sub-component B3 is removed from both union graphs because the sub-component belongs to the sets ⁇ ⁇ ⁇ and ⁇ ⁇ ⁇ .
  • the sub-component B3 and its associated incoming and outgoing links may be de-pruned.
  • FIGS.34(a) and (b) show the updated union graphs ⁇ ⁇ ⁇ and ⁇ ⁇ ⁇ , respectively.
  • FIG.35 shows an example of the hybrid split-merge sub-structure corresponding to an sSsD NS.
  • the NS comprises VNFs A, B, D, and E which have 3, 4, 2, and 4 sub-components, respectively.
  • the NS comprises two SFCs -- source-A-B-E-destination SFC (referred to as “SFC1” in section 2.4) and source-A-B-D-E-destination SFC (“SFC2”).
  • Multi- stage graph model associated with the SFC1 is shown in FIG.36(a) and multi-stage graph model associated with the SFC2 is shown in FIG.36(b).
  • the sSsD NS shown in FIGS.36(a)-(b) may be decomposed via a decomposition process described below. P104419WO01 (3602-2429WO1) Page 19 of 38 [0146]
  • the decomposition process may begin with running the pruning process on the SFC1 in both forward and reverse directions.
  • the pruning process may be performed based on the fitness scores (the weights) of edges of the SFC1.
  • the fitness scores may be obtained from an entity (e.g., a DSC module).
  • FIGS.37(a) and (b) The outcome of the pruning process is shown in FIGS.37(a) and (b). More specifically, FIG. 37(a) shows the outcome of the pruning process in the forward direction and FIG. 37(b) shows the outcome of running the pruning process in the reverse direction. [0148] As shown in FIG.
  • FIGS.39(a) and (b) show the outcome of the pruning process ran on the SFC1 and the SFC2, respectively.
  • the final decision graph of the given NS can be created. In order to create the final decision graph, it is necessary to resolve the compatibility conflicts that may arise at the splitting and merging points -- i.e., VNFs B, D, and E.
  • the first step of generating the final decision graph is by making a link between the sub-components i of VNF A and those of VNF B. More specifically, a link between the sub-component i of VNF A and the sub- component j of VNF B is established if there is a link between the sub-component i of VNF A and the sub-component j of VNF B in either union graph ⁇ ⁇ ⁇ or ⁇ ⁇ ⁇ , as shown in FIG.40(a).
  • the second step of generating the final decision graph is by creating hyper-nodes comprising the sub-components of VNFs B and D using the information acquired from the two union graphs ⁇ ⁇ ⁇ or ⁇ ⁇ ⁇ .
  • the sub-component i of VNF B and the sub-component j of VNF D form a hyper-node, which will be connected to the sub-component k of VNF E, if and only if the following conditions are met: (i) there is an edge between the sub-component i of VNF B and the sub-component j of VNF D in the union graph ⁇ ⁇ ⁇ ; (ii) there is an edge between the sub- component k of VNF E and the sub- B in the union graph ⁇ ⁇ ⁇ , and (iii) there is an edge between the sub-component k E and the sub-component j of VNF D in the union graph ⁇ ⁇ ⁇ .
  • the sub-component E1 i.e., the sub- component 1 of VNF E
  • the sub-component B2 is connected to the sub-component D1
  • the sub-components B2 and D1 can form a hyper-node, which can then be connected to the sub-component E1 (as shown in FIG.40(b)).
  • the final decision graph is shown in FIG.40(b).
  • FIG.40(b) a total of five paths is formed from VNF A to VNF E, and thus representing five feasible, low-cost VNF-FGs are formed: (i) A2, B2, D1, E1, (ii) A2, B3, D2, E2, (iii) A2, B3, D2, E3, (iv) A3, B3, D2, E2, and (v) A3, B3, D2, E3.
  • FIG. 41 shows an example of the connected split-and-merge sub-structure corresponding to an sSsD NS.
  • the NS comprises VNFs A, B, C, D, and E which have 3, 4, 3, 2, and 4 sub-components, respectively.
  • the NS comprises three SFCs - - source-A-B-C-D-E-destination SFC (referred to as “SFC1” in section 2.5), source-A-B-C-E- destination SFC (“SFC2”), and source-A-B-D-E-destination SFC (“SFC3”).
  • Multi-stage graph model associated with the SFC1 is shown in FIG.42(a)
  • multi-stage graph model associated with the SFC2 is shown in FIG.42(b)
  • multi-stage graph model associated with SFC3 is shown in FIG. 42(c).
  • the sSsD NS shown in FIGS. 42(a)-(c) may be decomposed via a decomposition process described below.
  • the decomposition process may begin with running the pruning process on the SFC1 in both forward and reverse directions. Like the decomposition processes described in sections 2.1-2.4 above, the pruning process may be performed based on the fitness scores (the weights) of edges of the SFC1. The fitness scores may be obtained from an entity (e.g., a DSC module). P104419WO01 (3602-2429WO1) Page 21 of 38 [0158]
  • the outcome of the pruning process is shown in FIGS.43(a) and (b). More specifically, FIG. 43(a) shows the outcome of the pruning process in the forward direction and FIG.
  • FIGS. 45(a) and (b) show the outcome of the pruning process on the SFC2 in the forward direction and the reverse direction, respectively.
  • the resultant union graph ⁇ ⁇ ⁇ of the SFC2 obtained based on the outcome of the pruning process is shown in FIG.46.
  • FIGS. 47(a) and (b) show the outcome of the pruning process ran on the SFC3 in the forward direction and the reverse direction, respectively.
  • the resultant union graph ⁇ ⁇ ⁇ of the SFC3 obtained based on the outcome of the pruning process is shown in FIG.48.
  • the final decision graph of the given NS can be created. Similar to the split-and-merge sub-structure discussed above, in order to create the final decision graph, it is necessary to resolve the compatibility conflicts that may arise at VNFs B, C, D, and E. [0164]
  • the first step of generating the final decision graph i.e., the step of generating the first stage of the final decision graph is by making the links between the sub-components of VNF A and VNF B.
  • a link between the sub-component i of VNF A and the sub-component j of VNF B may be established if there is a link between the sub-component i of VNF A and the sub- component j of VNF B in any of the three union graphs ⁇ ⁇ ⁇ , ⁇ ⁇ ⁇ , and ⁇ ⁇ ⁇ shown in FIGS. 44, 46, and 48.
  • the outcome of creating the first stage is shown in FIG.49(a).
  • the second step (i.e., the step of generating the second stage of the final decision graph) is creating hyper-nodes comprising sub-components of VNF B and VNF C using the information acquired from the union graphs ⁇ ⁇ ⁇ , ⁇ ⁇ ⁇ , and ⁇ ⁇ ⁇ .
  • the sub-component i P104419WO01 (3602-2429WO1) Page 22 of 38 of VNF B and the sub-component j of VNF C may form a hyper-node, which will be connected to the sub-component k of VNF D if and only if the following conditions are met: (i) there is an edge between the sub-component k of VNF D and the sub-component i of VNF B in the union graph ⁇ ⁇ ⁇ ; (ii) there is an edge between the sub-component i of VNF B and the sub-component j of in the union graph ⁇ ⁇ ⁇ ; (iii) there is an edge between the sub-component k of VNF D sub-component j C in the union graph ⁇ ⁇ ⁇ .
  • the sub-components B2 and C2 should form a hyper-node, which should be connected to D1 for the following reasons: (i) according to FIG.48, D1 is connected to B2 in the union graph ⁇ ⁇ ⁇ ; (ii) according to FIG.46, B2 is connected to C2 in the union graph ⁇ ⁇ ⁇ ; (iii) according to FIG.44, D1 is connected to C2 in the union graph ⁇ ⁇ ⁇ .
  • the outcome of creating the second stage is shown in FIG.49(b).
  • the third step (i.e., the step of generating the third and fourth stages of the decision graph) is creating hyper-nodes comprising the sub-components of VNFs C and D, which are to be connected to the sub-components of VNF E.
  • the sub-component j of VNF C and the sub-component k of VNF D may form a hypernode, which may be connected to the sub- component l of VNF E, if and only if the following conditions are met: (i) there is an edge between the sub-component l of VNF E and the sub-component k of VNF D in either union graph ⁇ ⁇ ⁇ and ⁇ ⁇ ⁇ ; (ii) there is an edge between the sub-component l of VNF E and the sub-component j of VNF C in the union graph ⁇ ⁇ ⁇ , (iii) there is an edge between the sub-component j of VNF C and the sub-component k of VNF D in creation of the second and third stages shown in FIG.49(b).
  • the sub-components C3 and D1 should form a hyper-node, which should be connected to the sub-component E1 for the following reasons: (i) according to FIGS. 44 and 48, the sub-component E1 is connected to the sub-component D1 in both union graphs ⁇ ⁇ ⁇ and ⁇ ⁇ ⁇ ; (ii) according to FIG.46, the sub-component E2 is connected to the sub-component C3 in the union graph ⁇ ⁇ ⁇ ; (iii) according to FIG. 49(b), the sub-component C3 is connected to the sub-component the creation of the second and third stages of the final decision graph.
  • FIG.49(c) The outcome of creating the remaining stages of the final decision graph is shown in FIG.49(c).
  • a total of four paths is formed from P104419WO01 (3602-2429WO1) Page 23 of 38 VNF A to VNF E, thus representing four feasible, low-cost VNF-FGs: (i) A1, B1, C2, D2, E2; (ii) A2, B2, C2, D1, E2; (iii) A1, B4, C3, D1, E1; and (iv) A1, B4, C3, D1, E3.
  • FIG.50 shows a process 5000 for decomposing one or more chains of VNFs.
  • the one or more chains of VNFs includes a first VNF and a second VNF.
  • Process 5000 may begin with step s5002.
  • Step s5002 comprises identifying a first set of decomposition sub-components, DSCs, included in the first VNF, wherein the first set of DSCs includes a first DSC and a second DSC.
  • Step s5004 comprises identifying a second set of DSCs included in the second VNF, wherein the second set of DSCs includes a third DSC.
  • Step s5006 comprises obtaining a first forward weight value for a first forward path from the first DSC to the third DSC.
  • Step s5008 comprises obtaining a second forward weight value for a second forward path from the second DSC to the third DSC.
  • Step s5010 comprises performing a first comparison based on the first forward weight value and the second forward weight value.
  • Step s5012 comprises, using a result of the first comparison based on the first forward weight value and the second forward weight value, selecting first forward path.
  • Step s5014 comprises configuring a connection between the first VNF and the second VNF based on the selection of the first forward path.
  • the method comprises generating a decision graph indicating a plurality of path between the first set of DSCs and the second set of DSCs, wherein the decision graph indicates the selection of the first forward path.
  • the decision graph is a tree graph.
  • performing the first comparison comprises determining which one of the first and second forward weight values is greater.
  • the first set of DSCs further includes a fourth DSC
  • the second set of DSCs further includes a fifth DSC
  • the method further comprises: obtaining a third forward weight value for a third forward path from the second DSC to the fifth DSC; obtaining a fourth forward weight value for a fourth forward path from the fourth DSC to the fifth DSC; performing a second comparison based on the third forward weight value and the fourth forward weight value; using a result of the second comparison, selecting the third forward path; and configuring a connection between the first VNF and the second VNF further based on the selection of the third forward path.
  • the second VNF includes a particular DSC
  • said one or more chains of VNFs further includes a third VNF comprising one or more DSCs
  • the method further comprises: selecting a forward path from at least one DSC included in the first VNF to the particular DSC included in the second VNF; not selecting any forward path from the particular DSC included in the second VNF to any DSC included in the third VNF; based on not selecting any forward path from the particular DSC include in the second VNF to any DSC included in the third VNF, determining to exclude the particular DSC from the decision graph.
  • the method further comprises selecting a backward path from at least one DSC included in the third VNF to the particular DSC included in the second VNF; and not selecting any backward path from the particular DSC included in the second VNF to any DSC included in the first VNF, wherein determining to exclude the particular DSC from the decision graph is further based on not selecting any backward path from the particular DSC included in the second VNF to any DSC included in the first VNF.
  • the method further comprises obtaining a first backward weight value for a first backward path from the third DSC to the first DSC; obtaining a second backward weight value for a second backward path from a DSC included in the second VNF to the first DSC; performing a comparison based on the first backward weight value and the second backward weight value; using a result of the comparison which is based on the first backward weight value and the second backward weight value, selecting the first backward path; and configuring a connection between the first VNF and the second VNF based on the selection of the first backward path.
  • said one or more chains of VNFs include a first chain of VNFs and a second chain of VNFs, the first chain of VNFs includes the first VNF, the second VNF, a source node (, and a first destination node, the second chain of VNFs includes the first VNF, a third VNF, the source node, and a second destination node.
  • the method comprises obtaining first connection information about a first group of connections between the first VNF and the second VNF in the first chain of VNFs; obtaining second connection information about a second group of connections between the first VNF and the third VNF in the second chain of VNFs; and based on the obtained first and P104419WO01 (3602-2429WO1) Page 25 of 38 second connection information, creating one or more connections between the second VNF and the third VNF.
  • the method comprises identifying one DSC included in the first VNF; identifying one DSC included in the third VNF, wherein said one DSC included in the first VNF is connected to said one DSC included in the third VNF in the second chain; identifying one DSC included in the second VNF, wherein said one DSC included in the second VNF is connected to said one DSC included in the first VNF in the first chain; and based on the obtained first and second connection information, creating a connection between said one DSC included in the second VNF and said one DSC included in the third VNF.
  • said one or more chains of VNFs include a first chain of VNFs and a second chain of VNFs, the first chain of VNFs includes a first source node, the first VNF, the second VNF, and a destination node, and the second chain of VNFs includes a second source node, a third VNF, the second VNF, and the destination node.
  • the method comprises obtaining first connection information about a first group of connections between the first VNF and the second VNF in the first chain of VNFs; obtaining second connection information about a second group of connections between the third VNF and the second VNF in the second chain of VNFs; and based on the obtained first and second connection information, creating one or more connections between the first VNF and the third VNF.
  • the method comprises identifying one DSC included in the first VNF; identifying one DSC included in the second VNF, wherein said one DSC included in the first VNF is connected to said one DSC included in the second VNF in the first chain; identifying one DSC included in the third VNF, wherein said one DSC included in the third VNF is connected to said one DSC included in the second VNF in the second chain; and based on the obtained first and second connection information, creating a connection between said one DSC included in the second VNF and said one DSC included in the third VNF.
  • said one or more chains of VNFs include a first chain of VNFs and a second chain of VNFs, the first chain of VNFs includes a source node, the first VNF, the P104419WO01 (3602-2429WO1) Page 26 of 38 second VNF, and a destination node, and the second chain of VNFs includes the source node, the first VNF, the second VNF, a third VNF, and the destination node.
  • the method comprises obtaining first connection information about a first group of connections between the first VNF and the second VNF in the first chain of VNFs; obtaining second connection information about a second group of connections between the first VNF and the third VNF in the second chain of VNFs; and based on the obtained first and second connection information, selecting one or more connections between the first VNF and the third VNF from the second group of connections in the second chain of VNFs.
  • the method comprises obtaining third connection information about a third group of connections between the third VNF and the second VNF in the second chain of VNFs, based on the obtained first and third connection information, selecting one or more connections between the second VNF and the third VNF from the third group of connections in the second chain of VNFs.
  • said one or more chains of VNFs include a first chain of VNFs, a second chain of VNFs, and a third chain of VNFs
  • the first chain of VNFs includes a source node, the first VNF, the second VNF, a third VNF, a fourth VNF, and a destination node
  • the second chain of VNFs includes the source node, the first VNF, the second VNF, the fourth VNF, and the destination node
  • the third chain of VNFs includes the source node, the first VNF, the third VNF, the fourth VNF, and the destination node.
  • the method comprises obtaining first connection information about a first group of connections between the first VNF and the second VNF in the first chain of VNFs; obtaining second connection information about a second group of connections between the first VNF and the third VNF in the second chain of VNFs; and based on the obtained second connection information, selecting one or more connections between the first VNF and the second VNF from the first group of connections in the first chain of VNFs.
  • the method further comprises obtaining third connection information about a third group of connections between the second VNF and the third VNF in the first chain of VNFs; and based on the obtained second connection information, selecting one or P104419WO01 (3602-2429WO1) Page 27 of 38 more connections between the second VNF and the third VNF from the third group of connections in the first chain of VNFs.
  • the method further comprises obtaining fourth connection information about a fourth group of connections between the second VNF and the fourth VNF in the third chain of VNFs; and based on the obtained fourth connection information, selecting one or more connections between the second VNF and the third VNF from the third group of connections in the first chain of VNFs.
  • the method further comprises obtaining fifth connection information about a fifth group of connections between the third VNF and the fourth VNF in the first chain of VNFs; and based on the obtained fourth connection information, selecting one or more connections between the third VNF and the fourth VNF from the fifth group of connections in the first chain of VNFs.
  • FIG.51 is a block diagram of an apparatus 5100, according to some embodiments, for implementing the VNF or the SFC described above. As shown in FIG.
  • apparatus 5100 may comprise: processing circuitry (PC) 5102, which may include one or more processors (P) 5155 (e.g., a general purpose microprocessor and/or one or more other processors, such as an application specific integrated circuit (ASIC), field-programmable gate arrays (FPGAs), and the like), which processors may be co-located in a single housing or in a single data center or may be geographically distributed (i.e., apparatus 5100 may be a distributed computing apparatus); a network interface 5148 comprising a transmitter (Tx) 5145 and a receiver (Rx) 5147 for enabling apparatus 5100 to transmit data to and receive data from other nodes connected to a network 110 (e.g., an Internet Protocol (IP) network) to which network interface 5148 is connected (directly or indirectly) (e.g., network interface 5148 may be wirelessly connected to the network 110, in which case network interface 5148 is connected to an antenna arrangement); and a local storage unit (a.k.a., “data storage system”)
  • CPP computer program product
  • CPP 5141 includes a computer readable medium (CRM) 5142 storing a computer program (CP) 5143 comprising computer readable instructions (CRI) 5144.
  • CRM 5142 may be a non-transitory computer readable medium, such as, magnetic media (e.g., a hard disk), optical media, memory P104419WO01 (3602-2429WO1) Page 28 of 38 devices (e.g., random access memory, flash memory), and the like.
  • the CRI 5144 of computer program 5143 is configured such that when executed by PC 5102, the CRI causes apparatus 5100 to perform steps described herein (e.g., steps described herein with reference to the flow charts).
  • apparatus 5100 may be configured to perform steps described herein without the need for code. That is, for example, PC 5102 may consist merely of one or more ASICs. Hence, the features of the embodiments described herein may be implemented in hardware and/or software.

Landscapes

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

Abstract

L'invention concerne un procédé de décomposition d'une ou de plusieurs chaînes de fonctions de réseau virtuel (VNF). Le procédé comprend l'identification d'un premier ensemble de sous-composants de décomposition (DSC) inclus dans une première VNF et d'un deuxième ensemble de DSC inclus dans une deuxième VNF. Le procédé comprend en outre l'obtention d'une première valeur de poids vers l'avant pour un premier trajet vers l'avant d'un premier DSC vers un troisième DSC, l'obtention d'une deuxième valeur de poids vers l'avant pour un deuxième trajet vers l'avant d'un deuxième DSC vers le troisième DSC, et la réalisation d'une première comparaison sur la base de la première valeur de poids vers l'avant et de la deuxième valeur de poids vers l'avant. Le procédé comprend en outre l'utilisation d'un résultat de la première comparaison sur la base de la première valeur de poids vers l'avant et de la deuxième valeur de poids vers l'avant, la sélection d'un premier trajet vers l'avant, et la configuration d'une connexion entre la première VNF et la deuxième VNF sur la base de la sélection du premier trajet vers l'avant.
PCT/IB2022/057904 2022-08-23 2022-08-23 Décomposition de fonctions de réseau virtuel WO2024042347A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/IB2022/057904 WO2024042347A1 (fr) 2022-08-23 2022-08-23 Décomposition de fonctions de réseau virtuel

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/IB2022/057904 WO2024042347A1 (fr) 2022-08-23 2022-08-23 Décomposition de fonctions de réseau virtuel

Publications (1)

Publication Number Publication Date
WO2024042347A1 true WO2024042347A1 (fr) 2024-02-29

Family

ID=83280303

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/IB2022/057904 WO2024042347A1 (fr) 2022-08-23 2022-08-23 Décomposition de fonctions de réseau virtuel

Country Status (1)

Country Link
WO (1) WO2024042347A1 (fr)

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160212017A1 (en) * 2015-01-20 2016-07-21 Huawei Technologies Co., Ltd. Systems and Methods for SDT to Interwork with NFV and SDN
US20170279923A1 (en) * 2016-03-25 2017-09-28 Ca, Inc. Provisioning of network services based on virtual network function performance characteristics

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160212017A1 (en) * 2015-01-20 2016-07-21 Huawei Technologies Co., Ltd. Systems and Methods for SDT to Interwork with NFV and SDN
US20170279923A1 (en) * 2016-03-25 2017-09-28 Ca, Inc. Provisioning of network services based on virtual network function performance characteristics

Non-Patent Citations (7)

* Cited by examiner, † Cited by third party
Title
"Network Functions Virtualisation (NFV); Ecosystem; Report on SDN Usage in NFV Architectural Framework", vol. ISG - NFV, no. V-EVE 005 V1.1.1, 1 September 2017 (2017-09-01), pages 1 - 125, XP014311664, Retrieved from the Internet <URL:docbox.etsi.org\ISG\NFV\Open\Publications\Specs-Reports\NFV-EVE 005v1.1.1 - GS - SDN usage in NFV Report.pdf> [retrieved on 20170901] *
FISCHER ANDREAS ET AL: "On the Construction of Optimal Embedding Problems for Delay-Sensitive Service Function Chains", 2019 28TH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATION AND NETWORKS (ICCCN), IEEE, 29 July 2019 (2019-07-29), pages 1 - 10, XP033620607, DOI: 10.1109/ICCCN.2019.8847151 *
KAUR KARAMJEET ET AL: "A comprehensive survey of service function chain provisioning approaches in SDN and NFV architecture", COMPUTER SCIENCE REVIEW, ELSEVIER, AMSTERDAM, NL, vol. 38, 8 September 2020 (2020-09-08), XP086364293, ISSN: 1574-0137, [retrieved on 20200908], DOI: 10.1016/J.COSREV.2020.100298 *
LI DEFANG ET AL: "Virtual Network Function Placement with Function Decomposition for Virtual Network Slice", 2018 IEEE CONFERENCE ON STANDARDS FOR COMMUNICATIONS AND NETWORKING (CSCN), IEEE, 29 October 2018 (2018-10-29), pages 1 - 4, XP033480453, DOI: 10.1109/CSCN.2018.8581851 *
PENTELAS ANGELOS ET AL: "Service Function Chain Graph Transformation for Enhanced Resource Efficiency in NFV", 2021 IFIP NETWORKING CONFERENCE (IFIP NETWORKING), IFIP, 21 June 2021 (2021-06-21), pages 1 - 9, XP033939135, DOI: 10.23919/IFIPNETWORKING52078.2021.9472854 *
SALLAM GAMAL ET AL: "Shortest Path and Maximum Flow Problems Under Service Function Chaining Constraints", IEEE INFOCOM 2018 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS, IEEE, 16 April 2018 (2018-04-16), pages 2132 - 2140, XP033418278, DOI: 10.1109/INFOCOM.2018.8485996 *
SCHARDONG FREDERICO ET AL: "NFV Resource Allocation: a Systematic Review and Taxonomy of VNF Forwarding Graph Embedding", COMPUTER NETWORKS, ELSEVIER, AMSTERDAM, NL, vol. 185, 4 December 2020 (2020-12-04), XP086441078, ISSN: 1389-1286, [retrieved on 20201204], DOI: 10.1016/J.COMNET.2020.107726 *

Similar Documents

Publication Publication Date Title
US7499413B2 (en) Method for designating communication paths in a network
US8694980B2 (en) Efficient egonet computation in a weighted directed graph
JP5104489B2 (ja) 分散イベント検出システム、分散イベント検出方法、及び分散イベント検出用プログラム
US10367686B2 (en) Automatically detecting roles of nodes in layered network topologies
Rao et al. New approximation techniques for some linear ordering problems
US9407546B2 (en) Routing a message using a routing table in a dynamic service mesh
CN105634974A (zh) 软件定义网络中的路由确定方法和装置
Ferber et al. Finding Hamilton cycles in random graphs with few queries
EP2238537A1 (fr) Système et procédé de diagnostics distribués automatisés pour des réseaux
Zenarosa et al. Scenario-tree decomposition: bounds for multistage stochastic mixed-integer programs
WO2018166249A1 (fr) Procédé et système de transmission de service de réseau
van Iersel et al. Approximation algorithms for nonbinary agreement forests
CN113868367A (zh) 构建知识图谱的方法、装置及系统、计算机存储介质
US20200302275A1 (en) Neural network apparatus
WO2024042347A1 (fr) Décomposition de fonctions de réseau virtuel
Fischer et al. Public vs. private randomness in simultaneous multi-party communication complexity
CN110071828A (zh) 告警方法、装置、设备及存储介质
CN113014650B (zh) 针对数据请求的处理方法、装置、计算设备和介质
Amarasinghe et al. Aggregation-based discovery for virtual network environments
Berry et al. Triangulation and clique separator decomposition of claw-free graphs
JP6981232B2 (ja) ネットワーク設計装置、方法、及びプログラム
Zhao et al. Symmetric agency graphs facilitate and improve the quality of virtual network embedding
CN112116136A (zh) 一种最短路径的生成方法及相关装置
Bartal et al. Lower bounds for on-line graph problems with application to on-line circuit and optical routing
CN114866281B (zh) 一种在p4交换机上部署随机森林模型的方法

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 22768972

Country of ref document: EP

Kind code of ref document: A1