WO2019210946A1 - Dispositif de gestion apte à gérer des tranches dans un réseau, et procédé et programme informatique pour la gestion de tranches de réseau - Google Patents

Dispositif de gestion apte à gérer des tranches dans un réseau, et procédé et programme informatique pour la gestion de tranches de réseau Download PDF

Info

Publication number
WO2019210946A1
WO2019210946A1 PCT/EP2018/061193 EP2018061193W WO2019210946A1 WO 2019210946 A1 WO2019210946 A1 WO 2019210946A1 EP 2018061193 W EP2018061193 W EP 2018061193W WO 2019210946 A1 WO2019210946 A1 WO 2019210946A1
Authority
WO
WIPO (PCT)
Prior art keywords
information
network
slice
management device
network devices
Prior art date
Application number
PCT/EP2018/061193
Other languages
English (en)
Inventor
Spyridon VASSILARAS
Georgios Paschos
Kostas KATSALIS
Konstantinos Samdanis
Xueli AN
Original Assignee
Huawei Technologies Co., Ltd.
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 Huawei Technologies Co., Ltd. filed Critical Huawei Technologies Co., Ltd.
Priority to PCT/EP2018/061193 priority Critical patent/WO2019210946A1/fr
Publication of WO2019210946A1 publication Critical patent/WO2019210946A1/fr

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/38—Flow based routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H04L45/124—Shortest path evaluation using a combination of metrics
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H04L45/127—Shortest path evaluation based on intermediate node capabilities
    • 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/302—Route determination based on requested QoS
    • 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/302—Route determination based on requested QoS
    • H04L45/306—Route determination based on the nature of the carried application
    • 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/64—Routing or path finding of packets in data switching networks using an overlay routing layer
    • 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/70—Routing based on monitoring results

Definitions

  • Management device for slice management in a network method and computer program for managing network slices
  • the present invention generally relates to the field of managing communication networks. More specifically, the present invention relates to devices and methods for managing network slices.
  • Communication networks in particular cellular communication networks, have often been architected to support specific predefined services, namely voice, messaging, and Internet access.
  • wireless networks and their operators are expected to support a number of diverse vertical industry applications in order to expand the wireless market.
  • Next-generation networks should simultaneously accommodate applications and services with requirements as diverse as ultra-low latency and high resilience (URLL) for real-time control of critical systems or scalability to hundreds of thousands of connected devices towards the Internet-of-Things (loT).
  • URLL ultra-low latency and high resilience
  • LoT Internet-of-Things
  • a Network Slice Instance as defined in 3GPP TS 28.801 is "a set of network functions and the resources for these network functions which are arranged and configured, forming a complete logical network to meet certain network characteristics.” This way, different NSI can be used to accommodate the requirements of different services types.
  • Network functions can be implemented either as Virtual Network Functions (VNF) which can be run by a suitable physical network node or as Physical Network Functions (PNF) whose location (physical node performing this function) is fixed.
  • VNF Virtual Network Functions
  • PNF Physical Network Functions
  • An NSI is expected to span multiple network domains.
  • 3GPP TR 28.801 vl5 defines the following entities regarding the orchestration and management of NSIs:
  • CSMF Communication Service Management Function
  • Network Slice Management Function This entity is responsible for
  • NSSI Network Slice Subnet Management Function
  • SSSI Network Slice Subnet Management Function
  • An NSSI is a set of network functions and the resources for these network functions which are arranged and configured to form a logical network for a specific subnet.
  • the RAN-NSSMF is responsible for the management of the RAN NSSIs.
  • the NSSI is defined by a sub-network blueprint (TR23.799).
  • Fig. 1 For the 3GPP network the logical architecture combining the above entities into a complete network slice management and orchestration system is shown in Fig. 1 for the case of disaggregated RAN.
  • the orchestration and management entities are however the same also in the case of other designs, for example vanilla LTE or Cloud-RAN designs.
  • PCE procedures are however slice unaware and the control plane functionalities are just based on the routing protocol used.
  • PCE procedures can take into account QoS requirements when discovering a path.
  • the following patent and paper describe the basic LARAC algorithm for finding a constrained min-cost path.
  • this basic algorithm does not take into consideration VNF placement, neither the simultaneous embedding of many service chains under node and link capacity constraints.
  • the supporting orchestration and management systems are not just used for path computations with the minimum cost or highest bandwidth. They need also to consider the need for a joint optimization of where NSI functions (like VNFs or PNFs) should be placed and how these will be interconnected over the network. This requires sophistication on both the orchestration and the control planes that need to be tightly integrated in order to provide the required slice guarantees.
  • NSI functions like VNFs or PNFs
  • an object of the present invention is to address the above-mentioned issues and to provide a way to reliably identify resources and functions required for the configuration of a network slice.
  • the above-mentioned object is achieved by the features of the independent claims. Further embodiments of the invention are apparent from the dependent claims, the description and the figures.
  • the invention relates to a management device for slice management of a communication network.
  • the management device is configured to determine path information about one or more network devices for operating a slice.
  • the management device is configured to determine configuration information for a virtual network function to be placed on the one or more network devices based on the path information.
  • the management device is configured to provide the configuration information to at least one of the network devices and/or to a control entity for at least one of the network devices.
  • the path information which may define a service chain, may comprise predefined requirements for the slice which must be obeyed when determining the network configuration information.
  • the management device may be implemented as a Network Slice Management Function, NSMF, in particular of a Service Level Agreement SLA.
  • the management device can be a Network Slice Subset Management Function, NSSMF, in particular an NSSMF of a Radio Access Network, RAN-NSSMF.
  • NSSMF Network Slice Subset Management Function
  • the management device may be configured to provide the configuration information by a transmission of the configuration information to the network devices and/or the control entity.
  • the management device may also be configured to store the configuration information into a database that is accessible by the network devices and/or the control entity.
  • a network slice may be implemented via chaining and operating virtual network functions on the respective network devices according to the path information and the configuration information.
  • the path information may comprise information about at least one of: a Fronthaul; a Midhaul; a Backhaul and an end-to-end path of the slice.
  • the Fronthaul, Midhaul and Backhaul are each domains with a different scope of the communication network. In some aspects, these domains may overlap.
  • An end-to-end path defined by the path information may extend over any of the Fronthaul, Midhaul and/or Backhaul of the network. Thereby, it is unambiguous how the slice should be implemented within the network.
  • the path information may comprise information about one or more VNFs and/or one or more value added services placed on one or more network devices for operating the slice.
  • the network devices may each provide an individual set of virtual network functions, VNF, and/or value added services. Thereby, it is further specified how the network slice is to be implemented within the network.
  • the path information may comprise an optimal set of network devices for operating the slice.
  • the slice may fulfil one or more Quality-of-Service, QoS parameters, e.g., a pre-defined latency between two or more network devices for operating the slice.
  • QoS parameters e.g., a pre-defined latency between two or more network devices for operating the slice.
  • the path information for all service chains, functions and/or slices is thus determined as a solution to an optimization problem.
  • Different QoS parameters may be fulfilled.
  • a jitter and/or an energy consumption requirement may be fulfilled in addition to or instead of a pre-defined latency.
  • the management device may be an NSMF or an NSSMF.
  • the slice may be configured with the parameters that were requested for the slice from the management device.
  • control entity may be another management device, in particular an NSSMF.
  • the management device may directly instruct a management device in contact with a transport network to implement the slice.
  • the management device may be configured to receive from the control entity information related to at least one of: a network topology, capability, slice configuration and/or resource allocation.
  • a resource allocation may be a process to obtain a resource, in particular by a request.
  • a resource may in particular be a communication resource or a computational resource on a network device.
  • allocation may also comprise to directly reserve a resource, i.e. without a prior request, because of internal management or control operations.
  • For each resource or network function configuration information can be organized in a template, in particular an at least partly completed template.
  • a template may be a combination of parameters and sub-functions.
  • the management device may receive information that is useful to determine the configuration information and/or to determine the scope of the resources controlled by the control entity.
  • the configuration information may comprise one or more of the following:
  • Topology information may comprise a set of physical nodes and/or physical links.
  • Capability information may comprise information about link capacities.
  • Functional information may comprise information about virtual and/or physical network functions.
  • Security information may comprise information regarding authorization and authentication credentials on per slice basis.
  • Performance information may relate to quality of service, e.g. measured packet error rates.
  • the virtual network function to be configured using this information can be correctly chosen to implement the constraints defined by the information.
  • the configuration information comprises information on a configuration of resources and/or functions of a transport network.
  • the control entity may, in this case, be a domain controller or an element manager.
  • the management device may be configured to receive monitoring information from one or more of the network devices and/or from one or more management entities, wherein each monitoring information is related to one or more of the network devices for operating the slice. Thereby, problems within the network can be identified.
  • the monitoring information comprises at least one of:
  • a slice management method comprises the steps:
  • the management device determines an output, wherein the output comprises path information about one or more network devices for operating a slice and configuration information for a virtual network function to be placed on the one or more network devices based on the path information;
  • the receiving step comprises: requesting, by the management device from the control entity, at least one of
  • the management device may receive information that is useful to determine the configuration information and/or to determine the scope of the resources controlled by the control entity
  • the processing step comprises:
  • the method further comprises requesting configuration of a slice.
  • the invention relates to a computer program having a program code for performing the method according to the second aspect, when the computer program runs on a computing device.
  • the method can be performed in an automatic and repeatable manner.
  • the computer program can be respectively performed by the management device according to the first aspect or by the control entity according to some implementations of the first aspect.
  • the above apparatuses may be implemented based on a discrete hardware circuitry with discrete hardware components, integrated chips or arrangements of chip modules, or based on a signal processing device or chip controlled by a software routine or program stored in a memory, written on a computer-readable medium or downloaded from a network such as the internet.
  • Fig. 1 shows a schematic overview over a network slice management
  • Fig. 2 shows a schematic overview of changes to a path computation element in order to make it slice-aware according to an embodiment of the invention
  • Fig. 3 shows a schematic overview of a centralized computation model according to an embodiment of the invention
  • Fig. 4 shows a schematic overview of a distributed computation model according to an embodiment of the invention
  • Fig. 5 shows an example simplified representation of a message exchange for a network as well as a network function chain to be embedded in the network;
  • Fig. 6 shows an example simplified representation of a message exchange for
  • Fig. 7 shows a network graph produced by a path determination algorithm
  • Fig. 8 shows an example network graph comprising gateway nodes for an instance of the reduced graph produced during advanced PCE operations
  • Fig. 9 shows a protocol flow diagram of a management device carrying out
  • Fig.10 shows a protocol flow diagram of a management device carrying out a high level centralized computation to determine the optimal slice configuration according to an embodiment of the invention
  • Fig.11 shows a network instance diagram of a management device carrying out decentralized computation procedures according to another embodiment of the invention for the multi-domain advanced PCE problem.
  • Fig. 1 shows a schematic overview over a network slice management and orchestration architecture as defined in 3GPP TR 28.801.
  • a management device which in this case comprises an NSMF 12
  • the control entities 14, 16, 18 each have an overview of the physical and/or virtual network functions and/or network devices controllable by them.
  • the control entities 14, 16, 18 may be local management entities.
  • the NSMF 12 is configured to determine configuration information for one or more virtual network functions to be placed on one or more network devices as well as path information about the network devices for operating one or more slices.
  • the path information may comprise interconnection path information about interconnection paths among the network devices hosting virtual network functions.
  • the configuration information may comprise virtual network function placement and/or embedding information.
  • the NSMF 12 is also configured to provide the configuration information to at least one of the network devices and/or to a control entity 14, 16, 18 for at least one of the network devices.
  • the control entities 14, 16, 18 may configure network devices within their domains, for example through a controller, according to the path information and/or the configuration information.
  • the path information may comprise information about paths in a fronthaul, a midhaul and/or a backhaul and/or an end-to-end path of the slice.
  • the path information may also comprise information about paths in multiple network domains.
  • the path information and/or the configuration information may also comprise information about virtual network functions forming one or more service chains.
  • the path information may also comprise information about multiple service chains.
  • Each service chain whose embedding information is determined by the NSMF 12 may need to fulfil one or more quality of service, QoS, parameters.
  • Such parameters may for example be a latency, a jitter and/or an energy consumption.
  • the latency may be a predefined latency between two or more network devices for operating the slice.
  • the chain embedding and interconnection path information may in particular be determined by the NSMF 12 in way so that it comprises an optimal set of network devices for operating the slice.
  • an optimal set of network devices is a set of network devices which fulfills the quality of service parameters.
  • the control entity 14, 16, 18 to which the NSMF 12 provides the configuration information may not only be an NSSMF 14, 16, 18 but may also be another NSMF or a completely different entity like a local controller according to the communication network it is implemented in.
  • the network devices may each provide an individual set of virtual network functions, VNF, and/or value added services.
  • Fig. 2 shows a schematic overview of changes to a path computation element in order to make it slice-aware according to an embodiment of the invention.
  • a variety of inputs 20 may be available to the NSMF 12 and/or the NSSMF 14, 16, 18.
  • the inputs 20 may comprise information relating to a network topology, a network capability, a slice configuration and/or a resource allocation.
  • the NSMF 12 may, for example, receive information about physical nodes, their latencies, their bandwidth, slices configured, slice templates, allocated resources and/or any of the resources named as input 20 in Fig. 2 as well as others falling into their respective domains from any of the control entities 14, 16, 18.
  • output 22 is generated by a processing entity 24.
  • the output 22 comprises path information and/or configuration information to implement a network slice to fulfil the constraints of the input 20.
  • the configuration information may comprise a topology information, for example regarding the use of certain links between nodes.
  • the configuration may further comprise capability information, for example the required capabilities to be configured on said links.
  • the configuration information may comprise functional information, for example which virtual and/or physical network functions should be configured at which node of the slice.
  • the configuration information may also comprise security information, for example the required encryption of certain links.
  • the configuration information may also comprise performance information, for example for configuring performance parameters of a network node.
  • Fig. 3 shows a schematic overview of a centralized computation model according to an embodiment of the invention.
  • the NSMF 12 by means of the processing entity 24 carries out the determination of the output 22 comprising path information and the configuration information based on the input 20 and a monitoring information provided by the NSSMF 14 of the transport network.
  • This particular NSSMF 14 is shown here for example. Any of the NSSMF 14, 16, 18 or any other control entity may be used instead.
  • the monitoring information provided by the NSSMF 14 may comprise performance information, in particular latency, utilization information, in particular bandwidth and/or for the management or resilience information.
  • the monitoring information may comprise further information not explicitly mentioned here.
  • the configuration information in the output 22 may comprise information on the configuration of resources and/or functions of a transport network.
  • the above- mentioned information that is comprised as configuration information in the output 22 may thus be applied to resources and/or functions of a transport network.
  • the output 22 is transmitted via an interface 26 to the NSSMF 14.
  • Configuration information in general can be organized as a template, in particular an at least partly completed template.
  • the template may comprise any combination of parameters and functions.
  • the NSSMF 14 thus may create a slice template 28 which comprises the configuration information and/or the path information from the output 22 in a way that is usable for configuring network devices of the transport network.
  • the slice template 28 may be used to configure element managers 30 directly or by intermediary of a domain controller 32.
  • Fig. 4 shows a schematic overview of a distributed computation model according to another embodiment of the invention.
  • the NSMF 12 and the NSSMFs 14 share the load of processing the input 20.
  • the NSMF 12 may carry out processing on its processing unit 24 with relation to the input 20 that is available to the NSMF 12.
  • the processing may comprise determining path information about one or more network devices for operating a slice and/or determining configuration information for a virtual network function to be placed on the one or more network devices based on the path information.
  • the results of the processing may be transmitted to the NSSMFs 14 for further processing in another processing unit 34. This processing is carried out using input 36 from the domain of each NSSMF 14.
  • Fig. 5 shows shows an example simplified representation of a message exchange for a network as well as a network function chain to be embedded in the network.
  • the sequence of the message exchange may also be interpreted as a flowchart of a centralized slice embedding determination protocol according to the schematic overview of figure 3.
  • a method for determining the path information and/or configuration information may comprise any subset of the steps and/or message exchanges shown therein.
  • Fig. 5 shows the interactions of the NSMF 12 with a single NSSMF 14, although similar interactions will be carried out with all involved NSSMFs 14, 16, 18.
  • the NSMF 12 will request input from the NSSMF 14, possibly combined that input 20 with information available within the NSMF 12 and process that input 20 to obtain an output 22 which comprises path information and/or configuration information.
  • the NSMF 12 may, in a first step 60, request network topology information from an NSSMF 14, for example via the interface 26.
  • the NSSMF 14 may transmit network topology information to the NSMF 12.
  • the NSMF 12 may request capabilities information from the NSSMF 14.
  • the NSSMF 14 may transmit capabilities information to the NSMF 12.
  • the NSMF 12 may process the input 20 comprising the network topology information and/or the capabilities information and/or further information to obtain and output 22 which comprises path information and/or configuration information.
  • the NSMF 12 may then, for example, send a network slice request in a further step 70 which may cause the NSSMF 14 to configure devices in its transport network.
  • the NSSMF 14 may, in a further step 72, send a response which may comprise information about the slice and/or whether the slice was successfully created and/or other information relating to the slice.
  • the NSMF 12 may, in a further step 74, request reservation of a resource from the NSSMF 14. This request may cause the NSSMF 14 to reserve resources in its transport network. Furthermore, the NSSMF 14 may, in a further step 76, sent a response which may indicate whether the resources were successfully reserved.
  • Fig. 6 shows a protocol flow diagram of a management device carrying out decentralized computation procedures according to another embodiment of the invention. For simplicity, it shows the interactions of the NSMF 12 with a single NSSMF 14, although similar interactions will be carried out with all involved NSSMFs 14.
  • the NSMF 12 may request, in a step 80, domain information from the NSSMF 14, for example about which part of a network topology it controls.
  • the NSMF 12 may request a list of physical nodes controlled by the NSSMF 14.
  • the NSSMF 14 may, in a step 82, transmit a list of physical nodes and/or other domain information to the NSMF 12.
  • the NSMF 12 may repeat these steps for every NSSMF 14, 16, 18 or any other control entity that it wishes to control.
  • the NSMF 12 may process the information received in step 82 together with information available within the NSMF 12 to obtain an intermediate output 38 which it may send, in a step 86, to the NSSMF 14.
  • the NSSMF 14 may process that intermediate output 38 as an input and may respond, in the further step 88, with a minimum cost path information which may be optimized for one or more quality of service parameters. That minimum cost path information may complement the input 20 of the NSMF 12.
  • Steps 84, 86 and 88 may then be repeated, also for other NSSMFs 14, 16, 18 and/or other control entities.
  • the path information referenced above may also be referred to as a routing path.
  • Determining path information may also be referred to as path computation, in particular routing path computation.
  • NFs Physical Network Functions (PNFs) and/or Virtualized Network Functions (VNFs)
  • PNFs Physical Network Functions
  • VNFs Virtualized Network Functions
  • RAN Radio Access Network
  • CN Core or Core Network
  • the invention defines an approach where instead of the monolithic operation of simple path computations performed in the PCE, advanced computational procedures are used to accommodate features like VNFs placement and routing in support of Network Slicing.
  • FIG. 2 A high level design of the approach is depicted in Fig. 2.
  • the invention employs the core concepts of input 20, information processing 24, and output 22 as follows:
  • Input 20, 36 Besides physical topologies and the SLAs (like in the case of PCE), advanced computational procedures also consider input 20, 36 like: a) current and desired NSSI state and performance; b) desired VNF chains; c) physical network/systems topologies; d) monitoring OAM information; and e) available VNF libraries.
  • the list is not exhaustive and can be enriched depending for example on technology specific requirements of the transport network.
  • Processing 24, 34, 68, 84 The following primitive objectives of the advanced computations operations can be identified for example: a) admission control; b) pre emption; and c) network embedding.
  • the invention targets network embedding operations. New policies need to be designed that are able to optimize the operational environment, while at the same time intra-NSSI optimizations, respecting the SLAs.
  • NSSMF 14 In the light of Network Slicing the output of enhanced computational operations is not just a route, but a NSSI template describing for example how VNF embedding must be performed together with the routing information.
  • NSSMF 14, 16, 18 entities interacts with the corresponding Domain Controllers 32 (e.g. SDN controllers) or directly with network Element Managers 32 (EM) for the actual enforcement of the slice template.
  • Domain Controllers 32 e.g. SDN controllers
  • EM network Element Managers
  • the invention exploits and extends the available interfaces used for the communication between the end-to-end NSMF 12 management and orchestration system and the NSSMF 14, 16, 18 systems of slice aware networks.
  • the invention also considers the design of new mechanisms that are able to provide end-to-end service guarantees for VNF chains in the light of network slicing.
  • Case 2 (Fig. 4): In the second case NSMF 12 and NSSMFs 14 need to interact during computation in order to derive the end-to-end solution.
  • the e2e solution is assembled in the NSMF 12 via an iterative process.
  • the core problem solved by our invention can be stated as follows. Given a physical network with specific topology, available resources, and cost of using these resources and a bunch of VNF/PNF chains with specific resource demands to be embedded on this given physical network, find the minimum cost embedding of all these chains subject capacity, VNF/PNF embedding, end-to-end QoS and integrality constraints on per NSI basis.
  • the QoS constraint can be any additive constraint in the sense that the sum of the values of a certain QoS parameter over all links and nodes in a path must be less than or equal to a quality of service required value.
  • Such QoS parameters can be, e.g., latency, jitter, energy consumption, etc.
  • Multiplicative constraints such as Packet Error Rates
  • latency As the QoS constraint, but note that any additive or multiplicative constraint can be handled.
  • any additive or multiplicative constraint can be handled.
  • To formally define the problem we use the following mathematical formulation. From an implementation perspective, these will be input 20 parameters to the slice-aware advanced computational procedures 24, 34 subsystem:
  • Input Parameters Depending on the way the problem is solved (centrally by the NSMF 12 or distributed by both the NSSMFs 14, 16, 18 and the NSMF 12) these parameters are passed to the corresponding entity that is responsible for driving the advanced path computation procedures 24, 34.
  • INPUT 20 A physical network graph G(V,E,c,p,d) where: o V is the set of physical nodes (MTs, RUs, routers or VMs) o E is the set of physical links (wireless or wireline) o b is a vector containing all physical link capacities, b q (e e E), and physical node capacities, b connectivity(n e V) o c is a vector containing all physical link costs, c e (e e E), and physical node costs, c v (v e V) o d is a vector containing all physical link delays, d e (e e E) and physical node delays, d conflict(v e V)
  • FIG. 7 A very simplified example of physical network is shown in Fig. 7.
  • solid lines represent wireline links 42, whereas dotted lines denote wireless links 40.
  • Multiple wireless links 40 between the same pair of nodes 44 denote different service classes which offer different delays and capacities usually at the relevant cost.
  • V n ,V m e V k might be overlapping which means that two (or more) different NFs can be embedded onto the same physical node 44 (provided that the physical node 44 has available resources to accommodate their aggregate demands).
  • the virtual link 40, 42 connecting the two NFs is embedded to an empty path with zero cost and delay.
  • Fig. 7 A simplified example of an NF chain that needs to be embedded on the physical network is also shown in Fig. 7 that represents the problem in an abstract graph format.
  • Output 22 The output parameters are part of a slice template that is created by the orchestration entities after the computation procedures are performed:
  • these parameters are used inside the slice template and are passed from the NSSMF 14, 16, 18 entity to the Domain Controllers 32 that are responsible for the execution of the necessary installation/instantiation/ configuration of the network elements and VNFs.
  • a domain controller 32 can interact with an ETSI MANO system for this purpose.
  • the invention may make use of Advanced Computational Procedures. These are either performed only in the NSFM 12 (case 1) or jointly by NSMF 12 and NSSMF 14, 16, 18 (case 2).
  • Node capacity constraints the sum of the resource demands of all virtual nodes 44 (from all chains) that are embedded on a given physical node v, 44 needs to be less than or equal to b n .
  • Link capacity constraints the sum of the link capacity demands of all virtual links 40, 42 (from all chains) whose physical path contains physical link e, 40, 42 needs to be less than or equal to b q .
  • Each virtual node n, 44 must be embedded in one of the nodes 44 in each embedding options set (f(h) e V n ).
  • Building block 1 (Path Computation Element - PCE): Find a min-cost path between two nodes 44 in the graph that can accommodate a given flow given the costs and capacities of all the physical links 40, 42.
  • Building block 2 (Chain Embedding No QoS - CENQ): Find a min-cost single chain embedding (no e2e QoS constraint). This building block can find a min-cost single chain embedding without any end-to-end latency guarantees. It can be implemented by the following algorithm (although other implementations are also possible).
  • Step 1 Create the "reduced graph” as follows:
  • nodes 44 in the set V n set take the nodes 44 in the set V n set and add them to the reduced graph. Exclude the nodes 44 that have not enough capacity to accommodate the demand of the corresponding NF. For instance in Fig. 7, we assume that node 8 has not enough capacity to accommodate the demand of VNF D. Nodes 44 that belong to more than one set V n are duplicated in the reduced graph. For example nodes E.15 and F.15 in Fig. 8 correspond to physical node 15 which belongs to both V E and V F . In case that the cardinality of the set corresponding to the first NF in the chain is greater than one, add one extra "starting node". Similarly, add an extra "ending node 46" in case the cardinality of the set corresponding to the last NF is greater than one. In Fig. 8 the "ending node 46" X has been added.
  • each reduced link is set equal to the cost of the minimum cost path connecting the respective nodes in the physical network (from which physical links with capacity less than the demand of the associated virtual link have been removed) times the demand of the corresponding virtual link 40, 42.
  • the cost of link (B.2, C.7) in Fig. 8 is set equal to the cost of the minimum cost path between nodes 2 and 7 in the physical network times the demand t(B,C). This cost can be obtained by using building block 1: PCE (2, 7, t (B, c>, G( ,E ,c , ⁇ )).
  • the reduced links connecting the "starting" and "ending" nodes 48, 46 to the rest of the reduced graph are assigned a zero cost.
  • Step 2 Run Dijkstra's algorithm on the reduced graph to find the min-cost path from the "starting" to the "ending" node 48, 46. Substitute the single node 44 corresponding to the first (last) NF for the starting (ending) node 48, 46 if no "starting" ("ending") node exists. The returned path solves the chain embedding problem.
  • the nodes 44 in the path indicate where to embed the NFs and the reduced links 40, 42 in the path correspond to physical network paths 40, 42 interconnecting the physical nodes 44, 46, 48 to which NFs have been embedded.
  • CENQ G (n,E,o,b), S(N,L,t,V)
  • G a physical network graph
  • S the NF chain
  • the algorithm for finding a minimum cost single chain embedding with end-to-end QoS guarantees is a novel algorithm which lies at the core of our invention. It is an extension of the well-known LARAC algorithm which finds a single constrained min-cost path but does not cover the combined node embedding and end-to-end constrained path problem we are considering in this invention.
  • the Flow Chart of CEQ is shown in Fig. 9.
  • CG Column Generation
  • MCF min-cost multi- commodity flow problem
  • the above CG method finds a solution to the LP relaxation of the problem, i.e., for the case where each NF chain can be split over more than one embedding e so that a fraction of the demanded resources is accommodated by each embedding.
  • CG needs to be followed by rounding.
  • Many rounding algorithms are known in the literature. Rounding does not guarantee that the optimal integral embedding solution will be found, only a feasible integral solution is guaranteed.
  • One possible implementation of the CG method for solving this problem is the following:
  • D is a real matrix of size
  • P is a binary indicator matrix of size K c Q where a row identifies all embeddings that can be used by the corresponding chain.
  • the multiple chain embedding problem is then formulated as follows (we denote by 1 a column vector with all elements equal to 1, and by 0 a column vector with all elements equal to 0): min g'f
  • the main idea of the CG method is that instead of solving the full problem (1.1) over the set of all possible embeddings If, we solve it for a subset of if (which we will denote byff) and based on this solution we identify new embeddings that can be added to ffin order to improve the solution. Each new embedding adds a new column to the constraint matrices D and P, hence the name Column Generation.
  • CG There are several variants of CG depending on whether we also remove certain embeddings from ffas we go on, and the number of embeddings we add to / remove from at each iteration. In traditional CG we add and remove exactly one embedding/column at each iteration.
  • Fig. 10 The flow chart of one possible CG implementation for solving problem (1.1) is shown in Fig. 10. Note that in this implementation we only add new embeddings to the set and keep solving a restricted version of problem (1.1) on this set until a solution is found whose dual is a feasible solution to problem (1.2). This solution is known from duality theory to be an optimum solution to the unrestricted problem (1.1). Upon finding the optimum solution to the relaxed LP problem (1.1) any known method for rounding this solution to an integer solutions (such as randomized rounding) can be used to obtain such an integer solution to the corresponding ILP problem.
  • CG is not the only way of solving the LP problem (1.1) but it is a very efficient methods especially for centralized implementation.
  • a Lagrange relaxation approach is another possible method which might lead to better distributed implementations more suitable to the hierarchical implementation embodiment according to Fig. 6.
  • the present invention aims at protecting all possible ways to solve problem (1.1).
  • One of the invention's objects is the design of a system that is able to support advanced path computation procedures in the light of network slicing. Furthermore, we advance the current state of the art in the way e2e and local orchestration and management systems are jointly operating to undertake the advanced computation procedures execution. Regarding the path computation procedures the invention is targeting minimum cost embeddings of multiple NF chains on the same physical network while respecting capacity constraints and providing end-to-end QoS guarantees.
  • the approach considered and the way the NSMF (e2e) and NSSMF (local domain) entities are interacting to solve the complicated NF chain embedding problem can be easily extended to include physical node costs, capacities and delays.
  • the centralized approach is the easiest to describe and can serve as a basis for understanding the hierarchical approach.
  • the NSMF needs to collect all relevant information about the physical network (on which the VNF/PNF chains need to be embedded) and all the VNF/PNF chains that need to be embedded.
  • the NSMF 12 needs to collect the following information:
  • NSMF 12 also keeps track of which pNodes and pLinks belong to each NSSMF 14, 16, 18 domain.
  • the NSMF 12 breaks the e2e embedding to pieces according to network
  • Some information (such as network topology) is static or slowly changing but other information (such as remaining resources) is dynamic and needs to be collected periodically.
  • One can implement different ways of keeping the information up to date such as periodic update requests by the NSMF 12 or notifications by the NSSMFs 14, 16, 18 when there is a change in parameters or a combination of both.
  • G m the sub-network of physical network G controlled by the m-th NSSMF 14.
  • G m the sub-network of physical network G controlled by the m-th NSSMF 14.
  • f(S) the embedding solution for a single chain S
  • m the part of it which goes through the domain of NSSMF 14, m, f m (S).
  • Q m The set of all chains passing through the domain of NSSMF 14, m.
  • Q m The set of all chains passing through the domain of NSSMF 14, m.
  • FIG. 64 we depict the case in which the network topology remains relatively unchanged and thus is communicated to the NSMF 12 only once in step 62. Then a bunch request to embed K NF chains is received and the NSMF 12 asks from all the NSSMFs 14 and receives the current state of physical node and links remaining capacities, costs and incurred delays in step 64.
  • the NSMF 12 in step 68, performs the advanced computations described above. It then splits the solution into parts so that each end-to-end chain embedding is divided into the embedding associated to each sub-network and sends each part to the NSSMF 14 controlling sub-network m in step 70.
  • the NSSMF 14 confirms that the requested resources are available and reserves them in step 72.
  • the NSMF 12 Upon collecting positive responses from all NSSMFs 14, 16, 18, the NSMF 12confirms the resource request in step 74 and the embeddings are realized on the physical network. Finally, the NSSMFs 14, 16, 18confirm that they have completed the embedding process to the NSMF 12 in step 76, at which stage the process has completed successfully.
  • Hierarchical NSMF / NSSMFs implementation
  • Hierarchical means that the NSMF 12 runs the Top-Level part of the algorithm, the CEQ and the CENQ, while the PCE function is performed at the appropriate NSSMF 14, 16, 18. More specifically, we assume that each NSSMF 14, 16, 18 controls a single network domain and will be in charge for managing NSSIs. On the borders between domains there are Gateway nodes which belong to both domains and play the role of forwarding packets from one domain to the other. A NSSMF 14, 16, 18 can run the PCE function to determine the min cost route between two nodes lying in its domain (including the gateway nodes). We also assume that each set of embedding options V n for a given VNF lies entirely in a single domain.
  • the NSMF does not need to know all the topological information of the physical network G(V,E,c,p,d). It receives the NF chains S k and needs to learn to which domain (and NSSMF 14, 16, 18) each V n belongs. It can get this information either by the service requesting the chain, by asking the NSSMF14, 16, 18, or by keeping a DB of nodes in the network and their associated domain. Then we need to extend the network graph and NF chains S as shown in Fig. 10. For each domain border it includes one more virtual node (in this example R) in the chain which can be embedded to anyone of the gateway nodes between the two domains (in this example nodes 11, 12 and 13). The two new virtual links (in this example (D, R) and (R, E)) take the cost and resource demand of the link they have replaced (in this example (D, E)). The new virtual node (in this example R) has zero cost and resource demand.
  • the NSMF 12 does not need to have complete knowledge of this physical network graph, only enough information to construct the reduced graph resulting from this physical network graph. To achieve this it will call the PCE running in the corresponding NSSMF 14, 16, 18 in step 86 to get the reduced graph link connecting two reduced graph nodes. For example the PCE running in NSSMF 14, 16, 18 of domain 1 will return the reduced link information for (C.7, D.8) and (D.7, R12) in step 88. The NSSMF 14, 16, 18 will return the solution to the NSMF 12 consisting of the physical path, cost and delay. This gives enough information to the NSMF 12 to solve the reduced primal problem (1.1) find the solution to (1.2) and update the physical link costs for the next generation of the CG procedure.
  • Fig. 6 we provide a possible exchange of messages between the NSMF 12 and the NSSMF's 14 in order to provide multiple NF chain embeddings with hierarchical computations.
  • the NSMF 12 does not need to know the complete network topology. In the implementation shown in the Figure, it only learn all the physical nodes in the network and which nodes are controlled by each NSSMF 14, 16, 18 in step 80. (In an alternative implementation it only learns the gateway nodes and after each embedding request the network domain of all nodes included in the location embedding sets of the chain requests). After receiving the request to embed K chains, the NSMF 12 can build the extended NF chains (based on the knowledge about gateway nodes). It then proceeds to perform the advanced computations described above in step 84.
  • a domain controller 32 may be comprised in or may be an NSSMF 14, 16, 18.
  • a control entity may be an NSMF 12 or an NSSMF 14, 16, 18.
  • the management device may be comprised in an NSMF 12.
  • the word “comprising” does not exclude other elements or steps, and the indefinite article “a” or “an” does not exclude a plurality.
  • a single processor or other unit may fulfil the functions of several items recited in the claims.
  • the mere fact that certain measures are recited in mutually different dependent claims does not indicate that a combination of these measures cannot be used to advantage.
  • a computer program may be stored/distributed on a suitable medium, such as an optical storage medium or a solid-state medium supplied together with or as part of other hardware, but may also be distributed in other forms, such as via the Internet or other wired or wireless telecommunication systems.

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 dispositif de gestion apte à gérer des tranches d'un réseau de communication. Le dispositif est configuré pour : déterminer des informations de trajet relatives à un ou plusieurs dispositifs de réseau pour gérer une tranche ; déterminer, d'après les informations de trajet, des informations de configuration relatives à une fonction de réseau virtuel devant être placée sur le ou les dispositifs de réseau ; et fournir les informations de configuration au ou aux dispositifs de réseau et/ou à une entité de commande d'un ou des dispositifs de réseau. Un procédé de gestion de tranche comprend les étapes : de réception d'une entrée, par un dispositif de gestion, en provenance d'une entité de commande ; et de traitement de l'entrée, par le dispositif de gestion, pour déterminer une sortie, la sortie comprenant des informations de trajet relatives à un ou plusieurs dispositifs de réseau pour gérer une tranche, et des informations de configuration relatives à une fonction de réseau virtuel devant être placée sur le ou les dispositifs de réseau, d'après les informations de trajet, et fournir les informations de configuration au ou aux dispositifs de réseau et/ou à une entité de commande d'un ou des dispositifs de réseau. L'invention concerne également un programme informatique pouvant contenir un code de programme pour implémenter le procédé.
PCT/EP2018/061193 2018-05-02 2018-05-02 Dispositif de gestion apte à gérer des tranches dans un réseau, et procédé et programme informatique pour la gestion de tranches de réseau WO2019210946A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/EP2018/061193 WO2019210946A1 (fr) 2018-05-02 2018-05-02 Dispositif de gestion apte à gérer des tranches dans un réseau, et procédé et programme informatique pour la gestion de tranches de réseau

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/EP2018/061193 WO2019210946A1 (fr) 2018-05-02 2018-05-02 Dispositif de gestion apte à gérer des tranches dans un réseau, et procédé et programme informatique pour la gestion de tranches de réseau

Publications (1)

Publication Number Publication Date
WO2019210946A1 true WO2019210946A1 (fr) 2019-11-07

Family

ID=62116418

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2018/061193 WO2019210946A1 (fr) 2018-05-02 2018-05-02 Dispositif de gestion apte à gérer des tranches dans un réseau, et procédé et programme informatique pour la gestion de tranches de réseau

Country Status (1)

Country Link
WO (1) WO2019210946A1 (fr)

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2021180427A1 (fr) * 2020-03-12 2021-09-16 Telefonaktiebolaget Lm Ericsson (Publ) Gestion de service de réseau
US20210320878A1 (en) * 2020-04-14 2021-10-14 Verizon Patent And Licensing Inc. Systems and methods for transport based network slicing orchestration and management
WO2021247807A1 (fr) * 2020-06-03 2021-12-09 Dish Wireless L.L.C. Procédé et système d'attribution de tranches permettant un délestage de charge de façon à réduire à un minimum une consommation de puissance sur un site où un gnb est commandé en fonction d'attributions de tranches
CN113810211A (zh) * 2020-06-15 2021-12-17 中国移动通信集团浙江有限公司 网络切片模板的归纳方法及装置、监控方法及装置
US11265135B2 (en) 2020-06-03 2022-03-01 Dish Wireless Llc Method and system for slicing assigning for load shedding to minimize power consumption where gNB is controlled for slice assignments for enterprise users
US11405941B2 (en) 2020-07-31 2022-08-02 DISH Wireless L.L.C Method and system for traffic shaping at the DU/CU to artificially reduce the total traffic load on the radio receiver so that not all the TTLs are carrying data
CN115001975A (zh) * 2021-04-25 2022-09-02 国网安徽省电力有限公司 一种5g切片接入的配电网保护优化方法及系统
US11470549B2 (en) 2020-07-31 2022-10-11 Dish Wireless L.L.C. Method and system for implementing mini-slot scheduling for all UEs that only are enabled to lower power usage
US11638178B2 (en) 2020-06-03 2023-04-25 Dish Wireless L.L.C. Method and system for smart operating bandwidth adaptation during power outages
US11902109B2 (en) 2020-04-24 2024-02-13 Samsung Electronics Co., Ltd. Method of network slice resource allocation and visualization

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7020086B2 (en) 2000-07-03 2006-03-28 Telefonaktiebolaget Lm Ericsson (Publ) Lagrange quality of service routing
US20160212017A1 (en) * 2015-01-20 2016-07-21 Huawei Technologies Co., Ltd. Systems and Methods for SDT to Interwork with NFV and SDN
US20180041905A1 (en) * 2016-08-05 2018-02-08 Nxgen Partners Ip, Llc Ultra-broadband virtualized telecom and internet

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7020086B2 (en) 2000-07-03 2006-03-28 Telefonaktiebolaget Lm Ericsson (Publ) Lagrange quality of service routing
US20160212017A1 (en) * 2015-01-20 2016-07-21 Huawei Technologies Co., Ltd. Systems and Methods for SDT to Interwork with NFV and SDN
US20180041905A1 (en) * 2016-08-05 2018-02-08 Nxgen Partners Ip, Llc Ultra-broadband virtualized telecom and internet

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
"3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; Telecommunication management; Study on management and orchestration of network slicing for next generation network (Release 15)", 3GPP STANDARD; TECHNICAL REPORT; 3GPP TR 28.801, 3RD GENERATION PARTNERSHIP PROJECT (3GPP), MOBILE COMPETENCE CENTRE ; 650, ROUTE DES LUCIOLES ; F-06921 SOPHIA-ANTIPOLIS CEDEX ; FRANCE, vol. SA WG5, no. V15.1.0, 4 January 2018 (2018-01-04), pages 1 - 75, XP051392292 *
JUTTNER, B. SZVIATOVSKI; I. MECS; Z. RAJKO: "Lagrange Relaxation Based Method for the QoS Routing Problem", PROCEEDINGS IEEE INFOCOM 2001, vol. 2, 2001, pages 859 - 868, XP010538772, DOI: doi:10.1109/INFCOM.2001.916277
MARCOS RATES CRIPPA ET AL: "H2020-ICT-2016-2 5G-MoNArch Project No. 761445 5G Mobile Network Architecture for diverse services, use cases, and applications in 5G and beyond", 1 December 2017 (2017-12-01), pages 1 - 84, XP055512152, Retrieved from the Internet <URL:https://5g-monarch.eu/wp-content/uploads/2017/12/5G-MoNArch_761445_D2.1_Baseline_Architecture_and_Identified_Gaps_v1.0.pdf> [retrieved on 20181004] *
RAPPORTEUR: "Draft GR NFV-EVE012v012 Contribution", vol. WG NFV EVE Evolution and Ecosystem, 27 October 2017 (2017-10-27), pages 1 - 34, XP014308203, Retrieved from the Internet <URL:docbox.etsi.org/ISG/NFV/EVE/05-CONTRIBUTIONS/2017/NFVEVE(17)000290_Draft_GR_NFV-EVE012v012_Contribution.zip/NFVEVE(17)000290_NFV-EVE012v012-cm.docx> [retrieved on 20171027] *

Cited By (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2021180427A1 (fr) * 2020-03-12 2021-09-16 Telefonaktiebolaget Lm Ericsson (Publ) Gestion de service de réseau
US20210320878A1 (en) * 2020-04-14 2021-10-14 Verizon Patent And Licensing Inc. Systems and methods for transport based network slicing orchestration and management
US11831556B2 (en) * 2020-04-14 2023-11-28 Verizon Patent And Licensing Inc. Systems and methods for transport based network slicing orchestration and management
US11902109B2 (en) 2020-04-24 2024-02-13 Samsung Electronics Co., Ltd. Method of network slice resource allocation and visualization
US11638178B2 (en) 2020-06-03 2023-04-25 Dish Wireless L.L.C. Method and system for smart operating bandwidth adaptation during power outages
WO2021247807A1 (fr) * 2020-06-03 2021-12-09 Dish Wireless L.L.C. Procédé et système d'attribution de tranches permettant un délestage de charge de façon à réduire à un minimum une consommation de puissance sur un site où un gnb est commandé en fonction d'attributions de tranches
US11265135B2 (en) 2020-06-03 2022-03-01 Dish Wireless Llc Method and system for slicing assigning for load shedding to minimize power consumption where gNB is controlled for slice assignments for enterprise users
US11689341B2 (en) 2020-06-03 2023-06-27 Dish Wireless L.L.C. Method and system for slicing assigning for load shedding to minimize power consumption where gNB is controlled for slice assignments for enterprise users
CN113810211A (zh) * 2020-06-15 2021-12-17 中国移动通信集团浙江有限公司 网络切片模板的归纳方法及装置、监控方法及装置
US11470549B2 (en) 2020-07-31 2022-10-11 Dish Wireless L.L.C. Method and system for implementing mini-slot scheduling for all UEs that only are enabled to lower power usage
US11871437B2 (en) 2020-07-31 2024-01-09 Dish Wireless L.L.C. Method and system for traffic shaping at the DU/CU to artificially reduce the total traffic load on the radio receiver so that not all the TTLs are carrying data
US11405941B2 (en) 2020-07-31 2022-08-02 DISH Wireless L.L.C Method and system for traffic shaping at the DU/CU to artificially reduce the total traffic load on the radio receiver so that not all the TTLs are carrying data
CN115001975B (zh) * 2021-04-25 2023-11-03 国网安徽省电力有限公司 一种5g切片接入的配电网保护优化方法及系统
CN115001975A (zh) * 2021-04-25 2022-09-02 国网安徽省电力有限公司 一种5g切片接入的配电网保护优化方法及系统

Similar Documents

Publication Publication Date Title
WO2019210946A1 (fr) Dispositif de gestion apte à gérer des tranches dans un réseau, et procédé et programme informatique pour la gestion de tranches de réseau
Mendiola et al. A survey on the contributions of software-defined networking to traffic engineering
US11184273B2 (en) Machine learning-based path priority determination for routing data in software-defined networks
US9838268B1 (en) Distributed, adaptive controller for multi-domain networks
Awduche et al. Internet traffic engineering using multi-protocol label switching (MPLS)
US11528190B2 (en) Configuration data migration for distributed micro service-based network applications
Bagaa et al. On SDN-driven network optimization and QoS aware routing using multiple paths
WO2019134639A1 (fr) Procédé et appareil permettant de mettre en œuvre un trajet de domaine croisé sans coupure optimal, dispositif et support de stockage
Kodialam et al. Online multicast routing with bandwidth guarantees: a new approach using multicast network flow
Kalmykov et al. Segment routing as a basis for software defined network
US20080059637A1 (en) System using planning information to modify operation of a digital network
US20240022950A1 (en) Decentralized coordinated reinforcement learning for optimizing radio access networks
Tajiki et al. SDN‐based resource allocation in MPLS networks: A hybrid approach
Tomovic et al. Toward a scalable, robust, and QoS-aware virtual-link provisioning in SDN-based ISP networks
Scoglio et al. TEAM: A traffic engineering automated manager for DiffServ-based MPLS networks
Šeremet et al. Advancing ip/impls with software defined network in wide area network
Fajjari et al. A novel SDN scheme for QoS path allocation in wide area networks
Lucrezia et al. A proposal for End-to-end QoS provisioning in software-defined networks
Feamster et al. Network-wide BGP route prediction for traffic engineering
Abe et al. Multipath routing and brokering in inter-domain or inter-as with SDN: A model
Ali et al. Management of software-defined networking powered by artificial intelligence
Hakiri et al. Work-in-progress: Towards real-time smart city communications using software defined wireless mesh networking
US11968120B2 (en) Adaptive hierarchical service path selection in dynamic edge computing environments
Blose et al. Scalable Hybrid Switching-Driven Software Defined Networking Issue: From the Perspective of Reinforcement Learning
Kawila et al. An sdn-coordinated steering framework for multipath big data transfer application

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: 18722463

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 18722463

Country of ref document: EP

Kind code of ref document: A1