Transmission frequency management for edge devices in interconnected distributed networks

By determining the maximum write frequency MWF in an interconnected distributed network and iteratively optimizing the data flow write frequency DFWF of edge devices, the problem of network performance is solved, and the privacy protection and network performance improvement of edge devices is achieved.

CN114731516BActive Publication Date: 2024-11-15INTERNATIONAL BUSINESS MACHINE CORPORATION
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202080080783.2
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Priority Date
2019-11-20
Filing Date
2020-11-12
Publication Date
2024-11-15
Estimated Expiration
2040-11-12

AI Technical Summary

Technical Problem

In interconnected distributed networks, the data flow write frequency of edge devices is limited by the maximum write frequency, resulting in performance being limited by the write speed constraints. It is difficult for the prior art to effectively manage transmission frequency, affecting the reliability of the network and Scalability.

Method used

The maximum write frequency MWF of the interconnected distributed network is determined by a computer processor, and iteratively processes the value of the data flow write frequency DFWF of the edge device based on the MWF optimization algorithm, and determines the optimal DFWF using the associated utility function of the edge device. value to ensure convergence and optimization of data flow.

Benefits of technology

It realizes optimal management of the data flow writing frequency of multiple edge devices, improves network performance, maintains the privacy of edge devices and the security of sensitive information, adapts to changes in the external environment, and prevents critical devices from being exposed to external attacks.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114731516B_ABST
    Figure CN114731516B_ABST
Patent Text Reader

Abstract

In a method for managing transmission frequencies of multiple edge devices for an interconnected distributed network, one or more computer processors determine a maximum write frequency MWF for the interconnected distributed network; iteratively process values ​​of a data stream write frequency DFWF for multiple edge devices of the interconnected distributed network according to an MWF-based optimization algorithm to identify convergence of the value of DFWF, wherein each iteration of processing the value includes determining the value of DFWF at each edge device among the multiple edge devices based on an associated utility function of the corresponding edge device, wherein the utility function is a measure of the utility of the device that depends on the DFWF; and in response to identifying convergence, determine the converged value of DFWF as the optimal value of DFWF for the multiple edge devices.
Need to check novelty before this filing date? Find Prior Art

Description

Background Art

[0001] The present invention generally relates to the field of distributed networks, and more particularly to a method for managing transmission frequencies of a plurality of edge devices interconnected in a distributed network.

[0002] Edge devices are devices that provide entry points into the core network of an enterprise or service provider. Examples include routers, routing switches, integrated access devices (IADs), multiplexers, and various metropolitan area networks (MANs) and wide area networks (WANs) access devices. Edge devices also provide connections to operators and service provider networks. Edge devices that connect local area networks to high-speed switches or backbones can be called edge concentrators. Typically, edge devices are usually routers that provide authenticated access (most commonly PPPoA and PPPoE) to faster and more efficient backbone and core networks. Therefore, core networks are typically designed with switches that use routing protocols such as Open Shortest Path First (OSPF) or Multiprotocol Label Switching (MPLS) to obtain reliability and scalability, allowing edge routers to have redundant links to the core network. The links between core networks are different, for example, Border Gateway Protocol (BGP) routers are often used for peer exchanges.

[0003] In a typical interconnected distributed network, data from various sensors and edge devices are collected, transmitted through gateways and the cloud, and stored in a database for analysis. However, the data flow write frequency (DFWF) that all devices of the interconnected distributed network can actually write to the database is usually limited by the maximum write frequency (MWF). For example, in some commercial applications, edge devices may be configured to allow ten (10) writes / second for basic / standard users and fifty (50) writes / second for advanced / premium users. Therefore, if the MWF is not managed correctly, the performance of the devices of the interconnected distributed network may be limited by the write speed constraint. Summary of the invention

[0004] Embodiments of the present invention disclose a computer-implemented method, a computer program product, and a system for managing the transmission frequencies of multiple edge devices of an interconnected distributed network. The computer-implemented method includes one or more computer processors determining a maximum write frequency MWF for the interconnected distributed network. One or more computer processors iteratively process the values ​​of the data stream write frequency DFWF of multiple edge devices of the interconnected distributed network according to an MWF-based optimization algorithm to identify the convergence of the value of DFWF, wherein each iteration of processing the value includes determining the value of DFWF at each edge device in the multiple edge devices based on the associated utility function of the corresponding edge device, wherein the utility function is a measure of the utility of the device that depends on the DFWF. In response to identifying the convergence, the one or more computer processors determine the converged value of DFWF as the optimal value of DFWF for the multiple edge devices.

[0005] According to one aspect, a computer-implemented method is provided, comprising: determining, by one or more computer processors, a maximum write frequency MWF for an interconnected distributed network; iteratively processing, by one or more computer processors, a value of a data stream write frequency DFWF for a plurality of edge devices of the interconnected distributed network, the method identifying a convergence of the value of DFWF based on an optimization algorithm according to the MWF, wherein each iteration of processing the value comprises determining, at each edge device among the plurality of edge devices, a value of DFWF based on an associated utility function of the corresponding edge device, wherein the utility function is a measure of the utility of the device that depends on the DFWF; and in response to identifying convergence, determining, by the one or more computer processors, the converged value of DFWF as an optimal value of DFWF for the plurality of edge devices.

[0006] According to another aspect, a computer program product is provided, comprising: one or more computer-readable storage media and program instructions stored on the one or more computer-readable storage media, the stored program instructions comprising: program instructions for determining a maximum write frequency (MWF) of a distributed network; program instructions for iteratively processing values ​​of a data flow write frequency (DFWF) of a plurality of edge devices interconnected in the distributed network according to an MWF-based optimization algorithm to identify convergence of values ​​of the DFWF, wherein each iteration of processing the values ​​comprises determining the value of the DFWF at each edge device based on an associated utility function of the edge device, the utility function defining a measure of the utility of the device as a function of the DFWF; and program instructions for determining the converged value of the DFWF as the optimal value of the DFWF of the edge device in response to identifying convergence.

[0007] According to another aspect, a system is provided, comprising: a processing component configured to determine a maximum write frequency MWF of a distributed network; a plurality of edge devices interconnecting the distributed network, wherein each of the plurality of edge devices is configured to determine a value of a data stream write frequency DFWF based on an associated utility function of the corresponding edge device, the utility function defining a measure of the utility of the device depending on the DFWF; and an optimization device configured to iteratively process the values ​​of the DFWF of the plurality of edge devices according to an MWF-based optimization algorithm to identify convergence of the values ​​of the DFWF, and in response to identifying convergence, determine the converged value of the DFWF as the optimal value of the DFWF of the edge device. BRIEF DESCRIPTION OF THE DRAWINGS

[0008] Embodiments of the present invention will now be described, by way of example only, with reference to the accompanying drawings, in which:

[0009] Figure 1 depicts a graphical representation of an example distributed system according to an embodiment of the present invention;

[0010] Figure 2 is a block diagram of an example system according to an embodiment of the present invention;

[0011] Figure 3A is a schematic diagram of a proposed distributed communication system according to an embodiment of the present invention;

[0012] Figure 3B is a schematic diagram describing algorithm iteration according to an embodiment of the present invention;

[0013] Figure 4 is a simplified flow chart of a method according to an embodiment of the present invention; and

[0014] Figure 5 A system according to an embodiment of the present invention is shown. DETAILED DESCRIPTION

[0015] The present invention relates generally to the field of distributed networks, and in particular to a method for managing transmission frequencies of a plurality of edge devices of an interconnected distributed network. The present invention also relates to a computer program product comprising a computer readable program code, which enables a processor of a system or a plurality of processors of a network to implement such a method. The present invention also relates to a system for managing transmission frequencies of a plurality of edge devices of an interconnected distributed network. The present invention seeks to provide a method for managing transmission frequencies of a plurality of edge devices of an interconnected distributed network. Such a method may be computer implemented.

[0016] The present invention also seeks to provide a computer program product comprising a computer program code for implementing the proposed method when executed by a processing unit. The present invention also seeks to provide a processing system suitable for executing the computer program code. The present invention also seeks to provide a system for managing the transmission frequencies of multiple edge devices of an interconnected distributed network. According to an embodiment of the present invention, a computer-implemented method for managing the transmission frequencies of multiple edge devices of an interconnected distributed network is provided. The method includes determining a maximum write frequency MWF for the distributed network. The method also includes iteratively processing the value of the data stream write frequency DFWF of the edge device according to an MWF-based optimization algorithm to identify the convergence of the value of DFWF. Each iteration of processing the value includes determining the value of DFWF at each edge device based on an associated utility function of the edge device, and the utility function defines a measure of the utility of the device based on the DFWF. In response to identifying convergence, the method determines the converged value of DFWF as the optimal value of DFWF for the edge device.

[0017] The concept of transmission frequency management for edge devices of a decentralized architecture (i.e., an interconnected distributed network) is proposed. In such a concept, a MWF can be optimized relative to multiple (e.g., a group) IoT devices. For such optimization, each edge device can have an associated utility function. The utility function can represent the extent to which a user can actually benefit from the device for a given DFWF. In other words, the associated utility function of a device can define a measure of the utility of the device that depends on the DFWF. As an example, in a machine learning application, the utility function can model the accuracy of a trained model relative to the DFWF of the device.

[0018] Embodiments of the present invention may seek to maximize the overall utility of multiple edge devices given the MWF of the distributed network to which the edge devices are connected. In particular, the proposed embodiments may employ decentralized optimization algorithms across gateway devices and multiple edge devices such that the privacy of the edge devices is preserved. For example, utility functions may be defined locally at each edge device and not disclosed to any other third-party device or management platform, including a gateway device that implements a portion of the optimization algorithm employed by the embodiments.

[0019] Embodiments of the present invention relate to the concept of employing a decentralized optimization algorithm that maintains the privacy of utility functions associated with multiple edge devices. In this way, embodiments can provide optimized management of transmission frequencies while maintaining the privacy of sensitive / confidential utility information associated with edge devices of a distributed network. In particular, it is proposed to utilize a decentralized privacy-aware algorithm on an existing distributed communication architecture (e.g., an IoT architecture).

[0020] In embodiments of the present invention, the workload scheduling problem may be modeled as a constrained concave / convex optimization problem. Instead of looking at workload privacy, the main focus of the proposed embodiments may be to protect sensitive information (e.g., utility functions) of user-defined edge devices (e.g., IoT), which may, for example, capture / describe the importance of a specific device in a distributed network. As an example, in some embodiments, the transmission frequency may be optimally calculated not only based on external system resources but also taking into account (multiple) user-customizable preferences.

[0021] Some embodiments of the present invention employ a collaborative decentralized algorithm to optimally calculate the transmission frequency of edge devices in a plug-and-play and privacy-aware manner. As a result of adopting this decentralized approach, an upper-level node (e.g., a gateway) relative to the edge device may only need to collect limited information about (multiple) edge devices for computing purposes, and therefore does not need to fully access the utility functions of (multiple) edge devices. Although in some embodiments, the associated utility function of the device may have been previously generated or defined (e.g., based on user input and / or control signals), other embodiments may be configured to generate such a utility function (e.g., based on user input signals). Therefore, some embodiments may further include, at each edge device, determining a utility function for the device, and associating the determined utility function with the device. In this way, improved flexibility can be provided. In addition, dynamic updating or recalculation of utility functions can be facilitated.

[0022] Iterative processing may be performed partially at non-edge devices of an interconnected distributed network. For example, a gateway may take on a portion of the optimization processing. In this way, a decentralized approach may be adopted that prevents utility functions local to edge devices from being exposed or exposed. Embodiments may therefore involve a gateway as part of the iterative process. In other words, a gateway may take on part of the optimization processing, and a non-edge device may take on part of the optimization processing, so as to implement a decentralized / distributed optimization processing apparatus.

[0023] The first edge device of the plurality of edge devices may have an associated utility function comprising a continuously differentiable non-decreasing concave function. For example, the associated utility function of the first edge device may be modeled as a cluster of weighted logarithmic functions. Other convex / concave functions may also be used for utility functions. In addition, a logarithmic function, such as y=log(x), is continuously differentiable and is a non-decreasing concave function. However, according to the proposed embodiment, the utility function does not have to be continuously non-decreasing. For example, a concave function may not decrease in one interval and decrease in another interval. Therefore, according to an embodiment, the utility function associated with the first edge device may be continuously differentiable and have a decreasing first-order derivative. The optimization algorithm may include an alternating direction multiplier method ADMM algorithm. This is only one example of a decentralization algorithm that may be employed. Other different decentralization algorithms may be used, including the well-known dual decomposition method. Therefore, the proposed embodiment may utilize well-known and established decentralization algorithms, thereby reducing the cost and / or complexity of implementing the proposed embodiment.

[0024] Some embodiments may further include communicating the optimal value of the DFWF to its corresponding edge device. In this way, the optimal DFWF value may be set for each edge device, and then the edge device may begin pushing data to the distributed network. Here, it should also be noted that the data communicated through the distributed network may be stored in an off-site database (e.g., in the cloud) for further data analysis and / or visualization. The embodiment may also include: in response to changes in operating parameters of the interconnected distributed network: iteratively processing the value of the DFWF of the edge device according to an MWF-based optimization algorithm to identify a new convergence of the value of the DFWF; and in response to identifying a new convergence, determining the new converged value of the DFWF as the new optimal value of the DFWF for the edge device.

[0025] When compared to conventional approaches, the proposed embodiments may provide one or more of the following advantages: (i) the utility function can be customized in any practical scenario (with certain concavity assumptions); (ii) there is no direct control over the sampling rate of the edge devices, which is typically complex, and instead the embodiments can calculate the optimal write frequency for each device subject to the MWF constraints; (iii) the decentralized architecture is highly scalable for various device accesses; (iv) the optimal solution can be calculated without leaking information about the utility function; (v) the optimal solution can be adaptively recalculated when the external environment changes, such as the MWF, the number of edge devices changes (due to edge device disconnection / connection), etc.; and (vi) the proposed embodiments can be used to prevent critical edge devices from being exposed to external malicious attackers, especially in security-related applications (e.g., financial systems).

[0026] According to another embodiment of the present invention, a computer program product is provided. The computer program product includes a computer-readable storage medium having program instructions embodied therewith, the program instructions being executable by a processing unit to cause the processing unit to perform a method according to the proposed embodiment. According to another embodiment of the present invention, a computer system including at least one processor and a computer program product is provided. At least one processor is suitable for executing the computer program code of the computer program product. According to yet another embodiment of the present invention, a system for managing the transmission frequency of multiple edge devices of an interconnected distributed network is provided. The system includes a processing component configured to determine a maximum write frequency MWF for the distributed network. The system also includes a plurality of edge devices. Each edge device is configured to determine a value of a data stream write frequency DFWF based on an associated utility function of the edge device, the utility function defining a measure of the utility of the device depending on the DFWF. The system also includes an optimization component configured to iteratively process the value of the DFWF of the edge device according to an optimization algorithm based on the MWF to identify the convergence of the value of the DFWF, and in response to identifying the convergence, determine the converged value of the DFWF as the optimal value of the DFWF of the edge device.

[0027] In the context of the present application, where the embodiments of the present invention constitute a method, it should be understood that such a method may be a process for being executed by a computer, i.e., a computer-implementable method. Therefore, the various steps of the method may reflect various parts of a computer program, such as various parts of one or more algorithms.

[0028] Furthermore, in the context of the present application, a system may be a single device or a collection of distributed devices suitable for performing one or more embodiments of the method of the present invention. For example, a system may be a personal computer (PC), a server, or a collection of PCs and / or servers connected via a network such as a local area network, the Internet, etc., so as to collaboratively perform at least one embodiment of the method of the present invention. Furthermore, an edge device may be an Internet of Things (IoT) device configured to be communicatively coupled to the edge of an interconnected distributed network.

[0029] A concept of transmission frequency management for edge devices of a decentralized architecture (i.e., an interconnected distributed network) is proposed. In such a concept, a MWF can be optimized with respect to multiple (e.g., groups) of IoT devices. Such optimization can employ a decentralized optimization algorithm on non-edge devices and multiple edge devices, thereby protecting the privacy of (multiple) edge devices. For example, a utility function can be defined locally at each edge device and not disclosed to any other third-party device or management platform, including non-edge devices that implement part of the optimization algorithm.

[0030] A concept is proposed that employs a decentralized optimization algorithm that maintains the privacy of utility functions associated with multiple edge devices. As a result of employing this decentralized approach, upper-level nodes (e.g., gateways) relative to edge devices may only need to collect limited information about edge devices for computational purposes and therefore do not require full access to the utility functions of edge devices. In this way, embodiments can provide optimized management of transmission frequencies while maintaining the privacy of sensitive / confidential utility information associated with edge devices of a distributed network. Specifically, embodiments can utilize decentralized privacy-aware algorithms on existing distributed communication architectures (e.g., IoT architectures).

[0031] The implementation of the embodiments of the present invention may take various forms, and exemplary implementation details are discussed later with reference to the accompanying drawings. It should be understood that the drawings are only schematic and are not drawn to scale. It should also be understood that the same reference numerals are used throughout the drawings to represent the same or similar components.

[0032] Preferred embodiments of the present invention will now be described in detail with reference to the accompanying drawings.

[0033] Figure 1 A graphical representation of an exemplary distributed system in which aspects of the illustrative embodiments may be implemented is depicted. Distributed system 100 may include a network of computers in which aspects of the illustrative embodiments may be implemented. Distributed system 100 contains at least one network 102, which is a medium for providing communication links between various devices and computers connected together within distributed data processing system 100. Network 102 may include connections such as wired, wireless communication links, or fiber optic cables.

[0034] In the depicted example, first server 104 and second server 106 are connected to network 102 along with storage unit 108. In addition, clients 110, 112, and 114 are also connected to network 102. Clients 110, 112, and 114 may be edge devices, such as personal computers, network computers, IoT devices, etc. In the depicted example, first server 104 provides data such as boot files, operating system images, and applications to clients 110, 112, and 114. In the depicted example, clients 110, 112, and 114 are clients of first server 104. Distributed processing system 100 may include additional servers, clients, and other devices not shown.

[0035] In the depicted example, distributed system 100 is the Internet, where network 102 represents a worldwide collection of networks and gateways that use the Transmission Control Protocol / Internet Protocol (TCP / IP) protocol suite to communicate with each other. The core of the Internet is a backbone of high-speed data communication lines between major nodes or host computers, consisting of thousands of commercial, government, educational, and other computer systems that route data and messages. Of course, distributed system 100 can also be implemented to include multiple different types of networks, such as intranets, local area networks (LANs), wide area networks (WANs), etc. As described above, Figure 1 It is intended as an example and not as an architectural limitation to the different embodiments of the present invention, and thus, Figure 1 The specific elements shown are not to be construed as limiting the environments in which illustrative embodiments of the invention may be implemented.

[0036] Figure 2 A block diagram of an example system 200 is depicted in which aspects of the illustrative embodiments may be implemented. System 200 is such as Figure 1 The example of a computer of client 110 in which computer usable code or instructions implementing the processes of the illustrative embodiments of the present invention may be located. For example, the proposed embodiments may be partially implemented in processing unit 206 of system 200.

[0037] In the depicted example, system 200 employs a hub architecture that includes a north bridge and memory controller hub (NB / MCH) 202 and a south bridge and input / output (I / O) controller hub (SB / ICH) 204. Thus, another proposed embodiment may be implemented in the memory controller hub 202 of system 200. A processing unit 206, a main memory 208, and a graphics processor 210 are connected to NB / MCH 202. The graphics processor 210 may be connected to NB / MCH 202 via an accelerated graphics port (AGP).

[0038] In the depicted example, a local area network (LAN) adapter 212 is connected to the SB / ICH 204. An audio adapter 216, a keyboard and mouse adapter 220, a modem 222, a read-only memory (ROM) 224, a hard disk drive (HDD) 226, a CD-ROM drive 230, a universal serial bus (USB) port and other communication ports 232, and a PCI / PCIe device 234 are connected to the SB / ICH 204 via a first bus 238 and a second bus 240. PCI / PCIe devices may include, for example, Ethernet adapters, add-on cards, and PC cards for notebook computers. PCI uses a card bus controller, while PCIe does not. ROM 224 may be, for example, a flash basic input / output system (BIOS).

[0039] HDD 226 and CD-ROM drive 230 are connected to SB / ICH 204 via second bus 240. HDD 226 and CD-ROM drive 230 may use, for example, an integrated drive electronics (IDE) or serial advanced technology attachment (SATA) interface. Super I / O (SIO) device 236 may be connected to SB / ICH 204.

[0040] An operating system runs on processing unit 206. The operating system coordinates and provides Figure 2 The object-oriented programming system can run with the operating system and provide calls to the operating system from multiple programs or applications executed on the system 200.

[0041] As a server, the system 200 may be, for example, a computer system running an open source operating system. The system 200 may be a symmetric multiprocessor (SMP) system including a plurality of processors in the processing unit 206 .

[0042] Alternatively, a single processor system may be employed. Instructions for the operating system, programming system, and applications or programs are located on a storage device such as HDD 226 and may be loaded into main memory 208 for execution by processing unit 206. Similarly, one or more programs according to an embodiment may be suitable for storage by storage device and / or main memory 208.

[0043] The processes of the illustrative embodiments of the present invention may be performed by processing unit 206 using computer usable program code, which may be located in a memory such as main memory 208 , ROM 224 , or in one or more peripheral devices 226 and 230 .

[0044] Such as Figure 2 The bus system shown as the first bus 238 or the second bus 240 may include one or more buses. In one embodiment, the bus system may be implemented using any type of communication structure or architecture that provides for data transmission between different components or devices attached to the structure or architecture. Figure 2 The communication unit such as the modem 222 or the network adapter 212 may include one or more devices for transmitting and receiving data. The memory may be, for example, the main memory 208, the ROM 224 or a memory such as a memory card. Figure 2 The cache found in the NB / MCH 202 in .

[0045] Those of ordinary skill in the art will understand that Figure 1 and 2The hardware in can vary depending on the implementation. Figure 1 and Figure 2 In addition to or in place of the hardware described in the drawings, other internal hardware or peripheral devices such as flash memory, equivalent nonvolatile memory, or optical disk drives may be used. Furthermore, the processing of the exemplary embodiments may be applied to multi-processor data processing systems other than the previously mentioned systems without departing from the scope of the invention.

[0046] Furthermore, system 200 may take the form of any of a variety of different data processing systems, including a client computing device, a server computing device, a tablet computer, a laptop computer, a phone or other communication device, a personal digital assistant (PDA), etc. In some illustrative examples, system 200 may be a portable computing device that is configured with flash memory to provide non-volatile memory for storing, for example, operating system files and / or user-generated data. Thus, system 200 may be essentially any known or later developed data processing system, without architectural limitation.

[0047] As described above, the proposed embodiments provide methods and systems for optimizing privacy-aware transmission frequency management of edge devices of a distributed communication network.By way of further explanation, the proposed embodiments will now be described using IoT edge devices.

[0048] Figure 3A A schematic diagram of a proposed distributed communication system according to an embodiment is depicted. System 300 includes four main components: IoT device 310; gateway 320, cloud network platform 330; and user 340. The exemplary system also includes a data storage system 350, which is accessible via the cloud network platform 330 and is also directly accessible by the user 340. Also included in system 300 is a data visualization component for facilitating data analysis.

[0049] The main functions of each of the four main components are summarized as follows: IoT device 310: an edge device such as a sensor or device connected to the gateway 320, with the ability to define utility functions for solving the optimization problem of interest in a decentralized manner. Gateway 320: collects data from IoT devices / sensors, passes data to the cloud network platform 330, and performs basic data processing tasks. Cloud network platform 330: a central hub for data analysis, monitoring, and storage. User 340: the owner of the IoT device 310 who wants to benefit the device in the area for some application purpose.

[0050] Considering an example where N IoT devices 310 are connected to a gateway 320, the utility function associated with the i-th device can be represented as fi(xi). Then, using the maximum write frequency MWF per time slot, the user U may wish to determine the optimal data flow write frequency (DFWF) for the transmission rate of each IoT device 310 so that the overall utility of the entire IoT device 310 group can be maximized. Mathematically, this optimization problem can be represented using the following equations (Equations 1 and 2), where:

[0051] (1)

[0052] (2)

[0053] With respect to equations (1) and (2), xi represents the DFWF of the ith device in each time slot (e.g., 1 second), and c represents the MWF of all devices. As mentioned above, for basic / standard users, c can be set to 10, and for advanced / power users, c can be set to 50. Finally, represents the utility of the ith device given xi, and in practice, this means how the user can benefit from the DFWF xi of device i.

[0054] In this example, we assume that each utility function fi can be modeled as a continuously differentiable, non-decreasing, strictly concave function. This is a common assumption seen in modeling Internet business behavior. As an example, the utility function fi can be modeled as a cluster of weighted logarithmic functions, which represents a proportional fairness model of the optimal resource allocation with respect to user U. Figure 3B A schematic diagram of the algorithm iterations is shown.

[0055] exist Figure 3B In the example, each IoT device 310 can be interpreted as a physical entity, such as a Raspberry Pi device, or a "virtual device", i.e., any other type of sensor or device that can be used to interact with the system. In addition, the gateway 320 includes: a processing component 370 configured to determine the MWF of the distributed network; and an optimization component 380 configured to iteratively process the value of the DFWF of the edge device according to the MWF-based optimization algorithm to identify the convergence of the value of the DFWF.

[0056] To solve the optimization problem, for the sake of completeness, the steps of an exemplary implementation of the algorithm can be expressed as follows:

[0057] (3) Initialization: k = 0, x i (k)=0, y(k)=y0, α(k)=α0

[0058] at the same time implement:

[0059] The gateway broadcasts y(k) to the IoT device network

[0060] For each IoT device, execute:

[0061] Get y(k) from the gateway

[0062] Update X i :

[0063]

[0064] Send X i (k+1) to the gateway

[0065] Gateway Collection X i (k+1)

[0066] Gateway Update

[0067] Update k: k = k + 1

[0068] Regarding Algorithm (3), σ represents the threshold for algorithm convergence (e.g., a small real number), c is a constant that defines the total amount of resources to be allocated to all IoT devices (MWF), and xi(k) represents the state of xi at the kth iteration, so it is expected that xi will converge when the algorithm converges (i.e., when ) converges to the optimum, and y depends on the amount of remaining resources and the parameter of the step size α(k). The benefit of deploying such a decentralized algorithm is that each IoT device locally solves a simple sub-optimization problem in an iterative manner, which eventually converges to the optimality of the entire swarm. This can all be done without sharing its associated utility function to a central agent (e.g., a gateway), thereby preserving privacy.

[0069] Figure 4 A simplified flow chart of an exemplary embodiment is depicted.

[0070] Step 410 - Initialization: During the initialization phase, the user specifies some parameters before running the algorithm. This includes, for example, the number of IoT devices, available MWFs, and the utility functions associated with each device.

[0071] Step 420 - Calculate optimal DFWF: After initialization is complete, the ADMM algorithm is implemented to find the optimal DFWF for each device.

[0072] Step 430 - Convergence check: The algorithm is implemented in an iterative manner to check whether it has converged to optimality. If convergence is not identified, the method returns to step 420. If convergence is identified, the method proceeds to step 430.

[0073] Step 440 - Push data to the network: When the algorithm converges, the optimal DFWF will be set for each device, and then the device can start pushing data to the cloud. Note that the data passed through the cloud can eventually be stored in a cloud database for further data analysis and visualization.

[0074] Step 450 - Check for parameter changes: If any parameters change during runtime, the system will stop pushing data to the cloud, and the algorithm will dynamically capture the changes in order to return to step 420 and recalculate the optimal solution given the new set of parameters.

[0075] Figure 5 A block diagram of components of a computer system 70 is depicted, which may form part of a networked system 7, according to an illustrative embodiment of the present invention. It should be understood that Figure 5 This merely provides an illustration of one implementation and does not imply any limitation with respect to the environments in which different embodiments may be implemented.Many modifications to the described environments are possible.

[0076] In one example, a processing component configured to determine the MWF of a distributed network according to an embodiment may be implemented in a computer system 70 (e.g., as a processing unit 71). Components of the computer system / server 70 may include, but are not limited to, one or more processing devices, such as a processor or processing unit 71, a system memory 74, and a bus 90 coupling various system components including the system memory 74 to the processing unit 71. The system memory 74 may include computer system readable media in the form of volatile memory, such as a random access memory (RAM) 75 and / or a cache memory 76. The computer system / server 70 may also include other removable / non-removable, volatile / non-volatile computer system storage media. In this case, each may be connected to the bus 90 via one or more data medium interfaces. The memory 74 may include at least one program product having a set (e.g., at least one) of program modules that are configured to perform the functions of the proposed embodiments. For example, the memory 74 may include a computer program product having a program executable by the processing unit 71 to cause the input / output (I / O) interface 72 to perform the method according to the proposed embodiments. A program / utility 78 having a set (at least one) of program modules 79 may be stored in the memory 74, the program modules 79 generally performing the functions and / or methods of the proposed embodiments for writing to portions of the memory.

[0077] The computer system / server 70 may also communicate with one or more external devices 80, such as a keyboard, pointing device, display 85, etc.; one or more devices that enable a user to interact with the computer system / server 70; and / or any device that enables the computer system / server 70 to communicate with one or more other computing devices (e.g., a network card, a modem, etc.). Such communication may occur via an input / output (I / O) interface 72, however, the computer system / server 70 may communicate with one or more networks, such as a local area network (LAN), a general wide area network (WAN), and / or a public network (e.g., the Internet) via a network adapter 73 (e.g., to communicate the determined optimal value of the DFWF to the edge device of the distributed network).

[0078] In the context of the present application, where the embodiments of the present invention constitute methods, it should be understood that such methods are processes for being executed by a computer, i.e., methods that can be implemented by a computer. Therefore, the steps of the method reflect various parts of a computer program, such as parts of one or more algorithms.

[0079] The programs described herein are identified based on the applications in which they are implemented in specific embodiments of the present invention. However, it should be understood that any specific program terms herein are used only for convenience, and therefore the present invention should not be limited to use in any specific application identified and / or implied by such terms. The present invention may be a system, method and / or computer program product. A computer program product may include a computer-readable storage medium (or multiple media) having computer-readable program instructions thereon, and the computer-readable program instructions are used to cause a processor to perform various aspects of the present invention.

[0080] A computer-readable storage medium may be a tangible device capable of retaining and storing instructions used by an instruction execution device. A computer-readable storage medium may be, for example, but not limited to, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing. A non-exhaustive list of more specific examples of computer-readable storage media includes the following: a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a static random access memory (SRAM), a portable compact disc read-only memory (CD-ROM), a digital versatile disk (DVD), a memory stick, a floppy disk, a mechanical encoding device such as a punch card or a raised structure in a groove on which instructions are recorded, and any suitable combination of the foregoing. As used herein, a computer-readable storage medium should not be interpreted as a temporary signal itself, such as a radio wave or other freely propagating electromagnetic wave, an electromagnetic wave propagated by a waveguide or other transmission medium (e.g., a light pulse by an optical fiber cable), or an electrical signal transmitted by a wire.

[0081] The computer-readable program instructions described herein can be downloaded from a computer-readable storage medium to a corresponding computing / processing device, or downloaded to an external computer or external storage device via a network, such as the Internet, a local area network, a wide area network, and / or a wireless network. The network can include copper transmission cables, optical transmission fibers, wireless transmissions, routers, firewalls, switches, gateway computers, and / or edge servers. The network adapter card or network interface in each computing / processing device receives the computer-readable program instructions from the network and forwards the computer-readable program instructions to be stored in a computer-readable storage medium in the corresponding computing / processing device.

[0082] The computer readable program instructions for performing the operations of the present invention may be assembly instructions, instruction set architecture (ISA) instructions, machine dependent instructions, microcode, firmware instructions, state setting data, or source code or object code written in any combination of one or more programming languages, including object-oriented programming languages ​​such as Smalltalk, C++, etc., conventional procedural programming languages ​​such as the "C" programming language or similar programming languages, and quantum programming languages ​​such as the "Q" programming language, Q#, quantum computing language (QCL) or similar programming languages, low-level programming languages ​​such as assembly language or similar programming languages. The computer readable program instructions may be executed entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In the latter case, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., via the Internet using an Internet service provider). In some embodiments, to perform various aspects of the present invention, electronic circuits including, for example, programmable logic circuits, field programmable gate arrays (FPGAs), or programmable logic arrays (PLAs) may execute computer-readable program instructions by utilizing state information of the computer-readable program instructions to personalize the electronic circuits.

[0083] Various aspects of the present invention are described herein with reference to the flow chart and / or block diagram of the method, device (system) and computer program product according to embodiments of the present invention. It will be understood that each frame of the flow chart and / or block diagram and the combination of frames in the flow chart and / or block diagram can be implemented by computer-readable program instructions.

[0084] These computer-readable program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device create a device for implementing the functions / actions specified in one or more boxes of the flowchart and / or block diagram. These computer-readable program instructions can also be stored in a computer-readable storage medium, which can guide the computer, programmable data processing device, and / or other equipment to work in a specific manner, so that the computer-readable storage medium in which the instructions are stored includes an article of manufacture, which includes instructions for implementing various aspects of the functions / actions specified in one or more boxes of the flowchart and / or block diagram.

[0085] Computer-readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device, so that a series of operational steps are performed on the computer, other programmable apparatus, or other device to produce a computer-implemented process, so that the instructions executed on the computer, other programmable apparatus, or other device implement the functions / actions specified in one or more boxes of the flowchart and / or block diagram.

[0086] Flowchart and block diagram in the accompanying drawings show the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present invention.In this regard, each frame in flow chart or block diagram can represent the module, segment or part of instruction, and it comprises one or more executable instructions for realizing the logical function of appointment.In some alternative embodiments, the function mentioned in the frame may not occur in the order mentioned in the figure.For example, two frames shown continuously can actually be performed substantially simultaneously, or these frames can sometimes be performed in reverse order, depending on the function involved.It will also be noted that the combination of the frame in each frame of block diagram and / or flow chart illustration and block diagram and / or flow chart illustration can be realized by the dedicated hardware-based system of performing specified function or action or performing the combination of special hardware and computer instruction.

[0087] The description of various embodiments of the present invention has been given for the purpose of illustration, but it is not intended to be exhaustive or limited to the disclosed embodiments. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the present invention. The terms used herein are selected to best explain the principles of the embodiments, practical applications, or technical improvements existing in the market, or to enable other persons of ordinary skill in the art to understand the embodiments disclosed herein.

Claims

1. A computer-implemented method comprising: Determining, by one or more computer processors, a maximum write frequency MWF for the interconnected distributed network; Iteratively processing, by one or more computer processors, values ​​of a data stream write frequency DFWF for a plurality of edge devices of the interconnected distributed network, the method identifying convergence of the value of the DFWF according to an optimization algorithm based on the MWF, wherein each iteration of processing the value comprises: determining, at each edge device of the plurality of edge devices, a value of the DFWF based on an associated utility function of the respective edge device, wherein the utility function is a measure of the utility of the device that depends on the DFWF; as well as In response to identifying convergence, a converged value of the DFWF is determined, by one or more computer processors, as an optimal value of the DFWF for the plurality of edge devices.

2. The method according to claim 1, further comprising: At each edge device of the plurality of edge devices, a utility function for the device is determined by one or more computer processors, and the determined utility function is associated with the corresponding edge device.

3. The method of claim 1, wherein the iterative processing step is performed partially at a non-edge device of the interconnected distributed network and partially at each edge device of the plurality of edge devices of the interconnected distributed network. 4 . The method of claim 1 , wherein a first edge device of the plurality of edge devices has an associated utility function comprising a continuously differentiable non-decreasing concave function. 5 . The method of claim 4 , wherein the associated utility function of the first edge device is modeled as a cluster of weighted logarithmic functions.

6. The method of claim 1, wherein the optimization algorithm comprises an alternating direction method of multipliers (ADMM) algorithm.

7. The method according to claim 1, further comprising: The optimal value of DFWF is communicated to the corresponding edge device by one or more computer processors.

8. The method according to claim 1, further comprising: In response to a change in an operating parameter of the interconnected distributed network: iteratively processing, by one or more computer processors, the values ​​of the DFWFs for the plurality of edge devices according to an optimization algorithm based on the MWF to identify a new convergence of the values ​​of the DFWFs; And in response to identifying a new convergence, determining the new convergence value of the DFWF as a new optimal value of the DFWF for the plurality of edge devices.

9. A computer program product comprising: One or more computer-readable storage media and program instructions stored on the one or more computer-readable storage media, the stored program instructions comprising: program instructions for determining a maximum write frequency (MWF) for a distributed network; Program instructions for iteratively processing values ​​of a data flow write frequency (DFWF) for a plurality of edge devices of an interconnected distributed network according to an optimization algorithm based on the MWF to identify convergence of the values ​​of the DFWF, wherein each iteration of processing the values ​​comprises: determining, at each edge device, a value of the DFWF based on an associated utility function of the edge device, the utility function defining a measure of the utility of the device that is dependent on the DFWF; and Program instructions for determining a converged value of the DFWF as an optimal value of the DFWF for the edge device in response to identifying convergence.

10. A system comprising: a processing component configured to determine a maximum write frequency MWF for the distributed network; a plurality of edge devices interconnecting a distributed network, wherein each edge device of the plurality of edge devices is configured to determine a value of a data flow write frequency DFWF based on an associated utility function of the respective edge device, the utility function defining a measure of the utility of the device depending on the DFWF; as well as An optimization device is configured to iteratively process the DFWF values ​​for the multiple edge devices according to the MWF-based optimization algorithm to identify the convergence of the DFWF value, and determine the converged value of the DFWF as the optimal value of the DFWF for the edge device in response to identifying the convergence.

11. The system of claim 10, wherein each edge device is configured to determine a utility function for the device and associate the determined utility function with the device.

12. The system of claim 10, wherein the optimization device comprises a non-edge device of the interconnected distributed network and the edge device of the interconnected distributed network.

13. The system of claim 10, wherein a first edge device of the plurality of edge devices has an associated utility function comprising a continuously differentiable non-decreasing concave function.

14. The system of claim 13, wherein the associated utility function of the first edge device is modeled as a cluster of weighted logarithmic functions.

15. The system of claim 10, wherein the optimization algorithm comprises an alternating direction method of multipliers (ADMM) algorithm.

16. The system according to claim 10, wherein the optimization device is further configured to: In response to a change in an operating parameter of the interconnected distributed network: iteratively processing the values ​​of the DFWFs for the plurality of edge devices according to an optimization algorithm based on the MWF to identify a new convergence of the values ​​of the DFWFs; and The new convergence value of the DFWF is determined as a new optimal value of the DFWF for the plurality of edge devices in response to identifying the new convergence. 17 . A computer-readable storage medium storing program instructions, wherein when the program instructions are executed on a computer, the program instructions execute the method according to claim 1 .