US20230239233A1 - System and method for determining the shortest data transfer path in data communication - Google Patents
System and method for determining the shortest data transfer path in data communication Download PDFInfo
- Publication number
- US20230239233A1 US20230239233A1 US17/583,460 US202217583460A US2023239233A1 US 20230239233 A1 US20230239233 A1 US 20230239233A1 US 202217583460 A US202217583460 A US 202217583460A US 2023239233 A1 US2023239233 A1 US 2023239233A1
- Authority
- US
- United States
- Prior art keywords
- data
- data element
- devices
- data transfer
- transformation
- 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.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/122—Shortest path evaluation by minimising distances, e.g. by selecting a route with minimum of number of hops
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/20—Hop count for routing purposes, e.g. TTL
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/22—Alternate routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/24—Multipath
Definitions
- the present disclosure relates generally to data communication, and more specifically to a system and method for determining the shortest data transfer path in data communication.
- the data elements may be communicated from a source device to a destination via multiple hops between multiple devices. Each data element may undergo a transformation at each device before the data element reaches the destination device. In some cases, a data element may be communicated to a device even though the data element is not transformed at that device.
- the system described in the present disclosure is particularly integrated into practical applications of improving data communication and data routing efficiency among computing devices. This, in turn, provides an additional practical application of improving network bandwidth allocation efficiency and utilization. Furthermore, the system described in the present disclosure provides an additional practical application of reducing network congestion. As such, the technology disclosed in the present disclosure improves the data communication technology and underlying operations of network nodes, servers, switches, and routers that communicate data among devices. These practical applications are described below.
- the present disclosure contemplates systems and methods configured to determine the shortest data transfer paths for data elements from a source device to a destination device and communicate each data element using its respective shortest data transfer path.
- the disclosed system may perform one or more of the following operations for each data element.
- the data element may include any type of data/information related to an organization and/or clients of the organization, such as an application form for opening a new account, a user request related to a service and/or a product that the organization provides, etc.
- the disclosed system accesses a set of devices transferring the data element from the source device to the destination device.
- the disclosed system determines the existing and/or historical data transfer path for the data element.
- the disclosed system determines at which devices the data element is transformed—i.e., goes through a transformation type.
- the transformation type may indicate a type of change implemented on the data element.
- the transformation type may include merging, aggregating, normalizing, summarizing, filtering, enriching, splitting, joining, or removing duplicated data operation implemented on the data element.
- the disclosed system also determines at which devices the data element is not transformed—i.e., does not go through any transformation type operation. Based on this information, the disclosed system generates an array that uniquely defines the data element and its transformation type at each device.
- the disclosed system may perform a similar operation for each data element, meaning evaluate each data element at each device and determine whether a data element goes through a transformation type at a given device. Based on this information, the disclosed system determines a device dependency map that represents dependencies and correlations between the set of devices.
- the device dependency map may include data transfer paths of data elements between devices transferring the data elements from the source device to the destination device.
- the disclosed system determines a transformation dependency map that represents a set of transformation types implemented on each data element at a given device from among the devices.
- the disclosed system determines a set of data transfer paths for the data element from the source device to the destination device based on the historical and existing data transfer paths for the data element, the device dependency map, and the transformation dependency map.
- Each of the set of data transfer paths may include a different number of hops between the devices.
- the disclosed system selects the shortest data transfer path for each data element based on the device dependency map and transformation dependency map.
- the shortest data transfer path may correspond to a data transfer path for the data element that includes the least number of hops between the devices.
- the disclosed system may communicate the data element from the source device to the destination device using the shortest data transfer path.
- the disclosed system may reconstruct or revise the current and future communications of the data element according to the shortest data transfer path.
- a system for communicating data elements using the shortest data transfer path among devices comprises a memory and a processor.
- the memory is configured to store one or more data elements.
- the processor is operably coupled with the memory.
- the processor accesses a set of devices transferring the one or more data elements from a source device to a destination device.
- the processor performs one or more following operations for a data element from among the one or more data elements at a given device from among the set of devices.
- the processor determines a transformation type implemented on the data element, wherein the transformation type represents a type of change made to the data element.
- the processor generates an array that uniquely defines the data element, wherein the array comprises the transformation type and an identifier of the given device.
- the processor generates a transformation dependency map that represents a set of transformation types implemented on the data element at different devices from among the set of devices.
- the processor determines a set of data transfer paths for the data element from the source device to the destination device based at least in part upon the transformation dependency map. Each of the set of data transfer paths has a different number of hops between the set of devices.
- the processor selects the shortest data transfer path from among the set of data transfer paths for the data element from the source device to the destination device that corresponds to the least number of hops between devices.
- the processor communicates the data element from the source device to the destination device using the shortest data transfer path.
- the present disclosure contemplates systems and methods configured to split data elements based on their respective transfer paths and transformation types at different devices. For example, the disclosed system determines that a first subset of data elements is transformed in a first subset of devices, and a second subset of data elements is transformed in a second subset of devices.
- the second subset of devices may be different from the first subset of devices.
- the disclosed system determines that the first subset of data elements is transformed using one or more first transformation types, and the second subset of data elements is transformed using one or more second transformation types. Based on this information and the device dependency map and transformation dependency map described above, the disclosed system determines that the plurality of data elements should be split into the first subset of data elements and the second subset of data elements. Thus, the disclosed system splits the plurality of data elements into the first subset of data elements and the second subset of data elements.
- the disclosed system communicates the first subset of data elements using a first transfer path through the first subset of devices, and communicates the second subset of data elements using a second transfer path through the second subset of devices.
- the first data transfer path may correspond to the shortest data transfer path for the first subset of data elements that is determined based on the device dependency map, transformation dependency map, historical and/or existing data transfer paths, etc.
- the second data transfer path may correspond to the shortest data transfer path for the second subset of data elements that is determined based on the device dependency map, transformation dependency map, historical and/or existing data transfer paths, etc.
- a system for splitting data elements based on transformation types at different devices comprises a memory and a processor.
- the memory is configured to store a plurality of data elements.
- the processor accesses a set of devices transferring the plurality of data elements from a source device to a destination device.
- the processor determines that a first subset of data elements from among the plurality of data elements is transformed in a first subset of devices from among the set of devices.
- the processor determines that a second subset of data elements from among the plurality of data elements is transformed in a second subset of devices from among the set of devices, where the second subset of devices is different from the first subset of devices.
- the processor splits the plurality of data elements into the first subset of data elements and the second subset of data elements based at least in part upon the determination that first subset of data elements is transformed in the first subset of devices and the second subset of data elements is transformed in the second subset of devices.
- the processor communicates the first subset of data elements using a first transfer path through the first subset of devices.
- the processor communicates the second subset of data elements using a second transfer path through the second subset of devices.
- the disclosed system provides several practical applications and technical advantages, which include: 1) technology that improves network data routing by determining the shortest data transfer path for a data element from a source device to a destination device based on evaluating the data element at each device, determining whether the data element is transformed at each device using a transformation type; 2) technology that reduces network congestion by communicating the data element only to devices where the data element is transformed using a transformation type; 3) technology that improves network data communication and routing by reconstructing or revising the current and future communications of the data elements according to their respective determined shortest data transfer paths; 4) technology that reduces load processing at each device by splitting data elements based on data transfer paths and transformation types at each device.
- the disclosed system may be integrated into a practical application of improving data communication and data routing efficiency among computing devices. For example, the disclosed system only routes the data element through devices where the data element is transformed using a transformation type and bypasses the data element from (or does not route the data element to) devices where the data element is not transformed using a transformation type. This leads to eliminating or reducing unnecessary communication of the data element to devices where the data element is not transformed.
- the disclosed system improves the network bandwidth utilization efficiency. Furthermore, the unoccupied network bandwidth may be allocated for other data communication. Thus, the disclosed system improves the network bandwidth allocation efficiency. Furthermore, since less network bandwidth will be utilized for communicating the data element, network congestion is reduced. Furthermore, the disclosed system improves the underlying operations of network nodes, servers, switches, and routers that communicate data among devices because processing load is reduced at these devices.
- the disclosed system may be integrated into an additional practical application of reducing processing load at each device by splitting the data elements and routing each data element via devices where the data element is transformed using a transformation type. Because the data elements are split and not every data element is routed to every device, each device only needs to process data that it receives. Thus, the processing load at each device is reduced.
- FIG. 1 illustrates an embodiment of a system configured to communicate data elements using the shortest data transfer path
- FIG. 2 illustrates an example operational flow of the system of FIG. 1 ;
- FIG. 3 illustrates an example flowchart of a method for communicating data elements using the shortest data transfer path
- FIG. 4 illustrates an example flowchart of a method for splitting data elements based on transformation types at different devices
- FIG. 5 illustrates an example use case for determining the shortest data transfer path for each data element
- FIG. 6 illustrates an example use case for determining the shortest data transfer path for each data element.
- FIGS. 1 through 6 are used to describe a system and method for communicating data elements using the shortest data transfer path and splitting a plurality of data elements based on transfer paths and transformation types of the data elements.
- FIG. 1 illustrates one embodiment of a system 100 that is configured to determine the shortest data transfer path 174 for each data element 152 from a source device 120 to a destination device 120 and communicate the data element 152 from the source device 120 to the destination device 120 using the shortest data transfer path 174 .
- system 100 comprises a server 140 communicatively coupled with one or more computing device 120 via a network 110 .
- Network 110 enables the communication between components of the system 100 .
- Server 140 comprises a processor 142 in signal communication with a memory 148 .
- Memory 148 stores software instructions 150 that when executed by the processor 142 , cause the processor 142 to perform one or more functions described herein.
- the processor 142 executes the processing engine 144 to determine 1) which data element(s) 152 is transformed (e.g., modified, added with new data, data removed therefrom, etc.) at which computing device(s) 120 ; 2) determine which data element(s) 152 is not transformed (e.g., remains the same) and is passed through which computing device(s) 120 ; 3) determine transformation dependency map 168 and device dependency map 170 ; 4) based on this information, determine the shortest data transfer path 174 for each data element 152 ; 5) split the data elements 152 according to their data transfer paths 174 and transformation types 160 at different devices 120 ; and 6) communicate the data element 152 from the source device 120 to the destination device 120 using the shortest data transfer path 174 .
- system 100 may not have all of the components listed and/or may have other elements instead of, or in addition to, those listed above.
- a computing device 120 may interchangeably be referred to as a device 120 .
- a large amount of data is communicated between devices 120 associated with the organization 108 .
- a particular data element 152 may be communicated to a device 120 for processing.
- the particular data element 152 is originated from a source computing device 120 a .
- the data element 152 may include any data/information and activates related to clients of the organization 108 , such as opening new accounts, user requests related to a service and/or a product that the organization 108 provides, etc.
- the data element 152 may go through one or more stages at one or more computing devices 120 to reach a destination computing device 120 e .
- the data element 152 may go through a user authentication stage, an initial approval stage, or a revision stage, among others.
- the data element 152 may be transformed or changed—i.e., go through a transformation type 160 .
- additional information may be added to the data element, particular information associated with the data element 152 may be removed, or particular information associated with the data element 152 may be modified or changed.
- the transformation type 160 may indicate merging, aggregating, normalizing, summarizing, filtering, enriching, splitting, joining, or removing duplicated data operation associated with and/or performed on the data element 152 .
- the data element 152 comprises a fillable application form.
- the data element 152 may be transformed at a device 120 b when additional information is added to the application form at the device 120 b .
- the transformation type 160 may comprise a transformation of data element 152 from one data format to another, e.g., from a first data format used by and compatible to a source device 120 a into a second data format required by a destination device 120 e.
- the data element 152 may be communicated to the destination device 120 e , for example, to fulfill the user request associated with the data element 152 .
- the data element 152 may traverse a particular data transfer path 174 from the source device 120 a to the destination device 120 e.
- Different data elements 152 may not need to go through the same stages and the same devices 120 .
- different data elements 152 may not have the same data transfer paths 174 through the same devices 120 .
- a first data element 152 may not be transformed by a transformation type 160 (e.g., data addition, data removal, data modification) at the device 120 b
- a second data element 152 may be transformed by transformation type 160 at the device 120 b .
- the first data element 152 may not have to be communicated to the device 120 b
- the second data element 152 may have to be communicated to the device 120 b.
- One potential approach is to combine all the data elements 152 originated from the device 120 a and use the same data transfer path 174 for communicating the data elements 152 from the source device 120 a to the destination device 120 e .
- this approach suffers from multiple drawbacks, including network congestion in transmitting the data elements 152 as a result of a large volume of data elements 152 and unnecessarily occupying network bandwidth with all of the data elements 152 through the devices 120 a - e.
- system 100 is configured to determine which data element(s) 152 is transformed at which computing device(s) 120 , determine which data element(s) 152 is not transformed at which computing device(s) 120 , determine transformation dependency map 168 and device dependency map 170 , based on this information, determine the shortest data transfer path 174 for each data element 152 , and communicate the data element 152 from the source device 120 to the destination device 120 using the shortest data transfer path 174 .
- system 100 reduces the network congestion and improved data transmission and communication among devices 120 . Furthermore, the system 100 improves the network bandwidth utilization and efficiency in network routing.
- Network 110 may be any suitable type of wireless and/or wired network, including, but not limited to, all or a portion of an Internet, an Intranet, a peer-to-peer network, a switched telephone network, a local area network (LAN), a wide area network (WAN), a metropolitan area network (MAN), a personal area network (PAN), a wireless PAN (WPAN), an overlay network, a software-defined network (SDN), a virtual private network (VPN), a packet data network (e.g., the Internet), a mobile telephone network (e.g., cellular networks, such as 4G or 5G), a plain old telephone (POT) network, a wireless data network (e.g., WiFi, WiGig, WiMax, etc.), a long-term evolution (LTE) network, a universal mobile telecommunications system (UMTS) network, a peer-to-peer (P2P) network, a Bluetooth network, a near field communication (NFC) network, a Zigbee network
- Each of the computing devices 120 a to 120 e is an instance of a computing device 120 .
- Computing device 120 is generally any device that is configured to process data and interact with users. Examples of the computing device 120 include, but are not limited to, a personal computer, a desktop computer, a workstation, a server, a laptop, a tablet computer, a mobile phone (such as a smartphone), etc.
- the computing device 120 may include a user interface, such as a display, a microphone, keypad, or other appropriate terminal equipment usable by a user.
- the computing device 120 may include a hardware processor, memory, and/or circuitry configured to perform any of the functions or actions of the computing device 120 described herein.
- a software application designed using software code may be stored in the memory and executed by the processor to perform the functions of the computing device 120 .
- the computing device 120 is configured to communicate with other devices via the network 110 .
- the computing device 120 may communicate with a device (e.g., other computing devices 120 and the server 140 ).
- the computing devices 120 may be associated with the organization 108 .
- Server Server 140 is generally a device that is configured to process data and communicate with computing devices (e.g., computing devices 120 ), databases, systems, etc., via the network 110 .
- the server 140 may be associated with the organization 108 .
- the server 140 is generally configured to oversee the operations of the processing engine 144 , as described further below in conjunction with the operational flow 200 of system 100 described in FIG. 2 , method 300 described in FIG. 3 , method 400 described in FIG. 4 , and use cases described in FIGS. 5 and 6 .
- Processor 142 comprises one or more processors operably coupled to the memory 148 .
- the processor 142 is any electronic circuitry, including, but not limited to, state machines, one or more central processing unit (CPU) chips, logic units, cores (e.g., a multi-core processor), field-programmable gate arrays (FPGAs), application-specific integrated circuits (ASICs), or digital signal processors (DSPs).
- CPU central processing unit
- cores e.g., a multi-core processor
- FPGAs field-programmable gate arrays
- ASICs application-specific integrated circuits
- DSPs digital signal processors
- processors 142 may be implemented in cloud devices, servers, virtual machines, and the like.
- the processor 142 may be a programmable logic device, a microcontroller, a microprocessor, or any suitable combination of the preceding.
- the one or more processors are configured to process data and may be implemented in hardware or software.
- the processor 142 may be 8-bit, 16-bit, 32-bit, 64-bit, or of any other suitable architecture.
- the processor 142 may include an arithmetic logic unit (ALU) for performing arithmetic and logic operations, registers the supply operands to the ALU and store the results of ALU operations, and a control unit that fetches instructions from memory and executes them by directing the coordinated operations of the ALU, registers and other components.
- ALU arithmetic logic unit
- the one or more processors are configured to implement various instructions.
- the one or more processors are configured to execute instructions (e.g., software instructions 150 ) to implement the processing engine 144 .
- processor 142 may be a special-purpose computer designed to implement the functions disclosed herein.
- the processor 142 is implemented using logic units, FPGAs, ASICs, DSPs, or any other suitable hardware.
- the processor 142 is configured to operate as described in FIGS. 1 - 6 .
- the processor 142 may be configured to perform one or more operations of method 300 as described in FIG. 3 and one or more operations of method 400 described in FIG. 4 .
- Network interface 146 is configured to enable wired and/or wireless communications.
- the network interface 146 may be configured to communicate data between the server 140 and other devices, systems, or domains.
- the network interface 146 may comprise an NFC interface, a Bluetooth interface, a Zigbee interface, a Z-wave interface, a radio-frequency identification (RFID) interface, a WIFI interface, a LAN interface, a WAN interface, a MAN interface, a PAN interface, a WPAN interface, a modem, a switch, and/or a router.
- the processor 142 may be configured to send and receive data using the network interface 146 .
- the network interface 146 may be configured to use any suitable type of communication protocol as would be appreciated by one of ordinary skill in the art.
- the memory 148 may be volatile or non-volatile and may comprise read-only memory (ROM), random-access memory (RAM), ternary content-addressable memory (TCAM), dynamic random-access memory (DRAM), and static random-access memory (SRAM).
- the memory 148 may include one or more of a local database, cloud database, network-attached storage (NAS), etc.
- the memory 148 comprises one or more disks, tape drives, or solid-state drives, and may be used as an over-flow data storage device, to store programs when such programs are selected for execution, and to store instructions and data that are read during program execution.
- the memory 148 may store any of the information described in FIGS.
- the memory 148 may store software instructions 150 , data elements 152 , data sets 154 , arrays 156 , transformation dependency map 168 , device dependency map 170 , machine learning module 166 , historical (and/or existing) data transfer paths 172 , data transfer paths 174 , data transformation paths 176 , predefined rules 178 , and/or any other data or instructions.
- the software instructions 150 may comprise any suitable set of instructions, logic, rules, or code operable to execute the processor 142 and perform the functions described herein, such as some or all of those described in FIGS. 1 - 6 .
- Processing engine 144 may be implemented by the processor 142 executing the software instructions 150 , and is generally configured to perform one or more operations described herein.
- the processing engine 144 may be configured to determine 1) existing and/or historical data transfer paths 172 of data elements 152 between devices 120 a to 120 e; 2) which data element(s) 152 is transformed (e.g., modified, added with new data, data removed therefrom, etc.) at which computing device(s) 120 ; 3) determine which data element(s) 152 is not transformed (e.g., remains the same) and is passed through which computing device(s) 120 ; 4) determine transformation dependency map 168 and device dependency map 170 ; 5) based on this information, determine the shortest data transfer path 174 for each data element 152 ; and 6) communicate the data element 152 from the source device 120 to the destination device 120 using the shortest data transfer path 174 .
- the operations of the processing engine 144 are described in greater detail in the operational flow 200 of system 100 described in FIG. 2 , method 300
- the processing engine 144 may be implemented by supervised machine learning, semi-supervised machine learning, and/or unsupervised machine learning algorithm.
- the machine learning module 166 may comprise a support vector machine, neural network, random forest, k-means clustering, etc.
- the machine learning module 166 may be implemented by a plurality of neural network (NN) layers, Convolutional NN (CNN) layers, Long-Short-Term-Memory (LSTM) layers, Bidirectional LSTM layers, Recurrent NN (RNN) layers, and the like.
- NN neural network
- CNN Convolutional NN
- LSTM Long-Short-Term-Memory
- RNN Recurrent NN
- the processing engine 144 may implement the machine learning module 166 to determine which data element(s) 152 is not transformed at which computing device(s) 120 , determine transformation dependency map 168 and device dependency map 170 , and based on this information, determine the shortest data transfer path 174 for each data element 152 .
- the processing engine 144 may identify historical and/or existing data transfer paths 17 of data elements 152 between devices 120 .
- the processing engine 144 may access each device 120 identify data elements 152 at each device 120 .
- the processing engine 144 may identify data transfer paths 172 of data elements 152 between devices 120 based on historical data transfer paths 174 of the data elements 152 between the devices 120 .
- An example illustration of historical and/or existing data transfer paths 172 of data elements 152 between devices 120 is shown in FIG. 2 .
- FIG. 1 describes determining data transfer paths 174 for data elements between devices 120 a to 120 e
- system 100 may be configured to determine data transfer paths 174 for data elements 152 between any number of devices 120 .
- FIG. 2 illustrates an example operational flow 200 of system 100 of FIG. 1 for communicating the data elements 152 using their respective shortest data transfer path 174 .
- the operational flow 200 may begin when the processing engine 144 identifies the historical and/or existing data transfer paths 172 of data elements 152 between devices 120 a to 120 e.
- the devices 120 a to 120 e are transferring one or more data elements 152 from a source device 120 a to a destination device 120 e .
- the processing engine 144 may identify the historical and/or existing data transfer paths 172 of data elements 152 between the devices 120 a to 120 e by accessing each of the devices 120 a to 120 e and determining data elements 152 at each data element 152 .
- the processing engine 144 may access each device 120 a to 120 e via the network 110 .
- the processing engine 144 determines the status of each data element 152 at each device 120 a to 120 e .
- the status of each data element 152 may indicate whether the data element 152 is being transformed (e.g., changed) and a type of a transformation implemented on the data element 152 (e.g., a transformation type 160 implemented on the data element 152 ).
- the processing engine 144 may perform one or more of the following operations for each data element 152 at a given device 120 from among the set of devices 120 a to 120 e.
- the processing engine 144 determines a transformation type 160 implemented on the data element 152 .
- the transformation type 160 may represent a type of change made to the data element 152 .
- the transformation type 160 may comprise an addition to the data element 152 , a reduction from the data element 152 , or a modification of the data element 152 , similar to that described in FIG. 1 .
- the transformation type 160 may comprise transformation details associated with the data element 152 , e.g., what has been changed, modified, and/or transformed in the data element 152 .
- the transformation type 160 may indicate merging, aggregating, normalizing, summarizing, filtering, enriching, splitting, joining, or removing duplicated data operations associated with and/or performed on the data element 152 .
- the transformation type 160 may comprise a transformation of data element 152 from one data format to another, e.g., from a first data format used by and compatible to a source device 120 a into a second data format required by a destination device 120 e.
- the processing engine 144 may evaluate the status of the data element 152 at the input buffer of the particular device 120 , the change made to the data element 152 at the particular device 120 , and evaluate the status of the data element 152 in the output buffer of the particular device 120 .
- the processing engine 144 identifies the device 120 where the transformation type 160 is implemented on the data element 152 .
- the processing engine 144 generates an array 156 that uniquely identifies the data element 152 at the given device 120 .
- the data type 162 may comprise a number, a character, a character string, a composite type, or any combination thereof.
- the composite data type may include a list, an array, a matrix, etc.
- an example array 156 identifying a data element 152 ( i ) at a device 120 ( j ) is represented according to equation (1):
- T i,j ( n i ,y i ,t i ,s j ) Equation (1)
- T i,j represents the array 156
- n i represents the data element name 158
- y i represents transformation type 160
- s j represents the device 120 .
- the processing engine 144 may generate multiple arrays 156 for each data element 152 at different devices 120 representing the transformation type 160 that the data element 152 experiences at different devices 120 .
- the processing engine 144 may perform a similar operation for each data element 152 at each device 120 a to 120 e.
- the processing engine 144 accesses the device 120 a , identifies that the data elements 152 a are being processed by the device 120 a , and determines one or more first transformation types 160 that each data element 152 a is experiencing.
- the processing engine 144 accesses the device 120 b , identifies that the data elements 152 b are being processed by the device 120 b , and determines one or more second transformation types 160 that each data element 152 b is experiencing.
- the data elements 152 b may correspond to the data elements 152 a after the first one or more transformation types 160 implemented on the data elements 152 a .
- the processing engine 144 accesses the device 120 c , identifies that the data elements 152 c are being processed by the device 120 c , and determines a third one or more transformation types 160 that each data element 152 c is experiencing.
- the data elements 152 c may correspond to the data elements 152 b after the second one or more transformation types 160 implemented on the data elements 152 b .
- the processing engine 144 accesses the device 120 d , identifies that the data elements 152 d are being processed by the device 120 d , and determines a fourth one or more transformation types 160 that each data element 152 d is experiencing.
- the data elements 152 d may correspond to the data elements 152 c after the third one or more transformation types 160 implemented on the data element 152 c .
- the processing engine 144 accesses the destination device 120 e , identifies the data elements 152 e at the destination device 120 e , and determines the changes made to the data elements 152 e .
- the data elements 152 e may correspond to the data elements 152 d after the fourth one or more transformation types 160 implemented on the data elements 152 d.
- the processing engine 144 determines which data element(s) 152 is transformed at which computing device(s) 120 and which data element(s) 152 is not transformed at which computing device(s) 120 .
- the processing engine 144 uses this information in determining the transformation dependency map 168 and the device dependency map 170 .
- the processing engine 144 generates data sets 154 comprising data elements 152 at each device 120 .
- the processing engine 144 defines each data set 154 at a given device 120 in terms of data elements 152 that are transformed (e.g., using a transformation type 160 ) and data elements 152 that are not transformed.
- an example data set 154 (DS) at the device 120 ( i ) may be represented according to equation (2).
- DS i represents all the data elements 152 at the device 120 ( i )
- DT i represents transformed data elements 152 (e.g., using a transformation type 160 ) at the device 120 ( i )
- notation ( ⁇ ) represents a set intersection function
- notation ( ⁇ ) represents a union function
- notation ( ⁇ ) represent a deduction function.
- notation (DS i ⁇ DT i ) represents the set intersection of all data elements 152 and the transformation data elements 152 (e.g., using a transformation type 160 ).
- Notation (DS i ⁇ DT i ) represents all data elements 152 (DS i ) except the transformed data elements 152 (DT i ), meaning data elements 152 that are not transformed at the device 120 ( i ), i.e., data elements 152 are passing through the devices 120 ( i ) without change.
- the processing engine 144 may determine data sets 154 of data elements 152 at each device 120 using the equation (2). The processing engine 144 uses this information in determining the transformation dependency map 168 and the device dependency map 170 .
- the processing engine 144 determines a device dependency map 170 by feeding the arrays 156 indicating transformation types 160 of data elements 152 at each device 120 (according to equation (1)) and the status of the data elements 152 and data sets 154 at each device 120 (according to equation (2)) to the machine learning module 166 .
- the machine learning module 166 uses the input data to determine the data transfer paths 174 of the data elements 152 between devices 120 a to 120 e.
- the data transfer path 174 of a data element 152 goes through devices 120 where the data element 152 is transformed using a transformation type 160 .
- the processing engine 144 excludes or removes device(s) 120 where the data element 152 is not transformed from the data transfer path 174 of the data element 152 . For example, if the processing engine 144 determines that the data element 152 is passed through a particular device 120 without being transformed using a transformation type 160 , the processing engine 144 removes the particular device 120 from the data transfer paths 174 for the data element 152 .
- the device dependency map 170 may represent dependencies and correlations between devices 120 .
- the processing engine 144 e.g., via the machine learning module 166 ) may determine that a first set of data elements 152 - 1 from among the data elements 152 a (at the source device 120 a ) are only transformed at the source device 120 a (using a transformation type 160 ) and are not transformed (using a transformation type 160 ) at devices 120 b , 120 c , and 120 d .
- the processing engine 144 may determine that the first set of data elements 152 - 1 may be communicated from the source device 120 a to the destination device 120 e .
- the processing engine 144 may determine a transfer path 174 - 1 for the first set of data elements 152 - 1 is from the source device 120 a to the destination device 120 e.
- the processing engine 144 may determine that a second set of data elements 152 - 2 from among the data element 154 a (at the source device 120 a ) are only transformed (using a transformation type 160 ) at devices 120 a , 120 b , and 120 d and not transformed (using a transformation type 160 ) at device 120 c .
- the processing engine 144 may determine that the transfer path 174 - 2 for the second set of data elements 152 - 2 is through devices 120 a , 120 b , 120 d , and 120 e.
- the processing engine 144 may determine that a third set of data elements 152 - 3 from among the data elements 152 a (at the source device 120 a ) are only transformed (using a transformation type 160 ) at devices 120 a and 120 c and not transformed (using a transformation type 160 ) at devices 120 b and 120 d .
- the processing engine 144 may determine that the transfer path 174 - 3 for the third set of data elements 152 - 3 is through devices 120 a , 120 c , and 120 e.
- the processing engine 144 may split the data elements 152 a into the first set of data elements 152 - 1 , the second set of data elements 152 - 2 , and the third set of data elements 152 - 3 based on the determination of whether each data element 152 from among the data elements 152 a is transformed using a transformation type 160 at each device 120 .
- the processing engine 144 may proceed to determine the data transfer paths 174 - 1 , 174 - 2 , and 174 - 3 for the sets of data elements 152 - 1 , 152 - 2 , and 152 - 3 , respectively.
- the processing engine 144 determines a transformation dependency map 168 by feeding the arrays 156 indicating transformation types 160 of data elements 152 at each device 120 (according to equation (1)) and the status of the data elements 152 and data sets 154 at each device 120 (according to equation (2)) to the machine learning module 166 .
- the machine learning module 166 uses the input data to determine the data transfer paths 174 and data transformation paths 176 of the data elements 152 between devices 120 a to 120 e .
- the data transformation path 176 of a data element 152 indicates what transformation types 160 the data element 152 goes through at each device 120 .
- the transformation dependency map 168 of a particular data element 152 may represent dependencies and correlations among the set transformation types 160 implemented on the particular data element 152 at different devices 120 .
- the transformation dependency map 168 of a particular data element 152 may represent the set transformation types 160 implemented on the particular data element 152 at different devices 120 .
- an example transformation dependency map 168 of a particular data element 152 is shown.
- the example transformation dependency map 168 includes stages T1 to T4 where a data element 152 is transformed using a transformation type 160 .
- T 1,1 ( n 1 ,y 1 ,t 1 ,s 1 ) equation (3)
- the data element 152 with the data element name 158 represented by “n 1 ” and data type 162 “t 1 ” is transformed using a first transformation type 160 (represented by “y 1 ”) at device 120 a (represented by “S 1 ”).
- T 1,2 ( n 1 ,y 1 ,t 1 ,s 2 ) equation (4)
- the data element 152 with the data element name 158 represented by “n 1 ” and data type 162 “t 1 ” is transformed using a second transformation type 160 (represented by “y 2 ”) at device 120 b (represented by “S 2 ”).
- T 1,3 ( n 1 ,y 1 ,t 1 ,s 3 ) equation (5)
- the data element 152 with the data element name 158 represented by “n 1 ” and data type 162 “t 1 ” is transformed using a third transformation type 160 (represented by “y 1 ”) at device 120 c (represented by “S 3 ”).
- T 1,4 ( n 1 ,y 1 ,t 1 ,s 4 ) equation (6)
- the data element 152 with the data element name 158 represented by “n 1 ” and data type 162 “t 1 ” is transformed using a fourth transformation type 160 (represented by “y 1 ”) at device 120 d (represented by “S 4 ”).
- the lines between the stages T1 to T4 represent dependencies and correlations between the transformations of the data element 152 at devices 120 a to 120 e , i.e., the data transformation paths 176 of the data element 152 .
- the processing engine 144 may use the transformation dependency map 168 , the device dependency map 170 , and historical and existing data transfer paths 172 to determine a set of data transfer paths 174 for the data element 152 from the source device 120 a to the destination device 120 e .
- Each of the set of data transfer paths 174 may have a different number of hops between the set of devices 120 , similar to that described above with respect to transfer paths 174 - 1 to 174 - 3 .
- the processing engine 144 determines the shortest data transfer path 174 from among the set of data transfer paths 174 for the data element 152 from the source device 120 a to the destination device 120 e that corresponds to the least number of hops between devices 120 .
- the data element 152 may only be communicated to device(s) 120 where a transformation type 160 is implemented on the data element 152 .
- This obviates unnecessary batch data element 152 routing between all devices 120 .
- network congestion is reduced, data transmission and communication efficiency are improved, and network bandwidth is improved.
- the processing engine 144 may determine the shortest data transfer path 174 further based on the predefined rule 178 .
- the predefined rule 178 may indicate selecting a data transformation path 176 that maximizes data security and data quality for the data element 152 .
- the processing engine 144 may determine the shortest data transfer path 174 such that it corresponds to and/or includes the least number of hops between devices and maximizes data security and data quality for the data element 152 .
- the processing engine 144 may identify a particular data transfer path 174 from among the two data transfer paths 174 based on the predefined rule 178 such that the selected data transfer path 174 maximizes data security and data quality. Similarly, the processing engine 144 may determine a data transfer path 174 (e.g., the data transfer paths 174 - 1 , 174 - 2 , and 174 - 3 described above) based on the predefined rule 178 .
- the processing engine 144 may also determine the shortest transformation path 176 for the data element 152 from the source device 120 a to the destination device 120 e based on the transformation dependency map 168 , the device dependency map 170 , and historical and existing data transfer paths 172
- the shortest transformation path 176 for the data element 152 may further be determined according to the predefined rules 178 and the number of hops between the devices 120 .
- a first data transformation path 176 a for the data element 152 is from device 120 a to device 120 c
- a second data transformation path 176 b for the data element 152 is from device 120 a to device 120 b to device 120 d.
- the processing engine 144 determines which of the data transformation paths 176 a or 176 b should be selected for the data element 152 based on the predefined rule 178 and the number of hops between the devices 120 .
- the processing engine 144 communicates each data element 152 from the source device 120 a to the destination device 120 e using its determined shortest data transfer path 174 .
- the processing engine 144 may identify a particular data transmission path 176 from among the two data transmission paths 176 based on the predefined rule 178 such that the selected data transmission path 176 maximizes data security and data quality.
- the processing engine 144 determines the shortest data transfer path 174 and shortest data transformation path 176 for each data element 152 from the source device 120 a to the destination device 120 e .
- the processing engine 144 performs data communication for each data element 152 using its determined shortest data transfer path 174 .
- the processing engine 144 reconstructs or revises the current data transmission of the data element 152 that is not using the respective shortest data transfer path 174 .
- FIG. 3 illustrates an example flowchart of a method 300 configured to determine the shortest data transfer path 174 for each data element 152 from a source device 120 to a destination device 120 and communicate the data element 152 from the source device 120 to the destination device 120 using the shortest data transfer path 174 .
- Method 300 may include more, fewer, or other steps. For example, steps may be performed in parallel or in any suitable order. While at times discussed as the system 100 , server 140 , or components of any of thereof performing operations, any suitable system or components of the system may perform one or more operations of the method 300 .
- one or more operations of method 300 may be implemented, at least in part, in the form of software instructions 150 of FIG.
- non-transitory, tangible, machine-readable media e.g., memory 148 of FIG. 1
- processors e.g., processor 142 of FIG. 1
- operations 302 - 328 e.g., operations 302 - 328 .
- the processing engine 144 access a set of devices 120 transferring one or more data elements 152 from a source device 120 a to a destination device 120 e .
- the processing engine 144 may access the devices 120 a to 120 e that transfer data elements 152 from the source device 120 a to the destination device 120 e , via the network 110 .
- the processing engine 144 may determine historical and existing data transfer paths 172 for the one or more data elements 152 from the source device 120 a to the destination device 120 e.
- the processing engine 144 selects a device 120 from among the set of devices 120 .
- the processing engine 144 may iteratively select a device 120 until no device 120 is left for evaluation.
- the processing engine 144 selects a data element 152 at the selected device 120 .
- the processing engine 144 may iteratively select a data element 152 at the selected device 120 until no data element 152 at the selected device 120 is left for evaluation.
- the processing engine 144 determines a transformation type 160 implemented on the data element 152 .
- the transformation type 160 may represent a type of change made to the data element 152 . Examples of the transformation type 160 are discussed in FIGS. 1 and 2 .
- the processing engine 144 generates an array 156 that uniquely defines the data element 152 .
- the array 156 may be represented by multiple variables in a tuple.
- the array 156 may comprise the name of the data element 152 (i.e., data element name 158 ), the transformation type 160 , a data type 162 associated with the data element 152 , and an identifier of the device 120 (i.e., device name 164 ).
- An example representation of array 156 is discussed in FIG. 2 with respect to equation (1).
- the processing engine 144 determines whether to select another data element 152 .
- the processing engine 144 determines to select another data element 152 if at least one data element 152 in the selected device 120 is left for evaluation. If the processing engine 144 determines to select another data element 152 , method 300 returns to 306 . Otherwise, method 300 proceeds to step 314 .
- the processing engine 144 determines whether to select another device 120 .
- the processing engine 144 determines to select another device 120 if at least one device 120 is left for evaluation. If the processing engine 144 determines to select another device 120 , method 300 returns to 304 . Otherwise, method 300 proceeds to step 316 .
- the processing engine 144 generates a device dependency map 170 that represents dependencies between the set of devices 120 .
- the processing engine 144 may follow the operational flow 200 described in FIG. 2 to generate the device dependency map 170 .
- the processing engine 144 generates a transformation dependency map 168 that represents a set of transformation types 160 implemented on each data element 152 at different devices 120 .
- the processing engine 144 may follow the operational flow 200 described in FIG. 2 to generate the transformation dependency map 168 .
- the processing engine 144 selects a data element 152 from among the one or more data elements 152 .
- the processing engine 144 may iteratively select a data element 152 until no data element 152 is left for evaluation.
- the processing engine 144 determines a set of data transfer paths 174 for the data element 152 from the source device 120 a to the destination device 120 e based on the device dependency map 170 and the transformation dependency map 168 , similar to that described in FIG. 2 .
- each of the set of data transfer paths 174 may have a different number of hops between the devices 120 .
- the processing engine 144 determines the shortest data transfer path 174 for the data element 152 from the source device 120 a to the destination device 120 e , similar to that described in FIG. 2 .
- the shortest data transfer path 174 may have the least number of hops between the devices 120 .
- the processing engine 144 communicates the data element 152 from the source device 120 a to the destination device 120 e using the shortest data transfer path 174 .
- the processing engine 144 may reconstruct the data transmission of the data element 152 for future data transmissions from the source device 120 a to the destination device 120 e using the shortest data transfer path 174 .
- the processing engine 144 determines whether to select another data element 152 .
- the processing engine 144 determines to select another data element 152 if at least one data element 152 from among the one or more data elements 152 is left for evaluation. If the processing engine 144 determines to select another data element 152 , method 300 returns to 320 . Otherwise, method 300 is ended.
- FIG. 4 illustrates an example flowchart of a method 400 configured to split data elements 152 for transferring from a source device 120 to a destination device 120 . Modifications, additions, or omissions may be made to method 400 .
- Method 400 may include more, fewer, or other steps. For example, steps may be performed in parallel or in any suitable order. While at times discussed as the system 100 , server 140 , or components of any of thereof performing operations, any suitable system or components of the system may perform one or more operations of the method 400 .
- one or more operations of method 400 may be implemented, at least in part, in the form of software instructions 150 of FIG. 1 , stored on non-transitory, tangible, machine-readable media (e.g., memory 148 of FIG. 1 ) that when run by one or more processors (e.g., processor 142 of FIG. 1 ) may cause the one or more processors to perform operations 402 - 428 .
- processors e.g., processor 142 of FIG. 1
- the processing engine 144 access a set of devices 120 transferring a plurality of data elements 152 from a source device 120 a to a destination device 120 e .
- the processing engine 144 may access the devices 120 a to 120 e that transfer data elements 152 from the source device 120 a to the destination device 120 e , via the network 110 .
- the processing engine 144 may determine historical and existing data transfer paths 172 for the one or more data elements 152 from the source device 120 a to the destination device 120 e.
- the processing engine 144 selects a device 120 from among the set of devices 120 .
- the processing engine 144 may iteratively select a device 120 until no device 120 is left for evaluation.
- the processing engine 144 selects a data element 152 at the selected device 120 .
- the processing engine 144 may iteratively select a data element 152 at the selected device 120 until no data element 152 at the selected device 120 is left for evaluation.
- the processing engine 144 determines a transformation type 160 implemented on the data element 152 .
- the transformation type 160 may represent a type of change made to the data element 152 . Examples of the transformation type 160 are discussed in FIGS. 1 and 2 .
- the processing engine 144 generates an array 156 that uniquely defines the data element 152 .
- the array 156 may be represented by multiple variables in a tuple.
- the array 156 may comprise the name of the data element 152 (i.e., data element name 158 ), the transformation type 160 , a data type 162 associated with the data element 152 , and an identifier of the device 120 (i.e., device name 164 ).
- An example representation of array 156 is discussed in FIG. 2 with respect to equation (1).
- the processing engine 144 determines whether to select another data element 152 .
- the processing engine 144 determines to select another data element 152 if at least one data element 152 in the selected device 120 is left for evaluation. If the processing engine 144 determines to select another data element 152 , method 400 returns to 406 . Otherwise, method 400 proceeds to step 414 .
- the processing engine 144 determines whether to select another device 120 .
- the processing engine 144 determines to select another device 120 if at least one device 120 is left for evaluation. If the processing engine 144 determines to select another device 120 , method 400 returns to 404 . Otherwise, method 400 proceeds to step 416 .
- the processing engine 144 generates a device dependency map 170 that represents dependencies between the set of devices 120 .
- the processing engine 144 may follow the operational flow 200 described in FIG. 2 to generate the device dependency map 170 .
- the processing engine 144 generates a transformation dependency map 168 that represents a set of transformation types 160 implemented on each data element 152 at different devices 120 .
- the processing engine 144 may follow the operational flow 200 described in FIG. 2 to generate the transformation dependency map 168 .
- the processing engine 144 determines that a first subset of data elements 152 is transformed in a first subset of devices 120 .
- the processing engine 144 may determine that the first subset of data elements 152 is transformed in the first subset of devices 102 based on the transformation dependency map 168 , device dependency map 170 , historical and/or existing data transfer paths 172 , and transformation types 160 associated with the first subset of data elements 152 .
- the processing engine 144 determines that a second subset of data elements 152 is transformed in a second subset of devices 120 .
- the processing engine 144 may determine that the second subset of data elements 152 is transformed in the second subset of devices 102 based on the transformation dependency map 168 , device dependency map 170 , historical and/or existing data transfer paths 172 , and transformation types 160 associated with the second subset of data elements 152 .
- the second subset of data elements 152 may be different from the first subset of data elements 152 .
- the second subset of data elements 152 may have at least one data element 152 overlapping with the first subset of data elements 152 . In such cases, the processing engine 144 may implement the operation described in the operational flow 200 in FIG. 2 to determine the shortest data transfer path 176 for the overlapping data element 152 .
- the processing engine 144 splits the plurality of data elements 152 into the first subset of data elements 152 and the second subset of data elements 152 .
- the processing engine 144 may split the plurality of data elements 152 into the first subset of data elements 152 and the second subset of data elements 152 based at least the determinations in 420 to 422 , including the determination that the first subset of data elements i 152 s transformed in the first subset of devices 120 and the second subset of data elements 152 is transformed in the second subset of devices 120 and the determination that the first set of data elements 152 is transformed using the one or more first transformation types 160 and the second set of data elements 152 is transformed using the one or more second transformation types 160 .
- the one or more first transformation types 160 may be different from the one or more second transformation 160 .
- processing engine 144 splits the plurality of data elements 152 into the first subset of data elements 152 and the second subset of data elements 152 based at least on their respective transformation types 160 at different devices 120 .
- processing engine 144 splits the plurality of data elements 152 into the first subset of data elements 152 and the second subset of data elements 152 based at least on the shortest data transfer path 174 for each data element 152 that is determined similar to that described in FIGS. 1 and 2 .
- the processing engine 144 communicates the first subset of data elements 152 using a first data transfer path 174 through the first subset of devices 120 , similar to that described in FIG. 2 .
- the first data transfer path 174 may correspond to the shortest data transfer path 174 for the first subset of data elements 152 that is determined similar to that described in FIG. 2 .
- the processing engine 144 communicates the second subset of data elements 152 using a second data transfer path 174 through the second subset of devices 120 , similar to that described in FIG. 2 .
- the second data transfer path 174 may correspond to the shortest data transfer path 174 for the second subset of data elements 152 that is determined similar to that described in FIG. 2 .
- FIG. 5 illustrates an example operational flow 500 for determining the shortest data transfer paths 174 for data elements 152 in a particular use case.
- the operational flow 500 begins when the processing engine 144 accesses the set of devices 120 , similar to that described in FIG. 2 .
- the processing engine 144 determines historical and/or existing data transfer paths 172 .
- the processing engine 144 determines the data elements 152 at each device 120 .
- An example table illustrating the existing data transfer paths 172 for data elements 152 is shown in Table 1.
- Each data element 152 and/or dataset 154 may be associated with a key (e.g., an identifier or a flag) that is used to identify the data element 152 and/or dataset 154 .
- a key e.g., an identifier or a flag
- S1 represents device 120 a
- S2 represents device 120 b
- S3 represents device 120 c
- S4 represents device 120 d
- D1 represents destination device 120 e
- data elements 152 - 1 to 152 - 5 are transmitted from device 120 a to device 120 b
- data elements 152 - 1 to 152 - 6 are transmitted from device 120 b to device 120 c
- data elements 152 - 1 to 152 - 7 are transmitted from device 120 c to device 120 d
- data elements 152 - 1 to 152 - 8 are transmitted from device 120 d to device 120 e .
- the processing engine 144 uses this information to generate array 156 and datasets 154 , similar to that described in FIG. 2 .
- Table 2 illustrates example arrays 156 and datasets 154 for the data elements 152 at each device 120 a to 120 d .
- Each row in Table 2 may correspond to a dataset 154 of data elements 152 at each device 120 .
- T( 152 - 1 , nil, y, S1) corresponds to an array 156 representing data element 152 - 1 at device 120 a (noted at S1).
- 152 - 1 represents the data element name 158
- nil represents that no transformation type 160 is implemented on this data element 152
- y represents data type 162
- S1 represents device name 164 of the device 120 a .
- other arrays 156 represent the other data elements 152 .
- nil in any array 156 represents that no transformation type 160 is implemented.
- each array 156 for each data element 152 is represented by T (data element name 158 , transformation type 160 , data type 162 , and device name 164 ).
- T( 152 - 6 , t( 152 - 4 , 152 - 5 ), y, S2) corresponds to an array 156 that represents data element 152 - 6 at device 120 b (noted as S2).
- 152 - 6 represents the data element name 158
- t( 152 - 4 , 152 - 5 ) represents a transformation type 160 implemented on data elements 152 - 4 and 154 - 5 that produces the data element 152 - 6
- y represents data type 162
- S2 represents device name 164 of the device 120 b .
- This transformation type 160 occurs at device 120 b.
- T( 152 - 7 , t( 152 - 1 ), y, S3) corresponds to an array 156 that represents data element 152 - 7 at device 120 c (noted as S3).
- 152 - 7 represents the data element name 158
- t( 152 - 1 ) represents a transformation type 160 implemented on data elements 152 - 1 that produces the data element 152 - 7
- y represents data type 162
- S3 represents device name 164 of the device 120 c .
- This transformation type 160 occurs at device 120 c.
- T( 152 - 8 , t( 152 - 7 ), y, S4) corresponds to an array 156 that represents data element 152 - 8 at device 120 d (noted as S4).
- 152 - 8 represents the data element name 158
- t( 152 - 7 ) represents a transformation type 160 implemented on data elements 152 - 7 that produces the data element 152 - 8
- y represents data type 162
- S3 represents device name 164 of the device 120 d .
- This transformation type 160 occurs at device 120 d.
- the processing engine 144 feeds this information to the machine learning module 166 .
- the machine learning module 166 analyzes this information and determines which data element(s) 152 are transformed at which device(s) 120 and which data element(s) 152 are not transformed at which device(s) 120 . For example, the machine learning module 166 determines data elements 152 that are transformed and not transformed at device 120 a and 120 b , similar to that shown in Table 3.
- S2 ⁇ S1 represents data elements 152 that are not transformed at S1 (i.e., device 120 a ). In other words, S2 ⁇ S1 represents an intersection of data elements 152 between device 120 a and 120 b .
- S2-S1 represents data element 152 that is transformed and/or generated at S2 (i.e., device 120 b ). In other words, S2-S1 may represent data elements 152 in device 120 b but not in device 120 a .
- the machine learning module 166 determines data elements 152 that are transformed at devices 120 b and 120 c , similar to that shown in Table 4.
- S3 ⁇ S2 represents data elements 152 that are not transformed at S2 (i.e., device 120 b ). In other words, S3 ⁇ S2 represent an intersection of data elements 152 between device 120 b and 120 c .
- S3 ⁇ S2 ⁇ S1 represents data elements 152 that are not transformed at S1 (i.e., device 120 b ).
- S3-S2 represents data elements 152 that are transformed and/or generated at S3 (i.e., device 120 c ). In other words, S3 ⁇ S2 ⁇ S1 represent an intersection of data elements 152 between device 120 b to 120 c .
- S3-S2 represents data element 152 that is transformed and/or generated at S3 (i.e., device 120 c ).
- S3-S2 may represent data elements 152 in device 120 c but not in device 120 b .
- the machine learning module 166 determines data elements 152 that are transformed at devices 120 b to 120 d , similar to that shown in Table 5.
- S4 ⁇ S3 represents data elements 152 that are not transformed at S3 (i.e., device 120 c ). In other words, S4 ⁇ S3 represents an intersection of data elements 152 between device 120 c and 120 d .
- S4 ⁇ S3 ⁇ S2 represents data elements 152 that are not transformed at S2 (i.e., device 120 b ). In other words, S4 ⁇ S3 ⁇ S2 represents an intersection of data elements 152 between device 120 b to 120 d .
- S4 ⁇ S3 ⁇ S2 ⁇ S1 represents data elements 152 that are not transformed at S1 (i.e., device 120 a ).
- S4 ⁇ S3 ⁇ S2 ⁇ S1 represents an intersection of data elements 152 between device 120 a to 120 d .
- S4-S3 represents a data element 152 that is transformed and/or generated at S4 (i.e., device 120 d ).
- S4-S3 may represent data elements 152 in device 120 d but not in device 120 c .
- the processing engine 144 determines the dependencies between the devices 120 a to 120 d , similar to that shown in Table 6.
- S1 i.e., device 120 a
- S2 i.e., device 120 b
- S3 i.e., device 120 c
- S1 i.e., device 120 a
- S4 i.e., device 120 d
- S3 i.e., device 120 c
- the data elements 152 that depend on particular devices 120 are shown in Table 6.
- the processing engine 144 determines the transformation tree 510 .
- the transformation tree 510 represents dependencies between devices 120 a to 120 d .
- the transformation tree 510 is a graphical representation of Table 6.
- the processing engine 144 determines the transformation dependency map 168 , dependency tree 520 , and device dependency map 170 , similar to that described in FIG. 2 .
- the transformation dependency map 168 represents which data elements 152 are transformed at which devices 120 and which data elements 152 are not transformed at which devices 120 .
- the data element 152 - 7 (generated at device 120 c ) depends on data element 152 - 1
- data element 152 - 6 (generated at device 120 b ) depends on data elements 152 - 4 and 152 - 5
- data element 152 - 8 (generated at device 120 d ) depends on data element 152 - 7
- the dependency tree 520 may correspond to another illustration of the transformation dependency map 168 .
- Analyzing the dependency tree 520 vertically and horizontally may provide meaning full information.
- the data elements 152 at each row of the dependency tree 520 may be directly communicated to the destination device 120 e.
- the top row of the dependency tree 520 includes data elements 152 - 1 to 152 - 5 . These data elements 152 may be directly communicated to the destination device 120 e from the source device 120 a .
- the middle row of the dependency tree 520 includes data elements 152 - 6 and 152 - 7 .
- the data element 152 - 6 can be communicated to the destination device 120 e directly from the device 120 b .
- the data element 152 - 7 can be communicated to the destination device 120 e directly from the device 120 c .
- the bottom row of the dependency tree 520 includes data element 152 - 8 which can be communicated to the destination device 120 e directly from the device 120 d . These communications are based on the shortest data transfer path 174 for each data element 152 .
- the processing engine 144 determines the device dependency map 170 and the data transfer paths 174 , similar to that described in FIG. 2 .
- a first subset of data elements 152 is communicated from the device 120 a to device 120 e using a first transfer path 174
- a second subset of data elements 152 is communicated from the device 120 a to device 120 e via device 120 b .
- a third subset of data elements 152 is communicated from the device 120 a to device 120 e via the devices 120 c and 120 d using a third transfer path 174 .
- These subsets of data elements 152 may be split using the method 400 described in FIG. 4 .
- These data transfer paths 174 correspond to the shortest data transfer path 174 determined for each subset of data elements 152 , similar to that described in FIG. 2 .
- the data transfer paths 174 for the data elements 152 are shown in Table 7.
- Devices 120 Data elements 152 S1->D1 152-1 152-2 152-3 152-4 152-5 S1->S2 152-4 152-5 S2->D1 152-6 S1->S3 152-3 152-4 152-5 S3->S4 152-3 152-4 152-5 152-7 S4->D1 152-7 152-8
- S1 represents device 120 a
- S2 represents device 120 b
- S3 represents device 120 c
- S4 represents device 120 d
- D1 represents destination device 120 e
- the data elements 152 - 1 to 152 - 5 are communicated from S1 to D1
- data element 152 - 6 is communicated from S2 to D1
- data elements 152 - 4 and 152 - 5 are communicated from S4 to D1.
- These transfer paths 174 correspond to the shortest data transfer path 174 for each data element 152 , and other data transfer paths 174 are ignored.
- FIG. 6 illustrates an example operational flow 600 for determining the shortest data transfer paths 174 for data elements 152 in a particular use case.
- the operational flow 600 begins when the processing engine 144 accesses the set of devices 120 , similar to that described in FIG. 2 .
- the processing engine 144 determines historical and/or existing data transfer paths 172 .
- the processing engine 144 determines the data elements 152 at each device 120 .
- An example table illustrating the existing data transfer paths 172 for data elements 152 is shown in Table 8.
- Each data element 152 and/or dataset 154 may be associated with a key (e.g., an identifier or a flag) that is used to identify the data element 152 and/or dataset 154 .
- a key e.g., an identifier or a flag
- Table 8 may correspond to Table 1 described above in FIG. 5 .
- the following Tables 9 to 14 support the operational flow 600 for this particular use case.
- Example arrays 156 and datasets 154 for the data elements 152 Devices 120 Arrays 156 S1 T(152- T(152- T(152- T(152- 1, nil, y, 2, nil, y, 3, nil, y, 4, nil, y, 5, nil, y, S1) S1) S1) S1) S1) S1) S1) S2) S2 T(152- T(152- T(152- T(152- T(152- 1, nil, y, 2, nil, y, 3, nil, y, 4, nil, y, 5, nil, y, 6, t(152- S2) S2) S2) S2) S2) S2) S2) 4, 152- 5), y, S2) S3 T(152- T(152- T(152- T(152- T(152- 1, nil, y, 2, nil, y, 3, nil, y, 4, nil, y, y, y, y,
- the processing engine 144 feeds this information to the machine learning module 166 .
- the machine learning module 166 analyzes this information and determines which data element(s) 152 are transformed at which device(s) 120 and which data element(s) 152 are not transformed at which device(s) 120 . For example, the machine learning module 166 determines data elements 152 that are transformed and not transformed at devices 120 a and 120 b , similar to that shown in Table 10.
- the machine learning module 166 determines data elements 152 that are transformed at devices 120 b and 120 c , similar to that shown in Table 11.
- the machine learning module 166 determines data elements 152 that are transformed at devices 120 b to 120 d , similar to that shown in Table 12.
- the processing engine 144 determines the dependencies between the devices 120 a to 120 d , similar to that shown in Table 13.
- the processing engine 144 determines the transformation tree 510 .
- the transformation tree 510 represents dependencies between devices 120 a to 120 d .
- the transformation tree 510 is a graphical representation of Table 13.
- the processing engine 144 determines the transformation dependency map 168 , dependency tree 520 , and device dependency map 170 , similar to that described in FIG. 2 .
- the transformation dependency map 168 represents which data elements 152 are transformed at which devices 120 and which data elements 152 are not transformed at which devices 120 .
- Analyzing the dependency tree 520 vertically and horizontally may provide meaning full information.
- the data elements 152 at each row of the dependency tree 520 may be directly communicated to the destination device 120 e.
- the data elements 152 - 1 to 152 - 5 can be communicated directly to the destination device 120 e (i.e., D1) from the source device 120 a .
- the data element 152 - 6 can be communicated to the destination device 120 e directly from the device 120 b .
- the data element 152 - 7 can be communicated to the destination device 120 e directly from the device 120 c .
- the data element 152 -The data element 152 - 8 can be communicated to the destination device 120 e directly from the device 120 d .
- These communications are based on the shortest data transfer path 174 for each data element 152 .
- the processing engine 144 determines the device dependency map 170 and the data transfer paths 174 , similar to that described in FIG. 2 .
- the device dependency map 170 illustrates the shortest data transfer paths 174 of the data elements 152 based on the operational flow 600 . These data elements 152 may be split using the method 400 described in FIG. 4 . These data transfer paths 174 correspond to the shortest data transfer path 174 determined for each subset of data elements 152 , similar to that described in FIGS. 2 and 5 . The data transfer paths 174 for the data elements 152 are shown in Table 14.
- Devices 120 Data elements 152 S1->S2 152-4 152-5 S1->S3 152-1 152-3 S2->S4 152-6 S3->S4 152-7 S1->D1 152-1 152-2 152-3 152-4 152-5 S2->D1 152-6 S3->D1 152-7 S4->D1 152-8
- the data elements 152 - 1 to 152 - 5 can be communicated directly from S1 to D1
- the data element 152 - 6 can be communicated directly from S2 to D1
- the data element 152 - 7 can be communicated directly from S3 to D1
- the data element 152 - 8 can be communicated directly from S4 to D1.
- These transfer paths 174 correspond to the shortest data transfer path 174 for each data element 152 .
Abstract
A system accesses a set of devices transferring a data element from a source device to a destination device. The system determines a transformation type implemented on the data element at each device. The system generates an array that uniquely defines the data element at each device. The array comprises the transformation type and an identifier of the device. The system generates a transformation dependency map that represents a set of transformation types implemented on the data element at different devices. The system determines a set of data transfer paths for the data element from the source device to the destination device based on the transformation dependency map. The system selects the shortest data transfer path for the data element that corresponds to the least number of hops between devices. The system communicates the data element from the source device to the destination device using the shortest data transfer path.
Description
- The present disclosure relates generally to data communication, and more specifically to a system and method for determining the shortest data transfer path in data communication.
- Within an organization, a large number of data elements are transferred among devices. The data elements may be communicated from a source device to a destination via multiple hops between multiple devices. Each data element may undergo a transformation at each device before the data element reaches the destination device. In some cases, a data element may be communicated to a device even though the data element is not transformed at that device.
- The system described in the present disclosure is particularly integrated into practical applications of improving data communication and data routing efficiency among computing devices. This, in turn, provides an additional practical application of improving network bandwidth allocation efficiency and utilization. Furthermore, the system described in the present disclosure provides an additional practical application of reducing network congestion. As such, the technology disclosed in the present disclosure improves the data communication technology and underlying operations of network nodes, servers, switches, and routers that communicate data among devices. These practical applications are described below.
- The present disclosure contemplates systems and methods configured to determine the shortest data transfer paths for data elements from a source device to a destination device and communicate each data element using its respective shortest data transfer path. To this end, the disclosed system may perform one or more of the following operations for each data element. The data element may include any type of data/information related to an organization and/or clients of the organization, such as an application form for opening a new account, a user request related to a service and/or a product that the organization provides, etc.
- The disclosed system accesses a set of devices transferring the data element from the source device to the destination device. The disclosed system determines the existing and/or historical data transfer path for the data element.
- The disclosed system determines at which devices the data element is transformed—i.e., goes through a transformation type. The transformation type may indicate a type of change implemented on the data element. For example, the transformation type may include merging, aggregating, normalizing, summarizing, filtering, enriching, splitting, joining, or removing duplicated data operation implemented on the data element. The disclosed system also determines at which devices the data element is not transformed—i.e., does not go through any transformation type operation. Based on this information, the disclosed system generates an array that uniquely defines the data element and its transformation type at each device.
- The disclosed system may perform a similar operation for each data element, meaning evaluate each data element at each device and determine whether a data element goes through a transformation type at a given device. Based on this information, the disclosed system determines a device dependency map that represents dependencies and correlations between the set of devices. The device dependency map may include data transfer paths of data elements between devices transferring the data elements from the source device to the destination device.
- The disclosed system determines a transformation dependency map that represents a set of transformation types implemented on each data element at a given device from among the devices.
- The disclosed system determines a set of data transfer paths for the data element from the source device to the destination device based on the historical and existing data transfer paths for the data element, the device dependency map, and the transformation dependency map. Each of the set of data transfer paths may include a different number of hops between the devices.
- The disclosed system selects the shortest data transfer path for each data element based on the device dependency map and transformation dependency map. The shortest data transfer path may correspond to a data transfer path for the data element that includes the least number of hops between the devices. The disclosed system may communicate the data element from the source device to the destination device using the shortest data transfer path. The disclosed system may reconstruct or revise the current and future communications of the data element according to the shortest data transfer path.
- In one embodiment, a system for communicating data elements using the shortest data transfer path among devices comprises a memory and a processor. The memory is configured to store one or more data elements. The processor is operably coupled with the memory. The processor accesses a set of devices transferring the one or more data elements from a source device to a destination device. The processor performs one or more following operations for a data element from among the one or more data elements at a given device from among the set of devices. The processor determines a transformation type implemented on the data element, wherein the transformation type represents a type of change made to the data element. The processor generates an array that uniquely defines the data element, wherein the array comprises the transformation type and an identifier of the given device. The processor generates a transformation dependency map that represents a set of transformation types implemented on the data element at different devices from among the set of devices. The processor determines a set of data transfer paths for the data element from the source device to the destination device based at least in part upon the transformation dependency map. Each of the set of data transfer paths has a different number of hops between the set of devices. The processor selects the shortest data transfer path from among the set of data transfer paths for the data element from the source device to the destination device that corresponds to the least number of hops between devices. The processor communicates the data element from the source device to the destination device using the shortest data transfer path.
- The present disclosure contemplates systems and methods configured to split data elements based on their respective transfer paths and transformation types at different devices. For example, the disclosed system determines that a first subset of data elements is transformed in a first subset of devices, and a second subset of data elements is transformed in a second subset of devices.
- The second subset of devices may be different from the first subset of devices. The disclosed system determines that the first subset of data elements is transformed using one or more first transformation types, and the second subset of data elements is transformed using one or more second transformation types. Based on this information and the device dependency map and transformation dependency map described above, the disclosed system determines that the plurality of data elements should be split into the first subset of data elements and the second subset of data elements. Thus, the disclosed system splits the plurality of data elements into the first subset of data elements and the second subset of data elements.
- The disclosed system communicates the first subset of data elements using a first transfer path through the first subset of devices, and communicates the second subset of data elements using a second transfer path through the second subset of devices. The first data transfer path may correspond to the shortest data transfer path for the first subset of data elements that is determined based on the device dependency map, transformation dependency map, historical and/or existing data transfer paths, etc. The second data transfer path may correspond to the shortest data transfer path for the second subset of data elements that is determined based on the device dependency map, transformation dependency map, historical and/or existing data transfer paths, etc.
- In one embodiment, a system for splitting data elements based on transformation types at different devices comprises a memory and a processor. The memory is configured to store a plurality of data elements. The processor accesses a set of devices transferring the plurality of data elements from a source device to a destination device. The processor determines that a first subset of data elements from among the plurality of data elements is transformed in a first subset of devices from among the set of devices. The processor determines that a second subset of data elements from among the plurality of data elements is transformed in a second subset of devices from among the set of devices, where the second subset of devices is different from the first subset of devices. The processor splits the plurality of data elements into the first subset of data elements and the second subset of data elements based at least in part upon the determination that first subset of data elements is transformed in the first subset of devices and the second subset of data elements is transformed in the second subset of devices. The processor communicates the first subset of data elements using a first transfer path through the first subset of devices. The processor communicates the second subset of data elements using a second transfer path through the second subset of devices.
- In summary, the disclosed system provides several practical applications and technical advantages, which include: 1) technology that improves network data routing by determining the shortest data transfer path for a data element from a source device to a destination device based on evaluating the data element at each device, determining whether the data element is transformed at each device using a transformation type; 2) technology that reduces network congestion by communicating the data element only to devices where the data element is transformed using a transformation type; 3) technology that improves network data communication and routing by reconstructing or revising the current and future communications of the data elements according to their respective determined shortest data transfer paths; 4) technology that reduces load processing at each device by splitting data elements based on data transfer paths and transformation types at each device.
- As such, the disclosed system may be integrated into a practical application of improving data communication and data routing efficiency among computing devices. For example, the disclosed system only routes the data element through devices where the data element is transformed using a transformation type and bypasses the data element from (or does not route the data element to) devices where the data element is not transformed using a transformation type. This leads to eliminating or reducing unnecessary communication of the data element to devices where the data element is not transformed.
- This, in turn, leads to less network bandwidth to be utilized for communicating the data element to reach the destination device. Thus, the disclosed system improves the network bandwidth utilization efficiency. Furthermore, the unoccupied network bandwidth may be allocated for other data communication. Thus, the disclosed system improves the network bandwidth allocation efficiency. Furthermore, since less network bandwidth will be utilized for communicating the data element, network congestion is reduced. Furthermore, the disclosed system improves the underlying operations of network nodes, servers, switches, and routers that communicate data among devices because processing load is reduced at these devices.
- Furthermore, the disclosed system may be integrated into an additional practical application of reducing processing load at each device by splitting the data elements and routing each data element via devices where the data element is transformed using a transformation type. Because the data elements are split and not every data element is routed to every device, each device only needs to process data that it receives. Thus, the processing load at each device is reduced.
- Certain embodiments of this disclosure may include some, all, or none of these advantages. These advantages and other features will be more clearly understood from the following detailed description taken in conjunction with the accompanying drawings and claims.
- For a more complete understanding of this disclosure, reference is now made to the following brief description, taken in connection with the accompanying drawings and detailed description, wherein like reference numerals represent like parts.
-
FIG. 1 illustrates an embodiment of a system configured to communicate data elements using the shortest data transfer path; -
FIG. 2 illustrates an example operational flow of the system ofFIG. 1 ; -
FIG. 3 illustrates an example flowchart of a method for communicating data elements using the shortest data transfer path; -
FIG. 4 illustrates an example flowchart of a method for splitting data elements based on transformation types at different devices; -
FIG. 5 illustrates an example use case for determining the shortest data transfer path for each data element; and -
FIG. 6 illustrates an example use case for determining the shortest data transfer path for each data element. - As described above, previous technologies fail to provide efficient and reliable solutions to determine the shortest data transfer path for a data element or communicate the data element using the shortest data transfer path, and split a plurality of data elements based on transfer paths and transformation types of the data elements. This disclosure provides various systems and methods to determine the shortest data transfer path for each data element, split a plurality of data elements based on transfer paths and transformation types of the data elements, and communicate each data element using its respective shortest data transfer path. Embodiments of the present disclosure and its advantages may be understood by referring to
FIGS. 1 through 6 .FIGS. 1 through 6 are used to describe a system and method for communicating data elements using the shortest data transfer path and splitting a plurality of data elements based on transfer paths and transformation types of the data elements. -
FIG. 1 illustrates one embodiment of asystem 100 that is configured to determine the shortestdata transfer path 174 for eachdata element 152 from a source device 120 to a destination device 120 and communicate thedata element 152 from the source device 120 to the destination device 120 using the shortestdata transfer path 174. In one embodiment,system 100 comprises aserver 140 communicatively coupled with one or more computing device 120 via anetwork 110.Network 110 enables the communication between components of thesystem 100.Server 140 comprises aprocessor 142 in signal communication with amemory 148.Memory 148stores software instructions 150 that when executed by theprocessor 142, cause theprocessor 142 to perform one or more functions described herein. For example, when thesoftware instructions 150 are executed, theprocessor 142 executes theprocessing engine 144 to determine 1) which data element(s) 152 is transformed (e.g., modified, added with new data, data removed therefrom, etc.) at which computing device(s) 120; 2) determine which data element(s) 152 is not transformed (e.g., remains the same) and is passed through which computing device(s) 120; 3) determinetransformation dependency map 168 anddevice dependency map 170; 4) based on this information, determine the shortestdata transfer path 174 for eachdata element 152; 5) split thedata elements 152 according to their data transferpaths 174 andtransformation types 160 at different devices 120; and 6) communicate thedata element 152 from the source device 120 to the destination device 120 using the shortestdata transfer path 174. In other embodiments,system 100 may not have all of the components listed and/or may have other elements instead of, or in addition to, those listed above. - In general, the
system 100 improves data transmission and data routing efficiency among computing devices 120. In the present disclosure, a computing device 120 may interchangeably be referred to as a device 120. Within anorganization 108, a large amount of data is communicated between devices 120 associated with theorganization 108. Aparticular data element 152 may be communicated to a device 120 for processing. In an example scenario, assume that theparticular data element 152 is originated from asource computing device 120 a. Thedata element 152 may include any data/information and activates related to clients of theorganization 108, such as opening new accounts, user requests related to a service and/or a product that theorganization 108 provides, etc. Thedata element 152 may go through one or more stages at one or more computing devices 120 to reach adestination computing device 120 e. For example, thedata element 152 may go through a user authentication stage, an initial approval stage, or a revision stage, among others. - At each device 120, the
data element 152 may be transformed or changed—i.e., go through atransformation type 160. For example, additional information may be added to the data element, particular information associated with thedata element 152 may be removed, or particular information associated with thedata element 152 may be modified or changed. For example, thetransformation type 160 may indicate merging, aggregating, normalizing, summarizing, filtering, enriching, splitting, joining, or removing duplicated data operation associated with and/or performed on thedata element 152. For example, assume that thedata element 152 comprises a fillable application form. In this example, thedata element 152 may be transformed at adevice 120 b when additional information is added to the application form at thedevice 120 b. In certain embodiments, thetransformation type 160 may comprise a transformation ofdata element 152 from one data format to another, e.g., from a first data format used by and compatible to asource device 120 a into a second data format required by adestination device 120 e. - Upon going through these such stages, the
data element 152 may be communicated to thedestination device 120 e, for example, to fulfill the user request associated with thedata element 152. Thus, thedata element 152 may traverse a particulardata transfer path 174 from thesource device 120 a to thedestination device 120 e. -
Different data elements 152 may not need to go through the same stages and the same devices 120. In other words,different data elements 152 may not have the samedata transfer paths 174 through the same devices 120. For example, afirst data element 152 may not be transformed by a transformation type 160 (e.g., data addition, data removal, data modification) at thedevice 120 b, while asecond data element 152 may be transformed bytransformation type 160 at thedevice 120 b. Thus, in this example, thefirst data element 152 may not have to be communicated to thedevice 120 b, while thesecond data element 152 may have to be communicated to thedevice 120 b. - One potential approach is to combine all the
data elements 152 originated from thedevice 120 a and use the samedata transfer path 174 for communicating thedata elements 152 from thesource device 120 a to thedestination device 120 e. However, this approach suffers from multiple drawbacks, including network congestion in transmitting thedata elements 152 as a result of a large volume ofdata elements 152 and unnecessarily occupying network bandwidth with all of thedata elements 152 through the devices 120 a-e. - Therefore,
system 100 is configured to determine which data element(s) 152 is transformed at which computing device(s) 120, determine which data element(s) 152 is not transformed at which computing device(s) 120, determinetransformation dependency map 168 anddevice dependency map 170, based on this information, determine the shortestdata transfer path 174 for eachdata element 152, and communicate thedata element 152 from the source device 120 to the destination device 120 using the shortestdata transfer path 174. - In this manner,
system 100 reduces the network congestion and improved data transmission and communication among devices 120. Furthermore, thesystem 100 improves the network bandwidth utilization and efficiency in network routing. -
Network 110 may be any suitable type of wireless and/or wired network, including, but not limited to, all or a portion of an Internet, an Intranet, a peer-to-peer network, a switched telephone network, a local area network (LAN), a wide area network (WAN), a metropolitan area network (MAN), a personal area network (PAN), a wireless PAN (WPAN), an overlay network, a software-defined network (SDN), a virtual private network (VPN), a packet data network (e.g., the Internet), a mobile telephone network (e.g., cellular networks, such as 4G or 5G), a plain old telephone (POT) network, a wireless data network (e.g., WiFi, WiGig, WiMax, etc.), a long-term evolution (LTE) network, a universal mobile telecommunications system (UMTS) network, a peer-to-peer (P2P) network, a Bluetooth network, a near field communication (NFC) network, a Zigbee network, a Z-wave network, a WiFi network, and/or any other suitable network. Thenetwork 110 may be configured to support any suitable type of communication protocol as would be appreciated by one of ordinary skill in the art. - Each of the
computing devices 120 a to 120 e is an instance of a computing device 120. Computing device 120 is generally any device that is configured to process data and interact with users. Examples of the computing device 120 include, but are not limited to, a personal computer, a desktop computer, a workstation, a server, a laptop, a tablet computer, a mobile phone (such as a smartphone), etc. The computing device 120 may include a user interface, such as a display, a microphone, keypad, or other appropriate terminal equipment usable by a user. The computing device 120 may include a hardware processor, memory, and/or circuitry configured to perform any of the functions or actions of the computing device 120 described herein. For example, a software application designed using software code may be stored in the memory and executed by the processor to perform the functions of the computing device 120. The computing device 120 is configured to communicate with other devices via thenetwork 110. For example, the computing device 120 may communicate with a device (e.g., other computing devices 120 and the server 140). The computing devices 120 may be associated with theorganization 108. -
Server Server 140 is generally a device that is configured to process data and communicate with computing devices (e.g., computing devices 120), databases, systems, etc., via thenetwork 110. Theserver 140 may be associated with theorganization 108. Theserver 140 is generally configured to oversee the operations of theprocessing engine 144, as described further below in conjunction with theoperational flow 200 ofsystem 100 described inFIG. 2 ,method 300 described inFIG. 3 ,method 400 described inFIG. 4 , and use cases described inFIGS. 5 and 6 . -
Processor 142 comprises one or more processors operably coupled to thememory 148. Theprocessor 142 is any electronic circuitry, including, but not limited to, state machines, one or more central processing unit (CPU) chips, logic units, cores (e.g., a multi-core processor), field-programmable gate arrays (FPGAs), application-specific integrated circuits (ASICs), or digital signal processors (DSPs). For example, one ormore processors 142 may be implemented in cloud devices, servers, virtual machines, and the like. Theprocessor 142 may be a programmable logic device, a microcontroller, a microprocessor, or any suitable combination of the preceding. The one or more processors are configured to process data and may be implemented in hardware or software. For example, theprocessor 142 may be 8-bit, 16-bit, 32-bit, 64-bit, or of any other suitable architecture. Theprocessor 142 may include an arithmetic logic unit (ALU) for performing arithmetic and logic operations, registers the supply operands to the ALU and store the results of ALU operations, and a control unit that fetches instructions from memory and executes them by directing the coordinated operations of the ALU, registers and other components. The one or more processors are configured to implement various instructions. For example, the one or more processors are configured to execute instructions (e.g., software instructions 150) to implement theprocessing engine 144. In this way,processor 142 may be a special-purpose computer designed to implement the functions disclosed herein. In an embodiment, theprocessor 142 is implemented using logic units, FPGAs, ASICs, DSPs, or any other suitable hardware. Theprocessor 142 is configured to operate as described inFIGS. 1-6 . For example, theprocessor 142 may be configured to perform one or more operations ofmethod 300 as described inFIG. 3 and one or more operations ofmethod 400 described inFIG. 4 . -
Network interface 146 is configured to enable wired and/or wireless communications. Thenetwork interface 146 may be configured to communicate data between theserver 140 and other devices, systems, or domains. For example, thenetwork interface 146 may comprise an NFC interface, a Bluetooth interface, a Zigbee interface, a Z-wave interface, a radio-frequency identification (RFID) interface, a WIFI interface, a LAN interface, a WAN interface, a MAN interface, a PAN interface, a WPAN interface, a modem, a switch, and/or a router. Theprocessor 142 may be configured to send and receive data using thenetwork interface 146. Thenetwork interface 146 may be configured to use any suitable type of communication protocol as would be appreciated by one of ordinary skill in the art. - The
memory 148 may be volatile or non-volatile and may comprise read-only memory (ROM), random-access memory (RAM), ternary content-addressable memory (TCAM), dynamic random-access memory (DRAM), and static random-access memory (SRAM). Thememory 148 may include one or more of a local database, cloud database, network-attached storage (NAS), etc. Thememory 148 comprises one or more disks, tape drives, or solid-state drives, and may be used as an over-flow data storage device, to store programs when such programs are selected for execution, and to store instructions and data that are read during program execution. Thememory 148 may store any of the information described inFIGS. 1-6 along with any other data, instructions, logic, rules, or code operable to implement the function(s) described herein when executed byprocessor 142. For example, thememory 148 may storesoftware instructions 150,data elements 152,data sets 154,arrays 156,transformation dependency map 168,device dependency map 170,machine learning module 166, historical (and/or existing)data transfer paths 172, data transferpaths 174,data transformation paths 176,predefined rules 178, and/or any other data or instructions. Thesoftware instructions 150 may comprise any suitable set of instructions, logic, rules, or code operable to execute theprocessor 142 and perform the functions described herein, such as some or all of those described inFIGS. 1-6 . -
Processing engine 144 may be implemented by theprocessor 142 executing thesoftware instructions 150, and is generally configured to perform one or more operations described herein. For example, theprocessing engine 144 may be configured to determine 1) existing and/or historicaldata transfer paths 172 ofdata elements 152 betweendevices 120 a to 120 e; 2) which data element(s) 152 is transformed (e.g., modified, added with new data, data removed therefrom, etc.) at which computing device(s) 120; 3) determine which data element(s) 152 is not transformed (e.g., remains the same) and is passed through which computing device(s) 120; 4) determinetransformation dependency map 168 anddevice dependency map 170; 5) based on this information, determine the shortestdata transfer path 174 for eachdata element 152; and 6) communicate thedata element 152 from the source device 120 to the destination device 120 using the shortestdata transfer path 174. The operations of theprocessing engine 144 are described in greater detail in theoperational flow 200 ofsystem 100 described inFIG. 2 ,method 300 described inFIG. 3 ,method 400 described inFIG. 4 , and use cases described inFIGS. 5 and 6 . - In certain embodiments, the
processing engine 144 may be implemented by supervised machine learning, semi-supervised machine learning, and/or unsupervised machine learning algorithm. For example, themachine learning module 166 may comprise a support vector machine, neural network, random forest, k-means clustering, etc. In another example, themachine learning module 166 may be implemented by a plurality of neural network (NN) layers, Convolutional NN (CNN) layers, Long-Short-Term-Memory (LSTM) layers, Bidirectional LSTM layers, Recurrent NN (RNN) layers, and the like. - The
processing engine 144 may implement themachine learning module 166 to determine which data element(s) 152 is not transformed at which computing device(s) 120, determinetransformation dependency map 168 anddevice dependency map 170, and based on this information, determine the shortestdata transfer path 174 for eachdata element 152. - To this end, the
processing engine 144 may identify historical and/or existing data transfer paths 17 ofdata elements 152 between devices 120. In this process, theprocessing engine 144 may access each device 120identify data elements 152 at each device 120. Theprocessing engine 144 may identify data transferpaths 172 ofdata elements 152 between devices 120 based on historicaldata transfer paths 174 of thedata elements 152 between the devices 120. An example illustration of historical and/or existing data transferpaths 172 ofdata elements 152 between devices 120 is shown inFIG. 2 . - Although
FIG. 1 describes determiningdata transfer paths 174 for data elements betweendevices 120 a to 120 e,system 100 may be configured to determinedata transfer paths 174 fordata elements 152 between any number of devices 120. -
FIG. 2 illustrates an exampleoperational flow 200 ofsystem 100 ofFIG. 1 for communicating thedata elements 152 using their respective shortest data transferpath 174. Theoperational flow 200 may begin when theprocessing engine 144 identifies the historical and/or existing data transferpaths 172 ofdata elements 152 betweendevices 120 a to 120 e. - In an example scenario, assume that the
devices 120 a to 120 e are transferring one ormore data elements 152 from asource device 120 a to adestination device 120 e. Theprocessing engine 144 may identify the historical and/or existing data transferpaths 172 ofdata elements 152 between thedevices 120 a to 120 e by accessing each of thedevices 120 a to 120 e and determiningdata elements 152 at eachdata element 152. Theprocessing engine 144 may access eachdevice 120 a to 120 e via thenetwork 110. - Upon accessing each of the
devices 120 a to 120 e, theprocessing engine 144 determines the status of eachdata element 152 at eachdevice 120 a to 120 e. The status of eachdata element 152 may indicate whether thedata element 152 is being transformed (e.g., changed) and a type of a transformation implemented on the data element 152 (e.g., atransformation type 160 implemented on the data element 152). Theprocessing engine 144 may perform one or more of the following operations for eachdata element 152 at a given device 120 from among the set ofdevices 120 a to 120 e. - The
processing engine 144 determines atransformation type 160 implemented on thedata element 152. Thetransformation type 160 may represent a type of change made to thedata element 152. In certain embodiments, thetransformation type 160 may comprise an addition to thedata element 152, a reduction from thedata element 152, or a modification of thedata element 152, similar to that described inFIG. 1 . - In certain embodiments, the
transformation type 160 may comprise transformation details associated with thedata element 152, e.g., what has been changed, modified, and/or transformed in thedata element 152. For example, thetransformation type 160 may indicate merging, aggregating, normalizing, summarizing, filtering, enriching, splitting, joining, or removing duplicated data operations associated with and/or performed on thedata element 152. - In certain embodiments, the
transformation type 160 may comprise a transformation ofdata element 152 from one data format to another, e.g., from a first data format used by and compatible to asource device 120 a into a second data format required by adestination device 120 e. - To determine the
transformation type 160 implemented on thedata element 152 at a particular device 120, theprocessing engine 144 may evaluate the status of thedata element 152 at the input buffer of the particular device 120, the change made to thedata element 152 at the particular device 120, and evaluate the status of thedata element 152 in the output buffer of the particular device 120. - The
processing engine 144 identifies the device 120 where thetransformation type 160 is implemented on thedata element 152. Theprocessing engine 144 generates anarray 156 that uniquely identifies thedata element 152 at the given device 120. Thedata type 162 may comprise a number, a character, a character string, a composite type, or any combination thereof. The composite data type may include a list, an array, a matrix, etc. - As can be seen in
FIG. 2 , anexample array 156 identifying a data element 152 (i) at a device 120 (j) is represented according to equation (1): -
T i,j=(n i ,y i ,t i ,s j) Equation (1) - where Ti,j represents the
array 156, ni represents thedata element name 158, yi representstransformation type 160, and sj represents the device 120. In this manner, theprocessing engine 144 may generatemultiple arrays 156 for eachdata element 152 at different devices 120 representing thetransformation type 160 that thedata element 152 experiences at different devices 120. Theprocessing engine 144 may perform a similar operation for eachdata element 152 at eachdevice 120 a to 120 e. - With respect to
device 120 a, theprocessing engine 144 accesses thedevice 120 a, identifies that thedata elements 152 a are being processed by thedevice 120 a, and determines one or morefirst transformation types 160 that eachdata element 152 a is experiencing. With respect todevice 120 b, theprocessing engine 144 accesses thedevice 120 b, identifies that thedata elements 152 b are being processed by thedevice 120 b, and determines one or moresecond transformation types 160 that eachdata element 152 b is experiencing. Thedata elements 152 b may correspond to thedata elements 152 a after the first one ormore transformation types 160 implemented on thedata elements 152 a. With respect todevice 120 c, theprocessing engine 144 accesses thedevice 120 c, identifies that thedata elements 152 c are being processed by thedevice 120 c, and determines a third one ormore transformation types 160 that eachdata element 152 c is experiencing. Thedata elements 152 c may correspond to thedata elements 152 b after the second one ormore transformation types 160 implemented on thedata elements 152 b. With respect todevice 120 d, theprocessing engine 144 accesses thedevice 120 d, identifies that thedata elements 152 d are being processed by thedevice 120 d, and determines a fourth one ormore transformation types 160 that eachdata element 152 d is experiencing. Thedata elements 152 d may correspond to thedata elements 152 c after the third one ormore transformation types 160 implemented on thedata element 152 c. With respect to thedestination device 120 e, theprocessing engine 144 accesses thedestination device 120 e, identifies thedata elements 152 e at thedestination device 120 e, and determines the changes made to thedata elements 152 e. Thedata elements 152 e may correspond to thedata elements 152 d after the fourth one ormore transformation types 160 implemented on thedata elements 152 d. - In this manner, the
processing engine 144 determines which data element(s) 152 is transformed at which computing device(s) 120 and which data element(s) 152 is not transformed at which computing device(s) 120. Theprocessing engine 144 uses this information in determining thetransformation dependency map 168 and thedevice dependency map 170. - The
processing engine 144 generatesdata sets 154 comprisingdata elements 152 at each device 120. In this process, theprocessing engine 144 defines eachdata set 154 at a given device 120 in terms ofdata elements 152 that are transformed (e.g., using a transformation type 160) anddata elements 152 that are not transformed. For example, an example data set 154 (DS) at the device 120 (i) may be represented according to equation (2). -
DS=(DS i ∩DT i)∪(DS i −DT i) Equation (2) - where DSi represents all the
data elements 152 at the device 120 (i), DTi represents transformed data elements 152 (e.g., using a transformation type 160) at the device 120 (i), notation (∩) represents a set intersection function, notation (∪) represents a union function, and notation (−) represent a deduction function. - In equation (2), notation (DSi ∩DTi) represents the set intersection of all
data elements 152 and the transformation data elements 152 (e.g., using a transformation type 160). Notation (DSi−DTi) represents all data elements 152 (DSi) except the transformed data elements 152 (DTi), meaningdata elements 152 that are not transformed at the device 120 (i), i.e.,data elements 152 are passing through the devices 120 (i) without change. - The
processing engine 144 may determinedata sets 154 ofdata elements 152 at each device 120 using the equation (2). Theprocessing engine 144 uses this information in determining thetransformation dependency map 168 and thedevice dependency map 170. - The
processing engine 144 determines adevice dependency map 170 by feeding thearrays 156 indicatingtransformation types 160 ofdata elements 152 at each device 120 (according to equation (1)) and the status of thedata elements 152 anddata sets 154 at each device 120 (according to equation (2)) to themachine learning module 166. Themachine learning module 166 uses the input data to determine the data transferpaths 174 of thedata elements 152 betweendevices 120 a to 120 e. - The
data transfer path 174 of adata element 152 goes through devices 120 where thedata element 152 is transformed using atransformation type 160. In other words, theprocessing engine 144 excludes or removes device(s) 120 where thedata element 152 is not transformed from thedata transfer path 174 of thedata element 152. For example, if theprocessing engine 144 determines that thedata element 152 is passed through a particular device 120 without being transformed using atransformation type 160, theprocessing engine 144 removes the particular device 120 from the data transferpaths 174 for thedata element 152. - An example of
device dependency map 170 is shown inFIG. 2 . Thedevice dependency map 170 may represent dependencies and correlations between devices 120. In the example ofFIG. 2 , the processing engine 144 (e.g., via the machine learning module 166) may determine that a first set of data elements 152-1 from among thedata elements 152 a (at thesource device 120 a) are only transformed at thesource device 120 a (using a transformation type 160) and are not transformed (using a transformation type 160) atdevices processing engine 144 may determine that the first set of data elements 152-1 may be communicated from thesource device 120 a to thedestination device 120 e. In other words, theprocessing engine 144 may determine a transfer path 174-1 for the first set of data elements 152-1 is from thesource device 120 a to thedestination device 120 e. - Further, in the example of
FIG. 2 , the processing engine 144 (e.g., via the machine learning module 166) may determine that a second set of data elements 152-2 from among the data element 154 a (at thesource device 120 a) are only transformed (using a transformation type 160) atdevices device 120 c. Thus, theprocessing engine 144 may determine that the transfer path 174-2 for the second set of data elements 152-2 is throughdevices - Further, in the example of
FIG. 2 , the processing engine 144 (e.g., via the machine learning module 166) may determine that a third set of data elements 152-3 from among thedata elements 152 a (at thesource device 120 a) are only transformed (using a transformation type 160) atdevices devices processing engine 144 may determine that the transfer path 174-3 for the third set of data elements 152-3 is throughdevices - In certain embodiments, the
processing engine 144 may split thedata elements 152 a into the first set of data elements 152-1, the second set of data elements 152-2, and the third set of data elements 152-3 based on the determination of whether eachdata element 152 from among thedata elements 152 a is transformed using atransformation type 160 at each device 120. - Upon splitting the
data elements 152 a into the first set of data elements 152-1, the second set of data elements 152-2, and the third set of data elements 152-3, theprocessing engine 144 may proceed to determine the data transfer paths 174-1, 174-2, and 174-3 for the sets of data elements 152-1, 152-2, and 152-3, respectively. - The
processing engine 144 determines atransformation dependency map 168 by feeding thearrays 156 indicatingtransformation types 160 ofdata elements 152 at each device 120 (according to equation (1)) and the status of thedata elements 152 anddata sets 154 at each device 120 (according to equation (2)) to themachine learning module 166. Themachine learning module 166 uses the input data to determine the data transferpaths 174 anddata transformation paths 176 of thedata elements 152 betweendevices 120 a to 120 e. Thedata transformation path 176 of adata element 152 indicates what transformation types 160 thedata element 152 goes through at each device 120. - The
transformation dependency map 168 of aparticular data element 152 may represent dependencies and correlations among the settransformation types 160 implemented on theparticular data element 152 at different devices 120. In other words, thetransformation dependency map 168 of aparticular data element 152 may represent the settransformation types 160 implemented on theparticular data element 152 at different devices 120. - In the example of
FIG. 2 , an exampletransformation dependency map 168 of aparticular data element 152 is shown. The exampletransformation dependency map 168 includes stages T1 to T4 where adata element 152 is transformed using atransformation type 160. - In the illustrated example, at stage T1, the attributes of the
data element 152 are represented by thearray 156 “T1,1” according to equation (3) which is an instance of equation (1) where the i=1 and j=1. -
T1,1=(n 1 ,y 1 ,t 1 ,s 1) equation (3) - At stage T1, the
data element 152 with thedata element name 158 represented by “n1” anddata type 162 “t1” is transformed using a first transformation type 160 (represented by “y1”) atdevice 120 a (represented by “S1”). - At stage T2, the attributes of the
data element 152 are represented by thearray 156 “T1,2” according to equation (4) which is an instance of equation (1) where the i=1 and j=2. -
T 1,2=(n 1 ,y 1 ,t 1 ,s 2) equation (4) - At stage T2, the
data element 152 with thedata element name 158 represented by “n1” anddata type 162 “t1” is transformed using a second transformation type 160 (represented by “y2”) atdevice 120 b (represented by “S2”). - At stage T3, the attributes of the
data element 152 are represented by thearray 156 “T1,3” according to equation (5) which is an instance of equation (1) where the i=1 and j=3. -
T 1,3=(n 1 ,y 1 ,t 1 ,s 3) equation (5) - At stage T3, the
data element 152 with thedata element name 158 represented by “n1” anddata type 162 “t1” is transformed using a third transformation type 160 (represented by “y1”) atdevice 120 c (represented by “S3”). - At stage T4, the attributes of the
data element 152 are represented by thearray 156 “T1,4” according to equation (6) which is an instance of equation (1) where the i=1 and j=4. -
T 1,4=(n 1 ,y 1 ,t 1 ,s 4) equation (6) - At stage T4, the
data element 152 with thedata element name 158 represented by “n1” anddata type 162 “t1” is transformed using a fourth transformation type 160 (represented by “y1”) atdevice 120 d (represented by “S4”). The lines between the stages T1 to T4 represent dependencies and correlations between the transformations of thedata element 152 atdevices 120 a to 120 e, i.e., thedata transformation paths 176 of thedata element 152. - The
processing engine 144 may use thetransformation dependency map 168, thedevice dependency map 170, and historical and existing data transferpaths 172 to determine a set of data transferpaths 174 for thedata element 152 from thesource device 120 a to thedestination device 120 e. Each of the set of data transferpaths 174 may have a different number of hops between the set of devices 120, similar to that described above with respect to transfer paths 174-1 to 174-3. - The
processing engine 144 determines the shortestdata transfer path 174 from among the set of data transferpaths 174 for thedata element 152 from thesource device 120 a to thedestination device 120 e that corresponds to the least number of hops between devices 120. - In this manner, the
data element 152 may only be communicated to device(s) 120 where atransformation type 160 is implemented on thedata element 152. This obviates unnecessarybatch data element 152 routing between all devices 120. Thus, network congestion is reduced, data transmission and communication efficiency are improved, and network bandwidth is improved. - In some embodiments, the
processing engine 144 may determine the shortestdata transfer path 174 further based on thepredefined rule 178. Thepredefined rule 178 may indicate selecting adata transformation path 176 that maximizes data security and data quality for thedata element 152. For example, theprocessing engine 144 may determine the shortestdata transfer path 174 such that it corresponds to and/or includes the least number of hops between devices and maximizes data security and data quality for thedata element 152. - In a case where two data transfer
paths 174 for thedata element 152 have the least number of hops for thedata element 152 from thesource device 120 a to thedestination device 120 e, theprocessing engine 144 may identify a particulardata transfer path 174 from among the two data transferpaths 174 based on thepredefined rule 178 such that the selecteddata transfer path 174 maximizes data security and data quality. Similarly, theprocessing engine 144 may determine a data transfer path 174 (e.g., the data transfer paths 174-1, 174-2, and 174-3 described above) based on thepredefined rule 178. - The
processing engine 144 may also determine theshortest transformation path 176 for thedata element 152 from thesource device 120 a to thedestination device 120 e based on thetransformation dependency map 168, thedevice dependency map 170, and historical and existing data transferpaths 172 - In some embodiments, the
shortest transformation path 176 for thedata element 152 may further be determined according to thepredefined rules 178 and the number of hops between the devices 120. In the exampletransformation dependency map 168 illustrated inFIG. 2 , a firstdata transformation path 176 a for thedata element 152 is fromdevice 120 a todevice 120 c, and a seconddata transformation path 176 b for thedata element 152 is fromdevice 120 a todevice 120 b todevice 120 d. - The
processing engine 144 determines which of thedata transformation paths data element 152 based on thepredefined rule 178 and the number of hops between the devices 120. Theprocessing engine 144 communicates eachdata element 152 from thesource device 120 a to thedestination device 120 e using its determined shortestdata transfer path 174. - In a case where two
data transmission paths 176 for thedata element 152 have the least number of hops for thedata element 152 from thesource device 120 a to thedestination device 120 e, theprocessing engine 144 may identify a particulardata transmission path 176 from among the twodata transmission paths 176 based on thepredefined rule 178 such that the selecteddata transmission path 176 maximizes data security and data quality. - In this manner, the
processing engine 144 determines the shortestdata transfer path 174 and shortestdata transformation path 176 for eachdata element 152 from thesource device 120 a to thedestination device 120 e. Theprocessing engine 144 performs data communication for eachdata element 152 using its determined shortestdata transfer path 174. In this process, theprocessing engine 144 reconstructs or revises the current data transmission of thedata element 152 that is not using the respective shortest data transferpath 174. -
FIG. 3 illustrates an example flowchart of amethod 300 configured to determine the shortestdata transfer path 174 for eachdata element 152 from a source device 120 to a destination device 120 and communicate thedata element 152 from the source device 120 to the destination device 120 using the shortestdata transfer path 174. Modifications, additions, or omissions may be made tomethod 300.Method 300 may include more, fewer, or other steps. For example, steps may be performed in parallel or in any suitable order. While at times discussed as thesystem 100,server 140, or components of any of thereof performing operations, any suitable system or components of the system may perform one or more operations of themethod 300. For example, one or more operations ofmethod 300 may be implemented, at least in part, in the form ofsoftware instructions 150 ofFIG. 1 , stored on non-transitory, tangible, machine-readable media (e.g.,memory 148 ofFIG. 1 ) that when run by one or more processors (e.g.,processor 142 ofFIG. 1 ) may cause the one or more processors to perform operations 302-328. - At 302, the
processing engine 144 access a set of devices 120 transferring one ormore data elements 152 from asource device 120 a to adestination device 120 e. For example, theprocessing engine 144 may access thedevices 120 a to 120 e that transferdata elements 152 from thesource device 120 a to thedestination device 120 e, via thenetwork 110. In one embodiment, prior to 302, theprocessing engine 144 may determine historical and existing data transferpaths 172 for the one ormore data elements 152 from thesource device 120 a to thedestination device 120 e. - At 304, the
processing engine 144 selects a device 120 from among the set of devices 120. Theprocessing engine 144 may iteratively select a device 120 until no device 120 is left for evaluation. - At 306, the
processing engine 144 selects adata element 152 at the selected device 120. Theprocessing engine 144 may iteratively select adata element 152 at the selected device 120 until nodata element 152 at the selected device 120 is left for evaluation. - At 308, the
processing engine 144 determines atransformation type 160 implemented on thedata element 152. Thetransformation type 160 may represent a type of change made to thedata element 152. Examples of thetransformation type 160 are discussed inFIGS. 1 and 2 . - At 310, the
processing engine 144 generates anarray 156 that uniquely defines thedata element 152. Thearray 156 may be represented by multiple variables in a tuple. Thearray 156 may comprise the name of the data element 152 (i.e., data element name 158), thetransformation type 160, adata type 162 associated with thedata element 152, and an identifier of the device 120 (i.e., device name 164). An example representation ofarray 156 is discussed inFIG. 2 with respect to equation (1). - At 312, the
processing engine 144 determines whether to select anotherdata element 152. - The
processing engine 144 determines to select anotherdata element 152 if at least onedata element 152 in the selected device 120 is left for evaluation. If theprocessing engine 144 determines to select anotherdata element 152,method 300 returns to 306. Otherwise,method 300 proceeds to step 314. - At 314, the
processing engine 144 determines whether to select another device 120. Theprocessing engine 144 determines to select another device 120 if at least one device 120 is left for evaluation. If theprocessing engine 144 determines to select another device 120,method 300 returns to 304. Otherwise,method 300 proceeds to step 316. - At 316, the
processing engine 144 generates adevice dependency map 170 that represents dependencies between the set of devices 120. In this process, theprocessing engine 144 may follow theoperational flow 200 described inFIG. 2 to generate thedevice dependency map 170. - At 318, the
processing engine 144 generates atransformation dependency map 168 that represents a set oftransformation types 160 implemented on eachdata element 152 at different devices 120. In this process, theprocessing engine 144 may follow theoperational flow 200 described inFIG. 2 to generate thetransformation dependency map 168. - At 320, the
processing engine 144 selects adata element 152 from among the one ormore data elements 152. Theprocessing engine 144 may iteratively select adata element 152 until nodata element 152 is left for evaluation. - At 322, the
processing engine 144 determines a set of data transferpaths 174 for thedata element 152 from thesource device 120 a to thedestination device 120 e based on thedevice dependency map 170 and thetransformation dependency map 168, similar to that described inFIG. 2 . For example, each of the set of data transferpaths 174 may have a different number of hops between the devices 120. - At 324, the
processing engine 144 determines the shortestdata transfer path 174 for thedata element 152 from thesource device 120 a to thedestination device 120 e, similar to that described inFIG. 2 . The shortestdata transfer path 174 may have the least number of hops between the devices 120. - At 326, the
processing engine 144 communicates thedata element 152 from thesource device 120 a to thedestination device 120 e using the shortestdata transfer path 174. In this process, theprocessing engine 144 may reconstruct the data transmission of thedata element 152 for future data transmissions from thesource device 120 a to thedestination device 120 e using the shortestdata transfer path 174. - At 328, the
processing engine 144 determines whether to select anotherdata element 152. Theprocessing engine 144 determines to select anotherdata element 152 if at least onedata element 152 from among the one ormore data elements 152 is left for evaluation. If theprocessing engine 144 determines to select anotherdata element 152,method 300 returns to 320. Otherwise,method 300 is ended. -
FIG. 4 illustrates an example flowchart of amethod 400 configured to splitdata elements 152 for transferring from a source device 120 to a destination device 120. Modifications, additions, or omissions may be made tomethod 400.Method 400 may include more, fewer, or other steps. For example, steps may be performed in parallel or in any suitable order. While at times discussed as thesystem 100,server 140, or components of any of thereof performing operations, any suitable system or components of the system may perform one or more operations of themethod 400. For example, one or more operations ofmethod 400 may be implemented, at least in part, in the form ofsoftware instructions 150 ofFIG. 1 , stored on non-transitory, tangible, machine-readable media (e.g.,memory 148 ofFIG. 1 ) that when run by one or more processors (e.g.,processor 142 ofFIG. 1 ) may cause the one or more processors to perform operations 402-428. - At 402, the
processing engine 144 access a set of devices 120 transferring a plurality ofdata elements 152 from asource device 120 a to adestination device 120 e. For example, theprocessing engine 144 may access thedevices 120 a to 120 e that transferdata elements 152 from thesource device 120 a to thedestination device 120 e, via thenetwork 110. In one embodiment, prior to 402, theprocessing engine 144 may determine historical and existing data transferpaths 172 for the one ormore data elements 152 from thesource device 120 a to thedestination device 120 e. - At 404, the
processing engine 144 selects a device 120 from among the set of devices 120. Theprocessing engine 144 may iteratively select a device 120 until no device 120 is left for evaluation. - At 406, the
processing engine 144 selects adata element 152 at the selected device 120. Theprocessing engine 144 may iteratively select adata element 152 at the selected device 120 until nodata element 152 at the selected device 120 is left for evaluation. - At 408, the
processing engine 144 determines atransformation type 160 implemented on thedata element 152. Thetransformation type 160 may represent a type of change made to thedata element 152. Examples of thetransformation type 160 are discussed inFIGS. 1 and 2 . - At 410, the
processing engine 144 generates anarray 156 that uniquely defines thedata element 152. Thearray 156 may be represented by multiple variables in a tuple. Thearray 156 may comprise the name of the data element 152 (i.e., data element name 158), thetransformation type 160, adata type 162 associated with thedata element 152, and an identifier of the device 120 (i.e., device name 164). An example representation ofarray 156 is discussed inFIG. 2 with respect to equation (1). - At 412, the
processing engine 144 determines whether to select anotherdata element 152. - The
processing engine 144 determines to select anotherdata element 152 if at least onedata element 152 in the selected device 120 is left for evaluation. If theprocessing engine 144 determines to select anotherdata element 152,method 400 returns to 406. Otherwise,method 400 proceeds to step 414. - At 414, the
processing engine 144 determines whether to select another device 120. Theprocessing engine 144 determines to select another device 120 if at least one device 120 is left for evaluation. If theprocessing engine 144 determines to select another device 120,method 400 returns to 404. Otherwise,method 400 proceeds to step 416. - At 416, the
processing engine 144 generates adevice dependency map 170 that represents dependencies between the set of devices 120. In this process, theprocessing engine 144 may follow theoperational flow 200 described inFIG. 2 to generate thedevice dependency map 170. - At 418, the
processing engine 144 generates atransformation dependency map 168 that represents a set oftransformation types 160 implemented on eachdata element 152 at different devices 120. In this process, theprocessing engine 144 may follow theoperational flow 200 described inFIG. 2 to generate thetransformation dependency map 168. - At 420, the
processing engine 144 determines that a first subset ofdata elements 152 is transformed in a first subset of devices 120. - For example, the
processing engine 144 may determine that the first subset ofdata elements 152 is transformed in the first subset of devices 102 based on thetransformation dependency map 168,device dependency map 170, historical and/or existing data transferpaths 172, andtransformation types 160 associated with the first subset ofdata elements 152. - At 422, the
processing engine 144 determines that a second subset ofdata elements 152 is transformed in a second subset of devices 120. For example, theprocessing engine 144 may determine that the second subset ofdata elements 152 is transformed in the second subset of devices 102 based on thetransformation dependency map 168,device dependency map 170, historical and/or existing data transferpaths 172, andtransformation types 160 associated with the second subset ofdata elements 152. In certain embodiments, the second subset ofdata elements 152 may be different from the first subset ofdata elements 152. In certain embodiments, the second subset ofdata elements 152 may have at least onedata element 152 overlapping with the first subset ofdata elements 152. In such cases, theprocessing engine 144 may implement the operation described in theoperational flow 200 inFIG. 2 to determine the shortestdata transfer path 176 for the overlappingdata element 152. - At 424, the
processing engine 144 splits the plurality ofdata elements 152 into the first subset ofdata elements 152 and the second subset ofdata elements 152. Theprocessing engine 144 may split the plurality ofdata elements 152 into the first subset ofdata elements 152 and the second subset ofdata elements 152 based at least the determinations in 420 to 422, including the determination that the first subset of data elements i152 s transformed in the first subset of devices 120 and the second subset ofdata elements 152 is transformed in the second subset of devices 120 and the determination that the first set ofdata elements 152 is transformed using the one or morefirst transformation types 160 and the second set ofdata elements 152 is transformed using the one or more second transformation types 160. The one or morefirst transformation types 160 may be different from the one or moresecond transformation 160. In certain embodiments,processing engine 144 splits the plurality ofdata elements 152 into the first subset ofdata elements 152 and the second subset ofdata elements 152 based at least on theirrespective transformation types 160 at different devices 120. In certain embodiments,processing engine 144 splits the plurality ofdata elements 152 into the first subset ofdata elements 152 and the second subset ofdata elements 152 based at least on the shortestdata transfer path 174 for eachdata element 152 that is determined similar to that described inFIGS. 1 and 2 . - At 426, the
processing engine 144 communicates the first subset ofdata elements 152 using a firstdata transfer path 174 through the first subset of devices 120, similar to that described inFIG. 2 . The firstdata transfer path 174 may correspond to the shortestdata transfer path 174 for the first subset ofdata elements 152 that is determined similar to that described inFIG. 2 . - At 428, the
processing engine 144 communicates the second subset ofdata elements 152 using a seconddata transfer path 174 through the second subset of devices 120, similar to that described inFIG. 2 . The seconddata transfer path 174 may correspond to the shortestdata transfer path 174 for the second subset ofdata elements 152 that is determined similar to that described inFIG. 2 . -
FIG. 5 illustrates an example operational flow 500 for determining the shortestdata transfer paths 174 fordata elements 152 in a particular use case. The operational flow 500 begins when theprocessing engine 144 accesses the set of devices 120, similar to that described inFIG. 2 . Theprocessing engine 144 determines historical and/or existing data transferpaths 172. Theprocessing engine 144 determines thedata elements 152 at each device 120. An example table illustrating the existingdata transfer paths 172 fordata elements 152 is shown in Table 1. Eachdata element 152 and/ordataset 154 may be associated with a key (e.g., an identifier or a flag) that is used to identify thedata element 152 and/ordataset 154. -
TABLE 1 Example existing data transfer paths 172.Devices 120 Data elements 152S1->S2 152-1 152-2 152-3 152-4 152-5 S2->S3 152-1 152-2 152-3 152-4 152-5 152-6 S3->S4 152-1 152-2 152-3 152-4 152-5 152-6 152-7 S4->D1 152-1 152-2 152-3 152-4 152-5 152-6 152-7 152-8 - S1 represents
device 120 a, S2 representsdevice 120 b, S3 representsdevice 120 c, S4 representsdevice 120 d, and D1 representsdestination device 120 e. As shown in Table 1, data elements 152-1 to 152-5 are transmitted fromdevice 120 a todevice 120 b, data elements 152-1 to 152-6 are transmitted fromdevice 120 b todevice 120 c, data elements 152-1 to 152-7 are transmitted fromdevice 120 c todevice 120 d, and data elements 152-1 to 152-8 are transmitted fromdevice 120 d todevice 120 e. Theprocessing engine 144 uses this information to generatearray 156 anddatasets 154, similar to that described inFIG. 2 . Table 2 illustratesexample arrays 156 anddatasets 154 for thedata elements 152 at eachdevice 120 a to 120 d. -
TABLE 2 Example arrays 156 anddatasets 154 for thedata elements 152.Devices 120 Arrays 156 S1 T(152- T(152- T(152- T(152- T(152- 1, nil, y, 2, nil, y, 3, nil, y, 4, nil, y, 5, nil, y, S1) S1) S1) S1) S1) S2 T(152- T(152- T(152- T(152- T(152- T(152- 1, nil, y, 2, nil, y, 3, nil, y, 4, nil, y, 5, nil, y, 6, t(152- S2) S2) S2) S2) S2) 4, 152- 5), y, S2) S3 T(152- T(152- T(152- T(152- T(152- T(152- T(152- 1, nil, y, 2, nil, y, 3, nil, y, 4, nil, y, 5, nil, y, 6, nil, y, 7, t(152- S3) S3) S3) S3) S3) S3) 1), y, S3) S4 T(152- T(152- T(152- T(152- T(152- T(152- T(152- T(152- 1, nil, y, 2, nil, y, 3, nil, y, 4, nil, y, 5, nil, y, 6, nil, y, 7, nil, y, 8, t(152- S4) S4) S4) S4) S4) S4) S4) 7), y, S4) - Each row in Table 2 may correspond to a
dataset 154 ofdata elements 152 at each device 120. T(152-1, nil, y, S1) corresponds to anarray 156 representing data element 152-1 atdevice 120 a (noted at S1). In thisarray 156, 152-1 represents thedata element name 158, nil represents that notransformation type 160 is implemented on thisdata element 152, y representsdata type 162, and S1 representsdevice name 164 of thedevice 120 a. Similarly,other arrays 156 represent theother data elements 152. For example, nil in anyarray 156 represents that notransformation type 160 is implemented. Generally, eacharray 156 for eachdata element 152 is represented by T (data element name 158,transformation type 160,data type 162, and device name 164). - T(152-6, t(152-4, 152-5), y, S2) corresponds to an
array 156 that represents data element 152-6 atdevice 120 b (noted as S2). In thisarray 156, 152-6 represents thedata element name 158, t(152-4, 152-5) represents atransformation type 160 implemented on data elements 152-4 and 154-5 that produces the data element 152-6, y representsdata type 162, and S2 representsdevice name 164 of thedevice 120 b. Thistransformation type 160 occurs atdevice 120 b. - T(152-7, t(152-1), y, S3) corresponds to an
array 156 that represents data element 152-7 atdevice 120 c (noted as S3). In thisarray 156, 152-7 represents thedata element name 158, t(152-1) represents atransformation type 160 implemented on data elements 152-1 that produces the data element 152-7, y representsdata type 162, and S3 representsdevice name 164 of thedevice 120 c. Thistransformation type 160 occurs atdevice 120 c. - T(152-8, t(152-7), y, S4) corresponds to an
array 156 that represents data element 152-8 atdevice 120 d (noted as S4). In thisarray 156, 152-8 represents thedata element name 158, t(152-7) represents atransformation type 160 implemented on data elements 152-7 that produces the data element 152-8, y representsdata type 162, and S3 representsdevice name 164 of thedevice 120 d. Thistransformation type 160 occurs atdevice 120 d. - The
processing engine 144 feeds this information to themachine learning module 166. Themachine learning module 166 analyzes this information and determines which data element(s) 152 are transformed at which device(s) 120 and which data element(s) 152 are not transformed at which device(s) 120. For example, themachine learning module 166 determinesdata elements 152 that are transformed and not transformed atdevice -
TABLE 3 Example data elements transformations. Arrays 156S2 ∩ S1 T(152-1, T(152-2, T(152-3, T(152-4, T(152-5, nil, y, S1) nil, y, S1) nil, y, S1) nil, y, S1) nil, y, S1) S2 − S1 T(152-6, t(152-4, 152-5), y, S2) - S2 ∩S1 represents
data elements 152 that are not transformed at S1 (i.e.,device 120 a). In other words, S2 ∩S1 represents an intersection ofdata elements 152 betweendevice data element 152 that is transformed and/or generated at S2 (i.e.,device 120 b). In other words, S2-S1 may representdata elements 152 indevice 120 b but not indevice 120 a. Similarly, themachine learning module 166 determinesdata elements 152 that are transformed atdevices -
TABLE 4 Example data elements transformations. Arrays 156S3 ∩ S2 T(152-1, T(152-2, T(152-3, T(152-4, T(152-5, T(152-6, nil, y, nil, y, S2) nil, y, S2) nil, y, S2) nil, y, S2) nil, y, S2) S2) S3 ∩ S2 ∩ T(152-l, T(152-2, T(152-3, T(152-4, T(152-5, S1 nil, y, S1) nil, y, S1) nil, y, S1) nil, y, S1) nil, y, S1) S3-S2 T(152-7, t(152-1), y, S3) - S3 ∩S2 represents
data elements 152 that are not transformed at S2 (i.e.,device 120 b). In other words, S3 ∩S2 represent an intersection ofdata elements 152 betweendevice data elements 152 that are not transformed at S1 (i.e.,device 120 b). S3-S2 representsdata elements 152 that are transformed and/or generated at S3 (i.e.,device 120 c). In other words, S3 ∩S2 ∩S1 represent an intersection ofdata elements 152 betweendevice 120 b to 120 c. S3-S2 representsdata element 152 that is transformed and/or generated at S3 (i.e.,device 120 c). In other words, S3-S2 may representdata elements 152 indevice 120 c but not indevice 120 b. Similarly, themachine learning module 166 determinesdata elements 152 that are transformed atdevices 120 b to 120 d, similar to that shown in Table 5. -
TABLE 5 Example data elements transformations. Arrays 156 S4 ∩ S3 T(152-1, T(152-2, T(152-3, T(152-4, T(152-5, T(152-6, T(152-7, nil, y, S3) nil, y, S3) nil, y, S3) nil, y, S3) nil, y, S3) nil, y, S3) nil, y, S3) S4 ∩ S3 ∩ T(152-1, T(152-2, T(152-3, T(152-4, T(152-5, T(152-6, nil, y, S2) S2 nil, y, S2) nil, y, S2) nil, y, S2) nil, y, S2) nil, y, S2) S4 ∩ S3 ∩ T(152-l, T(152-2, T(152-3, T(152-4, T(152-5, nil, y, S1) S2 ∩ S1 nil, y, S1) nil, y, S1) nil, y, S1) nil, y, S1) S4-S3 T(152-8, t(152-7), y, S4) - S4 ∩S3 represents
data elements 152 that are not transformed at S3 (i.e.,device 120 c). In other words, S4 ∩S3 represents an intersection ofdata elements 152 betweendevice data elements 152 that are not transformed at S2 (i.e.,device 120 b). In other words, S4 ∩S3 ∩S2 represents an intersection ofdata elements 152 betweendevice 120 b to 120 d. S4 ∩S3 ∩S2 ∩S1 representsdata elements 152 that are not transformed at S1 (i.e.,device 120 a). In other words, S4 ∩S3 ∩S2 ∩S1 represents an intersection ofdata elements 152 betweendevice 120 a to 120 d. S4-S3 represents adata element 152 that is transformed and/or generated at S4 (i.e.,device 120 d). In other words, S4-S3 may representdata elements 152 indevice 120 d but not indevice 120 c. Based on the information in Tables 3 to 5, the processing engine 144 (e.g., via the machine learning module 166) determines the dependencies between thedevices 120 a to 120 d, similar to that shown in Table 6. -
TABLE 6 device dependencies dataflow. Devices 120 Arrays 156S1 T(152-1, T(152-2, T(152-3, T(152-4, T(152-5, nil, y, S1) nil, y, S1) nil, y, S1) nil, y, S1) nil, y, S1) S1 <- S2 T(152-4, nil, y, S2) T(152-5, nil, y, S2) S1 <- S3 T(152-1, nil, y, S1) S3 <- S4 T(152-7, nil, y, S3) - As can be seen in Table 6, S1 (i.e.,
device 120 a) is not dependent on any other devices 120, S2 (i.e.,device 120 b) depends on S1 (i.e.,device 120 a), S3 (i.e.,device 120 c) depends on S1 (i.e.,device 120 a), and S4 (i.e.,device 120 d) depends on S3 (i.e.,device 120 c). Thedata elements 152 that depend on particular devices 120 are shown in Table 6. Based on this information, theprocessing engine 144 determines thetransformation tree 510. Thetransformation tree 510 represents dependencies betweendevices 120 a to 120 d. Thetransformation tree 510 is a graphical representation of Table 6. - The
processing engine 144 determines thetransformation dependency map 168,dependency tree 520, anddevice dependency map 170, similar to that described inFIG. 2 . For example, thetransformation dependency map 168 represents whichdata elements 152 are transformed at which devices 120 and whichdata elements 152 are not transformed at which devices 120. - In the illustrated example, the data element 152-7 (generated at
device 120 c) depends on data element 152-1, data element 152-6 (generated atdevice 120 b) depends on data elements 152-4 and 152-5, and data element 152-8 (generated atdevice 120 d) depends on data element 152-7. Thedependency tree 520 may correspond to another illustration of thetransformation dependency map 168. - Analyzing the
dependency tree 520 vertically and horizontally may provide meaning full information. Thedata elements 152 at each row of thedependency tree 520 may be directly communicated to thedestination device 120 e. - For example, the top row of the
dependency tree 520 includes data elements 152-1 to 152-5. Thesedata elements 152 may be directly communicated to thedestination device 120 e from thesource device 120 a. In another example, the middle row of thedependency tree 520 includes data elements 152-6 and 152-7. The data element 152-6 can be communicated to thedestination device 120 e directly from thedevice 120 b. The data element 152-7 can be communicated to thedestination device 120 e directly from thedevice 120 c. In another example, the bottom row of thedependency tree 520 includes data element 152-8 which can be communicated to thedestination device 120 e directly from thedevice 120 d. These communications are based on the shortestdata transfer path 174 for eachdata element 152. Theprocessing engine 144 determines thedevice dependency map 170 and the data transferpaths 174, similar to that described inFIG. 2 . - As can be seen from the
device dependency map 170, a first subset ofdata elements 152 is communicated from thedevice 120 a todevice 120 e using afirst transfer path 174, a second subset ofdata elements 152 is communicated from thedevice 120 a todevice 120 e viadevice 120 b. using asecond transfer path 174, and a third subset ofdata elements 152 is communicated from thedevice 120 a todevice 120 e via thedevices third transfer path 174. These subsets ofdata elements 152 may be split using themethod 400 described inFIG. 4 . These data transferpaths 174 correspond to the shortestdata transfer path 174 determined for each subset ofdata elements 152, similar to that described inFIG. 2 . The data transferpaths 174 for thedata elements 152 are shown in Table 7. -
TABLE 7 Example data transfer paths for data elements. Devices 120 Data elements 152S1->D1 152-1 152-2 152-3 152-4 152-5 S1->S2 152-4 152-5 S2->D1 152-6 S1->S3 152-3 152-4 152-5 S3->S4 152-3 152-4 152-5 152-7 S4->D1 152-7 152-8 - S1 represents
device 120 a, S2 representsdevice 120 b, S3 representsdevice 120 c, S4 representsdevice 120 d, and D1 representsdestination device 120 e. The data elements 152-1 to 152-5 are communicated from S1 to D1, data element 152-6 is communicated from S2 to D1, and data elements 152-4 and 152-5 are communicated from S4 to D1. Thesetransfer paths 174 correspond to the shortestdata transfer path 174 for eachdata element 152, and other data transferpaths 174 are ignored. -
FIG. 6 illustrates an example operational flow 600 for determining the shortestdata transfer paths 174 fordata elements 152 in a particular use case. The operational flow 600 begins when theprocessing engine 144 accesses the set of devices 120, similar to that described inFIG. 2 . Theprocessing engine 144 determines historical and/or existing data transferpaths 172. Theprocessing engine 144 determines thedata elements 152 at each device 120. An example table illustrating the existingdata transfer paths 172 fordata elements 152 is shown in Table 8. Eachdata element 152 and/ordataset 154 may be associated with a key (e.g., an identifier or a flag) that is used to identify thedata element 152 and/ordataset 154. -
TABLE 8 Example existing data transfer paths 172.Devices 120 Data elements 152S1->S2 152-1 152-2 152-3 152-4 152-5 S2->S3 152-1 152-2 152-3 152-4 152-5 152-6 S3->S4 152-1 152-2 152-3 152-4 152-5 152-6 152-7 S4->D1 152-1 152-2 152-3 152-4 152-5 152-6 152-7 152-8 - Table 8 may correspond to Table 1 described above in
FIG. 5 . The following Tables 9 to 14 support the operational flow 600 for this particular use case. -
TABLE 9 Example arrays 156 anddatasets 154 for thedata elements 152.Devices 120 Arrays 156 S1 T(152- T(152- T(152- T(152- T(152- 1, nil, y, 2, nil, y, 3, nil, y, 4, nil, y, 5, nil, y, S1) S1) S1) S1) S1) S2 T(152- T(152- T(152- T(152- T(152- T(152- 1, nil, y, 2, nil, y, 3, nil, y, 4, nil, y, 5, nil, y, 6, t(152- S2) S2) S2) S2) S2) 4, 152- 5), y, S2) S3 T(152- T(152- T(152- T(152- T(152- T(152- T(152- 1, nil, y, 2, nil, y, 3, nil, y, 4, nil, y, 5, nil, y, 6, nil, y, 7, t(152- S3) S3) S3) S3) S3) S3) 1, 152- 3), y, S3) S4 T(152- T(152- T(152- T(152- T(152- T(152- T(152- T(152- 1, nil, y, 2, nil, y, 3, nil, y, 4, nil, y, 5, nil, y, 6, nil, y, 7, nil, y, 8, t(152- S4) S4) S4) S4) S4) S4) S4) 7, 152- 6), y, S4) - The
processing engine 144 feeds this information to themachine learning module 166. Themachine learning module 166 analyzes this information and determines which data element(s) 152 are transformed at which device(s) 120 and which data element(s) 152 are not transformed at which device(s) 120. For example, themachine learning module 166 determinesdata elements 152 that are transformed and not transformed atdevices -
TABLE 10 Example data elements transformations Arrays 156 S2 ∩ S1 T(152-1, T(152-2, T(152-3, T(152-4, T(152-5, nil, y, S1) nil, y, S1) nil, y, S1) nil, y, S1) nil, y, S1) S2 − S1 T(152-6, t(152-4, 152-5), y, S2) - Similarly, the
machine learning module 166 determinesdata elements 152 that are transformed atdevices -
TABLE 11 Example data elements transformations. Arrays 156S3 ∩ S2 T(152-1, T(152-2, T(152-3, T(152-4, T(152-5, T(152-6, nil, y, nil, y, S2) nil, y, S2) nil, y, S2) nil, y, S2) nil, y, S2) S2) S3 ∩ S2 ∩ T(152-1, T(152-2, T(152-3, T(152-4, T(152-5, S1 nil, y, S1) nil, y, S1) nil, y, S1) nil, y, S1) nil, y, S1) S3-S2 T(152-7, t(152-1, 152-3), y, S3) - Similarly, the
machine learning module 166 determinesdata elements 152 that are transformed atdevices 120 b to 120 d, similar to that shown in Table 12. -
TABLE 12 Example data elements transformations. Arrays 156 S4 ∩ S3 T(152-1, T(152-2, T(152-3, T(152-4, T(152-5, T(152-6, T(152-7, nil, y, S3) nil, y, S3) nil, y, S3) nil, y, S3) nil, y, S3) nil, y, S3) nil, y, S3) S4 ∩ S3 ∩ T(152-1, T(152-2, T(152-3, T(152-4, T(152-5, T(152-6, nil, y, S2) S2 nil, y, S2) nil, y, S2) nil, y, S2) nil, y, S2) nil, y, S2) S4 ∩ S3 ∩ T(152-l, T(152-2, T(152-3, T(152-4, T(152-5, nil, y, S1) S2 ∩ S1 nil, y, S1) nil, y, S1) nil, y, S1) nil, y, S1) S4-S3 T(152-8, t(152-7, 152-6), y, S4) - Based on the information in Tables 10 to 12, the processing engine 144 (e.g., via the machine learning module 166) determines the dependencies between the
devices 120 a to 120 d, similar to that shown in Table 13. -
TABLE 13 device dependencies dataflow. Devices 120 Arrays 156S1 T(152-1, T(152-2, T(152-3, T(152-4, T(152-5, nil, y, S1) nil, y, S1) nil, y, S1) nil, y, S1) nil, y, S1) S1 <- S2 T(152-4, nil, y, S2) T(152-5, nil, y, S2) S1 <- S3 T(152-1, nil, y, S1) T(152-3, nil, y, S1) S3 <- S4 T(152-7, nil, y, S3) T(152-7, nil, y, S3) - Based on this information, the
processing engine 144 determines thetransformation tree 510. Thetransformation tree 510 represents dependencies betweendevices 120 a to 120 d. Thetransformation tree 510 is a graphical representation of Table 13. Theprocessing engine 144 determines thetransformation dependency map 168,dependency tree 520, anddevice dependency map 170, similar to that described inFIG. 2 . For example, thetransformation dependency map 168 represents whichdata elements 152 are transformed at which devices 120 and whichdata elements 152 are not transformed at which devices 120. - Analyzing the
dependency tree 520 vertically and horizontally may provide meaning full information. Thedata elements 152 at each row of thedependency tree 520 may be directly communicated to thedestination device 120 e. - The data elements 152-1 to 152-5 can be communicated directly to the
destination device 120 e (i.e., D1) from thesource device 120 a. The data element 152-6 can be communicated to thedestination device 120 e directly from thedevice 120 b. The data element 152-7 can be communicated to thedestination device 120 e directly from thedevice 120 c. The data element 152-The data element 152-8 can be communicated to thedestination device 120 e directly from thedevice 120 d. These communications are based on the shortestdata transfer path 174 for eachdata element 152. Theprocessing engine 144 determines thedevice dependency map 170 and the data transferpaths 174, similar to that described inFIG. 2 . - The
device dependency map 170 illustrates the shortestdata transfer paths 174 of thedata elements 152 based on the operational flow 600. Thesedata elements 152 may be split using themethod 400 described inFIG. 4 . These data transferpaths 174 correspond to the shortestdata transfer path 174 determined for each subset ofdata elements 152, similar to that described inFIGS. 2 and 5 . The data transferpaths 174 for thedata elements 152 are shown in Table 14. -
TABLE 14 Example data transfer paths for data elements. Devices 120 Data elements 152S1->S2 152-4 152-5 S1->S3 152-1 152-3 S2->S4 152-6 S3->S4 152-7 S1->D1 152-1 152-2 152-3 152-4 152-5 S2->D1 152-6 S3->D1 152-7 S4->D1 152-8 - The data elements 152-1 to 152-5 can be communicated directly from S1 to D1, the data element 152-6 can be communicated directly from S2 to D1, the data element 152-7 can be communicated directly from S3 to D1, and the data element 152-8 can be communicated directly from S4 to D1. These
transfer paths 174 correspond to the shortestdata transfer path 174 for eachdata element 152. - While several embodiments have been provided in the present disclosure, it should be understood that the disclosed systems and methods might be embodied in many other specific forms without departing from the spirit or scope of the present disclosure. The present examples are to be considered as illustrative and not restrictive, and the intention is not to be limited to the details given herein. For example, the various elements or components may be combined or integrated with another system or certain features may be omitted, or not implemented.
- In addition, techniques, systems, subsystems, and methods described and illustrated in the various embodiments as discrete or separate may be combined or integrated with other systems, modules, techniques, or methods without departing from the scope of the present disclosure. Other items shown or discussed as coupled or directly coupled or communicating with each other may be indirectly coupled or communicating through some interface, device, or intermediate component whether electrically, mechanically, or otherwise. Other examples of changes, substitutions, and alterations are ascertainable by one skilled in the art and could be made without departing from the spirit and scope disclosed herein.
- To aid the Patent Office, and any readers of any patent issued on this application in interpreting the claims appended hereto, applicants note that they do not intend any of the appended claims to invoke 35 U. S.C. § 112(f) as it exists on the date of filing hereof unless the words “means for” or “step for” are explicitly used in the particular claim.
Claims (20)
1. A system for communicating data elements using the shortest data transfer path among devices, comprising:
a memory configured to store one or more data elements;
a processor, operably coupled with the memory, and configured to:
access a set of devices transferring the one or more data elements from a source device to a destination device;
for a data element from among the one or more data elements at a given device from among the set of devices:
determine a transformation type implemented on the data element, wherein the transformation type represents a type of change made to the data element; and
generate an array that uniquely defines the data element, wherein the array comprises the transformation type and an identifier of the given device;
generate a transformation dependency map that represents a set of transformation types implemented on the data element at different devices from among the set of devices;
determine a set of data transfer paths for the data element from the source device to the destination device based at least in part upon the transformation dependency map, wherein each of the set of data transfer paths has a different number of hops between the set of devices;
select the shortest data transfer path from among the set of data transfer paths for the data element from the source device to the destination device that corresponds to the least number of hops between devices; and
communicate the data element from the source device to the destination device using the shortest data transfer path.
2. The system of claim 1 , wherein:
the processor is further configured to determine a device dependency map that represents dependencies among the set of devices; and
determining the set of data transfer paths for the data element from the source device to the destination device is further based at least in part upon the device dependency map.
3. The system of claim 1 , wherein:
the array further comprises a name of the data element and a data type associated with the data element; and
the data type associated with the data element comprises a number, a character, a character string, a composite type, or any combination thereof.
4. The system of claim 1 , wherein the processor is further configured to:
determine that the data element is passed through a particular device from among the set of devices without being transformed using the transformation type; and
remove the particular device from the set of data transfer paths for the data element from the source device to the destination device.
5. The system of claim 1 , wherein the transformation type implemented on the data element comprises a normalization operation or a duplicated data removal operation.
6. The system of claim 1 , wherein:
the processor is further configured to identify a set of historical data transfer paths for the data element from the source device to the destination device; and
determining the set of data transfer paths is further based at least in part upon the set of historical data transfer paths.
7. The system of claim 1 , wherein, in response to determining that two data transfer paths for the data element have the least number of hops for the data element from the source device to the destination device, the processor is further configured to identify a particular data transfer path from among the two data transfer paths based at least in part upon a predefined rule, wherein the predefined rule indicates selecting a data transfer path that maximizes data security and data quality.
8. A method for communicating data elements using the shortest data transfer path among devices, comprising:
accessing a set of devices transferring one or more data elements from a source device to a destination device;
for a data element from among the one or more data elements at a given device from among the set of devices:
determining a transformation type implemented on the data element, wherein the transformation type represents a type of change made to the data element; and
generating an array that uniquely defines the data element, wherein the array comprises the transformation type and an identifier of the given device;
generating a transformation dependency map that represents a set of transformation types implemented on the data element at different devices from among the set of devices;
determining a set of data transfer paths for the data element from the source device to the destination device based at least in part upon the transformation dependency map, wherein each of the set of data transfer paths has a different number of hops between the set of devices;
selecting the shortest data transfer path from among the set of data transfer paths for the data element from the source device to the destination device that corresponds to the least number of hops between devices; and
communicating the data element from the source device to the destination device using the shortest data transfer path.
9. The method of claim 8 , further comprising:
determining a device dependency map that represents dependencies among the set of devices; and
determining the set of data transfer paths for the data element from the source device to the destination device is further based at least in part upon the device dependency map.
10. The method of claim 8 , wherein:
the array further comprises a name of the data element and a data type associated with the data element; and
the data type associated with the data element comprises a number, a character, a character string, a composite type, or any combination thereof.
11. The method of claim 8 , further comprising:
determining that the data element is passed through a particular device from among the set of devices without being transformed using the transformation type; and
removing the particular device from the set of data transfer paths for the data element from the source device to the destination device.
12. The method of claim 8 , wherein the transformation type implemented on the data element comprises a normalization operation or a duplicated data removal operation.
13. The method of claim 8 , further comprising:
identifying a set of historical data transfer paths for the data element from the source device to the destination device; and
determining the set of data transfer paths is further based at least in part upon the set of historical data transfer paths.
14. The method of claim 8 , further comprising, in response to determining that two data transfer paths for the data element have the least number of hops for the data element from the source device to the destination device, identifying a particular data transfer path from among the two data transfer paths based at least in part upon a predefined rule, wherein the predefined rule indicates selecting a data transfer path that maximizes data security and data quality.
15. A computer program comprising executable instructions stored in a non-transitory computer-readable medium that when executed by a processor causes the processor to:
access a set of devices transferring one or more data elements from a source device to a destination device;
for a data element from among the one or more data elements at a given device from among the set of devices:
determine a transformation type implemented on the data element, wherein the transformation type represents a type of change made to the data element; and
generate an array that uniquely defines the data element, wherein the array comprises the transformation type and an identifier of the given device;
generate a transformation dependency map that represents a set of transformation types implemented on the data element at different devices from among the set of devices;
determine a set of data transfer paths for the data element from the source device to the destination device based at least in part upon the transformation dependency map, wherein each of the set of data transfer paths has a different number of hops between the set of devices;
select the shortest data transfer path from among the set of data transfer paths for the data element from the source device to the destination device that corresponds to the least number of hops between devices; and
communicate the data element from the source device to the destination device using the shortest data transfer path.
16. The computer program of claim 15 , wherein:
the instructions when executed by the processor, further cause the processor to determine a device dependency map that represents dependencies among the set of devices; and
determining the set of data transfer paths for the data element from the source device to the destination device is further based at least in part upon the device dependency map.
17. The computer program of claim 15 , wherein:
the array further comprises a name of the data element and a data type associated with the data element; and
the data type associated with the data element comprises a number, a character, a character string, a composite type, or any combination thereof.
18. The computer program of claim 15 , wherein the instructions when executed by the processor, further cause the processor to:
determine that the data element is passed through a particular device from among the set of devices without being transformed using the transformation type; and
remove the particular device from the set of data transfer paths for the data element from the source device to the destination device.
19. The computer program of claim 15 , wherein the transformation type implemented on the data element comprises a normalization operation or a duplicated data removal operation.
20. The computer program of claim 15 , wherein:
the instructions when executed by the processor, further cause the processor to identify a set of historical data transfer paths for the data element from the source device to the destination device; and
determining the set of data transfer paths is further based at least in part upon the set of historical data transfer paths.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US17/583,460 US11716278B1 (en) | 2022-01-25 | 2022-01-25 | System and method for determining the shortest data transfer path in data communication |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US17/583,460 US11716278B1 (en) | 2022-01-25 | 2022-01-25 | System and method for determining the shortest data transfer path in data communication |
Publications (2)
Publication Number | Publication Date |
---|---|
US20230239233A1 true US20230239233A1 (en) | 2023-07-27 |
US11716278B1 US11716278B1 (en) | 2023-08-01 |
Family
ID=87314802
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US17/583,460 Active 2042-02-11 US11716278B1 (en) | 2022-01-25 | 2022-01-25 | System and method for determining the shortest data transfer path in data communication |
Country Status (1)
Country | Link |
---|---|
US (1) | US11716278B1 (en) |
Families Citing this family (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20230018654A1 (en) * | 2021-06-17 | 2023-01-19 | Nubis Communications, Inc. | Communication systems having pluggable modules |
US20230239236A1 (en) * | 2022-01-25 | 2023-07-27 | Bank Of America Corporation | System and method for splitting data elements for data communication based on transformation types implemented on the data elements at different devices |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20200127915A1 (en) * | 2016-05-16 | 2020-04-23 | Mitsubishi Electric Corporation | Transfer device, adjustment device, and parameter adjusting method |
US20210058826A1 (en) * | 2019-09-10 | 2021-02-25 | Intel Corporation | Techniques for integrated access and backhaul (iab) nodes |
Family Cites Families (50)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4888690A (en) | 1985-01-11 | 1989-12-19 | Wang Laboratories, Inc. | Interactive error handling means in database management |
US5694546A (en) | 1994-05-31 | 1997-12-02 | Reisman; Richard R. | System for automatic unattended electronic information transport between a server and a client by a vendor provided transport software with a manifest list |
KR100595924B1 (en) | 1998-01-26 | 2006-07-05 | 웨인 웨스터만 | Method and apparatus for integrating manual input |
US6862622B2 (en) | 1998-07-10 | 2005-03-01 | Van Drebbel Mariner Llc | Transmission control protocol/internet protocol (TCP/IP) packet-centric wireless point to multi-point (PTMP) transmission system architecture |
US6564105B2 (en) | 2000-01-21 | 2003-05-13 | Medtronic Minimed, Inc. | Method and apparatus for communicating between an ambulatory medical device and a control device via telemetry using randomized data |
JP3868776B2 (en) | 2001-08-28 | 2007-01-17 | 株式会社日立製作所 | Bidirectional data transmission / reception method and system |
WO2003096669A2 (en) | 2002-05-10 | 2003-11-20 | Reisman Richard R | Method and apparatus for browsing using multiple coordinated device |
US8611919B2 (en) | 2002-05-23 | 2013-12-17 | Wounder Gmbh., Llc | System, method, and computer program product for providing location based services and mobile e-commerce |
US7360954B1 (en) | 2004-03-25 | 2008-04-22 | Cisco Technology, Inc. | Low speed data path for SFP-MSA interface |
WO2007024317A2 (en) | 2005-06-06 | 2007-03-01 | New World Tmt Limited | Quality of service in an optical network |
US7733224B2 (en) | 2006-06-30 | 2010-06-08 | Bao Tran | Mesh network personal emergency response appliance |
US8488447B2 (en) | 2006-06-30 | 2013-07-16 | Centurylink Intellectual Property Llc | System and method for adjusting code speed in a transmission path during call set-up due to reduced transmission performance |
WO2008082441A1 (en) | 2006-12-29 | 2008-07-10 | Prodea Systems, Inc. | Display inserts, overlays, and graphical user interfaces for multimedia systems |
US20080298805A1 (en) | 2007-05-30 | 2008-12-04 | Futurewei Technologies, Inc. | System and Method for Wavelength Conversion and Switching |
US8630192B2 (en) | 2009-01-28 | 2014-01-14 | Headwater Partners I Llc | Verifiable and accurate service usage monitoring for intermediate networking devices |
JP5120341B2 (en) | 2009-06-15 | 2013-01-16 | 富士通オプティカルコンポーネンツ株式会社 | Optical device |
US8612439B2 (en) | 2009-06-30 | 2013-12-17 | Commvault Systems, Inc. | Performing data storage operations in a cloud storage environment, including searching, encryption and indexing |
WO2011030889A1 (en) | 2009-09-14 | 2011-03-17 | 日本電気株式会社 | Communication system, forwarding node, path management server, communication method, and program |
US8422379B2 (en) | 2009-12-15 | 2013-04-16 | At&T Intellectual Property I, Lp | Method of simple and efficient failure resilient load balancing |
US8626474B2 (en) | 2010-04-19 | 2014-01-07 | Altera Corporation | Simulation tool for high-speed communications links |
US8831439B2 (en) | 2010-10-05 | 2014-09-09 | Infinera Corporation | Upsampling optical transmitter |
US10009108B2 (en) | 2011-02-11 | 2018-06-26 | Menara Networks, Inc. | Coherent and pulse amplitude modulation in a pluggable optical transceiver |
JP5216147B2 (en) | 2011-03-08 | 2013-06-19 | 日本オクラロ株式会社 | Differential transmission circuit, optical transceiver module, and information processing apparatus |
US9385917B1 (en) | 2011-03-31 | 2016-07-05 | Amazon Technologies, Inc. | Monitoring and detecting causes of failures of network paths |
US9536361B2 (en) | 2012-03-14 | 2017-01-03 | Autoconnect Holdings Llc | Universal vehicle notification system |
US9369371B2 (en) | 2012-10-05 | 2016-06-14 | Cisco Technologies, Inc. | Method and system for path monitoring using segment routing |
CN104704759B (en) | 2012-10-08 | 2017-11-24 | 华为技术有限公司 | The transmitting function virtualization of optical-fiber network based on wavelength-division multiplex (WDM) |
US8885510B2 (en) | 2012-10-09 | 2014-11-11 | Netspeed Systems | Heterogeneous channel capacities in an interconnect |
CN104885004A (en) | 2012-12-27 | 2015-09-02 | 株式会社藤仓 | Light modulation element |
US9264270B2 (en) | 2013-06-27 | 2016-02-16 | Intel Corporation | Transition time measurement of PAM4 transmitters |
US9471726B2 (en) | 2013-07-25 | 2016-10-18 | Netspeed Systems | System level simulation in network on chip architecture |
US9411100B2 (en) | 2013-09-20 | 2016-08-09 | Alcatel Lucent | Photonic lantern spatial multiplexers with mode selectivity |
US9450864B2 (en) | 2013-10-11 | 2016-09-20 | Futurewei Technologies, Inc. | Using PCE as SDN controller |
US9288143B2 (en) | 2013-10-14 | 2016-03-15 | Hewlett Packard Enterprise Development Lp | Data flow path determination |
US9888405B2 (en) | 2013-11-05 | 2018-02-06 | Cisco Technology, Inc. | Networking apparatuses and packet statistic determination methods employing atomic counters |
WO2016007867A2 (en) | 2014-07-11 | 2016-01-14 | Acacia Communications, Inc. | Multichannel coherent transceiver and related apparatus and methods |
US9671572B2 (en) | 2014-09-22 | 2017-06-06 | Oracle International Corporation | Integrated chip package with optical interface |
US10355940B2 (en) | 2014-09-22 | 2019-07-16 | Wolting Holding B.V. | Compiler for and method of software defined networking, storage and compute performing operations |
WO2016054028A1 (en) | 2014-09-29 | 2016-04-07 | Fiber Mountain, Inc. | Data center network |
US10009668B2 (en) | 2014-12-01 | 2018-06-26 | The Royal Institution For The Advancement Of Learning / Mcgill University | Methods and systems for board level photonic bridges |
US9602387B2 (en) | 2014-12-29 | 2017-03-21 | Juniper Networks, Inc. | Network topology optimization |
US9712447B2 (en) | 2014-12-29 | 2017-07-18 | Juniper Networks, Inc. | Point-to-multipoint path computation for wide area network optimization |
US10419152B2 (en) | 2015-03-25 | 2019-09-17 | Tevetron, Llc | Communication network employing network devices with packet delivery over pre-assigned optical channels |
CN106936657B (en) | 2015-12-30 | 2020-01-03 | 华为技术有限公司 | Method, device and system for realizing time delay detection |
JP6165286B1 (en) | 2016-02-29 | 2017-07-19 | 株式会社安川電機 | Motor control system, robot system, and motor control system communication method |
US10263881B2 (en) | 2016-05-26 | 2019-04-16 | Cisco Technology, Inc. | Enforcing strict shortest path forwarding using strict segment identifiers |
US10182000B2 (en) | 2016-08-03 | 2019-01-15 | Cisco Technology, Inc. | Loop detection and avoidance for segment routed traffic engineered paths |
US11032197B2 (en) | 2016-09-15 | 2021-06-08 | Cisco Technology, Inc. | Reroute detection in segment routing data plane |
US11333907B2 (en) | 2017-05-23 | 2022-05-17 | Rockley Photonics Limited | Optical engine |
JP7092993B2 (en) | 2018-03-06 | 2022-06-29 | 日本電信電話株式会社 | Optical transmission system and optical transmission method |
-
2022
- 2022-01-25 US US17/583,460 patent/US11716278B1/en active Active
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20200127915A1 (en) * | 2016-05-16 | 2020-04-23 | Mitsubishi Electric Corporation | Transfer device, adjustment device, and parameter adjusting method |
US20210058826A1 (en) * | 2019-09-10 | 2021-02-25 | Intel Corporation | Techniques for integrated access and backhaul (iab) nodes |
Also Published As
Publication number | Publication date |
---|---|
US11716278B1 (en) | 2023-08-01 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US11568305B2 (en) | System and method for customer journey event representation learning and outcome prediction using neural sequence models | |
EP3564829B1 (en) | A modified representational state transfer (rest) application programming interface (api) including a customized graphql framework | |
US11716278B1 (en) | System and method for determining the shortest data transfer path in data communication | |
US20180253335A1 (en) | Maintaining throughput of a stream processing framework while increasing processing load | |
EP2916242B1 (en) | Graph-based entity resolution for documents using either bucket or record centric parallelization | |
CA2855136C (en) | Systems and methods of precision sharing of big data | |
US10091282B2 (en) | Metadata-driven dynamic load balancing in multi-tenant systems | |
US20140173092A1 (en) | Exchange of server health and client information through headers for request management | |
US9990403B2 (en) | System and a method for reasoning and running continuous queries over data streams | |
US20160292581A1 (en) | Minimized processing of streaming changes into a semantic reasoner | |
JP2020501254A (en) | Method and system for anonymizing data stock | |
CN110169019B (en) | Network switch and database system with database function definition | |
US20150347914A1 (en) | Method for data parallel inference and apparatus thereof | |
US20140244666A1 (en) | Systems and methods for preventing overload of an application | |
US20230239236A1 (en) | System and method for splitting data elements for data communication based on transformation types implemented on the data elements at different devices | |
US10547565B2 (en) | Automatic determination and just-in-time acquisition of data for semantic reasoning | |
US10482070B2 (en) | Form field creation systems and methods | |
US9774688B2 (en) | Discovery of server functions | |
US10402243B2 (en) | Input analysis for dynamic data object definitions | |
US20150206075A1 (en) | Efficient Decision Making | |
US11934255B2 (en) | System and method for improving memory resource allocations in database blocks for executing tasks | |
US11893267B2 (en) | Data flow control and routing using machine learning | |
US20230229321A1 (en) | System and method for improving memory resource allocations in database blocks using blockchain | |
US20230325234A1 (en) | System and method for dynamic task scheduling | |
US20230237572A1 (en) | Structuring a Multi-Segment Operation |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: BANK OF AMERICA CORPORATION, NORTH CAROLINA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:GRANDHYE, NAGENDRA B.;RANDHI, VENUGOPALA RAO;VEGULLA, VIJAYA KUMAR;AND OTHERS;REEL/FRAME:058757/0503 Effective date: 20220124 |
|
FEPP | Fee payment procedure |
Free format text: ENTITY STATUS SET TO UNDISCOUNTED (ORIGINAL EVENT CODE: BIG.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
STCF | Information on status: patent grant |
Free format text: PATENTED CASE |