Search Results (46)

Rapid electrification of road transport and growing shares of variable renewable generation are pushing urban low-voltage feeders toward their operating limits. Uncoordinated electric vehicle (EV) charging can create transformer overloads, voltage violations, and unfair delays, while most existing smart charging schemes either ignore distribution network constraints or treat fairness and risk in an ad hoc way. This paper proposes a city-scale hierarchical scheduling framework that coordinates EV charging and vehicle-to-grid (V2G) services under renewable variability. In the upper layer, a LinDistFlow-based optimal power flow computes feeder-constrained power envelopes and shadow prices over a rolling horizon, capturing transformer and voltage limits under photovoltaic (PV) uncertainty. In the lower layer, each station solves a queue-aware receding-horizon optimization that allocates charging/V2G set points across plugs using α-fair and lexicographic objectives, with conditional value-at-risk (CVaR) constraints on waiting times and state-of-charge (SoC) shortfalls. A digital twin of a medium-sized city with 24 stations (238 plugs) on five feeders and PV shares between 25% and 55% is used for evaluation. Compared with uncoordinated charging and myopic baselines, the proposed scheduler reduces feeder peak loading and PV curtailment while improving user experience and equity: average waits and 90% CVaR of waits are lowered, the Gini coefficient of waiting times drops (e.g., from 0.31 to 0.22), and SoC shortfalls are significantly reduced, all while respecting voltage limits. Each receding-horizon step executes in under 30 s on commodity hardware, indicating that the framework is practical for real-time deployment in city-scale smart charging platforms. Full article

We study waiting times in a queue with active management and correlated job/packet sizes, which induce correlated service times. In the transient case, formulae for the distribution tail, the probability density, and the expected virtual waiting time at any time t, are found. Then, grounded on these results, stationary versions of the probability density and the expected value are obtained. The correlation of service times resulting from correlated job sizes is modeled through an MSP (Markovian service process). Theoretical results are reinforced by numerical examples, in which we examine the impact of symmetric positive and negative correlation of service times, and the impact of symmetric weak and strong active management, on transient and stationary waiting times. We also compare the effects of these factors on the waiting time with their effects on the queue length. In these examples, we can see a surprisingly large expected virtual waiting time, much greater than the product of the expected service time and the queue length. This effect is observed for both weak and strong management functions when the correlation is positive, but it vanishes when a symmetric negative correlation is applied. We also observe a weaker effect of active management on virtual waiting times than that of service time correlation, as well as a weaker impact of active management on virtual waiting time densities than on queue length distributions. Full article

This paper analyzes a finite-capacity $GI/M/2/N$ queue with two heterogeneous servers operating under a multiple working-vacation policy, Bernoulli feedback, and customer impatience. Using the supplementary-variable technique in tandem with a tailored recursive scheme, we derive the stationary distributions of the system size as observed at pre-arrival instants and at arbitrary epochs. From these, we obtain explicit expressions for key performance metrics, including blocking probability, average reneging rate, mean queue length, mean sojourn time, throughput, and server utilizations. We then embed these metrics in an economic cost function and determine service-rate settings that minimize the total expected cost via the Bat Algorithm. Numerical experiments implemented in R validate the analysis and quantify the managerial impact of the vacation, feedback, and impatience parameters through sensitivity studies. The framework accommodates general renewal arrivals ($GI$), thereby extending classical ($M/M/2/N$) results to more realistic input processes while preserving computational tractability. Beyond methodological interest, the results yield actionable design guidance: (i) they separate Palm and time-stationary viewpoints cleanly under non-Poisson input, (ii) they retain heterogeneity throughout all formulas, and (iii) they provide a cost–optimization pipeline that can be deployed with routine numerical effort. Methodologically, we (i) characterize the generator of the augmented piecewise–deterministic Markov process and prove the existence/uniqueness of the stationary law on the finite state space, (ii) derive an explicit Palm–time conversion formula valid for non-Poisson input, (iii) show that the boundary-value recursion for the Laplace–Stieltjes transforms runs in linear time $\mathcal{O}\left(N\right)$ and is numerically stable, and (iv) provide influence-function (IPA) sensitivities of performance metrics with respect to $({\mu }_1,{\mu }_2,\nu ,\alpha ,\varphi ,\beta )$. Full article

This paper analyzes a discrete-time single-server retrial queue with preemptive service, Bernoulli arrivals, and adaptive retrial times, tailored to telecommunications systems. In call centers, the model captures caller retries and priority interruptions, while in cellular networks, it represents user channel access attempts with preemption for emergency calls. Using a Markov chain framework, we derive the stationary distribution, establish a stability condition, and compute performance metrics, including the mean number of retrying callers or users and orbit size probabilities. The model incorporates a novel retrial time adaptation probability, reflecting dynamic retry behaviors in telecommunications. Numerical results demonstrate the impact of arrival rates, preemption probabilities, and retrial adaptations on system performance, offering insights for optimizing call center staffing and cellular network protocols. Applications to slotted ALOHA and TDMA systems highlight the model’s practical relevance. Full article

Efficient resource utilization and low response times are critical challenges in storage area network (SAN) systems, especially as data-intensive applications like those driven by the Internet of Things and Artificial Intelligence place increasing demands on reliable, high-performance data storage solutions. Addressing these challenges, this paper contributes by proposing a proactive, utilization-driven traffic redistribution strategy to achieve balanced load distribution across switches, thereby improving the overall SAN performance and alleviating the risk of overload-incurred cascading failures. The proposed approach incorporates a Jackson Queueing Network-based method to evaluate both utilization and response time of individual switches, as well as the overall system response time. Based on a comprehensive case study of a mesh SAN system, two key parameters—the transition probability adjustment step size and the node selection window size—are analyzed for their impact on the effectiveness of the proposed strategy, revealing several valuable insights into fine-tuning traffic redistribution parameters. Full article

Medical imaging analysis plays a pivotal role in modern healthcare, with physicians relying heavily on radiologists for disease diagnosis. However, many hospitals face a shortage of radiologists, leading to long queues at radiology centers and delays in diagnosis. Advances in artificial intelligence (AI) have made it possible for AI models to analyze medical images and provide insights similar to those of radiologists. Despite their successes, these models face significant challenges that hinder widespread adoption. One major issue is the inability of AI models to generalize data from new populations, as performance tends to degrade when evaluated on datasets with different or shifted distributions, a problem known as domain shift. Additionally, the large size of these models requires substantial computational resources for training and deployment. In this study, we address these challenges by investigating domain shifts using ChestXray-14 and a Nigerian chest X-ray dataset. We propose a multi-task learning (MTL) approach that jointly trains the model on both datasets for two tasks, classification and segmentation, to minimize the domain gap. Furthermore, we replace traditional convolutional layers in the backbone model (Densenet-201) architecture with depthwise separable convolutions, reducing the model’s number of parameters and computational requirements. Our proposed model demonstrated remarkable improvements in both accuracy and AUC, achieving 93% accuracy and 96% AUC when tested across both datasets, significantly outperforming traditional transfer learning methods. Full article

This study examines a single-server Markovian queueing system featuring continuous service and an infinite number of customers at both ends—namely, offline and online clients. Offline customers are conventional clients who arrive at the system following a Poisson process, while online customers are assumed to be endlessly present in the system. All service times are exponentially and identically distributed and independent. Utilizing generating functions and Laplace transform techniques, this study derives exact analytical expressions for the system size probabilities in both transient and steady states. Furthermore, it evaluates key performance measures for each state and provides graphical representations to illustrate the system’s dynamics, thereby enriching the understanding of its operational behavior. This work contributes to the advancement of priority-based queueing models and proposes a novel framework applicable to hybrid service architectures in contemporary digital ecosystems. Full article

This research examines a multi-server retrial queueing system with a batch Markov arrival process and a phase-type service time distribution. The system’s distinguishing feature is its ability to control the admission of retrial customers. An attempt by a customer to retry is successful only if the number of busy servers does not exceed certain threshold values, which may depend on the state of the fundamental process of the primary customer’s arrival. Impatient retrying customers may abandon the system without obtaining service. A group of primary customers that arrives while the number of available servers is fewer than the group size is either entirely rejected or occupies all available servers, while the remainder of the group transitions to the orbit. The system’s behavior, under a defined set of thresholds, is characterized by a multidimensional Markov chain classified as asymptotically quasi-Toeplitz. This enables the acquisition of the ergodicity condition and the computation of the steady-state distribution of the Markov chain and the system’s performance measures. The presented numerical examples demonstrate the impact of threshold value variation. An example of solving an optimization problem is presented. The importance of the account of the batch arrivals is shown. Full article

Data center architecture plays an important role in effective server management network systems. Load balancing is one such data architecture used to efficiently distribute network traffic to the server. In this paper, we incorporated the load-balancing technique used in cloud computing with power business intelligence (BI) and cloud load based on the queueing theoretic approach. This model examines a bulk arrival and batch service queueing system, incorporating server overloading and underloading based on the queue length. In a batch service system, customers are served in groups following a general bulk service rule with the server operating between the minimum value $\mathit{‘}\mathit{a}\mathit{’}$ and the maximum value $\mathit{‘}b\mathit{’}$. But in certain situations, maintaining the same extreme values of the server is difficult, and it needs to be changed according to the service request. In this paper, server load balancing is introduced for a batch service queueing model, which is the capacity of the server that can be adjusted, either increased or decreased, based upon the service request by the customer. On service completion, if the service request is not enough to start any of the services, the server will be assigned to perform a secondary job (vacation). After vacation completion based upon the service request, the server will start regular service, overload or underload. Cloud computing using power BI can be analyzed based on server load balancing. The function that determines the probability of the queue size at any given time is derived for the specified queueing model using the supplementary variable technique with the remaining time as the supplementary variable. Additionally, various system characteristics are calculated and illustrated with suitable numerical examples. Full article

Unmanned aerial vehicle (UAV)-enabled vehicular communications in the sixth generation (6G) are characterized by line-of-sight (LoS) and dynamically varying channel conditions. However, the presence of obstacles in the LoS path leads to shadowed fading environments. In UAV-assisted cellular vehicle-to-everything (C-V2X) communication, vehicle and UAV mobility and shadowing adversely impact latency and throughput. Moreover, 6G vehicular communications comprise data-intensive applications such as augmented reality, mixed reality, virtual reality, intelligent transportation, and autonomous vehicles. Since vehicles’ sensors generate immense amount of data, the latency in processing these applications also increases, particularly when the data are not independently identically distributed (non-i.i.d.). Furthermore, when the sensors’ data are heterogeneous in size and distribution, the incoming packets demand substantial computing resources, energy efficiency at the UAV servers and intelligent mechanisms to queue the incoming packets. Due to the limited battery power and coverage range of UAV, the quality of service (QoS) requirements such as coverage rate, UAV flying time, and fairness of vehicle selection are adversely impacted. Controlling the UAV trajectory so that it serves a maximum number of vehicles while maximizing battery power usage is a potential solution to enhance QoS. This paper investigates the system performance and communication disruption between vehicles and UAV due to Doppler effect in the orthogonal time–frequency space (OTFS) modulated channel. Moreover, a low-complexity UAV trajectory prediction and vehicle selection method is proposed using federated learning, which exploits related information from past trajectories. The weighted total energy consumption of a UAV is minimized by jointly optimizing the transmission window ($L_w$), transmit power and UAV trajectory considering Doppler spread. The simulation results reveal that the weighted total energy consumption of the OTFS-based system decreases up to 10% when combined with federated learning to locally process the sensor data at the vehicles and communicate the processed local models to the UAV. The weighted total energy consumption of the proposed federated learning algorithm decreases by 10–15% compared with convex optimization, heuristic, and meta-heuristic algorithms. Full article

The N policy is a buffer and transmission management scheme proposed for nodes in wireless sensor networks to save energy. It exploits the concept that the output radio of a node is initially switched off until a critical queue of packets is built up. Then, the output transmission begins and continues until the buffer is completely flushed. The cycle then repeats. In this study, we analyze a buffer with the N policy, equipped additionally with active queue management, which allows for dropping some packets depending on the current buffer occupancy. This extension enables controlling the performance of the node to a much greater extent than in the original N policy. The main contribution is the formulae for the key performance characteristics of the extended policy: the queue size distribution, throughput, and energy efficiency. These formulae are proven for a model with a general distribution of service time and general parameterizations of active management during the energy-saving and transmission phases. Theoretical results are followed by sample numerical calculations, demonstrating how the system’s performance can be controlled using active management in the transmission phase, the energy-saving phase, or both combined. The influence of the threshold value in an actively managed buffer is then shown and compared with its passive counterpart. Finally, solutions to some optimization problems, with the cost function based on the trade-off between the queue length and throughput, are presented. Full article

There are various types of sharing economy services, such as ride-sharing and shared-taxi rides. Motivated by these services, we consider a single-server queue in which customers probabilistically select the type of service, that is, the single service or batch service, or other services (e.g., train). In the proposed model, which is denoted by the M+M(K)/M/1 queue, we assume that the arrival process of all the customers follows a Poisson distribution, the batch size is constant, and the common service time (for the single- and batch-service customers) follows an exponential distribution. In this model, the derivation of the sojourn time distribution is challenging because the sojourn time of a batch-service customer is not determined upon arrival but depends on single customers who arrive later. This results in a two-dimensional recursion, which is not generally solvable, but we made it possible by utilizing a special structure of our model. We present an analysis using a quasi-birth-and-death process, deriving the exact and approximated sojourn time distributions (for the single-service customers, batch-service customers, and all the customers). Through numerical experiments, we demonstrate that the approximated sojourn time distribution is sufficiently accurate compared to the exact sojourn time distributions. We also present a reasonable approximation for the distribution of the total number of customers in the system, which would be challenging with a direct-conventional method. Furthermore, we presented an accurate approximation method for a more general model where the service time of single-service customers and that of batch-service customers follow two distinct distributions, based on our original model. Full article

This paper studies a continuous-review stochastic replenishment model for a multi-component system with regular and emergency orders. The system consists of N parallel and independent components, each of which has a finite life span. In addition, there is a warehouse with a limited stock of new components. Each broken component is replaced by a new component from the stock. When no component is available, an emergency supply is ordered. The stock is managed according to an $((s,S),(0,Q^e))$ policy, which is a combination of an $(s,S)$ policy for the regular order and a $(0,Q^e)$ policy for the emergency order. The regular order is delivered after an exponentially distributed lead time, whereas the emergency order is delivered immediately. We study three sub-policies for emergency orders, which differ from each other in size and in relation to the regular order. Applying the results from queueing theory and phase-type properties, we derive the optimal thresholds for each sub-policy and then compare the economic benefit of each one. Full article

This study proposes a charging demand forecasting model for electric vehicles (EVs) that takes into consideration the characteristics of EVs with transportation and mobile load. The model utilizes traffic information to evaluate the influence of traffic systems on driving and charging behavior, specifically focusing on the characteristics of EVs with transportation and mobile load. Additionally, it evaluates the effect of widespread charging on the distribution network. An urban traffic network model is constructed based on the multi-intersection features, and a traffic network–distribution network interaction model is determined according to the size of the urban road network. Type classification simplifies the charging and discharging characteristics of EVs, enabling efficient aggregation of EVs. The authors have built a singular EV transportation model and an EV charging queue model is established. The EV charging demand is forecasted and then used as an input in the support vector machine (SVM) model. The final projection value for EV charging load is determined by taking into account many influencing elements. Compared to the real load, the proposed method’s feasibility and effectiveness are confirmed. Full article

In this paper, we examine a buffer with active management that rejects packets basing on the buffer occupancy. Specifically, we derive several metrics characterizing how effectively the algorithm can prevent the queue of packets from becoming too long and how well it assists in flushing the buffer quickly when necessary. First, we compute the probability that the size of the queue is kept below a predefined level L. Second, we calculate the distribution of the amount of time needed to cross level L, the buffer overflow probability, and the average time to buffer overflow. Third, we derive the distribution of the amount of time required to flush the buffer and its average value. A general modeling framework is used in derivations, with a general service time distribution, general rejection function, and a powerful model of the arrival process. The obtained formulas enable, among other things, the solving of many design problems, e.g., those connected with the design of wireless sensor nodes using the N-policy. Several numerical results are provided, including examples of design problems and other calculations. Full article