# US 11,907,159 B2 · Method for representing a distributed computing system by graph embedding > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 11,907,159 B2 - Document ID: US11907159B2 - Status: Granted - Kind: B2 - Application number: 17/891,095 - Filed: 2022-08-18 - Published: 2023-02-23 - Granted: 2024-02-20 - Earliest claimed: 2021-08-19 - Assignees: Bull SAS; Le Commissariat à L'éNergie Atomique Et Aux éNergies Alternatives - Applicants: Bull SAS - Inventors: Emeric Dynomant; Pierre Seroul - Web page: https://patentgrep.com/patent/US11907159B2 ## CPC - G06F 15/8092: {Array of vector units} - G06F 8/77: Software metrics - G06F 11/3006: {where the computing system is distributed, e.g. networked systems, clusters, multiprocessor systems (multiprogramming arrangements G06F9/46; allocation of resources G06F9/50)} - G06F 11/323: {Visualisation of programs or trace data} - G06F 11/3476: {Data logging (G06F11/14, G06F11/2205 take precedence)} - G06N 3/044: Recurrent networks, e.g. Hopfield networks - G06N 3/045: Combinations of networks - G06N 3/0455: Auto-encoder networks; Encoder-decoder networks - G06N 3/08: Learning methods - G06N 5/022: Knowledge engineering; Knowledge acquisition - G06N 7/01: Probabilistic graphical models, e.g. probabilistic networks - G06N 20/00: Machine learning - G06F 11/3447: {Performance evaluation by modeling} - H04L 63/1425: {Traffic logging, e.g. anomaly detection} - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) - G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS - H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M) ## Abstract A method of representing a distributed computing system, the distributed computing system comprising a plurality of processing devices connected together according to a predefined topology. The method comprising receiving at least one piece of data from an activity log file relating to at least one processing device among the plurality of processing devices, receiving at least one metric relating to at least one processing device among the plurality of processing devices, receiving at least the predefined topology of the distributed computing system, constructing a graph representative of a distributed computing system operation, the graph comprising the data item extracted from the received log file, the received metric, and the received topology, and embedding at least one part of the graph to obtain at least one state vector representing the at least one part of the embedded graph. ## Claims ### Claim 1 A method of representing a distributed computing system, the distributed computing system comprising a plurality of processing devices connected together in a predefined topology, the method comprising: receiving at least one piece of data from an activity log file relating to at least one processing device among the plurality of processing devices, receiving at least one metric related to said at least one processing device among the plurality of processing devices, receiving at least the predefined topology of the distributed computing system, constructing a graph representative of a distributed computing system operation, the graph comprising the at least one piece of data extracted from the activity log file that is received, the at least one metric that is received, and the predefined topology that is received, embedding at least one part of the graph to obtain at least one state vector representing the at least one part of the graph that is embedded, the at least one state vector taking into account the predefined topology, the at least one metric and the activity log file. ### Claim 2 (depends on 1) The method of representing according to claim 1, wherein the receiving the at least one piece of data, the receiving the at least one metric and the receiving the predefined topology are implemented a plurality of times, each implementation being performed during a time window of predetermined duration, and wherein the constructing the graph and the embedding the at least one part of the graph are carried out at an end of each time window. ### Claim 3 (depends on 1) The method of representing according to claim 1, wherein the graph that is constructed comprises nodes representing one or more of users, processing devices, activities and log files, edges connecting said nodes, where the edges represent links between said nodes and are based at least in part on the predefined topology, attributes of one or more of said nodes and said edges representing the at least one metric that is received. ### Claim 4 (depends on 1) The method of representing according to claim 1, wherein the predefined topology that is received is sent by an orchestrator. ### Claim 5 (depends on 1) The method of representing according to claim 1, wherein the embedding of the at least a portion of the graph is performed by a graph embedding method selected from DyGCN and MAGNN. ### Claim 6 (depends on 1) The method of representing according to claim 1, further comprising maintaining the distributed computing system by a machine learning method from the at least one state vector. ### Claim 7 (depends on 6) The method of representing according to claim 6, wherein said maintaining the distributed computing system is carried out from a plurality of state vectors respectively obtained during each time window of a plurality of time windows. ### Claim 8 (depends on 6) The method of representing according to claim 6, wherein the machine learning method is at least one method selected from an anomaly detection method, an incident prediction method, a root cause analysis method. ### Claim 9 A device for representing a distributed computing system, the distributed computing system comprising a plurality of processing devices connected together in a predefined topology, the device comprises: at least one receiver, wherein the at least one receiver is configured to receive at least one piece of data from an activity log file relating to at least one processing device among the plurality of processing devices, receive at least one metric related to said at least one processing device among the plurality of processing devices, receive at least the predefined topology of the distributed computing system, at least one graph creator, wherein the at least one graph creator is configured construct a graph representative of a distributed computing system operation, the graph comprising the at least one piece of data extracted from the activity log file that is received, the at least one metric that is received, and the predefined topology that is received, at least one graph embedding network, wherein the at least one graph embedding network is configured to embed at least one part of the graph to obtain at least one state vector representing the at least one part of the graph that is embedded, the at least one state vector taking into account the predefined topology, the at least one metric and the activity log file. ### Claim 10 (depends on 9) The device according to claim 9, further comprising a storage configured to store the at least one state vector from the embed said at least one part of the graph, wherein the at least one graph embedding network is further configured to send the at least one state vector to the storage. ### Claim 11 A non-transitory computer-readable medium comprising instructions that, when software is executed by a computer, cause the computer to implement a method of representing a distributed computing system, the distributed computing system comprising a plurality of processing devices connected together in a predefined topology, the method comprising: receiving at least one piece of data from an activity log file relating to at least one processing device among the plurality of processing devices, receiving at least one metric related to said at least one processing device among the plurality of processing devices, receiving at least the predefined topology of the distributed computing system, constructing a graph representative of a distributed computing system operation, the graph comprising the at least one piece of data extracted from the activity log file that is received, the at least one metric that is received, and the predefined topology that is received, embedding at least one part of the graph to obtain at least one state vector representing the at least one part of the graph that is embedded, the at least one state vector taking into account the predefined topology, the at least one metric and the activity log file. ### Claim 12 (depends on 11) The non-transitory computer-readable medium according to claim 11, further comprising a computer program product.