EP4139799A1 - Procédé et dispositif de distribution de composants logiciels d'une ou de plusieurs applications à des composants d'infrastructure d'une infrastructure industrielle adaptée à leur exécution - Google Patents

Procédé et dispositif de distribution de composants logiciels d'une ou de plusieurs applications à des composants d'infrastructure d'une infrastructure industrielle adaptée à leur exécution

Info

Publication number
EP4139799A1
EP4139799A1 EP21728446.2A EP21728446A EP4139799A1 EP 4139799 A1 EP4139799 A1 EP 4139799A1 EP 21728446 A EP21728446 A EP 21728446A EP 4139799 A1 EP4139799 A1 EP 4139799A1
Authority
EP
European Patent Office
Prior art keywords
infrastructure
components
nodes
software components
specific properties
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.)
Pending
Application number
EP21728446.2A
Other languages
German (de)
English (en)
Inventor
Jürgen Gesswein
Lena HUPP
Harald Müller
Christian Royer
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.)
Siemens AG
Original Assignee
Siemens AG
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 Siemens AG filed Critical Siemens AG
Publication of EP4139799A1 publication Critical patent/EP4139799A1/fr
Pending legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5061—Partitioning or combining of resources
    • G06F9/5066—Algorithms for mapping a plurality of inter-dependent sub-tasks onto a plurality of physical CPUs
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/12—Avoiding congestion; Recovering from congestion
    • H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/78—Architectures of resource allocation
    • H04L47/781—Centralised allocation of resources
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/80—Actions related to the user profile or the type of traffic
    • H04L47/803—Application aware
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/80—Actions related to the user profile or the type of traffic
    • H04L47/805—QOS or priority aware
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/34—Network arrangements or protocols for supporting network services or applications involving the movement of software or configuration parameters 

Definitions

  • the invention relates to a method and device for distributing software components of one or more applications to infrastructure components of an industrial infrastructure that are suitable for their execution, as well as an associated computer program (product).
  • An industrial infrastructure can be a modern automation system. It is characterized by centralized and hierarchical control architectures, such as B. the automation pyramid according to the ISA-95 and IEC 62264 standards. According to these standards, the actual conventional architecture of the automation pyramid represents a clear separation of systems and functionalities in five architectural levels that have their own specific automation purpose and only exchange information with the adjacent architectural levels.
  • the lowest architecture level represents the manufacturing and production process, which is controlled by means of input and output signals I / O of a field environment by so-called PLC machines (PLC in English: PLC: Programmable Logic Controller) in a control environment.
  • PLC machines PLC in English: PLC: Programmable Logic Controller
  • This architecture level is usually developed as a process control and / or communication network environment and is often abbreviated to the term SCADA (Supervisory Control and Data Acquisition).
  • An operations management environment or level forms the next higher architecture level and is often abbreviated to the term MES (Manufacturing Execution System).
  • MES Manufacturing Execution System
  • a corporate environment or level forms the highest level of architecture and is often abbreviated to ERP (Enterprise Resource Planning).
  • ERP Enterprise Resource Planning
  • a hierarchical structure is very robust and emphasizes good predictability and global system optimization.
  • this structure is effective for small systems that are implemented in very stable and structured environments in which the pyramid according to ISA-95 can be used for easy development and maintenance.
  • This reliability between the architectural levels leads to insufficient adaptability and Flexibility with production changes.
  • a single point of failure can drastically reduce system performance.
  • Information also becomes inconsistent and out of date once a communication delay occurs that affects partial and global decision-making.
  • Various types of hardware and software are used here. This means that communication between these components is also inhomogeneous.
  • Maintainability, expandability and updateability also suffer from these inhomogeneities.
  • This environment there is a desire to create a seamless transition between the architecture levels described above. It makes sense to use a modular system as an industrial infrastructure. Such a modular system usually only works if all infrastructure components and interfaces of the applications work properly and if certain boundary conditions are met.
  • the infrastructure components can include the computing nodes and network nodes.
  • the infrastructure components can be physical and / or virtual components.
  • Computing nodes are parts of computing units; they can either be pure hardware nodes or virtual machines.
  • Computing nodes of other domains, such as the cloud, the data center or the edge, are modeled in the same way, ie the properties of the domains are expressed by the properties of the model components.
  • the interfaces each have certain characteristics (eg computational complexity, memory requirements, data rate, call frequency).
  • additional restrictions that must be met so that the application can be viewed as fully functional (e.g. end-to-end latency, response times, availability of the application or parts of the application, data protection restrictions for infrastructure components or interfaces) .
  • These features and restrictions describe interface-specific properties.
  • the infrastructure components of an application usually run on different computing nodes, eg Cj, possibly in different domains or different production cells.
  • the computing nodes can be connected to one another via a single or multiple network paths.
  • the different computing nodes can be heterogeneous, ie they have different ability-specific properties, eg computing capacity, main storage capacity, storage capacity, CPU architecture.
  • the connections and the network nodes Ni can also have different properties. Transmission-specific properties of the connections are, for example, bandwidth and latency, and resource-specific properties of the network nodes are, for example, response time, failure safety and availability.
  • a state-of-the-art technology for implementing applications that can be divided into modular software components is container technology (such as Docker).
  • Software components can be packed in containers that can run on one or more container clusters.
  • the latest technologies for managing multiple containers on a cluster are container orchestration technologies such as Kubernetes.
  • Kubernetes has a scheduler that assigns pods (a collection of containers) to a set of nodes within a cluster.
  • a node is a computer system, physical or virtual, that is set up to operate containers under the control of Kubernetes.
  • a cluster is an overall system made up of nodes.
  • Kubernetes summarizes container images (memory image of a container), their configuration and the number of required instances in deployments.
  • Kubernetes automatically monitors the parameters of a deployment. The tool ensures that the required number of containers is running at all times.
  • Kubernetes distributes changes to the software or the configuration with a rollout.
  • Kubernetes was not designed for such a hierarchical architecture as is used in the industrial environment. When distributing the pods, no skill-specific, transmission-specific or resource-specific properties within the infrastructure mentioned are taken into account.
  • a scheduler for mapping industrial applications to a specific infrastructure has already been proposed in EP 19152467.7.
  • MILP mixed integer optimization
  • MILP is concerned with optimizing linear objective functions over a set constrained by linear equations and inequalities. It is the basis of the solution methods of (mixed) integer linear optimization.
  • a so-called solver is a collective term for special mathematical computer programs that can solve mathematical problems numerically.
  • standard solvers such as CPLEX, Scip, Gurobi, Xpress can be used for IP programs (integer optimization models).
  • the object is achieved by the features specified in the independent claims.
  • Advantageous developments of the invention are presented in the dependent claims.
  • the invention claims a computer-aided method for distributing software components of one or more applications to infrastructure components of an industrial infrastructure that are suitable for their execution, which includes a set of infrastructure components which are made up of a set of computing nodes and a set of network nodes.
  • the computing nodes each being connectable or connected to at least one infrastructure component via a connection, which at least partially of a communication network belonging to the infrastructure to which the computing nodes are connected, the computing nodes each having capability-specific properties, the connections each having transmission-specific properties, characterized in that the distribution of the software communication components is optimized with the aim that as many applications as possible from a predeterminable set of applications can be used in the infrastructure, provided that each software component of an application has only one computing node on which it can be executed taking into account the capability-specific properties , and that for each interface between at least two of these assigned software components one connection or several connections coupled one behind the other via one or more network nodes is or will be selected, taking into account the transmission-specific and resource-specific properties.
  • the optimization can be carried out by means of mixed-integer optimization.
  • a first infrastructure component (start component or source) is in each case via a connection or several connections with a second infrastructure component (target components or destination) for an exchange (i.e. bidirectional) directionally) or for the transfer (ie unidirectional) of data.
  • these connection (s) are referred to as the (network) path from the first to the second infrastructure component.
  • each path is directional.
  • the interfaces can each have interface-specific properties.
  • each path (a connection or several coupled connections) has, for example, a latency as a transmission-specific property.
  • Each interface has a maximum latency as a corresponding interface-specific property. If an interface runs over a path, i.e. forwards data over the path, the latency of the path must be less than or equal to the maximum latency of the interface.
  • the sum of the values of the interface-specific properties over the multiple interfaces must be less than the corresponding or comparable value of the transmission-specific properties of the same connection or be identical.
  • Each connection has a maximum bandwidth as a transmission-specific property that is not exceeded allowed. Accordingly, the following must apply to each individual connection in the communication network: The sum of the bandwidths of all interfaces as interface-specific properties that run over a path or are assigned to the path used by this connection must be less than or equal to the bandwidth of the connection under consideration as a corresponding transmission-specific property.
  • the network nodes can each have resource-specific properties that are taken into account when selecting the one or more connections.
  • a weighting when taking into account the capability-specific, the transmission-specific and / or the resource-specific properties can be included in the optimization.
  • All software components of each application that are used or that are to be installed or executed in the infrastructure are accordingly assigned to one computing node.
  • Corresponding network paths must be found in the network infrastructure for the data exchange / transfer of the interfaces. Several possible network paths can be selected in each case.
  • the distribution or placement of the software components and the routing of the data in the communication network takes place in such a way that all requirements of the applications, the communication network and the infrastructure components are met.
  • the infrastructure here comprises at least one communication network and the infrastructure components.
  • Computing nodes can be manufacturing machines, (IoT) devices, terminals, PCs and possibly sensors or actuators.
  • the coupling or the connection of computing or network nodes can possibly be phy- be physically bidirectional (data exchange) or unidirectional (data transfer).
  • the data exchange or the data transfer can also comprise only simple messages or, if applicable, only the sending or receiving of simple signals.
  • the data exchange can be wired or wireless using standard wireless technology such as WLAN, Bluetooth, NFC, cellular radio, etc.
  • the application can be designed in terms of firm and / or software technology as an app or also as a container.
  • Containers embed the software code of an application in a secure storage area, to which there is then only fully regulated, possibly encrypted or certified access from outside.
  • cryptographic-specific properties of the infrastructure components can also be taken into account.
  • Cryptographic properties can be expressed by a type of hardness measure with regard to the probability that an attack from outside will be successful.
  • An asymmetrical encryption method could have a different degree of hardness than a symmetrical encryption method.
  • Further cryptographic protection measures, among many others, are signature procedures and possibly certificates. These can also be assigned a degree of hardness.
  • connection or the multiple connections not only the throughput but also the ability of one or more nodes of this connection (s) to fend off attacks from outside can play a role.
  • Another aspect of the invention is a device, in particular a scheduler, for distributing software components of one or more applications to infrastructure components of an industrial infrastructure that are suitable for their execution and that comprise a set of infrastructure components that are made up of a set of computing nodes (C) and a set of network nodes (N) is formed, with an application having one or more software components which exchange and / or transfer data with one another via interfaces (I 01 to I 03 , I 13), the computing nodes each can be or are connected to at least one infrastructure component via a connection which is at least part of a communication network belonging to the infrastructure to which the computing nodes are connected, the computing nodes each having capability-specific properties and the connections each having transmission-specific properties , marked calibrated by an optimization component that is designed to optimize the distribution of the software components with the aim that as many applications as possible from a predeterminable set of applications can be used in the infrastructure, provided that each software component has a Application is only assigned to one computing node on which it can be executed taking into account the capability-specific properties and that for each
  • the best network path is determined from a set of possible network paths for the data exchange between two software components.
  • Several routes via network paths from a first computing node (source) to a second computing node (destination) are thus possible, provided that the forward and backward communication of two computing nodes takes place via the same network path. This not only enables bandwidth to be used and latency to be reduced, but also creates a seamless transition between the architecture levels described above.
  • the MILP approach described in a further development of the invention makes it possible to efficiently find optimal solutions which combine the two requirements for the distribution of as many applications as possible, taking into account the transmission-specific properties in the network.
  • a computer program comprising program code which can be executed by at least one processor and which causes the at least one processor to execute the operating method according to the invention and its embodiments.
  • the computer program can run on a computer, e.g. in the cloud, server and / or PC, or be stored as a computer program product on a computer-readable medium.
  • the computer program brings the runtime environment to run.
  • a variant of the computer program (products) with program commands for configuring a creation device for example a 3D printer, a computer system or be a manufacturing machine suitable for creating processors and / or devices.
  • the means can be hardware, firmware and / or software units or modules.
  • the term “computer” should be interpreted as broadly as possible, in particular to cover all electronic devices with data processing properties. Computers can thus, for example, personal computers, servers, programmable logic controllers (PLC), handheld computer systems, pocket PC devices, mobile radio devices and other communication devices that can process data with the aid of computers, processors and other electronic devices Be data processing.
  • PLC programmable logic controllers
  • “computer-aided” can be understood to mean, for example, an implementation of the method in which, in particular, a processor executes at least one method step of the method.
  • FIG. 1 schematically shows the application mentioned at the outset
  • FIG. 2 schematically shows an industrial infrastructure with a communication network.
  • Figure 1 shows an industrial application A consists of several (software) components (workloads, WL) which exchange data via interfaces (interfaces). Each component is characterized by a set of parameters that describe the requirements, restrictions and behavior as a property of these. These include, for example, the computational complexity (CPU), memory consumption (RAM), etc. Each interface is also characterized by a set of parameters or interface-specific properties that characterize the data flow or the data throughput on this interface. This can be, for example, the required bandwidth or the maximum permissible latency.
  • FIG. 2 schematically shows an infrastructure which comprises the relevant infrastructure components and the properties on which the industrial applications are distributed and executed.
  • the infrastructure consists of computing nodes C1 to C16, connections L1 to L24 and network nodes N1 to N8.
  • the computing nodes C1 to C6 with the network node NI can be a domain or manufacturing cell and the computing nodes th C7 to C12 form a further domain or manufacturing cell with the network node N2. According to the ISA-95 standard, these two production cells then belong to the production level or to the control and field level.
  • the computing nodes C13 and C14 with the network node N7 can belong to the operations management level in the example.
  • the computing nodes C15 and C16 with network nodes N8 can belong to the company level in the example.
  • the network nodes N2, N7 and N8 can each be designed as a so-called EDGE.
  • Computing node C15 can offer cloud services and computing node C16 can be a data center.
  • the network nodes N3 to N6 can accordingly form a communication network that can be wired and / or wireless.
  • the use of communication standards such as mobile radio (e.g. LTE, 5G etc.), WIFI, LAN and an intranet or internet is conceivable here.
  • Each computing node has a number of skill-specific properties such as the main memory capacity or the computing power.
  • Connections also called links
  • Each connection is characterized by a number of parameters or properties, such as bandwidth and latency characteristics.
  • a network node links two or more connections.
  • a network node usually abstracts physical or virtual network devices such as switches or routers.
  • a network node can also have other properties that affect the network, such as minimal latency.
  • the device for example the scheduler, which can be configured as a cloud service, has, for example, an optimization component that has a modeled optimization.
  • the optimization model preferably a mixed-integer optimization model (MILP)
  • MILP mixed-integer optimization model
  • the applications are distributed over a communication network of the infrastructure, which is made up of a number of infrastructure components.
  • the set of nodes also known as infrastructure components, contains both the computing nodes and the network nodes.
  • connections are preferably directed, ie if ⁇ n1, n2) is a forward connection then (n2, n1) is the corresponding reverse connection.
  • a sequence of several nodes, each with a connection or linked to one another via connections, is called a path.
  • every path is directed.
  • the goal is to place as many applications as possible in the infrastructure. Allocation or distribution of one or more applications can take place if no applications have yet been allocated or if applications on computing nodes have already been allocated and these therefore already ensure a certain utilization of the infrastructure.
  • NodesForWL (w) Set of possible nodes on which component w can be placed
  • WLsForNode (n) Set of possible components that can be placed on node n
  • Paths (s, d) Set of paths in the network with start node s (or source) and destination node d (or dest). There can be several paths from a start node to a destination node, ie circles are permitted in the network. In addition, the direction of the paths must be taken into account.
  • Paths Set of all paths in the network i.e. the union of all sets of Paths (s, d)
  • PathsWithLink (n1 n2) Set of all paths in the network that use the connection (n1, n2) between nodes n1 and n2
  • WLsOfApp (a) Set of components that make up an app. Groups Set of groups. A group consists of several components. Components of a group must not be placed on the same node.
  • WLsOfGroup (g) Components that belong to group g.
  • NodeRAM working memory capacity (RAM)
  • variables setup w, n Assignment of component w to node n.
  • the variable takes the value 1, otherwise the value 0.
  • the variable assumes the value 1 if path p is used for the interface (w1, w2) in the network, otherwise 0.
  • Each component may be assigned to a maximum of one node:
  • a path between the selected nodes must also be active that can be used by the interface of the two components.
  • path restrictions are defined for all components w1, w2 ⁇ WLs and all node pairs source, dest ⁇ Nodes, for which (w1, w2) ⁇ Int, source ⁇ NodesForWL (w1), dest E NodesForWL (w2) applies and for those between a path exists for the node source and the node dest, i.e. Paths (source, dest) ⁇ 0, Paths (source, dest) Paths:
  • a path p may only be selected for an interface (w1, w2) if the latency of the path does not exceed the maximum latency of the interface.
  • Components that belong to a group must be distributed to different nodes, or no two components of a group may be assigned to the same node:
  • the data exchange between several applications can be modeled by adding further linear inequalities.
  • the capability-specific properties such as the output load of the computing nodes (e.g. CPU, RAM) as well as the transmission-specific properties, e.g. bandwidth of the paths, are taken into account in the MIP model.
  • the underlying transmission technology of the connection (s) can also play a role in the transmission-specific properties.
  • Transmission technology can be wireless, ie radio-based (e.g. mobile radio, WiFi), or as a type of ad hoc connection (mostly e.g. Bluetooth, NFC, Zigbee, infrared) or as a wired connection (e.g. local, wide area or metropolitan area network).
  • radio-based e.g. mobile radio, WiFi
  • a type of ad hoc connection mostly e.g. Bluetooth, NFC, Zigbee, infrared
  • a wired connection e.g. local, wide area or metropolitan area network.
  • a cost function can combine several optimization criteria, such as effort-oriented cost factors for the infrastructure components (eg the computing nodes, network connections) or performance criteria of the applications such as the resource-specific or transmission-specific properties (eg availability, latency).
  • the objective function can consist of a weighted sum of the individual factors or criteria. This means that the optimization can be configured specifically for the application.
  • At least part of the industrial infrastructure can be implemented as a block chain.
  • a block chain here means a continuously expandable list of data records, called “blocks”, which are chained to one another using cryptographic methods.
  • Each block typically contains a cryptographically secure hash (scatter value) of the previous block , a time stamp and transaction data.
  • the transaction data can also be embedded in smart contracts in which the execution of a transaction between the communication partners is specified. This increases security.
  • the software components to be distributed or distributed to the computing nodes form the blocks of a block chain.
  • the communication and the data exchange are carried out by means of transactions.
  • the paths are determined, the nodes further forming blocks of the block chain along the determined paths.
  • a block chain could be formed from node C1 to node C15 via nodes N1, N2, N3, N4, N5, N8.
  • Cryptographic properties can be expressed by a type of hardness measure with regard to the probability that an attack from outside will be successful.
  • An asymmetrical encryption method could have a different degree of hardness than a symmetrical encryption method.
  • the choice of the hash function, as it is used in the block chain, could also make a certain degree of hardship.
  • Further cryptographic protection measures, among many others, are signature procedures and possibly certificates. These can also be assigned a degree of hardness.
  • Computer-readable memories are, for example, volatile memories such as caches, buffers or RAM as well as non-volatile memories such as removable media, hard disks, etc.
  • the functions or method steps described above can be present in the form of at least one set of instructions in / on a computer-readable memory.
  • the functions or steps are not tied to a specific set of instructions or to a specific form of instruction set or to a specific storage medium or to a specific processor or to specific execution schemes and can be implemented through software, firmware, microcode, hardware, processors, integrated circuits etc. can be run alone or in any combination.
  • a wide variety of processing strategies can be used to such as serial processing by a single processor, or multiprocessing, or multitasking, or parallel processing, etc.
  • the instructions can be stored in local or central memories, but it is also possible to store the instructions on a remote system and access them via the network.
  • processor central signal processing
  • control unit or “data evaluation means” includes processing means in the broadest sense, for example servers, universal processors, graphics processors, digital signal processors, application-specific integrated circuits ( ASICs), programmable logic circuits such as FPGAs, discrete analog or digital circuits and any combination thereof, including all other processing means known to the person skilled in the art or developed in the future.
  • processors can consist of one or more devices or units that can be integrated into a device. If a processor consists of several devices, these can be designed or configured for parallel or sequential processing or execution of instructions.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Computer And Data Communications (AREA)

Abstract

L'invention concerne un procédé assisté par ordinateur permettant de distribuer des composants logiciels d'une ou de plusieurs applications à des composants d'infrastructure d'une infrastructure industrielle adaptée à leur exécution, ladite infrastructure industrielle comprenant un certain nombre de composants d'infrastructure, qui sont formés par un certain nombre de nœuds informatiques (C) et un certain nombre de nœuds de réseau (N), une application comportant un ou plusieurs composants logiciels qui échangent et/ou transfèrent des données entre eux par l'intermédiaire d'interfaces (I01 à I03, I13), les nœuds informatiques étant chacun reliés à au moins un composant d'infrastructure par l'intermédiaire d'une connexion, qui est au moins une partie d'un réseau de communication appartenant à l'infrastructure, auquel les nœuds informatiques sont connectés, les nœuds informatiques ayant chacun des caractéristiques spécifiques de capacité et les connexions ayant chacune des caractéristiques spécifiques à la transmission, caractérisé en ce que la répartition des composants logiciels est optimisée dans le but d'optimiser autant d'applications que possible d'un nombre prédéfini d'applications dans l'infrastructure à condition que chaque composant logiciel d'une application soit affecté à un seul nœud informatique sur lequel il peut être exécuté tout en prenant en compte les caractéristiques propres à la capacité, et qu'une connexion ou de multiples connexions couplées l'une après l'autre par l'intermédiaire d'un ou de plusieurs nœuds de réseau est/sont sélectionnées pour chaque interface entre au moins deux de ces composants logiciels attribués, en tenant compte des caractéristiques spécifiques à la transmission et spécifiques aux ressources.
EP21728446.2A 2020-05-29 2021-05-06 Procédé et dispositif de distribution de composants logiciels d'une ou de plusieurs applications à des composants d'infrastructure d'une infrastructure industrielle adaptée à leur exécution Pending EP4139799A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
EP20177414.8A EP3916553A1 (fr) 2020-05-29 2020-05-29 Procédé et dispositif pour la distribution de composants logiciels d'une ou plusieurs applications pour leur exécution sur des composants d'infrastructure appropriés d'une infrastructure industrielle.
PCT/EP2021/062025 WO2021239433A1 (fr) 2020-05-29 2021-05-06 Procédé et dispositif de distribution de composants logiciels d'une ou de plusieurs applications à des composants d'infrastructure d'une infrastructure industrielle adaptée à leur exécution

Publications (1)

Publication Number Publication Date
EP4139799A1 true EP4139799A1 (fr) 2023-03-01

Family

ID=70968742

Family Applications (2)

Application Number Title Priority Date Filing Date
EP20177414.8A Withdrawn EP3916553A1 (fr) 2020-05-29 2020-05-29 Procédé et dispositif pour la distribution de composants logiciels d'une ou plusieurs applications pour leur exécution sur des composants d'infrastructure appropriés d'une infrastructure industrielle.
EP21728446.2A Pending EP4139799A1 (fr) 2020-05-29 2021-05-06 Procédé et dispositif de distribution de composants logiciels d'une ou de plusieurs applications à des composants d'infrastructure d'une infrastructure industrielle adaptée à leur exécution

Family Applications Before (1)

Application Number Title Priority Date Filing Date
EP20177414.8A Withdrawn EP3916553A1 (fr) 2020-05-29 2020-05-29 Procédé et dispositif pour la distribution de composants logiciels d'une ou plusieurs applications pour leur exécution sur des composants d'infrastructure appropriés d'une infrastructure industrielle.

Country Status (2)

Country Link
EP (2) EP3916553A1 (fr)
WO (1) WO2021239433A1 (fr)

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2017005514A (ja) 2015-06-10 2017-01-05 富士通株式会社 無線装置
US20190007258A1 (en) * 2017-06-29 2019-01-03 Cisco Technology, Inc. Workload placement and resource allocation for media production data center

Also Published As

Publication number Publication date
EP3916553A1 (fr) 2021-12-01
WO2021239433A1 (fr) 2021-12-02

Similar Documents

Publication Publication Date Title
DE102020125219A1 (de) End-to-end -dienstqualität in edge-computing -umgebungen
DE102018120345A1 (de) Hochleistungssteuerungsserversystem
EP3320406B1 (fr) Validation d'une étape de traitement d'un objet à traiter
DE102022114301A1 (de) Software-definiertes prozesssteuerungssystem für industrielle prozessanlagen
DE102010044529B4 (de) Autonomes speicher-sub-system mit hardwarebeschleuniger
DE102022114267A1 (de) Systeme und verfahren zur dynamischen aufrechterhaltung der redundanz und des lastausgleichs in softwaredefinierten steuerungssystemen für industrielle prozessanlagen
DE102022114391A1 (de) Suchdienst in einem softwaredefinierten Steuerungssystem
DE102022114380A1 (de) Sicherheitsdienste in einem softwaredefinierten steuerungssystem
DE112011105911T5 (de) Server mit Switch-Schaltungen
DE102022114305A1 (de) E/a serverdienste zur auswahl und verwendung aktiver steuerungsausgänge von containerisierten steuerungsdiensten in einer prozesssteuerungsumgebung
DE102022114541A1 (de) Suchdienst in einem softwaredefinierten steuerungssystem
DE102022114542A1 (de) Suchdienst in einem softwaredefinierten steuerungssystem
DE102022114281A1 (de) Softwaredefiniertes steuerungssystem mit e/a-serverdiensten, die mit containerisierten diensten kommunizieren
EP3125056A1 (fr) Systeme et procede de commande et/ou d'analyse d'un processus industriel
DE102022115152A1 (de) Visualisierung eines softwaredefinierten prozesssteuerungssystems für industrielle prozessanlagen
DE102022114543A1 (de) Systeme und verfahren zur zuordnung von modulen in einem softwaredefinierten steuerungssystem für industrielle prozessanlagen
DE102022114250A1 (de) Systeme und Verfahren zur hierarchischen Organisation von softwaredefinierten Prozesssteuerungssystemen für industrielle Prozessanlagen
DE102022115178A1 (de) Visualisierung eines softwaredefinierten prozesssteuerungsstems für industrielle prozessanlagen
DE102022114375A1 (de) Sicherheitsdienste in einem softwaredefiniertensteuerungssystem
EP3767894A1 (fr) Procédé de communication de données, noeud de travail, groupe, réseau industriel, programme informatique et support lisible par ordinateur
DE102022114307A1 (de) Nutzung von dienstqualitätsmetriken zur erleichterung von übergängen zwischen e/a-kanälen für e/a-serverdienste
DE102012219705A1 (de) Datenpaketverarbeitung im netzwerk
DE102022114302A1 (de) Softwaredefiniertes prozesssteuerungssystem und verfahren für industrielle prozessanlagen
DE102015116036A1 (de) Dezentrale Realzeitrechenstruktur, die eine speicherinterne Verarbeitung verwendet
WO2022022992A1 (fr) Commande de processus basée sur un jumeau numérique dans un réseau ido

Legal Events

Date Code Title Description
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: UNKNOWN

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE

PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE

17P Request for examination filed

Effective date: 20221123

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

DAV Request for validation of the european patent (deleted)
DAX Request for extension of the european patent (deleted)
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: EXAMINATION IS IN PROGRESS

17Q First examination report despatched

Effective date: 20231205