Abstract: Systems and methods may use a math programming model for designing an edge cloud network. The edge cloud network design may depend on various factors, including the number of edge cloud nodes, edge cloud node location, or traffic coverage, among other things.

Abstract: Systems and methods may use a math programming model for designing an edge cloud network. The edge cloud network design may depend on various factors, including the number of edge cloud nodes, edge cloud node location, or traffic coverage, among other things.

Abstract: Concepts and technologies disclosed herein are directed to the optimization of over-the-air (“OTA”) file distribution for connected cars based upon a heuristic scheduling algorithm. A schedule provided by the heuristic scheduling algorithm is designed to distribute OTA data flow to connected cars over the network (geographically) and over a scheduling time horizon (timely), and is capable of reducing the negative impact of OTA file updates on overall wireless network performance. This schedule is created based upon historical statistics associated with connected car driving patterns and simulations of connected car-specific OTA traffic over the network. By leveraging connected cars that connect to different cells at different times based upon driving patterns, the heuristic scheduling algorithm is effective in reducing OTA impact on the network.

Abstract: Systems and methods may use a math programming model for designing an edge cloud network. The edge cloud network design may depend on various factors, including the number of edge cloud nodes, edge cloud node location, or traffic coverage, among other things.

Abstract: Systems and methods may use a math programming model for designing an edge cloud network. The edge cloud network design may depend on various factors, including the number of edge cloud nodes, edge cloud node location, or traffic coverage, among other things.

Abstract: Systems and methods may use a math programming model for designing an edge cloud network. The edge cloud network design may depend on various factors, including the number of edge cloud nodes, edge cloud node location, or traffic coverage, among other things.

Abstract: Concepts and technologies disclosed herein are directed to the optimization of over-the-air (“OTA”) file distribution for connected cars based upon a heuristic scheduling algorithm. A schedule provided by the heuristic scheduling algorithm is designed to distribute OTA data flow to connected cars over the network (geographically) and over a scheduling time horizon (timely), and is capable of reducing the negative impact of OTA file updates on overall wireless network performance. This schedule is created based upon historical statistics associated with connected car driving patterns and simulations of connected car-specific OTA traffic over the network. By leveraging connected cars that connect to different cells at different times based upon driving patterns, the heuristic scheduling algorithm is effective in reducing OTA impact on the network.

Abstract: Concepts and technologies disclosed herein are directed to the optimization of over-the-air (“OTA”) file distribution for connected cars based upon a heuristic scheduling algorithm. A schedule provided by the heuristic scheduling algorithm is designed to distribute OTA data flow to connected cars over the network (geographically) and over a scheduling time horizon (timely), and is capable of reducing the negative impact of OTA file updates on overall wireless network performance. This schedule is created based upon historical statistics associated with connected car driving patterns and simulations of connected car-specific OTA traffic over the network. By leveraging connected cars that connect to different cells at different times based upon driving patterns, the heuristic scheduling algorithm is effective in reducing OTA impact on the network.

Abstract: Concepts and technologies disclosed herein are directed to the optimization of over-the-air (“OTA”) file distribution for connected cars based upon a heuristic scheduling algorithm. A schedule provided by the heuristic scheduling algorithm is designed to distribute OTA data flow to connected cars over the network (geographically) and over a scheduling time horizon (timely), and is capable to reducing the negative impact of OTA file updates on overall wireless network performance. This schedule is created based upon historical statistics associated with connected car driving patterns and simulations of connected car-specific OTA traffic over the network. By leveraging connected cars that connect to different cells at different times based upon driving patterns, the heuristic scheduling algorithm is effective in reducing OTA impact on the network.

Abstract: A method, computer-readable storage device and an apparatus for planning tracking areas in a wireless network are disclosed. For example, the method represents geographical neighbor relations between each pair of base stations in a first set, and represents in a third set a plurality of potential assignment options for each base station of the first set to tracking areas in a second set, represents the historical data on paging traffic among the base stations in the first set via a first parameter, and represents the historical data on tracking area update traffic among the tracking areas of the second set via a second parameter, and determines for each base station in the first set, the optimal assignment of a tracking area in the second set.

Abstract: A method, computer-readable storage device and an apparatus for planning tracking areas in a wireless network are disclosed. For example, the method represents geographical neighbor relations between each pair of base stations in a first set, and represents in a third set a plurality of potential assignment options for each base station of the first set to tracking areas in a second set, represents the historical data on paging traffic among the base stations in the first set via a first parameter, and represents the historical data on tracking area update traffic among the tracking areas of the second set via a second parameter, and determines for each base station in the first set, the optimal assignment of a tracking area in the second set.

Abstract: The invention relates to systems and methods for improving planning, scheduling, and supply chain management. Embodiments of the invention can provide some or all of the following: improved systems and methods for determining an optimal lot size, improved systems and methods for determining optimal WIP levels, improved systems and methods for an inventory advisor module, improved systems and methods for integrating functionality of a lot sizer and WIP module and an inventory module, improved systems and methods for implementing multi-echelon inventory analysis, and improved systems and methods for partitioning planning information.

Abstract: The invention relates to systems and methods for improving planning, scheduling, and supply chain management. Embodiments of the invention can provide some or all of the following: improved systems and methods for determining an optimal lot size, improved systems and methods for determining optimal WIP levels, improved systems and methods for an inventory advisor module, improved systems and methods for integrating functionality of a lot sizer and WIP module and an inventory module, improved systems and methods for implementing multi-echelon inventory analysis, and improved systems and methods for partitioning planning information.