[go: up one dir, main page]

WO2018130307A1 - Mécanisme d'architecture et de coordination pour distribuer et paralléliser n'importe quel solveur mcf - Google Patents

Mécanisme d'architecture et de coordination pour distribuer et paralléliser n'importe quel solveur mcf Download PDF

Info

Publication number
WO2018130307A1
WO2018130307A1 PCT/EP2017/050727 EP2017050727W WO2018130307A1 WO 2018130307 A1 WO2018130307 A1 WO 2018130307A1 EP 2017050727 W EP2017050727 W EP 2017050727W WO 2018130307 A1 WO2018130307 A1 WO 2018130307A1
Authority
WO
WIPO (PCT)
Prior art keywords
solution
sdn controller
sdn
cluster
messages
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/EP2017/050727
Other languages
English (en)
Inventor
Georgios Paschos
Ioannis STEIAKOGIANNAKIS
Mathieu Leconte
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
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/EP2017/050727 priority Critical patent/WO2018130307A1/fr
Publication of WO2018130307A1 publication Critical patent/WO2018130307A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H04L45/04—Interdomain routing, e.g. hierarchical 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/64—Routing or path finding of packets in data switching networks using an overlay routing layer

Definitions

  • the present invention relates to a system, apparatus and method for computing a solution to an optimization problem within a multi-controller software-defined networking (SDN) architecture.
  • SDN software-defined networking
  • the first manifestations of SDN technology put together the network control logic into one monolithic physical entity, the SDN controller, which decides the routing to globally optimize the network. Indeed, a single SDN controller can centrally optimize traffic engineering by having a global view of the network.
  • the SDN controller solves a centralized optimization problem in frequent intervals in order to decide the optimal routing of packet flows.
  • the cornerstone optimization problem for a SDN product is the minimum cost flow (MCF) problem (also denoted by minimum cost multi-commodity flow (MCF) problem), which consists in seeking for the packet flow for multiple commodities that minimizes the total cost.
  • MCF is a linear program (LP) solved by standard centralized optimization methods such as the column generation method and the interior-point method, which are however less efficient empirically when applied within a network of nodes of large size, usually a network of more than one thousand nodes.
  • LP linear program
  • the recent SDN architecture is based on multiple SDN controllers retaining either a centralized control logic like in the distributed control platforms ONIX for large-scale production networks and the Open Network Operating Systems (ONOS) or a distributed control logic like in the hierarchical control planes KANDOO and ORION, wherein each SDN controller has a view of the domain for which it is responsible and can make decisions.
  • dSDN distributed SDN
  • DDBS distributed database system
  • the vertical approach requires a DDBS allowing the SDN controllers to have a synchronized global view of the network. For example, when a new flow is admitted and its routing is decided by the controller 1, the DDBS is updated and the controller 2 is then informed of this decision by directly reading the DDBS. If the dSDN system has an available DDBS, then the MCF problem can be solved with the aforementioned standard centralized optimization methods provided that the global network is small enough to be handled by a single entity.
  • Fig. 2 shows a distributed SDN architecture 100 with multiple controllers (controller 1 to controller 3) arranged in a flat topology. Each SDN controller monitors a different domain or part (Dl to D3) of the network and its knowledge about topology and network state is limited to that respective domain.
  • the SDN controllers of two neighboring network nodes can communicate with each other through an east-west controller-to-controller interface using an appropriate message exchange protocol.
  • the optimal routing is globally studied.
  • the SDN controllers act as agents in a distributed system, which exchange messages and perform local computations with the aim of reaching an agreement on the flow routing that minimizes the total cost.
  • This problem of cost minimization can be solved by the classical fully distributed routing algorithms, which however suffer from slow convergence as they tend to explore many network paths before reaching the optimal solution.
  • the distributed SDN architecture is advantageous with respect to the centralized SDN architecture for several reasons. Indeed, it is more easily scalable and can thereby work on larger networks. Moreover, it facilitates an incremental deployment and can thereby add other SDN controllers when the network is expanded. In addition, it offers privacy and can thereby work in a multi-operator environment in which confidential or sensitive network information is not leaked from one domain to another or from one vendor to another.
  • the invention relates to a system for computing a solution to a problem within a communication network, wherein the communication network is split into a plurality of clusters.
  • the system comprises a plurality of software-defined networking (SDN) controllers configured to compute the solution by solving the problem at each respective cluster to which a respective SDN controller is assigned, and a messaging module configured to exchange a sequence of messages between each SDN controller amongst the plurality of SDN controllers, wherein the solution is based on the sequence of messages exchanged between each SDN controller.
  • SDN software-defined networking
  • each SDN controller has a local view of the network, namely an intra-cluster view of the network.
  • each SDN controller solves an equivalent local problem and brings a solution to it by finding, for example, some paths in the case of a MCF problem.
  • the solution to the original problem can be reached by finding, for example, the entirety of the paths in the case of a MCF problem.
  • each SDN controller comprises a respective computing device, the respective computing device communicating with each other computing device through the messaging module.
  • the exchanged messages between each SDN controller can be processed through the computing device inside each SDN controller.
  • Each computing device can be, for example, a computer system, a server system, a virtual machine or a central processing unit core in the case of a multi-core architecture.
  • each computing device comprises a respective problem solver configured to provide the computed solution, a respective coordination module configured to compute the sequence of messages using some information from the respective problem solver and the remaining problem solvers, and a respective driver module configured to interface the respective coordination module and the respective problem solver.
  • each problem solver can solve its local problem while communicating with the remaining problem solvers by means of the exchanged messages.
  • the respective driver module provides the respective problem solver with a modified problem, which is defined by the respective driver module.
  • the driver module that interfaces the problem solver and the coordination module can be a set of rules that feeds the problem solver with a modified problem with respect to the original problem.
  • a particular calculation of, for example, Lagrange multipliers will take place at each cluster that includes boundary values from neighboring clusters and a local sparse algorithm will be then used to obtain the optimal convergence.
  • the algorithm will not solve the original problem but rather a modified problem based on the made calculation.
  • the problem is either a minimum cost flow (MCF) problem or a network utility maximization (NUM) problem.
  • the problem can consist in minimizing the sum of the costs of flow over the links in the case of the MCF problem or maximizing the total utility as defined by " ⁇ U f ( f )", where U f is a concave function and f is the demand of the commodity f, in the case of the NUM problem.
  • U f is a concave function
  • f is the demand of the commodity f
  • the problem is solved using either a column generation algorithm or a simplex algorithm or a backpressure algorithm or an interior point algorithm.
  • the problem is solved using a local convex optimization algorithm.
  • the MCF problem depends on a local determination of Lagrange multipliers.
  • the Lagrange multiplier can represent the price per unit of flow for deviating from the flow conservation at a border link.
  • the Lagrangian multipliers can be updated and converge towards the optimal Lagrange multipliers.
  • the invention relates to a software-defined networking (SDN) controller for computing a solution to a problem within a communication network, the SDN controller being split into a plurality of parts.
  • the SDN controller comprises a plurality of computing devices configured to compute the solution by solving the problem at a respective part of the SDN controller, each part being assigned to a respective computing device, and a messaging module configured to exchange a sequence of messages between each computing device amongst the plurality of computing devices, wherein the solution is based on the sequence of messages exchanged between each computing device.
  • each computing device has a local view of the SDN controller, namely an intra-part view of the SDN controller.
  • each computing device solves an equivalent local problem and brings a solution to it by finding, for example, some paths in the case of a MCF problem. Owing to the exchanged messages between each computing device associated to a respective part, the solution to the original problem can be reached by finding, for example, the entirety of the paths in the case of a MCF problem.
  • each computing device comprises a respective problem solver configured to compute the solution by locally solving the problem, a respective coordination module configured to compute the sequence of messages using some information from the respective problem solver and the remaining problem solvers, and a respective driver module configured to interface the coordination module and the problem solver.
  • the invention relates to a system for computing a solution to a problem within a communication network, the communication network being split into a plurality of clusters.
  • the system comprises the system according to the first aspect, in which each SDN controller is as specified according to the second aspect.
  • the invention relates to a method for computing a solution to a problem within a communication network, the communication network being split into a plurality of clusters.
  • the method comprises the steps of computing the solution by solving the problem at each respective cluster, and exchanging a sequence of messages between each respective cluster amongst the plurality of clusters, wherein the solution is based on the sequence of messages exchanged between each cluster.
  • the invention relates to a computer program comprising a program code for performing the method according to the fourth aspect when executed on a computer.
  • the method can be performed in an automatic and repeatable manner.
  • the computer program can be performed by the above apparatus.
  • the apparatus can be
  • the above apparatus 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 vertical (a) and horizontal (b) approach with access to a distributed database system (DDBS) wherein each part of the network is controlled by a single SDN controller;
  • DDBS distributed database system
  • Fig. 2 shows a distributed SDN architecture 100 with multiple controllers arranged in a flat topology
  • Fig. 3 shows a distributed SDN controller architecture 200 within a clustered communication network according to an embodiment of the present invention
  • Fig. 4 shows an algorithmic flow chart describing the steps of obtaining the optimal Lagrange multipliers
  • Fig. 5 shows a centralized SDN controller architecture 300 according to an embodiment of the present invention.
  • Fig. 3 shows a distributed SDN controller architecture 200 within a clustered communication network according to an embodiment of the present invention.
  • the depicted distributed SDN controller architecture 200 comprises a plurality of SDN controllers (denoted by SDN controller 1 and SDN controller 2) whose number is limited in the present embodiment to two for clarity reasons only, and a messaging module configured to exchange a sequence of messages between each SDN controller amongst the plurality of SDN controllers.
  • the communication network is split into a plurality of clusters, for example, through a clustering algorithm, and each cluster is assigned to a respective SDN controller, which has thereby a local view of the global communication network.
  • Each SDN controller comprises a respective computing device (CE), such as a computer system, a server system, a virtual machine (VM) and a central processing unit (CPU) core in the case of a multi-core architecture, and a respective south-bound interface. Through its respective south-bound interface, each SDN controller controls a plurality of routing devices, such as routers and switches, located in its respective cluster.
  • Each computing device (CE) comprises a respective coordination module, a respective driver module and a respective problem solver configured to solve a problem, such as a minimum cost flow (MCF) problem (also named minimum cost multicommodity flow problem) and a network utility maximization (NUM) problem.
  • MCF minimum cost flow
  • NUM network utility maximization
  • Each driver module is configured to interface the respective coordination module and the respective problem solver through a set of rules.
  • the plurality of SDN controllers is configured together to compute a solution to an original problem, while none of the SDN controllers has a global view of the communication network. Indeed, each SDN controller is configured to solve an equivalent local problem by reducing the original problem at each respective cluster.
  • the solution is based on the sequence of messages exchanged between each SDN controller through the messaging module using a respective interface (a), which interfaces the messaging module and the respective coordination module.
  • Each problem solver is configured to provide the computed solution
  • each coordination module is configured to compute the sequence of messages to be exchanged between each SDN controller using some information from its respective problem solver and the remaining problem solvers.
  • the messages exchanged between, for example, two SDN controllers A (SDNA) and B (SDNB) can contain a set of identifiers for network elements (nodes or links) at the interface between SDNA and SDNB, a set of identifiers for commodities, a set of queue (i.e., Lagrangian multiplier) updates for the networks elements and the cited extended commodities, and an information about the time periods covered by the updates.
  • SDNA SDN controllers A
  • SDNB SDN controllers A
  • identifiers for network elements nodes or links
  • a set of queue i.e., Lagrangian multiplier
  • the set of identifiers for commodities can also be enlarged with some information about, for example, different stages of service (in the case of node inclusion, service chaining, multi-domain constraints, and so on), different shared risk link groups (S LGs) encountered and different values or range of cumulative constraints (delay, hop counts, and so on).
  • stages of service in the case of node inclusion, service chaining, multi-domain constraints, and so on
  • S LGs shared risk link groups
  • the driver module of, for example, the SDN controller A can feed the MCF problem solver with an MCF problem modified by:
  • An alternate implementation requires MCF solvers able to deal with multiple sources and multiple destinations for each commodity and commodity-dependent costs. Such an alternate
  • implementation would not require adding virtual sources/destinations and associated virtual links, but would rather consider the set of incoming interface edges plus any source for the commodity inside the cluster as the source for an extended commodity, and the set of outgoing interface edges plus destination of the commodity if inside the cluster as the destination for an extended
  • the coordination module of, for example, SDNA can take the flow solution of the MCF problem solver at the interfaces of SDNA from the driver module, possibly apply a non-decreasing function to it, then form messages of the type described above and send them to the relevant neighboring SDN controllers, receive messages from the neighboring SDN controllers, combine them into a unique queue value per extended commodity and per interface by applying the non-decreasing function, and pass them to the driver module.
  • the communication network is assumed to be already split into K clusters, each cluster being assigned to a respective SDN controller, and the links that traverse two different clusters are called "border links".
  • the present invention is complemented with the aforementioned clustering algorithm whose goal is to split the communication network into K clusters.
  • the proposed clustering algorithm seeks to make several parts of the communication network as equal in size as possible, which allows the computation time inside each cluster to be equalized, and to make the border links as small as possible.
  • B balance metric
  • p is a path
  • f is the commodity allocated to the path p
  • c p is the total cost of the path p corresponding to the sum of costs of all links in the path p
  • X p f is the optimization variable that assigns some flows over the path p for the commodity f
  • s f is the generated flow, which is equal to the demand of commodity f when s is a source node for this commodity f and equal to zero otherwise (knowing that a commodity may have multiple sources in our formulation)
  • ⁇ ⁇ is the capacity of the link e
  • S f is the set of sources of commodity f (which can be restricted to a single node or not).
  • the goal is to find the correct paths and optimization variables X p f such that the total cost of the flow is minimized.
  • the standard way of solving such a problem is to use linear
  • the present invention in the case of our distributed SDN controller architecture 200 considers a modified MCF problem based on the original MCF problem using paths that are entirely contained inside single clusters.
  • This modified problem requires introducing conservation constraints to make sure the value of the flows on the border links are preserved between the different clusters involved.
  • the flow conservation constraints are relaxed and a Lagrangian function L(X, ⁇ ), which can be entirely decomposed between each cluster and wherein the Lagrangian multipliers ⁇ represent the price per unit of flow for deviating from the flow conservation at the border link, is then obtained.
  • L(X, ⁇ ) which can be entirely decomposed between each cluster and wherein the Lagrangian multipliers ⁇ represent the price per unit of flow for deviating from the flow conservation at the border link.
  • each cluster may decide to deviate from flow agreements at the borders as long as the cost saved in this way is larger than the penalty imposed by the prices.
  • the benefit of this relaxation is that the prices can be initialized and that the SDN controllers can afterwards try to allocate flows exploring
  • 9 f is the Lagrangian multiplier ⁇ for the commodity f
  • a p 9 f is the difference between the Lagrangian multipliers at the last edge of the path segment p and at its first edge (any of the two may be zero if the corresponding edge is not a border edge)
  • E(K) is the set of edges of cluster K
  • X./ is the sum of the flow values X p f for the path segments p leaving from the virtual source s' via its outgoing virtual edge towards a source s of commodity f which belongs to cluster K (intuitively, it is the amount of flow for commodity f actually entering the network at source s, as opposed to flow entering the cluster from another cluster)
  • s f is the amount of flow for commodity f that we have to carry from source node s
  • S f is the set of source nodes of commodity f
  • V(K) is the set of vertices of cluster K
  • P f (K) is the set
  • the local SDN controller can solve this problem using standard sparse algorithms, such as the column generation, locally. Owing to the sparsity property, the computation efficiency can be optimized while saving memory size. If the parameters are set equal to the optimal Lagrangian multipliers, denoted by ⁇ *, then the optimal solution of the dual of the global MCF problem can be obtained, which corresponds to the optimal solution of the global (i.e., original) MCF problem due to the strong duality. Hence, given the optimal Lagrangian multipliers, each SDN controller can solve the local MCF problem to find a cluster routing that guarantees the overall global optimality of the MCF problem.
  • the optimal Lagrangian multipliers ⁇ * can be found by a sequence of messages exchanged between the SDN controllers acting as agents in order to reach agreements of flow routing on the cluster border links and by the way to minimize the global routing cost.
  • the present invention suggests a distributed subgradient (DSA) algorithm to achieve the optimal global routing solution, and alternatively, an extension of the DSA algorithm through a proximal parallel alternate direction of multipliers (ADMM) algorithm (hereafter denoted by PPA algorithm), which further improves the convergence in the networks with numerous border links due to sophisticated convex optimization techniques.
  • DSA distributed subgradient
  • ADMM proximal parallel alternate direction of multipliers
  • the Lagrangian multipliers ⁇ shall be updated in an iterative manner in order to converge towards the optimal Lagrangian multipliers ⁇ *.
  • the subgradient updates 0e as follows:
  • the present invention requires the neighboring values of flow to be obtained using messaging.
  • the message exchanged at the iteration t from an i-th SDN controller (SDNi) towards a j-th SDN controller (SDNj) is a vector of real values with size
  • the present invention can make use of augmented Lagrangian functions instead of normal Lagrangian functions in order to make the global convergence of the Lagrangian multipliers ⁇ faster even though at the cost of harder intra-cluster problems.
  • the obtained intra- cluster problem at iteration t can be formulated as follows:
  • ⁇ is the set of interface edges e leaving from cluster K towards another cluster
  • a e Y f is the difference in total flow for the commodity f between the two clusters the interface edge e connects (refer to equation (5) for a detailed expression)
  • a t Y e f (K) is the difference between the total amount of flow for the commodity f on the interface edge e at the current iteration and at the previous iteration (all the variables are implicitly indexed by t, but only this term involves the value of variables at a different iteration than t)
  • ⁇ is a fixed step-size coefficient.
  • the local MCF problem is no longer a linear program (LP) but has become a more general convex problem, in particular a quadratic program, which can be solved by any methods for centralized convex flow problems or by specific methods for quadratic flow problems, while ensuring a faster global convergence.
  • the Lagrangian multiplier updates at the iteration t are similar to the previous case as found in equation (5) (implemented with the prescribed step-size ⁇ ) and are given for each cluster by the relationship: The convergence towards the optimal Lagrangian multipliers ⁇ * can then be obtained after a certain number of iterations.
  • the algorithm that will be basically used in the present invention is depicted in the flow chart of Fig. 4 in the case of the i-th SDN controller (SDNi).
  • SDNi SDN controller
  • the updated costs c(t) are received and the fractional MCF problem for the network of the local cluster with the updated costs c(t) at the interfaces can be solved by standard methods using, for example, the column generation algorithm, the simplex algorithm or the backpressure algorithm.
  • the local solution to the fractional MCF problem is received and the Lagrange multipliers (9(i)) are computed at the interfaces of SDNi and transmitted in the form of messages (9(i)) towards the other SDN controllers. If the computed Lagrangian multipliers (9(i)) are sufficiently accurate the solution is then output, otherwise an iteration is requested to recalculate and optimize the Lagrangian multipliers (9(i)).
  • the MCF problem depends on a local determination of Lagrange multipliers ( ⁇ ), which can converge towards optimal Lagrange multipliers ( ⁇ *) by iteratively repeating the exchange of the sequence of messages between each SDN controller.
  • the present invention can extend the MCF problem to the NUM problem.
  • the NUM problem is formulated as to maximize the total utility as defined by " ⁇ U f ( f )", where U f is a concave function and f is the demand of the commodity f.
  • the present invention directly applies to the network utility maximization (NUM) with the difference that the intra-cluster problem is no longer a local MCF problem, but rather a local convex optimization problem, which can be solved with standard convex optimization techniques.
  • the present invention can introduce constraints, such as an additive delay, S LG constraints, backup paths and so on. Two scenarios can then occur according to whether the problem remains a linear program (LP) or becomes an integer linear program (ILP).
  • LP linear program
  • ILP integer linear program
  • the same messaging with respect to the case where no constraint is introduced can be used and only the local problem is to be adapted.
  • the constrained problem can be solved by the standard methods.
  • our invention can then yield the globally optimal solution.
  • IRP in the latter scenario
  • our invention can either use the value of its solution as a lower bound to the constrained MCF problem or project infeasible solutions to the feasible set in order to get a good approximation.
  • the second option has the disadvantage with respect to the first one to involve a projection operation depending on the problem and to be not always straightforward.
  • Fig. 5 shows a centralized SDN controller architecture 300 according to an embodiment of the present invention.
  • the approach described for the distributed SDN controller architecture 200 of Fig. 3 applies to the depicted centralized SDN controller architecture 300, which structurally differs from the distributed SDN controller architecture 200 in that the SDN controller is now split into a plurality of parts and each part is assigned to a respective computing device (denoted by CE1, CE2, CEn), and which functionally differs from the distributed SDN controller architecture in that the above-mentioned local sparse algorithms are no longer distributed but rather parallelized.
  • the plurality of computing devices (CE1, CE2, CEn) is configured to compute the solution through a respective problem solver as above-mentioned by locally solving the problem at a respective part of the SDN controller.
  • the distributed SDN controller architecture 200 of Fig. 3 and the centralized SDN controller architecture 300 of Fig. 5 can be merged into a hybrid configuration.
  • the present invention relates to systems, an apparatus and a method for computing a solution to an optimization problem within a communication network through the use of algorithms.
  • the network uses a SDN architecture either with multiple controllers and a messaging protocol distributed amongst the multiple controllers or with a centralized controller and a messaging protocol distributed amongst multiple computing devices, each SDN controller comprising a respective computing device.
  • the network is split into a plurality of clusters assigned each to a respective SDN controller and the problem is locally solved at each respective cluster.
  • the SDN controller is split into a plurality of parts assigned each to a respective computing device and the problem is locally solved at each respective part.
  • the network optimization can be achieved by computing cluster-boundary or part-boundary values and using a local sparse algorithm based on those computed values in order to solve a modified problem rather than the original problem.
  • the present invention allows to a solver to be re-used in the case of a centralized MCF problem so that there is no need to design a new special solver for solving the intra- cluster modified MCF problems.
  • this applies only to the embodiments in which the nature of the intra-cluster problem is not modified, for example, from a linear problem into a quadratic problem.
  • 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 fulfill 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

La présente invention concerne des systèmes, un appareil et un procédé pour calculer une solution à un problème d'optimisation dans un réseau de communication par l'utilisation d'algorithmes. Le réseau utilise une architecture de SDN ayant soit multiples contrôleurs et un protocole de messagerie distribué parmi les multiples contrôleurs, soit un contrôleur centralisé et un protocole de messagerie distribué parmi multiples dispositifs informatiques, chaque contrôleur de SDN comprenant un dispositif informatique respectif. Dans la première option, le réseau est divisé en une pluralité de grappes attribuées chacune à un contrôleur de SDN respectif et le problème est résolu localement au niveau de chaque grappe respective. Dans cette dernière option, le contrôleur de SDN est divisé en une pluralité de parties attribuées chacune à un dispositif informatique respectif et le problème est résolu localement au niveau de chaque partie respective.
PCT/EP2017/050727 2017-01-13 2017-01-13 Mécanisme d'architecture et de coordination pour distribuer et paralléliser n'importe quel solveur mcf Ceased WO2018130307A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/EP2017/050727 WO2018130307A1 (fr) 2017-01-13 2017-01-13 Mécanisme d'architecture et de coordination pour distribuer et paralléliser n'importe quel solveur mcf

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/EP2017/050727 WO2018130307A1 (fr) 2017-01-13 2017-01-13 Mécanisme d'architecture et de coordination pour distribuer et paralléliser n'importe quel solveur mcf

Publications (1)

Publication Number Publication Date
WO2018130307A1 true WO2018130307A1 (fr) 2018-07-19

Family

ID=57860844

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2017/050727 Ceased WO2018130307A1 (fr) 2017-01-13 2017-01-13 Mécanisme d'architecture et de coordination pour distribuer et paralléliser n'importe quel solveur mcf

Country Status (1)

Country Link
WO (1) WO2018130307A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111641564A (zh) * 2020-05-11 2020-09-08 紫光云技术有限公司 Sdn控制器的集群系统及下发配置方法
CN111915890A (zh) * 2020-07-24 2020-11-10 清华大学 一种干道交通信号的网联优化控制方法

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130329601A1 (en) * 2012-06-11 2013-12-12 Futurewei Technologies, Inc. Defining Data Flow Paths in Software-Defined Networks with Application-Layer Traffic Optimization
US20150244607A1 (en) * 2014-02-26 2015-08-27 Futurewei Technologies, Inc. Software Defined Networking (SDN) Specific Topology Information Discovery

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130329601A1 (en) * 2012-06-11 2013-12-12 Futurewei Technologies, Inc. Defining Data Flow Paths in Software-Defined Networks with Application-Layer Traffic Optimization
US20150244607A1 (en) * 2014-02-26 2015-08-27 Futurewei Technologies, Inc. Software Defined Networking (SDN) Specific Topology Information Discovery

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
H YIN ET AL: "Internet Research Task Force SDNi: A Message Exchange Protocol for Software Defined Networks (SDNS) across Multiple Domains draft-yin-sdn-sdni-00.txt", 27 June 2012 (2012-06-27), pages 1 - 14, XP055182729, Retrieved from the Internet <URL:http://tools.ietf.org/pdf/draft-yin-sdn-sdni-00.pdf> [retrieved on 20150414] *
P. R P. RAGHAVAN; C. D. TOMPSON: "Randomized rounding: A technique for provably good algorithms and algorithmic proofs", COMBINATORICA, vol. 7, no. 4, 1987, pages 365 - 374

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111641564A (zh) * 2020-05-11 2020-09-08 紫光云技术有限公司 Sdn控制器的集群系统及下发配置方法
CN111641564B (zh) * 2020-05-11 2023-08-29 紫光云技术有限公司 Sdn控制器的集群系统及下发配置方法
CN111915890A (zh) * 2020-07-24 2020-11-10 清华大学 一种干道交通信号的网联优化控制方法

Similar Documents

Publication Publication Date Title
Avin et al. Demand-aware network design with minimal congestion and route lengths
Chantre et al. The location problem for the provisioning of protected slices in NFV-based MEC infrastructure
Zhu et al. DRL-based deadline-driven advance reservation allocation in EONs for cloud–edge computing
US20140149493A1 (en) Method for joint service placement and service routing in a distributed cloud
Ibrahim et al. Heuristic resource allocation algorithm for controller placement in multi-control 5G based on SDN/NFV architecture
KR20060022680A (ko) 전체적 라우팅과 대역폭 공유를 위한 방법 및 시스템
Jalili et al. A new framework for reliable control placement in software-defined networks based on multi-criteria clustering approach
US10356185B2 (en) Optimal dynamic cloud network control
Doan et al. SAP: Subchain-aware NFV service placement in mobile edge cloud
Lin et al. Column generation based service function chaining embedding in multi-domain networks
Liu et al. Cost-efficient virtual network function placement and traffic steering
CN105049353A (zh) 一种为业务配置路由路径的方法及控制器
EP3235224B1 (fr) Affectation de ressources
US11809895B2 (en) Control device, control method, and program
Wang et al. Service-aware design policy of end-to-end network slicing for 5G use cases
Li et al. Availability-aware provision of service function chains in mobile edge computing
Huang et al. Parallel placement of virtualized network functions via federated deep reinforcement learning
Ji et al. Towards optimal application offloading in heterogeneous edge-cloud computing
Montana et al. Adaptive reconfiguration of data networks using genetic algorithms
WO2018130307A1 (fr) Mécanisme d&#39;architecture et de coordination pour distribuer et paralléliser n&#39;importe quel solveur mcf
Liu et al. Online virtual network embedding for both the delay sensitive and tolerant services in SDN-enabled satellite-terrestrial networks
CN119420659B (zh) 一种多模态网络环境下网络模态共存的优化部署方法
Haghani et al. Multi-objective embedding of software-defined virtual networks
Sadeghianpour et al. Joint channel assignment and routing in multiradio multichannel wireless mesh networks with directional antennas
Lu et al. Cost-efficient resource provisioning in delay-sensitive cooperative fog computing

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

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

Country of ref document: EP

Kind code of ref document: A1