Search NASA⌕ Search

SEARCH · Search NASA

Results for “Model Optimization”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 973 records · Page 54

Optimal Operation and Impact Assessment of Distributed Wind for Improving Efficiency and Resilience of Rural Electricity Systems

This project aims to empower rural utilities by developing advanced optimization models and algorithms for effectively integrating distributed wind energy alongside battery storage and other distributed energy resources (DERs). The primary objectives are to reduce peak demand, ensure reliable emergency power supply, and regulate voltage and frequency. To address operational challenges, the project introduces innovative mitigation strategies and ultrafast assessment frameworks to evaluate the impacts of distributed wind and DERs on rural grids, offering actionable solutions to potential issues. Economic viability is assessed through cost-benefit analysis using real rural utility data, ensuring the practical application of the project outcomes.

17 WIND ENERGY↗

Effective noise-suppressed and artifact-reduced reconstruction of SPECT data using a preconditioned alternating projection algorithm

Purpose: The authors have recently developed a preconditioned alternating projection algorithm (PAPA) with total variation (TV) regularizer for solving the penalized-likelihood optimization model for single-photon emission computed tomography (SPECT) reconstruction. This algorithm belongs to a novel class of fixed-point proximity methods. The goal of this work is to investigate how PAPA performs while dealing with realistic noisy SPECT data, to compare its performance with more conventional methods, and to address issues with TV artifacts by proposing a novel form of the algorithm invoking high-order TV regularization, denoted as HOTV-PAPA, which has been explored and studied extensively in the present work. Methods: Using Monte Carlo methods, the authors simulate noisy SPECT data from two water cylinders; one contains lumpy “warm” background and “hot” lesions of various sizes with Gaussian activity distribution, and the other is a reference cylinder without hot lesions. The authors study the performance of HOTV-PAPA and compare it with PAPA using first-order TV regularization (TV-PAPA), the Panin–Zeng–Gullberg one-step-late method with TV regularization (TV-OSL), and an expectation–maximization algorithm with Gaussian postfilter (GPF-EM). The authors select penalty-weights (hyperparameters) by qualitatively balancing the trade-off between resolution and image noise separately for TV-PAPA and TV-OSL. However, the authors arrived at the same penalty-weight value for both of them. The authors set the first penalty-weight in HOTV-PAPA equal to the optimal penalty-weight found for TV-PAPA. The second penalty-weight needed for HOTV-PAPA is tuned by balancing resolution and the severity of staircase artifacts. The authors adjust the Gaussian postfilter to approximately match the local point spread function of GPF-EM and HOTV-PAPA. The authors examine hot lesion detectability, study local spatial resolution, analyze background noise properties, estimate mean square errors (MSEs), and report the convergence speed and computation time. Results: HOTV-PAPA yields the best signal-to-noise ratio, followed by TV-PAPA and TV-OSL/GPF-EM. The local spatial resolution of HOTV-PAPA is somewhat worse than that of TV-PAPA and TV-OSL. Images reconstructed using HOTV-PAPA have the lowest local noise power spectrum (LNPS) amplitudes, followed by TV-PAPA, TV-OSL, and GPF-EM. The LNPS peak of GPF-EM is shifted toward higher spatial frequencies than those for the three other methods. The PAPA-type methods exhibit much lower ensemble noise, ensemble voxel variance, and image roughness. HOTV-PAPA performs best in these categories. Whereas images reconstructed using both TV-PAPA and TV-OSL are degraded by severe staircase artifacts; HOTV-PAPA substantially reduces such artifacts. It also converges faster than the other three methods and exhibits the lowest overall reconstruction error level, as measured by MSE. Conclusions: For high-noise simulated SPECT data, HOTV-PAPA outperforms TV-PAPA, GPF-EM, and TV-OSL in terms of hot lesion detectability, noise suppression, MSE, and computational efficiency. Unlike TV-PAPA and TV-OSL, HOTV-PAPA does not create sizable staircase artifacts. Moreover, HOTV-PAPA effectively suppresses noise, with only limited loss of local spatial resolution. Of the four methods, HOTV-PAPA shows the best lesion detectability, thanks to its superior noise suppression. HOTV-PAPA shows promise for clinically useful reconstructions of low-dose SPECT data.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Alternating Direction Decomposition with Strong Bounding and Convexification (ADDSBC) for Solving Security Constrained AC Unit Commitment Problems

This project aims to develop efficient and robust computational methods for solving the security-constrained unit commitment and alternating current optimal power flow problem (SC-UC-ACOPF). The SC-UC-ACOPF problem is at the center of the short-term operation of the U.S. Power Grid. It is solved every week, every day, and every 10 minutes to plan for the optimal action of electricity generation and consumption by minimizing the generation cost and maintaining power system reliability against potential disruptions of equipment failures. In mathematical terms, SC-UC-ACOPF is a challenging large-scale mixed-integer nonlinear optimization model. This means that the decisions involve both discrete variables, e.g. the turning on and off of generators and switching of transmission lines and transformers, and continuous decisions, e.g. the amount of energy generated by each generator and the power flows in the power grid. The physics of the power flow is described by nonlinear equations involving real and reactive power and bus voltages. Another key feature is the large number of contingencies, i.e. the system needs to stay reliable in face of failure of any one equipment, such as transmission lines and generators. The U.S. power grids are extremely complicated and large scale with more than 5,000 generators, 50,000 buses, and 100,000 high-voltage transmission lines, making the SC-UC-ACOPF a very large-scale computation challenge. The research developed in this project aims to solve the SC-UC-ACOPF problems in the three timescales, i.e. weekly, daily, and every 10-min. The proposed computational methods are built on a principled algorithmic approach of decomposition and penalization. More specifically, the algorithm develops spatial and temporal decomposition by exploiting the strong temporal coupling and weak spatial coupling of the UC problem and the complementary feature, i.e. weak temporal coupling and strong spatial coupling of the ACOPF problem. The algorithm also leverages recent progresses in strong convex relaxation of ACOPF. A unique feature of the proposed approach is that it generates a valid, global upper bound on the optimal maximum profit. In this way, a global optimality gap is available to measure the quality of the solution. To further speed up computation, the research team has developed a plethora of effective heuristics to strengthen the iterative penalty-based decomposition framework. For instance, a heuristic is developed to construct inner approximations of the time coupling constraints within the time decoupled problems. Contingencies are pre-screened and low-rank matrix computation is exploited to find the almost unique solution to each contingency. A novel heuristic for line switching is proposed and tested with positive impacts on instances where line switching is beneficial. Taking a systematic approach and carefully handling every detail of the problem pays off. The TIM-GO’s performance throughout the trials and the final event was stellar. TIM-GO garnered the second highest total prize money and is ranked in the top three positions across all categories of comparison.

97 MATHEMATICS AND COMPUTING↗

How Solar and Storage Can Reduce Coincident Peak Loads and Payments: A Case Study in Austin, TX

This study builds a generalized tool to forecast the change of 4 coincident peak (4CP) loads and payments based on varying amounts of solar, storage capacity, and population estimates over a 10-year period for utilities within the Electric Reliability Council of Texas (ERCOT). It also incorporates an optimization model for the energy storage systems (ESSs) that maximizes the sum of the revenue earned from their operation as well as the net 4CP payments received by the utility by attempting to arbitrage the ERCOT energy market. Here, the tool is illustrated by using empirical data from the municipally-owned utility in Austin, TX (Austin Energy). 4CP payments can be on the order of tens of millions of dollars. Results indicate that solar and storage capacity can substantially lower these payments. For example, a 20 MW increase in solar capacity in 2018 would reduce Austin Energy’s payment by an estimated $200,000 for each subsequent year. By using the novel approach of incorporating coincident peak demand charge reductions at the DSP level, this study highlights the economic value of local generation and storage.

14 SOLAR ENERGY↗

SU-F-E-03: PET/CT Guided Dose Boost to Hypoxic Sub-Volume in Nasopharyngeal Carcinomas Using Self-Optimizing Non-Uniform VMAT

Purpose: This study is to evaluate the feasibility of simultaneously integrated boost (SIB) to hypoxic subvolume (HTV) in nasopharyngeal carcinomas under the guidance of 18F-Fluoromisonidazole (FMISO) PET/CT using a novel non-uniform volumetric modulated arc therapy (VMAT)technique. Methods: Eight nasopharyngeal carcinoma patients treated with conventional uniform VMAT were retrospectively analyzed. For each treatment, actual conventional uniform VMAT plan with two or more arcs (2–2.5 arcs, totally rotating angle < 1000o) was designed with dose boost to hopxic subvolume (total dose, 84Gy) in the gross tumor volme (GTV) under the guidance of 18F- FMISO PET/CT. Based on the same dataset, experimental single arc non-uniform VAMT plans were generated with the same dose prescription using customized software tools. Dosimetric parameters, quality assurance and the efficiency of the treatment delivery were compared between the uniform and non-uniform VMAT plans. Results: To develop the non-uniform VMAT technique, a specific optimization model was successfully established. Both techniques generate high-quality plans with pass rate (>98%) with the 3mm, 3% criterion. HTV received dose of 84.1±0.75Gy and 84.1±1.2Gy from uniform and non-uniform VMAT plans, respectively. In terms of target coverage and dose homogeneity, there was no significant statistical difference between actual and experimental plans for each case. However, for critical organs at risk (OAR), including the parotids, oral cavity and larynx, dosimetric difference was significant with better dose sparing form experimental plans. Regarding plan implementation efficiency, the average machine time was 3.5 minutes for the actual VMAT plans and 3.7 minutes for the experimental nonuniform VMAT plans (p>0.050). Conclusion: Compared to conventional VMAT technique, the proposed non-uniform VMAT technique has the potential to produce efficient and safe treatment plans, especially in cases with complicated anatomical structures and demanding dose boost to subvolumes.

60 APPLIED LIFE SCIENCES↗

MO-G-BRF-02: Enhancement of Texture-Based Metastasis Prediction Models Via the Optimization of PET/MRI Acquisition Protocols

Purpose: We have previously identified a prediction model of lung metastases at diagnosis of soft-tissue sarcomas (STS) that is composed of two textural features extracted from FDG-PET and T1-weighted (T1w) MRI scans. The goal of this study is to evaluate whether the optimization in FDGPET and MRI acquisition parameters would enhance the prediction performance of texture-based models. Methods: Ten FDG-PET and T1w- MRI digitized tumor models were generated from imaging data of STS patients who underwent pre-treatment clinical scans between 2005 and 2011. Five of ten patients eventually developed lung metastases. Numerically simulated MR images were produced using echo times (TE) of 2 and 4 times the nominal clinical parameter (TEc), and repetition times (TR) of 0.5, 0.67, 1.5 and 2 times the nominal clinical parameter (TRc) found in the DICOM headers (TEc range: 9–13 ms, TRc range: 410-667 ms). PET 2D images were simulated using Monte-Carlo and were reconstructed using an ordered-subsets expectation maximization (OSEM) algorithm with 1 to 32 iterations and a post-reconstruction Gaussian filter of 0, 2, 4 or 6 mm width. For all possible combinations of PET and MRI acquisition parameters, the prediction model was constructed using logistic regression with new coefficients, and its associated prediction performance for lung metastases was evaluated using the area under the ROC curve (AUC). Results: The prediction performance over all simulations yielded AUCs ranging from 0.7 to 1. Notably, TR values below or equal to TRc and higher PET post-reconstruction filter widths yielded higher prediction performance. The best results were obtained with a combination of 4*TEc, TRc, 30 OSEM iterations and 2mm filter width. Conclusion: This work indicates that texture-based metastasis prediction models could be improved using optimized choices of FDG-PET and MRI acquisition protocols. This principle could be generalized to other texture-based models.

60 APPLIED LIFE SCIENCES↗

IPIP: A new approach to inverse planning for HDR brachytherapy by directly optimizing dosimetric indices

Purpose: Many planning methods for high dose rate (HDR) brachytherapy require an iterative approach. A set of computational parameters are hypothesized that will give a dose plan that meets dosimetric criteria. A dose plan is computed using these parameters, and if any dosimetric criteria are not met, the process is iterated until a suitable dose plan is found. In this way, the dose distribution is controlled by abstract parameters. The purpose of this study is to develop a new approach for HDR brachytherapy by directly optimizing the dose distribution based on dosimetric criteria. Methods: The authors developed inverse planning by integer program (IPIP), an optimization model for computing HDR brachytherapy dose plans and a fast heuristic for it. They used their heuristic to compute dose plans for 20 anonymized prostate cancer image data sets from patients previously treated at their clinic database. Dosimetry was evaluated and compared to dosimetric criteria. Results: Dose plans computed from IPIP satisfied all given dosimetric criteria for the target and healthy tissue after a single iteration. The average target coverage was 95%. The average computation time for IPIP was 30.1 s on an Intel(R) Core{sup TM}2 Duo CPU 1.67 GHz processor with 3 Gib RAM. Conclusions: IPIP is an HDR brachytherapy planning system that directly incorporates dosimetric criteria. The authors have demonstrated that IPIP has clinically acceptable performance for the prostate cases and dosimetric criteria used in this study, in both dosimetry and runtime. Further study is required to determine if IPIP performs well for a more general group of patients and dosimetric criteria, including other cancer sites such as GYN.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Pyomo: Accidentally outrunning the bear

Pyomo is an open-source optimization modeling software that has undergone significant evolution since its inception in 2008. Pyomo has evolved to enhance flexibility, solver integration, and community engagement. Modern collaborative tools for open-source software have facilitated the development of new Pyomo functionality and improved our development process through automated testing and performance-tracking pipelines. However, Pyomo faces challenges typical of research software, including resource limitations and knowledge retention. The Pyomo team’s commitment to better development practices and community engagement reflects a proactive approach to these issues. We describe Pyomo’s development journey, highlighting both successes and failures, in the hopes that other open-source research software packages may benefit from our experiences.

automation↗

Time-Constrained Capacitated Vehicle Routing Problem in Urban E-Commerce Delivery

Electric vehicle routing problems can be particularly complex when recharging must be performed mid-route. In some applications, such as e-commerce parcel delivery truck routing, however, mid-route recharging may not be necessary because of constraints on vehicle capacities and the maximum allowed time for delivery. In this study, we develop a mixed-integer optimization model that exactly solves such a time-constrained capacitated vehicle routing problem, especially of interest for e-commerce parcel delivery vehicles. We compare our solution method with an existing metaheuristic and carry out exhaustive case studies considering four U.S. cities—Austin, TX; Bloomington, IL; Chicago, IL; and Detroit, MI—and two vehicle types: conventional vehicles and battery electric vehicles (BEVs). In these studies we examine the impact of vehicle capacity, maximum allowed travel time, service time (dwelling time to physically deliver the parcel), and BEV range on system-level performance metrics, including vehicle miles traveled (VMT). We find that the service time followed by the vehicle capacity plays a key role in the performance of our approach. We assume an 80-mi BEV range as a baseline without mid-route recharging. Our results show that the BEV range has a minimal impact on performance metrics because the VMT per vehicle averages around 72 mi. In a case study for shared-economy parcel deliveries, we observe that VMT could be reduced by 38.8% in Austin if service providers were to operate their distribution centers jointly.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Assessing the Accuracy of Property Model Predictions for Cost Optimization of Desalination Technologies

Accurate modeling of seawater thermophysical and thermodynamic properties is critical for optimizing desalination processes. This study compares three seawater property models, a Reaktoro multicomponent model, the thermophysical seawater properties library from the Massachusetts Institute of Technology, and a simplified sodium chloride model, in the context of levelized cost of water (LCOW) minimization for reverse osmosis (RO) and mechanical vapor compression systems. Process simulations and cost optimizations reveal that although all three models yield comparable LCOW and specific energy consumption (SEC) estimates under baseline conditions, deviations among their predictions increase with salinity. Relative differences in LCOW and SEC reach up to 6% and 8%, respectively. RO results show greater variability due to differences in osmotic pressure predictions, which affect pressure constraints at high recoveries. Computational performance varies substantially; specifically, Reaktoro simulations are up to 28 times slower than empirical models due to their detailed equilibrium calculations. These results suggest that empirical models offer acceptable accuracy for routine desalination process design, while Reaktoro provides advantages in scenarios requiring detailed speciation, such as scaling or pH adjustment studies. These findings underscore the importance of selecting appropriate property models based on the modeling objective of desalination applications and motivate future work integrating thermodynamic rigor with empirical efficiency.

Physical and chemical properties↗

Responses of Marginal and Intrinsic Water-Use Efficiency to Changing Aridity Using FLUXNET Observations

According to classic stomatal optimization theory, plant stomata are regulated to maximize carbon assimilation for a given water loss. A key component of stomatal optimization models is marginal water-use efficiency (mWUE), the ratio of the change of transpiration to the change in carbon assimilation. Although the mWUE is often assumed to be constant, variability of mWUE under changing hydrologic conditions has been reported. However, there has yet to be a consensus on the patterns of mWUE variabilities and their relations with atmospheric aridity. We investigate the dynamics of mWUE in response to vapor pressure deficit (VPD) and aridity index using carbon and water fluxes from 115 eddy covariance towers available from the global database FLUXNET. We demonstrate a non-linear mWUE-VPD relationship at a sub-daily scale in general; mWUE varies substantially at both low and high VPD levels. However, mWUE remains relatively constant within the mid-range of VPD. Despite the highly non-linear relationship between mWUE and VPD, the relationship can be informed by the strong linear relationship between ecosystem-level inherent water-use efficiency (IWUE) and mWUE using the slope, m *. We further identify site-specific m * and its variability with changing site-level aridity across six vegetation types. We suggest accurately representing the relationship between IWUE and VPD using Michaelis–Menten or quadratic functions to ensure precise estimation of mWUE variability for individual sites.

54 ENVIRONMENTAL SCIENCES↗

A Time-Regularized Multiple Gravity-Assist Low-Thrust Bounded-Impulse Model for Trajectory Optimization

The multiple gravity assist low-thrust (MGALT) trajectory model combines the medium-fidelity Sims-Flanagan bounded-impulse transcription with a patched-conics flyby model and is an important tool for preliminary trajectory design. While this model features fast state propagation via Kepler's equation and provides a pleasingly accurate estimation of the total mass budget for the eventual flight-suitable integrated trajectory it does suffer from one major drawback, namely its temporal spacing of the control nodes. We introduce a variant of the MGALT transcription that utilizes the generalized anomaly from the universal formulation of Kepler's equation as a decision variable in addition to the trajectory phase propagation time. This results in two improvements over the traditional model. The first is that the maneuver locations are equally spaced in generalized anomaly about the orbit rather than time. The second is that the Kepler propagator now has the generalized anomaly as its independent variable instead of time and thus becomes an iteration-free propagation method. The new algorithm is outlined, including the impact that this has on the computation of Jacobian entries for numerical optimization, and a motivating application problem is presented that illustrates the improvements that this model has over the traditional MGALT transcription.

Optimization↗

A Time-Regularized, Multiple Gravity-Assist Low-Thrust, Bounded-Impulse Model for Trajectory Optimization

The multiple gravity assist low-thrust (MGALT) trajectory model combines the medium-fidelity Sims-Flanagan bounded-impulse transcription with a patched-conics flyby model and is an important tool for preliminary trajectory design. While this model features fast state propagation via Keplers equation and provides a pleasingly accurate estimation of the total mass budget for the eventual flight suitable integrated trajectory it does suffer from one major drawback, namely its temporal spacing of the control nodes. We introduce a variant of the MGALT transcription that utilizes the generalized anomaly from the universal formulation of Keplers equation as a decision variable in addition to the trajectory phase propagation time. This results in two improvements over the traditional model. The first is that the maneuver locations are equally spaced in generalized anomaly about the orbit rather than time. The second is that the Kepler propagator now has the generalized anomaly as its independent variable instead of time and thus becomes an iteration-free propagation method. The new algorithm is outlined, including the impact that this has on the computation of Jacobian entries for numerical optimization, and a motivating application problem is presented that illustrates the improvements that this model has over the traditional MGALT transcription.

Optimization↗

Optimization of Regression Models of Experimental Data Using Confirmation Points

A new search metric is discussed that may be used to better assess the predictive capability of different math term combinations during the optimization of a regression model of experimental data. The new search metric can be determined for each tested math term combination if the given experimental data set is split into two subsets. The first subset consists of data points that are only used to determine the coefficients of the regression model. The second subset consists of confirmation points that are exclusively used to test the regression model. The new search metric value is assigned after comparing two values that describe the quality of the fit of each subset. The first value is the standard deviation of the PRESS residuals of the data points. The second value is the standard deviation of the response residuals of the confirmation points. The greater of the two values is used as the new search metric value. This choice guarantees that both standard deviations are always less or equal to the value that is used during the optimization. Experimental data from the calibration of a wind tunnel strain-gage balance is used to illustrate the application of the new search metric. The new search metric ultimately generates an optimized regression model that was already tested at regression model independent confirmation points before it is ever used to predict an unknown response from a set of regressors.

Ulbrich, N.↗

Thermoplastic Matrix Composite Design for Cryotanks Using Multiscale Modeling and Bayesian Optimization

Designing lightweight, robust cryogenic storage tanks is critical for future launch vehicles, in-space propellant storage, and hydrogen powered aircraft. This work presents a multiscale modeling and Bayesian optimization framework for the design of thermoplastic matrix composite cryotanks. Molecular dynamics simulations are first used to determine temperature-dependent constituent properties for candidate thermoplastic matrices, which are homogenized to the lamina scale using NASA’s Multiscale Analysis Tool (NASMAT). These lamina properties, in combination with laminate family generation rules, are evaluated in HyperX structural optimization software to identify stacking sequences that meet all cryogenic load requirements. A Bayesian optimization framework is applied, with HyperX in the loop (via the HyperX API) to efficiently search across material and laminate design variables, yielding an optimized cryotank configuration with significant reductions in design cycle time compared to exhaustive search approaches.

thermoplastics↗

Automated Generation of Microkinetics for Heterogeneously Catalyzed Reactions Considering Correlated Uncertainties**

Abstract The study presents an ab‐initio based framework for the automated construction of microkinetic mechanisms considering correlated uncertainties in all energetic parameters and estimation routines. 2000 unique microkinetic models were generated within the uncertainty space of the BEEF‐vdW functional for the oxidation reactions of representative exhaust gas emissions from stoichiometric combustion engines over Pt(111) and compared to experiments through multiscale modeling. The ensemble of simulations stresses the importance of considering uncertainties. Within this set of first‐principles‐based models, it is possible to identify a microkinetic mechanism that agrees with experimental data. This mechanism can be traced back to a single exchange‐correlation functional, and it suggests that Pt(111) could be the active site for the oxidation of light hydrocarbons. The study provides a universal framework for the automated construction of reaction mechanisms with correlated uncertainty quantification, enabling a DFT‐constrained microkinetic model optimization for other heterogeneously catalyzed systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

New prospects for PV powered water desalination plants: case studies in Saudi Arabia: New prospects for PV powered water desalination plants

Increased water demand and increased drought episodes in the Middle East and other regions necessitate an expansion in desalination projects and create a great market opportunity for photovoltaics (PV). PV-powered desalination has previously been regarded as not being a cost-competitive solution when compared with conventionally powered desalination; however, the decline in PV costs over the last few years has changed this outlook. Here, this article presents up-to-date performance and cost analysis of reverse osmosis (RO) desalination powered with PV connected to the Saudi Arabian grid. Reference cases include relatively small (i.e., producing 6550 m 3 water per day) and large (i.e., 190 000 m 3 /day) desalination plants using seawater at a salinity of 40 000 ppm. We used data from a King Abdullah University for Science and Technology presentation and Hybrid Optimization Model for Electric Renewables 2.81 Energy Modeling Software (HOMER Energy LLC) in tandem with Desalination Economic Evaluation Program 4.0 (International Atomic Energy Agency) desalination software to analyze the techno-economic feasibility of these plants. The first phase of our work entailed a comparison between dual-axis high concentration PV (CPV) equipped with triple junction III/V solar cells and CdTe PV-powered RO systems. The estimated levelized cost of electricity from CPV is 0.16/kWh dollars, whereas that from CdTe PV is $0.10/kWh dollars and 0.09/kWh dollars for fixed-tilt and one-axis tracking systems, respectively. These costs are higher than the price of diesel-based grid electricity in the region because diesel fuel is heavily subsidized in Saudi Arabia.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

A TTL-based Approach for Content Placement in Edge Networks

Edge networks are promising to provide better services to users by provisioning computing and storage resources at the edge of networks. However, due to the uncertainty and diversity of user interests, content popularity, distributed network structure, cache sizes, it is challenging to decide where to place the content, and how long it should be cached. In this paper, we study the utility optimization of content placement at edge networks through timer-based (TTL) policies. We propose provably optimal distributed algorithms that operate at each network cache to maximize the overall network utility. Our TTL-based optimization model provides theoretical answers to how long each content must be cached, and where it should be placed in the edge network. Extensive evaluations show that our algorithm significantly outperforms path replication with conventional caching algorithms over some network topologies.

Panigrahy, Nitish K.↗