Embodiments of the invention relate to computerized systems and computerized methods configured to optimize data transmission paths in a large-scale computerized network relative to reliability and bandwidth requirements. Embodiments of the invention further relate to computerized systems and methods that direct and control the physical adjustments to data transmission paths in a large-scale network's composition of computerized data transmission nodes in order to limit data end-to-end transmission delay in a computerized network to a delay within a calculated worst-case delay bound.
Legal claims defining the scope of protection. Each claim is shown in both the original legal language and a plain English translation.
1. An electronic data transmission scheduling system for a computer network having a plurality of computerized data transmission nodes and a plurality of electronic aggregators, wherein each computerized data transmission node of the plurality of computerized data transmission nodes has at least one data transmission link of a plurality of data transmission links to another computerized data transmission node of the plurality of computerized data transmission nodes, and wherein each electronic aggregator of the plurality of electronic aggregators forwards data to a set of computerized data transmission nodes of the plurality of computerized data transmission nodes, a configuration of the plurality of computerized data transmission nodes and the plurality of data transmission links collectively forming a network topology, the electronic data transmission scheduling system, comprising: an electronic reliability checker that examines possible data transmission routes between computerized data transmission nodes of the plurality of computerized data transmission nodes and data transmission links of the plurality of data transmission links to determine a network mapping reliability score for the network topology, wherein the network mapping reliability score represents a probability that an electronic aggregator of the plurality of the electronic aggregators connects to at least one computerized data transmission node of a set of computerized data transmission nodes given computerized data transmission node and data transmission link failure probabilities; an electronic bandwidth checker configured to calculate bandwidth allocations and a flow routing plan for the network topology, wherein the electronic bandwidth checker develops calculated bandwidth allocations and the flow routing plan by testing different combinations of data transmission links from the plurality of data transmission links and different combinations computerized data transmission nodes of the plurality of computerized data transmission nodes, wherein the electronic bandwidth checker calculates bandwidth allocations and the flow routing plan for the network topology to ensure flow routability in line with predetermined bandwidth requirements, by evaluating routability of different combinations of inter-traffic between computerized data transmission nodes in the plurality of computerized data transmission nodes given the network topology and estimated traffic characteristics and flow demands, wherein the network topology comprises a mapping of the plurality of computerized data transmission nodes to the network topology and associations between computerized data transmission nodes and the plurality of computerized data transmission nodes, wherein the electronic bandwidth checker further calculates bandwidth allocations for the network topology by computing whether all flows can be routed without overloading any transmission links from the plurality of data transmission links relative to predetermined bandwidth constraints, with all possible paths; and an electronic resource planner that applies the network mapping reliability score from the electronic reliability checker, traffic characteristics and demands, and the calculated bandwidth allocations and the flow routing plan from the electronic bandwidth checker to evaluate and develop a computer-implementable deployment strategy that directs rearrangement of the network topology, by calculating and evaluating a trade-off between the network mapping reliability score, estimated bandwidth demands, the calculated bandwidth allocations and the flow routing plan that satisfies predetermined requirements for reliability and bandwidth.
This system relates to optimizing data transmission scheduling in computer networks with multiple nodes and aggregators. The system addresses the challenge of ensuring reliable and efficient data flow in complex network topologies, where node or link failures could disrupt connectivity and bandwidth constraints must be respected. The system includes a reliability checker that analyzes possible data transmission routes to assess the probability that aggregators maintain connections to designated nodes, accounting for potential failures. It generates a reliability score based on node and link failure probabilities. A bandwidth checker calculates bandwidth allocations and flow routing plans by testing different link and node combinations. It ensures routability meets predetermined bandwidth requirements by evaluating inter-node traffic flows against the network topology and estimated demands. The checker verifies that all flows can be routed without overloading any links relative to bandwidth constraints. An resource planner integrates the reliability score, traffic characteristics, and bandwidth allocations to develop a deployment strategy. It evaluates trade-offs between reliability and bandwidth demands to optimize the network topology, ensuring it meets predefined reliability and bandwidth requirements. The system dynamically rearranges the network to balance these factors.
2. The electronic data transmission scheduling system of claim 1 , wherein the electronic reliability checker determines the network mapping reliability score for the network topology relative to a predetermined reliability requirement, wherein the electronic reliability checker further determines the network mapping reliability score by calculating a lower reliability bound.
The invention relates to an electronic data transmission scheduling system designed to optimize network reliability in data transmission. The system addresses the challenge of ensuring reliable data transfer across network topologies by evaluating and enhancing network reliability before transmission occurs. A key component is an electronic reliability checker that assesses the network topology's reliability against predetermined requirements. The reliability checker calculates a network mapping reliability score, which includes determining a lower reliability bound to ensure that the network meets or exceeds the specified reliability thresholds. This evaluation helps prevent data transmission failures by identifying and mitigating potential reliability issues in the network structure before data is sent. The system dynamically adjusts transmission parameters based on the reliability score to maintain consistent and dependable data transfer. The lower reliability bound calculation provides a conservative estimate of network performance, ensuring that even under worst-case conditions, the network meets the required reliability standards. This approach is particularly useful in environments where network conditions are variable or unpredictable, such as wireless or distributed networks. The system's ability to preemptively assess and adjust for reliability issues enhances overall data transmission efficiency and success rates.
3. The electronic data transmission scheduling system of claim 1 wherein the electronic bandwidth checker calculates the bandwidth allocations for the network topology by calculating a maximum concurrent flow, according to an equation: maximize λ ( 15 ) s . t . : ∑ K : ɛ ∋ K X ( K ) ≤ u e , ∀ e ∈ E ( 16 ) ∑ K ∈ κ f X ( K ) ≥ λ d f , ∀ f ∈ F ( 17 ) X ( K ) ≥ 0 , ∀ K . ( 18 )
The invention relates to an electronic data transmission scheduling system designed to optimize bandwidth allocation in network topologies. The system addresses the challenge of efficiently distributing limited network resources to maximize data flow while avoiding congestion. A key component is an electronic bandwidth checker that calculates bandwidth allocations by determining a maximum concurrent flow. This is achieved using a mathematical optimization equation that maximizes the flow rate (λ) subject to constraints. The constraints ensure that the sum of flows on each network link (e) does not exceed its capacity (u_e), and that the total flow for each data transmission request (f) meets or exceeds its demand (d_f). The solution enforces non-negativity for all flow variables (X_K). The system dynamically adjusts allocations to maintain optimal performance across the network, ensuring efficient data transmission without overloading any single link. This approach is particularly useful in high-traffic environments where bandwidth must be carefully managed to prevent bottlenecks and ensure reliable communication.
4. The electronic data transmission scheduling system of claim 1 , wherein the electronic reliability checker comprises a first field-programmable gate array (FPGA), wherein the electronic bandwidth checker comprises a second field-programmable gate array (FPGA), and wherein the electronic resource planner comprises a third field-programmable gate array (FPGA).
The invention relates to an electronic data transmission scheduling system designed to optimize data transfer in network environments. The system addresses the challenge of efficiently managing data transmission by ensuring reliability, monitoring bandwidth usage, and planning resource allocation to prevent congestion and improve performance. The system includes three key components implemented as separate field-programmable gate arrays (FPGAs) for specialized processing. The first FPGA functions as an electronic reliability checker, verifying the integrity and stability of data transmission paths to prevent errors or disruptions. The second FPGA operates as an electronic bandwidth checker, continuously assessing available network bandwidth to avoid overloading and ensure optimal data flow. The third FPGA serves as an electronic resource planner, dynamically allocating network resources based on current demand and system capabilities to maximize efficiency. By distributing these functions across dedicated FPGAs, the system enhances processing speed and reliability compared to software-based solutions. The FPGAs enable real-time adjustments to transmission parameters, improving adaptability in varying network conditions. This architecture ensures that data transmission remains consistent, efficient, and scalable, making it suitable for high-performance computing and large-scale network applications.
5. The electronic data transmission scheduling system of claim 1 , wherein the electronic resource planner evaluates and calculates the mapping and association of computerized transmission nodes and the plurality of computerized transmission nodes, by assessing the calculated reliability score, traffic characteristics and demands, routing plan and the routability of the calculated bandwidth allocations and calculated end-to-end delay, relative to predetermined requirements for reliability, bandwidth and end-to-end delay, wherein the electronic data transmission scheduling system further comprises estimation of traffic characteristics and demands.
This invention relates to an electronic data transmission scheduling system designed to optimize the routing and scheduling of data transmissions across a network of computerized transmission nodes. The system addresses the challenge of efficiently allocating bandwidth and managing transmission delays while ensuring reliability in data delivery. The core functionality involves evaluating and calculating the mapping and association of transmission nodes based on multiple factors, including reliability scores, traffic characteristics, demand patterns, routing plans, and the routability of bandwidth allocations and end-to-end delays. The system compares these calculated metrics against predetermined requirements for reliability, bandwidth, and delay to determine the most effective transmission paths. Additionally, the system includes an estimation module to predict traffic characteristics and demands, enabling proactive adjustments to transmission schedules. By dynamically assessing these parameters, the system ensures that data transmissions meet specified performance criteria while optimizing resource utilization across the network. The invention is particularly useful in environments where reliable, low-latency data transmission is critical, such as telecommunications, cloud computing, and distributed computing systems.
6. An electronic data transmission scheduling system for a computer network having a plurality of computerized data transmission nodes and a plurality of electronic aggregators, wherein each computerized data transmission node of the plurality of computerized data transmission nodes has at least one data transmission link of a plurality of data transmission links to another computerized data transmission node of the plurality of computerized data transmission nodes, and wherein each electronic aggregator of the plurality of electronic aggregators forwards data to a set of computerized data transmission nodes of the plurality of computerized data transmission nodes, a configuration of the plurality of computerized data transmission nodes and the plurality of data transmission links collectively forming a network topology, the electronic data transmission scheduling system, comprising: an electronic reliability checker that examines possible data transmission routes between computerized data transmission nodes of the plurality of computerized data transmission nodes and data transmission links of the plurality of data transmission links to determine a network mapping reliability score for the network topology, wherein the network mapping reliability score represents a probability that an electronic aggregator of the plurality of the electronic aggregators connects to at least one computerized data transmission node of a set of computerized data transmission nodes given computerized data transmission node and data transmission link failure probabilities; an electronic bandwidth checker configured to calculate bandwidth allocations and a flow routing plan for the network topology, wherein the electronic bandwidth checker develops calculated bandwidth allocations and the flow routing plan by testing different combinations of data transmission links from the plurality of data transmission links and different combinations computerized data transmission nodes of the plurality of computerized data transmission nodes; and an electronic resource planner that applies the network mapping reliability score from the electronic reliability checker, traffic characteristics and demands, and the calculated bandwidth allocations and the flow routing plan from the electronic bandwidth checker to evaluate and develop a computer-implementable deployment strategy that directs rearrangement of the network topology, by calculating and evaluating a trade-off between the network mapping reliability score, estimated bandwidth demands, the calculated bandwidth allocations and the flow routing plan that satisfies predetermined requirements for reliability and bandwidth, wherein the electronic resource planner further calculates mapping and association of network traffic given performance requirements on reliability and bandwidth for each data transmission link of the plurality of data transmission links.
This system addresses the challenge of optimizing data transmission in computer networks with multiple nodes and aggregators, ensuring reliable and efficient data flow despite potential node or link failures. The system evaluates network reliability by assessing possible transmission routes and calculating a reliability score based on failure probabilities, indicating the likelihood that aggregators maintain connections to designated nodes. It also analyzes bandwidth by testing various link and node combinations to determine optimal allocations and routing plans. A resource planner integrates these assessments, traffic demands, and performance requirements to develop a deployment strategy that balances reliability and bandwidth. The system dynamically rearranges the network topology to meet predefined reliability and bandwidth criteria, ensuring robust data transmission even under adverse conditions. The solution is particularly useful in large-scale networks where maintaining high availability and efficient data flow is critical.
7. The electronic data transmission scheduling system of claim 6 , wherein the electronic resource planner further estimates traffic characteristics and flow demands in the computer network and wherein the electronic resource planner further evaluates and calculates the mapping and association of computerized transmission nodes of the plurality of computerized transmission nodes, by assessing a calculated reliability score, traffic characteristics, flow demands, routing plan and routability of the calculated bandwidth allocation, relative to predetermined reliability and bandwidth requirements.
This invention relates to an electronic data transmission scheduling system designed to optimize network resource allocation in computer networks. The system addresses the challenge of efficiently managing data transmission by dynamically assessing network conditions and ensuring reliable data delivery. The system includes an electronic resource planner that estimates traffic characteristics and flow demands within the network. It evaluates and calculates the mapping and association of computerized transmission nodes by considering multiple factors. These include a calculated reliability score, traffic characteristics, flow demands, routing plans, and the routability of the bandwidth allocation. The system ensures that the calculated bandwidth allocation meets predetermined reliability and bandwidth requirements, optimizing network performance and data transmission efficiency. The electronic resource planner dynamically adjusts transmission schedules and resource allocation based on real-time network conditions, improving overall network reliability and reducing transmission delays. This approach enhances data transmission efficiency while maintaining high reliability standards. The system is particularly useful in large-scale networks where dynamic traffic patterns and varying demands require adaptive resource management.
8. The electronic data transmission scheduling system of claim 7 , wherein the electronic resource planner evaluates and calculates the mapping and association of computerized transmission nodes and the plurality of computerized transmission nodes, by assessing the calculated reliability score, traffic characteristics and demands, routing plan and the routability of the calculated bandwidth allocations and calculated end-to-end delay, relative to predetermined requirements for reliability, bandwidth and end-to-end delay, wherein the electronic data transmission scheduling system further comprises estimation of traffic characteristics and demands.
This invention relates to an electronic data transmission scheduling system designed to optimize the routing and scheduling of data transmissions across a network of computerized transmission nodes. The system addresses the challenge of efficiently allocating bandwidth and managing end-to-end delays while ensuring reliable data delivery, particularly in dynamic network environments where traffic demands and node reliability vary. The system includes an electronic resource planner that evaluates and calculates the mapping and association of transmission nodes by assessing multiple factors. These include the calculated reliability score of each node, traffic characteristics and demands, routing plans, and the routability of bandwidth allocations and end-to-end delays. The planner compares these factors against predetermined requirements for reliability, bandwidth, and delay to determine optimal transmission paths. Additionally, the system estimates traffic characteristics and demands to dynamically adjust routing decisions. This ensures that data transmissions meet performance criteria while adapting to changing network conditions. The overall goal is to enhance network efficiency, reduce latency, and improve reliability in data transmission scheduling.
9. The electronic data transmission scheduling system of claim 6 wherein the electronic resource planner calculates the mapping and association of the network traffic by randomly adding or removing a computerized data transmission node of the plurality of computerized processing nodes using an existing network topology map, wherein the electronic resource planning calculates a computer-implementable cost (energy) function for evaluating a new solution as: cost = min ( 0 , log 10 1 - R min 1 - β , λ - 1 ) .
This invention relates to an electronic data transmission scheduling system designed to optimize network traffic routing in a distributed computing environment. The system addresses the challenge of efficiently managing data transmission across multiple computerized processing nodes while minimizing energy consumption and computational overhead. The core functionality involves dynamically adjusting the network topology by randomly adding or removing nodes to improve traffic flow and resource utilization. The system employs an electronic resource planner that calculates the mapping and association of network traffic using an existing network topology map. This planner evaluates new network configurations by computing a cost function that balances energy efficiency and performance. The cost function is defined as cost = min(0, log10(1 - R_min / (1 - β)), λ - 1), where R_min represents a minimum performance threshold, β is a scaling factor, and λ is a penalty term for suboptimal configurations. By iteratively modifying the network topology and assessing the cost function, the system identifies optimal or near-optimal transmission paths that reduce energy consumption while maintaining acceptable performance levels. The random addition or removal of nodes allows the system to explore alternative network configurations, ensuring adaptability to changing traffic patterns and resource availability. This approach enhances scalability and reliability in large-scale distributed computing environments, making it suitable for applications requiring efficient data transmission and energy management.
10. The electronic data transmission scheduling system of claim 6 , wherein the electronic bandwidth checker calculates bandwidth allocations and the flow routing plan for the network topology to ensure flow routability in line with predetermined bandwidth requirements, by evaluating routability of different combinations of inter-traffic between computerized data transmission nodes in the plurality of computerized data transmission nodes given the network topology and estimated traffic characteristics and flow demands, wherein the network topology comprises a mapping of the plurality of computerized data transmission nodes to the network topology and associations between computerized data transmission nodes and the plurality of computerized data transmission nodes.
The system relates to electronic data transmission scheduling, specifically optimizing bandwidth allocation and routing in network topologies to ensure reliable data flow. The problem addressed is the need to efficiently manage network resources by determining optimal bandwidth assignments and routing paths while maintaining flow routability according to predefined bandwidth constraints. The system includes a bandwidth checker that calculates bandwidth allocations and flow routing plans for a network topology. This involves evaluating the routability of different inter-traffic combinations between multiple computerized data transmission nodes, considering the network topology and estimated traffic characteristics. The network topology is defined by a mapping of the nodes and their associations, which helps in assessing how data flows between them. The bandwidth checker ensures that the routing plan adheres to predetermined bandwidth requirements, preventing congestion and ensuring efficient data transmission. By analyzing various traffic scenarios, the system optimizes the allocation of available bandwidth and determines the most effective paths for data flow, improving overall network performance and reliability. The solution is particularly useful in complex networks where dynamic traffic demands and varying node connections require adaptive routing strategies.
11. The electronic data transmission scheduling system of claim 10 , wherein the electronic bandwidth checker further calculates bandwidth allocations for the network topology by computing whether all flows can be routed without overloading any transmission links from the plurality of data transmission links relative to predetermined bandwidth constraints, with all possible paths, and wherein the electronic bandwidth checker calculates the bandwidth allocations for the network topology by calculating a maximum concurrent flow, according to an equation: maximize s . t . : λ ( 15 ) ∑ K : e ∈ K X ( K ) ≤ u e , ∀ e ∈ E ( 16 ) ∑ K ∈ k f X ( K ) ≥ λ d f , ∀ f ∈ F ( 17 ) X ( K ) ≥ 0 , ∀ K . ( 18 )
The invention relates to an electronic data transmission scheduling system designed to optimize bandwidth allocation in network topologies. The system addresses the challenge of efficiently routing data flows across multiple transmission links without overloading any individual link, ensuring compliance with predetermined bandwidth constraints. The system includes a bandwidth checker that evaluates whether all data flows can be routed through the network without exceeding the capacity of any transmission link. This evaluation considers all possible paths within the network topology. The bandwidth checker calculates bandwidth allocations by determining the maximum concurrent flow that can be supported. This calculation is performed using a mathematical optimization framework, where the objective is to maximize the flow (s) subject to constraints. The constraints ensure that the sum of flows on all paths (K) sharing a link (e) does not exceed the link's capacity (u_e) for every link in the network (E). Additionally, the sum of flows on paths associated with each flow (f) must meet or exceed the demand (d_f) multiplied by a scaling factor (λ) for all flows (F). The solution variables (X(K)) representing the flow on each path must be non-negative. This approach ensures that the network operates within its bandwidth limits while maximizing throughput.
12. The electronic data transmission scheduling system of claim 6 , wherein the electronic reliability checker comprises a first field-programmable gate array (FPGA), wherein the electronic bandwidth checker comprises a second field-programmable gate array (FPGA), and wherein the electronic resource planner comprises a third field-programmable gate array (FPGA).
The invention relates to an electronic data transmission scheduling system designed to optimize data transfer in network environments. The system addresses challenges in ensuring reliable, high-bandwidth data transmission while efficiently managing network resources. The system includes three key components: an electronic reliability checker, an electronic bandwidth checker, and an electronic resource planner. The reliability checker evaluates the stability and integrity of data transmission paths, ensuring that data is transmitted without errors or disruptions. The bandwidth checker monitors available network capacity, assessing whether sufficient bandwidth exists to support the required data transfer rates. The resource planner allocates network resources dynamically, balancing load distribution to prevent congestion and maximize efficiency. Each of these components is implemented using a separate field-programmable gate array (FPGA), allowing for high-speed, parallel processing and customizable hardware configurations. The FPGAs enable real-time adjustments to transmission parameters, improving adaptability in varying network conditions. This modular FPGA-based architecture enhances performance, scalability, and reliability in data transmission scheduling.
13. The electronic data transmission scheduling system of claim 6 , wherein the electronic reliability checker determines the network mapping reliability score for the network topology relative to a predetermined reliability requirement, wherein the electronic reliability checker further determines the network mapping reliability score by calculating a lower reliability bound.
This invention relates to electronic data transmission scheduling systems designed to optimize network reliability in data transmission. The system addresses the challenge of ensuring reliable data transmission across network topologies by evaluating and improving the reliability of network mappings. The system includes an electronic reliability checker that assesses the network topology's reliability against predetermined requirements. The reliability checker calculates a network mapping reliability score, which involves determining a lower reliability bound to ensure that the network meets or exceeds the specified reliability thresholds. This lower bound calculation helps identify the minimum acceptable reliability level for the network, ensuring that data transmission remains robust and consistent. The system dynamically adjusts network mappings based on these reliability assessments to maintain optimal performance and prevent transmission failures. By incorporating this reliability scoring mechanism, the system enhances the dependability of data transmission in complex network environments.
14. An electronic data transmission scheduling system for a computer network having a plurality of computerized data transmission nodes and a plurality of electronic aggregators, wherein each computerized data transmission node of the plurality of computerized data transmission nodes has at least one data transmission link of a plurality of data transmission links to another computerized data transmission node of the plurality of computerized data transmission nodes, and wherein each electronic aggregator of the plurality of electronic aggregators forwards data to a set of computerized data transmission nodes of the plurality of computerized data transmission nodes, a configuration of the plurality of computerized data transmission nodes and the plurality of data transmission links collectively forming a network topology, the electronic data transmission scheduling system, comprising: an electronic reliability checker that examines possible data transmission routes between computerized data transmission nodes of the plurality of computerized data transmission nodes and data transmission links of the plurality of data transmission links to determine a network mapping reliability score for the network topology, wherein the network mapping reliability score represents a probability that an electronic aggregator of the plurality of the electronic aggregators connects to at least one computerized data transmission node of a set of computerized data transmission nodes given computerized data transmission node and data transmission link failure probabilities; an electronic bandwidth checker configured to calculate bandwidth allocations and a flow routing plan for the network topology, wherein the electronic bandwidth checker develops calculated bandwidth allocations and the flow routing plan by testing different combinations of data transmission links from the plurality of data transmission links and different combinations computerized data transmission nodes of the plurality of computerized data transmission nodes; and an electronic resource planner that applies the network mapping reliability score from the electronic reliability checker, traffic characteristics and demands, and the calculated bandwidth allocations and the flow routing plan from the electronic bandwidth checker to evaluate and develop a computer-implementable deployment strategy that directs rearrangement of the network topology, by calculating and evaluating a trade-off between the network mapping reliability score, estimated bandwidth demands, the calculated bandwidth allocations and the flow routing plan that satisfies predetermined requirements for reliability and bandwidth; and an electronic flow delay checker that determines a flow routing plan and an end-to-end delay of delivering a data packet from a sending computerized data transmission node of the plurality of computerized processing nodes to a destination computerized data transmission node of the plurality of computerized processing nodes over at least one data transmission link of a plurality of data transmission links, wherein the electronic flow delay checker evaluates whether a flow routing plan and calculated end-to-end delays satisfies estimated traffic characteristics and flow demands, calculated bandwidth allocations and predetermined end-to-end delay requirements, wherein the electronic resource planner is further configured to use the calculated end-to-end delay and flow routing plan along with the network mapping reliability score from the electronic reliability checker, traffic characteristics and demands, the calculated bandwidth allocation from the electronic bandwidth checker to evaluate and develop a computer-implementable deployment strategy that directs rearrangement of the network topology by calculating trade-offs among the network mapping reliability score, traffic characteristics and demands, the calculated bandwidth allocation, and calculated end-to-end delay that satisfies predetermined requirements for reliability, bandwidth and end-to-end delay.
This system optimizes data transmission scheduling in computer networks with multiple nodes and aggregators. The network includes interconnected nodes forming a topology, where aggregators forward data to subsets of nodes. The system evaluates network reliability, bandwidth allocation, and flow delays to improve deployment strategies. A reliability checker assesses route reliability by calculating a network mapping reliability score, which predicts connection probabilities under node and link failure conditions. A bandwidth checker tests link and node combinations to determine optimal bandwidth allocations and routing plans. A resource planner integrates reliability scores, traffic demands, and bandwidth data to develop deployment strategies that balance reliability, bandwidth, and delay requirements. Additionally, a flow delay checker evaluates routing plans and end-to-end delays to ensure they meet traffic demands and delay constraints. The system dynamically adjusts the network topology by analyzing trade-offs between reliability, bandwidth, and delay to meet predefined performance criteria. This approach enhances network efficiency and resilience by optimizing resource allocation and routing decisions.
15. The electronic data transmission scheduling system of claim 14 , wherein the electronic flow delay checker determines the end-to-end delay by calculating a worst-case end-to-end delay bound in sending the data packet from the sending computerized data transmission node of the plurality of computerized processing nodes to the destination computerized data transmission node of the plurality of computerized processing nodes over the at least one data transmission link of a plurality of data transmission links.
This invention relates to electronic data transmission scheduling systems designed to optimize data flow in distributed computing environments. The system addresses the challenge of ensuring timely and reliable data delivery across multiple interconnected nodes, particularly in scenarios where network conditions may introduce variable delays. The system includes a flow delay checker that calculates the worst-case end-to-end delay bound for transmitting a data packet from a sending node to a destination node over one or more data transmission links. This calculation helps predict the maximum possible delay a packet may experience, allowing the system to schedule transmissions more efficiently and avoid bottlenecks. The system also incorporates a data transmission scheduler that dynamically adjusts transmission timing based on the calculated delay bounds, ensuring that data packets are transmitted in a manner that meets performance requirements. Additionally, the system may include a data transmission link analyzer that assesses the characteristics of available data transmission links, such as bandwidth and latency, to further refine scheduling decisions. By integrating these components, the system enhances data transmission reliability and reduces the risk of delays in distributed computing environments.
16. The electronic data transmission scheduling system of claim 14 , wherein the electronic bandwidth checker calculates bandwidth allocations and the flow routing plan for the network topology to ensure flow routability in line with predetermined bandwidth requirements, by evaluating routability of different combinations of inter-traffic between computerized data transmission nodes in the plurality of computerized data transmission nodes given the network topology and estimated traffic characteristics and flow demands, wherein the network topology comprises a mapping of the plurality of computerized data transmission nodes to the network topology and associations between computerized data transmission nodes and the plurality of computerized data transmission nodes.
This invention relates to an electronic data transmission scheduling system designed to optimize bandwidth allocation and flow routing in network topologies. The system addresses the challenge of ensuring efficient and reliable data transmission by dynamically assessing network conditions and traffic demands. The core component is an electronic bandwidth checker that calculates bandwidth allocations and generates flow routing plans to maintain flow routability while meeting predetermined bandwidth requirements. The system evaluates the routability of various inter-traffic combinations between data transmission nodes within the network, considering the network topology and estimated traffic characteristics. The network topology includes a mapping of data transmission nodes and their associations, which the system uses to determine optimal routing paths. By analyzing different traffic flow scenarios, the system ensures that data transmission adheres to bandwidth constraints while maintaining network efficiency. This approach enhances network performance by preventing congestion and optimizing resource utilization. The invention is particularly useful in complex networks where dynamic traffic patterns and varying bandwidth demands require adaptive routing solutions.
17. The electronic data transmission scheduling system of claim 16 , wherein the electronic bandwidth checker further calculates bandwidth allocations for the network topology by computing whether all flows can be routed without overloading any transmission links from the plurality of data transmission links relative to predetermined bandwidth constraints, with all possible paths, and wherein the electronic bandwidth checker calculates the bandwidth allocations for the network topology by calculating a maximum concurrent flow, according to an equation: maximize s . t . : λ ( 15 ) ∑ K : e ∈ K X ( K ) ≤ u e , ∀ e ∈ E ( 16 ) ∑ K ∈ k f X ( K ) ≥ λ d f , ∀ f ∈ F ( 17 ) X ( K ) ≥ 0 , ∀ K . ( 18 )
The invention relates to an electronic data transmission scheduling system designed to optimize bandwidth allocation in network topologies. The system addresses the problem of efficiently routing data flows across a network while avoiding link overloading and ensuring bandwidth constraints are met. The system includes an electronic bandwidth checker that calculates bandwidth allocations by determining whether all data flows can be routed without exceeding predetermined bandwidth limits on any transmission links. The checker evaluates all possible paths in the network topology to ensure compliance with these constraints. The bandwidth checker computes the maximum concurrent flow using a mathematical optimization equation. This equation maximizes the flow (s) subject to constraints that ensure the sum of flows on each link does not exceed its capacity (u_e) and that the total flow for each data flow (f) meets or exceeds its demand (d_f). The solution ensures that all flows are routed without overloading any links, while also adhering to the network's bandwidth limitations. The system thus provides a method for dynamically allocating bandwidth in a way that optimizes network performance and prevents congestion.
18. The electronic data transmission scheduling system of claim 14 , wherein the electronic reliability checker comprises a first field-programmable gate array (FPGA), wherein the electronic bandwidth checker comprises a second field-programmable gate array (FPGA), wherein the electronic resource planner comprises a third field-programmable gate array (FPGA), and wherein the electronic flow delay checker comprises a fourth field-programmable gate array (FPGA).
This invention relates to an electronic data transmission scheduling system designed to optimize data transfer in networked environments. The system addresses challenges in ensuring reliable, high-bandwidth, and low-latency data transmission by dynamically assessing network conditions and resource availability. The system includes multiple specialized components: an electronic reliability checker, an electronic bandwidth checker, an electronic resource planner, and an electronic flow delay checker. Each of these components is implemented using a dedicated field-programmable gate array (FPGA) to enhance processing speed and efficiency. The reliability checker evaluates the stability of data transmission paths, while the bandwidth checker monitors available network capacity. The resource planner allocates network resources based on real-time demand, and the flow delay checker assesses and mitigates transmission delays. By using separate FPGAs for each function, the system achieves parallel processing, reducing latency and improving overall transmission performance. This architecture is particularly useful in high-performance computing, telecommunications, and real-time data processing applications where reliability and speed are critical. The FPGA-based implementation ensures low-latency decision-making and adaptability to varying network conditions.
19. The electronic data transmission scheduling system of claim 14 , wherein the electronic reliability checker determines the network mapping reliability score for the network topology relative to a predetermined reliability requirement, wherein the electronic reliability checker further determines the network mapping reliability score by calculating a lower reliability bound.
The invention relates to an electronic data transmission scheduling system designed to optimize network reliability in data transmission. The system addresses the problem of ensuring reliable data transmission across network topologies by evaluating network reliability and scheduling transmissions accordingly. The system includes an electronic reliability checker that assesses the reliability of a network topology by calculating a network mapping reliability score. This score is determined relative to a predetermined reliability requirement, ensuring that the network meets specified performance standards. The reliability checker further calculates a lower reliability bound, which provides a conservative estimate of the network's reliability, helping to avoid transmission failures. The system dynamically adjusts transmission schedules based on these reliability assessments, improving data transfer efficiency and minimizing errors. This approach is particularly useful in environments where network conditions vary, such as in wireless or distributed systems, where maintaining reliable data flow is critical. The invention enhances network performance by proactively identifying and mitigating potential reliability issues before they impact data transmission.
20. The electronic data transmission scheduling system of claim 14 , wherein the electronic resource planner calculates the mapping and association of the network traffic by randomly adding or removing a computerized data transmission node of the plurality of computerized processing nodes using an existing network topology map, wherein the electronic resource planning calculates a computer-implementable cost (energy) function for evaluating a new solution as: cost = min ( 0 , log 10 1 - R min 1 - β , λ - 1 ) .
The electronic data transmission scheduling system operates in the domain of network traffic optimization, addressing the challenge of efficiently managing data transmission across multiple computerized processing nodes to minimize energy consumption and improve performance. The system dynamically adjusts network traffic routing by randomly adding or removing nodes from the network topology, using an existing network map to guide these modifications. The core innovation lies in the electronic resource planner, which calculates the mapping and association of network traffic by evaluating new solutions through a computer-implementable cost function. This cost function, defined as cost = min(0, log10(1 - R_min / (1 - β)), λ - 1), quantifies the efficiency of each potential routing configuration. The function incorporates parameters such as the minimum resource utilization (R_min), a scaling factor (β), and a penalty term (λ) to balance energy consumption and network performance. By iteratively applying this cost function, the system optimizes the network topology to reduce energy usage while maintaining reliable data transmission. The random addition or removal of nodes ensures adaptability to varying network conditions, making the system suitable for dynamic environments. This approach enhances energy efficiency and network reliability in large-scale computing systems.
Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.
January 17, 2020
March 29, 2022
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.