Search NASA⌕ Search

SEARCH · Search NASA

Results for “queuing model”

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 19 records

A queuing model for road traffic simulation

We present in this article a stochastic queuing model for the raod traffic. The model is based on the M/G/c/c state dependent queuing model, and is inspired from the deterministic Godunov scheme for the road traffic simulation. We first propose a variant of M/G/c/c state dependent model that works with density-flow fundamental diagrams rather than density-speed relationships. We then extend this model in order to consider upstream traffic demand as well as downstream traffic supply. Finally, we show how to model a whole raod by concatenating raod sections as in the deterministic Godunov scheme.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Modeling information flow in a computer processor with a multi-stage queuing model

In this paper, we introduce a nonlinear stochastic model to describe the propagation of information inside a computer processor. In this model, a computational task is divided into stages, and information can flow from one stage to another. The model is formulated as a spatially-extended, continuous-time Markov chain where space represents different stages. This model is equivalent to a spatially-extended version of the M/M/s queue. The main modeling feature is the throttling function which describes the processor slowdown when the amount of information falls below a certain threshold. We derive the stationary distribution for this stochastic model and develop a closure for a deterministic ODE system that approximates the evolution of the mean and variance of the stochastic model. In conclusion, we demonstrate the validity of the closure with numerical simulations.

97 MATHEMATICS AND COMPUTING↗

Capacity Utilization Study for Aviation Security Cargo Inspection Queuing System

In this paper, we conduct performance evaluation study for an aviation security cargo inspection queuing system for material flow and accountability. The queuing model employed in our study is based on discrete-event simulation and processes various types of cargo simultaneously. Onsite measurements are collected in an airport facility to validate the queuing model. The overall performance of the aviation security cargo inspection system is computed, analyzed, and optimized for the different system dynamics. Various performance measures are considered such as system capacity, residual capacity, throughput, capacity utilization, subscribed capacity utilization, resources capacity utilization, subscribed resources capacity utilization, and number of cargo pieces (or pallets) in the different queues. These metrics are performance indicators of the system s ability to service current needs and response capacity to additional requests. We studied and analyzed different scenarios by changing various model parameters such as number of pieces per pallet, number of TSA inspectors and ATS personnel, number of forklifts, number of explosives trace detection (ETD) and explosives detection system (EDS) inspection machines, inspection modality distribution, alarm rate, and cargo closeout time. The increased physical understanding resulting from execution of the queuing model utilizing these vetted performance measures should reduce the overall cost and shipping delays associated with new inspection requirements.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

Long-term strategic planning of inter-city fast charging infrastructure for battery electric vehicles

Here, this study introduces a multistage mixed integer modeling framework for long-term strategic planning of the battery electric vehicle (BEV) inter-city fast charging infrastructure. In response to the growing BEV inter-city travel demand, the framework integrates both an optimization model for decisions on where and when to build charging stations and a stochastic queuing model to determine how many chargers are needed for each station. A genetic algorithm based heuristic method is developed to efficiently solve the problem. The model is applied to investigate the long-term infrastructure requirement in the state of California where significant growth in BEV demand is expected in coming decades. Our findings indicate that the charging infrastructure is expanded in both network coverage (number of stations) and service capacity (number of chargers per station) as the BEV demand grows. We also found that the infrastructure requirement is dependent on many factors, such as the BEV electrified range, the required level of service at charging stations, and the range anxiety cost. For most simulated scenarios, the results show that it is beneficial to invest in the inter-city fast charging infrastructure, even though the range anxiety cost is at its low end.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Refueling infrastructure planning in intercity networks considering route choice and travel time delay for mixed fleet of electric and conventional vehicles

The range anxiety has been a major factor that affects the market acceptance of electric vehicles. Even with the recent development of battery technologies, a lack of charging stations and range anxiety are still significant concerns, specifically for intercity trips. This calls for more investments in building charging stations and advancing battery technologies to increase the market share of electric vehicles and improve sustainability. This study suggests a configuration for plug-in electric vehicle charging infrastructure to support long-distance intercity trips of electric vehicles at the network level. A model is proposed to minimize the total system cost including infrastructure investment (building charging stations/spots) and travel time delays (charging time, waiting time in the queue, and detour time to access charging stations). This study fills existing gaps in the literature by capturing realistic patterns of travel demand and considering flow-dependent charging delays at charging stations. Furthermore, the proposed model, which is formulated as a mixed-integer program with nonlinear constraints, solves the optimization problem at the network level. At the network level, impacts of charging station locations on the traffic assignment problem with a mixed fleet of electric and conventional vehicles need to be considered. To this end, a traffic assignment module is integrated with a simulated annealing algorithm. The numerical experiments show a satisfactory application of the model for a full-scale case study (intercity network in Michigan). The solution quality and efficiency of the proposed solution algorithm are evaluated against those of an enumeration approach for a small case study. The results suggest that even for the current market share and charging stations’ setting, a significant investment is needed to support intercity trips without range anxiety issues and with acceptable delays. Additionally, through sensitivity analyses, the required infrastructure and battery investments to support intercity trips with acceptable delays are established for hypothetical increased market shares and battery size in the future.

42 ENGINEERING↗

SciDAC-Data, A Project to Enabling Data Driven Modeling of Exascale Computing

The SciDAC-Data project is a DOE funded initiative to analyze and exploit two decades of information and analytics that have been collected by the Fermilab Data Center on the organization, movement, and consumption of High Energy Physics data. The project will analyze the analysis patterns and data organization that have been used by the NOvA, MicroBooNE, MINERvA and other experiments, to develop realistic models of HEP analysis workflows and data processing. The SciDAC-Data project aims to provide both realistic input vectors and corresponding output data that can be used to optimize and validate simulations of HEP analysis. These simulations are designed to address questions of data handling, cache optimization and workflow structures that are the prerequisites for modern HEP analysis chains to be mapped and optimized to run on the next generation of leadership class exascale computing facilities. We will address the use of the SciDAC-Data distributions acquired from Fermilab Data Center’s analysis workflows and corresponding to around 71,000 HEP jobs, as the input to detailed queuing simulations that model the expected data consumption and caching behaviors of the work running in HPC environments. In particular we describe in detail how the Sequential Access via Metadata (SAM) data handling system in combination with the dCache/Enstore based data archive facilities have been analyzed to develop the radically different models of the analysis of HEP data. We present how the simulation may be used to analyze the impact of design choices in archive facilities.

Mubarak, M.↗

Scidac-Data: Enabling Data Driven Modeling of Exascale Computing

Here, the SciDAC-Data project is a DOE-funded initiative to analyze and exploit two decades of information and analytics that have been collected by the Fermilab data center on the organization, movement, and consumption of high energy physics (HEP) data. The project analyzes the analysis patterns and data organization that have been used by NOvA, MicroBooNE, MINERvA, CDF, D0, and other experiments to develop realistic models of HEP analysis workflows and data processing. The SciDAC-Data project aims to provide both realistic input vectors and corresponding output data that can be used to optimize and validate simulations of HEP analysis. These simulations are designed to address questions of data handling, cache optimization, and workflow structures that are the prerequisites for modern HEP analysis chains to be mapped and optimized to run on the next generation of leadership-class exascale computing facilities. We present the use of a subset of the SciDAC-Data distributions, acquired from analysis of approximately 71,000 HEP workflows run on the Fermilab data center and corresponding to over 9 million individual analysis jobs, as the input to detailed queuing simulations that model the expected data consumption and caching behaviors of the work running in high performance computing (HPC) and high throughput computing (HTC) environments. In particular we describe how the Sequential Access via Metadata (SAM) data-handling system in combination with the dCache/Enstore-based data archive facilities has been used to develop radically different models for analyzing the HEP data. We also show how the simulations may be used to assess the impact of design choices in archive facilities.

97 MATHEMATICS AND COMPUTING↗

Regulating TNCs: Should Uber and Lyft set their own rules?

We evaluate the impact of three proposed regulations of transportation network companies (TNCs) like Uber, Lyft and Didi: (1) A minimum wage for drivers, (2) a cap on the number of drivers or vehicles, and (3) a per-trip congestion tax. The impact is assessed using a queuing theoretic equilibrium model which incorporates the stochastic dynamics of the app-based ride-hailing matching platform, the ride prices and driver wages established by the platform, and the incentives of passengers and drivers. We show that a floor placed under driver earnings can push the ride-hailing platform to hire more drivers and offer more rides, at the same time that passengers enjoy faster rides and lower total cost, while platform rents are reduced. Contrary to standard competitive labor market theory, enforcing a minimum wage for drivers benefits both drivers and passengers, and promotes the efficiency of the entire system. This surprising outcome holds for almost all model parameters, and it occurs because the wage floor curbs TNC labor market power. In contrast to a wage floor, imposing a cap on the number of vehicles hurts drivers, because the platform reaps all the benefits of limiting supply. The congestion tax has the expected impact: fares increase, wages and platform revenue decrease. Here, we also construct variants of the model to briefly discuss platform subsidy, platform competition, and autonomous vehicles.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Eco-Trajectory Planning with Consideration of Queue along Congested Corridor for Hybrid Electric Vehicles

At signalized intersections, vehicle speed profile plays a vital role in determining fuel consumption and emissions. With advances of connected and automated vehicle technology, vehicles are able to receive predicted traffic information from the infrastructure in real-time to plan their trajectories in a fuel-efficient way. In this paper, an eco-driving model is developed for hybrid electric vehicles in a congested urban traffic environment. The vehicle queuing process is explicitly modeled by the shockwave profile model with consideration of vehicle deceleration and acceleration to provide a green window for eco-vehicle trajectory planning. A trigonometric speed profile is applied to minimize fuel consumption and maximize driving comfort with a low jerk. A hybrid electric vehicle fuel consumption model is built and calibrated with real vehicle data to evaluate the energy benefit of the eco-vehicles. Simulation results from a real-world corridor of six intersections show that the proposed eco-driving model can significantly reduce energy consumption by 8.7% on average and by 23.5% at maximum, without sacrificing mobility.

Engineering↗

Kullback–Leibler Divergence of an Open-Queuing Network of a Cell-Signal-Transduction Cascade

Queuing networks (QNs) are essential models in operations research, with applications in cloud computing and healthcare systems. However, few studies have analyzed the cell’s biological signal transduction using QN theory. This study entailed the modeling of signal transduction as an open Jackson’s QN (JQN) to theoretically determine cell signal transduction, under the assumption that the signal mediator queues in the cytoplasm, and the mediator is exchanged from one signaling molecule to another through interactions between the signaling molecules. Each signaling molecule was regarded as a network node in the JQN. The JQN Kullback–Leibler divergence (KLD) was defined using the ratio of the queuing time (λ) to the exchange time (μ), λ/μ. The mitogen-activated protein kinase (MAPK) signal-cascade model was applied, and the KLD rate per signal-transduction-period was shown to be conserved when the KLD was maximized. Our experimental study on MAPK cascade supported this conclusion. This result is similar to the entropy-rate conservation of chemical kinetics and entropy coding reported in our previous studies. Thus, JQN can be used as a novel framework to analyze signal transduction.

97 MATHEMATICS AND COMPUTING↗

Threshold-based queuing system for performance analysis of cloud computing system with dynamic scaling

Cloud computing is promising technology to manage and improve utilization of computing center resources to deliver various computing and IT services. For the purpose of energy saving there is no need to unnecessarily operate many servers under light loads, and they are switched off. On the other hand, some servers should be switched on in heavy load cases to prevent very long delays. Thus, waiting times and system operating cost can be maintained on acceptable level by dynamically adding or removing servers. One more fact that should be taken into account is significant server setup costs and activation times. For better energy efficiency, cloud computing system should not react on instantaneous increase or instantaneous decrease of load. That is the main motivation for using queuing systems with hysteresis for cloud computing system modelling. In the paper, we provide a model of cloud computing system in terms of multiple server threshold-based infinite capacity queuing system with hysteresis and noninstantanuous server activation. For proposed model, we develop a method for computing steady-state probabilities that allow to estimate a number of performance measures.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Influence of Weather on the Predicted Moisture Content of Field Chopped EnergySorghum and Switchgrass

To determine the effects of weather on harvested moisture content (MC) of switchgrass (Panicum virgatum) and energy sorghum (Sorghum bicolor), tracking of harvest progress on individual fields in the Integrated Biomass Supply and Logistics (IBSAL) model was modified to allow: i) rewetting of swathed material in the drying formulae; and ii) field queuing rules based on equipment availability and weather. Estimated crop yield and initial MC by harvest date, as observed in field trials, along with the modeling of different delays between mowing and harvest allowed estimation of harvested MC, annual tonnage processed and associated processing cost differences by crop and location over 10 years. Extending the hours of annual equipment use had minor implications on cost of production. Energy sorghum proved difficult to dry in the field. Its higher yield, leading to shorter supply distance to the plant, may justify harvesting of energy sorghum early in the season with drier weather. Lastly, later harvest for lower-yielding switchgrass offers MC advantages.

09 BIOMASS FUELS↗

Cyber Threat Screening Using a Queuing-Based Game-Theoretic Approach

Dynamic and uncertain security environments, such as cyber systems, often involve strategic interactions among multiple decision-making agents. In this paper, we consider a cybersecurity setting where a system administrator (defender) has to screen malicious service requests of an attacker who seeks to exhaust available cyber resources and inconvenience users with normal requests. We propose a novel cyber-threat inspection model, based on Stackelberg games, that unies aspects of Threat Security Games with the Erlang-B queuing framework to provide equilibrium strategies for both the attacker and defender. In our proposed model, the defender seeks to determine the optimal number of inspection nodes required to maximize detection probability of malicious requests, while the attacker maximizes the probability of legitimate requests dropping out of the system. We derive analytical expressions of the equilibrium solutions of the proposed Stackelberg game under realistic assumptions on system observability and payoff structure of the players. A numerical case study is presented, and steps for further research are identified.

Cybersecurity, Stackelberg game, Erlang-B loss sys↗

Adaptive job and resource management for the growing quantum cloud

As the popularity of quantum computing continues to grow, efficient quantum machine access over the cloud is critical to both academic and industry researchers across the globe. And as cloud quantum computing demands increase exponentially, the analysis of resource consumption and execution characteristics are key to efficient management of jobs and resources at both the vendor-end as well as the client-end. While the analysis and optimization of job / resource consumption and management are popular in the classical HPC domain, it is severely lacking for more nascent technology like quantum computing.This paper proposes optimized adaptive job scheduling to the quantum cloud taking note of primary characteristics such as queuing times and fidelity trends across machines, as well as other characteristics such as quality of service guarantees and machine calibration constraints. Key components of the proposal include a) a prediction model which predicts fidelity trends across machine based on compiled circuit features such as circuit depth and different forms of errors, as well as b) queuing time prediction for each machine based on execution time estimations. Altogether, this proposal is evaluated on simulated IBM machines across a diverse set of quantum applications and system loading scenarios, and is able to reduce wait times by over 3x and improve fidelity by over 40% on specific usecases, when compared to traditional job schedulers.

97 MATHEMATICS AND COMPUTING↗

Towards an Introspective Dynamic Model of Globally Distributed Computing Infrastructures

Large-scale scientific collaborations like ATLAS, Belle II, CMS, DUNE, and others involve hundreds of research institutes and thousands of researchers spread across the globe. These experiments generate petabytes of data, with volumes soon expected to reach exabytes. Consequently, there is a growing need for computation, including structured data processing from raw data to consumer-ready derived data, extensive Monte Carlo simulation campaigns, and a wide range of end-user analysis. To manage these computational and storage demands, centralized workflow and data management systems are implemented. However, decisions regarding data placement and payload allocation are often made disjointly and via heuristic means. A significant obstacle in adopting more effective heuristic or AI-driven solutions is the absence of a quick and reliable introspective dynamic model to evaluate and refine alternative approaches. In this study, we aim to develop such an interactive system using real-world data. By examining job execution records from the PanDA workflow management system, we have pinpointed key performance indicators such as queuing time, error rate, and the extent of remote data access. The dataset includes five months of activity. Additionally, we are creating a generative AI model to simulate time series of payloads, which incorporate visible features like category, event count, and submitting group, as well as hidden features like the total computational load—derived from existing PanDA records and computing site capabilities. These hidden features, which are not visible to job allocators, whether heuristic or AI-driven, influence factors such as queuing times and data movement.

kilic, Ozgur Ozan [Brookhaven National Laboratory ↗

Electric vehicle fast charging infrastructure planning in urban networks considering daily travel and charging behavior

Electric vehicles are a sustainable substitution to conventional vehicles. This work introduces an integrated framework for urban fast charging infrastructure to address the range anxiety issue. A mesoscopic simulation tool is developed to generate trip trajectories, and simulate charging behavior based on various trip attributes. The resulting charging demand is the key input to a mixed-integer nonlinear program that seeks charging station configuration. The model minimizes the total system cost including charging station and charger installation costs, and charging, queuing, and detouring delays. The problem is solved using a decomposition technique incorporating a commercial solver for small networks, and a heuristic algorithm for large-scale networks, in addition to the Golden Section method. The solution quality and significant superiority in the computational efficiency of the decomposition approach are confirmed in comparison with the implicit enumeration approach. Furthermore, the required infrastructure to support urban trips is explored for future market shares and technologies.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Balancing Charging Station Utilization and Throughput in Electric Vehicle Charging Stations with Queuing Theory

The rapid increase in electric vehicle (EV) adoption demands enhancements in the efficiency and adaptability of EV supply equipment (EVSE). Traditional EVSE systems often fail to optimize power delivery to meet the variable acceptance rates of EV batteries, resulting in significant energy wastage and reduced operational efficiency. This research addresses these challenges by integrating queuing theory with modular EVSE architectures, offering a dual strategy to optimize the operation of EV charging stations. A simulation model was developed to assess various configurations of charger capacities and outlet numbers. This model aimed to identify the optimal setup that maximizes station utilization while minimizing charging times and maximizing throughput. The model focused on charger capacities ranging from 50 to 250 kW and analyzed the different capacities’ effects on charging times and the number of vehicles served. The results indicate that a charger capacity of 125 kW is optimal, striking a balance between the charging time and the number of EVs served per hour, thus achieving the highest station utilization rate. This capacity allows for servicing a significant number of EVs with moderate increases in charging times. Lower capacities, although capable of serving more vehicles, lead to longer charging times and decreased throughput efficiency. The study underscores the effectiveness of combining queuing theory with flexible, modular charging systems that can dynamically adjust to EV charging demands.

Kumar, Praveen↗

Analyzing and Comparing Biomass Feedstock Supply Systems in China: Corn Stover and Sweet Sorghum Case Studies

This paper analyzes the rural Chinese biomass supply system and models supply chain operations according to U.S. concepts of logistical unit operations: harvest and collection, storage, transportation, preprocessing, and handling and queuing. In this paper, we quantify the logistics cost of corn stover and sweet sorghum in China under different scenarios. We analyze three scenarios of corn stover logistics from northeast China and three scenarios of sweet sorghum stalks logistics from Inner Mongolia in China. The case study estimates that the logistics cost of corn stover and sweet sorghum stalk to be $52.95/dry metric ton and $52.64/dry metric ton, respectively, for the current labor-based biomass logistics system. However, if the feedstock logistics operation is mechanized, the cost of corn stover and sweet sorghum stalk decreases to $36.01/dry metric ton and $35.76/dry metric ton, respectively. The study also includes a sensitivity analysis to identify the cost factors that cause logistics cost variation. Results of the sensitivity analysis show that labor price has the most influence on the logistics cost of corn stover and sweet sorghum stalk, with a variation of $6 to $12/dry metric ton.

09 BIOMASS FUELS↗