US Patent Application 17886764. Robust Network Path Generation simplified abstract
Contents
Robust Network Path Generation
Organization Name
Inventor(s)
Ali Kemal Sinop of Fremont CA (US)
Sreenivas Gollapudi of Cupertino CA (US)
Konstantinos Kollias of San Jose CA (US)
Robust Network Path Generation - A simplified explanation of the abstract
This abstract first appeared for US patent application 17886764 titled 'Robust Network Path Generation
Simplified Explanation
The abstract of this patent application describes a computer-implemented method for generating alternative network paths. Here is a simplified explanation:
- The method involves obtaining a network graph, which represents the connections between different nodes in a network.
- It then determines flows for the edges of the network graph by resolving a linear system of weights associated with the edges. This means finding the optimal distribution of traffic or data across the network.
- The linear system is resolved over a reduced network graph, which simplifies the calculations.
- The solution of the linear system is propagated into different partitions of the network graph to determine the flows within each partition. This helps in understanding the flow of data within different sections of the network.
- Finally, the method determines a plurality of alternative paths across the network graph. This means identifying multiple routes that can be taken to reach a destination, providing redundancy and flexibility in the network.
In summary, this patent application describes a method for efficiently generating alternative network paths by resolving a linear system of weights and partitioning the network graph.
Original Abstract Submitted
Example aspects of the present disclosure provide for an example computer-implemented method for generating alternative network paths, the example method including obtaining a network graph; determining flows respectively for edges of the network graph by: resolving a linear system of weights associated with the edges, the linear system resolved over a reduced network graph, and propagating a solution of the linear system into a respective partition of a plurality of partitions of the network graph to determine at least one of the flows within the respective partition; and determining a plurality of alternative paths across the network graph.
