Search Results (13)

This paper analyzes a finite-capacity Markovian queueing system with two customer types, each assigned to a separate buffer, and a single alternating server whose service priority is dynamically controlled by a queue-length-based threshold policy. The arrivals of both customer types follow independent Poisson processes, and the service times are generally distributed. The server alternates between the two buffers, granting service priority to buffer 1 when its queue length exceeds a specified threshold immediately after service completion; otherwise, buffer 2 receives priority. Once buffer 1 gains priority, it retains it until it becomes empty, with all priority transitions occurring non-preemptively. We develop an embedded Markov chain model to derive the joint queue length distribution at departure epochs and employ supplementary variable techniques to analyze the system performance at arbitrary times. This study provides explicit expressions for key performance measures, including blocking probabilities and average queue lengths, and demonstrates the effectiveness of threshold-based control in balancing service quality between customer classes. Numerical examples illustrate the impact of buffer capacities and threshold settings on system performance and offer practical insights into the design of adaptive scheduling policies in telecommunications, cloud computing, and healthcare systems. Full article

The Internet of Things (IoT) with non-orthogonal multiple access (NOMA) has been anticipated to offer diverse real-time applications, wherein the crux is to guarantee the age of information (AoI) for dynamic traffic. However, the traffic temporal variation provokes the interdependence between queue status and interference, in which context the AoI performance remains to be further explored. In this paper, an analytical framework is established to characterize the AoI performance in NOMA-IoT networks with random Bernoulli and deterministic periodic arrivals. Particularly, a numerical algorithm is devised to obtain the queue service rate, and tractable expressions for AoI violation probability and average AoI under both the first-come first-served (FCFS) and the preemptive last-come first-served (LCFS-PR) service disciplines are derived. Simulations are conducted to validate the proposed analysis. The results unveil that LCFS-PR conduces to better AoI performance than FCFS, and yet the gain diverges for each device with different traffic arrival configurations. In addition, the result shows that with sporadic traffic arrival, the periodic pattern outperforms the Bernoulli pattern, whereas this advantage gradually diminishes with more frequent packet arrival. Full article

Cloud services offer doctors and data scientists access to medical data from multiple locations using different devices (laptops, desktops, tablets, smartphones, etc.). Therefore, cyber threats to medical data at rest, in transit and when used by applications need to be pinpointed and prevented preemptively through a host of proven cryptographical solutions. The presented work integrates adaptive key generation, neural-based confusion and non-XOR, namely DNA diffusion, which offers a more extensive and unique key, adaptive confusion and unpredictable diffusion algorithm. Only authenticated users can store this encrypted image in cloud storage. The proposed security framework uses logistics, tent maps and adaptive key generation modules. The adaptive key is generated using a multilayer and nonlinear neural network from every input plain image. The Hopfield neural network (HNN) is a recurrent temporal network that updates learning with every plain image. We have taken Amazon Web Services (AWS) and Simple Storage Service (S3) to store encrypted images. Using benchmark evolution metrics, the ability of image encryption is validated against brute force and statistical attacks, and encryption quality analysis is also made. Thus, it is proved that the proposed scheme is well suited for hosting cloud storage for secure images. Full article

In this paper, a multi-server queueing system providing service to two correlated flows of requests was considered. Non-preemptive priority was granted to one flow via the preliminary delay of requests in the intermediate buffers with different rates of extracting from the buffers. Customers’ impatience during waiting in the intermediate and main buffers was taken into account. The possibility of the use of the results of the mathematical analysis for managerial goals is numerically illustrated. Full article

Cloud operators face massive unused excess computing capacity with a stochastic non-stationary nature due to time-varying resource utilization with peaks and troughs. Low-priority spot (pre-emptive) cloud services with real-time pricing have been launched by many cloud operators, which allow them to maximize excess capacity revenue while keeping the right to reclaim capacities when resource scarcity occurs. However, real-time spot pricing with the non-stationarity of excess capacity has two challenges: (1) it faces incomplete peak–trough and pattern shifts in excess capacity, and (2) it suffers time and space inefficiency in optimal spot pricing policy, which needs to search over the large space of history-dependent policies in a non-stationary state. Our objective was to develop a real-time pricing method with a spot pricing scheme to maximize expected cumulative revenue under a non-stationary state. We first formulated the real-time spot pricing problem as a non-stationary Markov decision process. We then developed an improved reinforcement learning algorithm to obtain the optimal solution for real-time pricing problems. Our simulation experiments demonstrate that the profitability of the proposed reinforcement learning algorithm outperforms that of existing solutions. Our study provides both efficient optimization algorithms and valuable insights into cloud operators’ excess capacity management practices. Full article

In this paper, we analyze a queueing–inventory system with two classes of customers, high priority (HP) and low priority (LP), under the discretionary priority discipline. The LP customers are served in two stages: preliminary service in stage-I and main service in stage-II. In contrast, HP customers require only the main service. Whenever the inventory level is less than the threshold level during the stage-I service of an LP customer, an arriving HP customer is allowed to interrupt the service of an LP customer by adopting the mixed-priority discipline. Otherwise, non-preemptive priority discipline is used in both stages. The interrupted LP customer moves to orbit and retries for the service whenever the server is free. The waiting hall of finite capacity is afforded for the HP customer only. The orbital search is provided for LP customers in orbit. The inventory is replenished following the $(s,Q)$ ordering policy, with the lifetimes of the items being exponentially distributed. An expression for the stability condition is determined explicitly, and system performance measures are evaluated. Numerical examples are formulated for different sets of input values of the parameters. Full article

There is a well-validated association between SLCO1B1 (rs4149056) and statin-associated muscle symptoms (SAMS). Preemptive SLCO1B1 pharmacogenetic (PGx) testing may diminish the incidence of SAMS by identifying individuals with increased genetic risk before statin initiation. Despite its potential clinical application, the cost implications of SLCO1B1 testing are largely unknown. We conducted a cost–consequence analysis of preemptive SLCO1B1 testing (PGx+) versus usual care (PGx−) among Veteran patients enrolled in the Integrating Pharmacogenetics in Clinical Care (I-PICC) Study. The assessment was conducted using a health system perspective and 12-month time horizon. Incremental costs of SLCO1B1 testing and downstream medical care were estimated using data from the U.S. Department of Veterans Affairs’ Managerial Cost Accounting System. A decision analytic model was also developed to model 1-month cost and SAMS-related outcomes in a hypothetical cohort of 10,000 Veteran patients, where all patients were initiated on simvastatin. Over 12 months, 13.5% of PGx+ (26/193) and 11.2% of PGx− (24/215) participants in the I-PICC Study were prescribed Clinical Pharmacogenetics Implementation Consortium (CPIC) guideline-concordant statins (Δ2.9%, 95% CI −4.0% to 10.0%). Differences in mean per-patient costs for lipid therapy prescriptions, including statins, for PGx+ compared to PGx− participants were not statistically significant (Δ USD 9.53, 95% CI −0.86 to 22.80 USD). Differences in per-patient costs attributable to the intervention, including PGx testing, lipid-lowering prescriptions, SAMS, laboratory and imaging expenses, and primary care and cardiology services, were also non-significant (Δ− USD 1004, 95% CI −2684 to 1009 USD). In the hypothetical cohort, SLCO1B1-informed statin therapy averted 109 myalgias and 3 myopathies at 1-month follow up. Fewer statin discontinuations (78 vs. 109) were also observed, but the SLCO1B1 testing strategy was 96 USD more costly per patient compared to no testing (124 vs. 28 USD). The implementation of SLCO1B1 testing resulted in small, non-significant increases in the proportion of patients receiving CPIC-concordant statin prescriptions within a real-world primary care context, diminished the incidence of SAMS, and reduced statin discontinuations in a hypothetical cohort of 10,000 patients. Despite these effects, SLCO1B1 testing administered as a standalone test did not result in lower per-patient health care costs at 1 month or over 1 year of treatment. The inclusion of SLCO1B1, among other well-validated pharmacogenes, into preemptive panel-based testing strategies may provide a better balance of clinical benefit and cost. Full article

The paper deals with a finite-source queueing system serving one class of customers and consisting of heterogeneous servers with unequal service intensities and of one common queue. The main model has a non-preemptive service when the customer can not change the server during its service time. The optimal allocation problem is formulated as a Markov-decision one. We show numerically that the optimal policy which minimizes the long-run average number of customers in the system has a threshold structure. We derive the matrix expressions for performance measures of the system and compare the main model with alternative simplified queuing systems which are analysed for the arbitrary number of servers. We observe that the preemptive heterogeneous model operating under a threshold policy is a good approximation for the main model by calculating the mean number of customers in the system. Moreover, using the preemptive and non-preemptive queueing models with the faster server first policy the lower and upper bounds are calculated for this mean value. Full article

In this paper, we consider two single server queueing systems to which customers of two distinct priorities ($P_1$ and $P_2$) arrive according to a Marked Markovian arrival process (MMAP). They are served according to two distinct phase type distributions. The probability of a $P_1$ customer to feedback is $\theta$ on completion of his service. The feedback ($P_1$) customers, as well as $P_2$ customers, join the low priority queue. Low priority ($P_2$) customers are taken for service from the head of the line whenever the $P_1$ queue is found to be empty at the service completion epoch. We assume a finite waiting space for $P_1$ customers and infinite waiting space for $P_2$ customers. Two models are discussed in this paper. In model I, we assume that the service of $P_2$ customers is according to a non-preemptive service discipline and in model II, the $P_2$ customers service follow a preemptive policy. No feedback is permitted to customers in the $P_2$ line. In the steady state these two models are compared through numerical experiments which reveal their respective performance characteristics. Full article

A single-server queueing system with a finite buffer, several types of impatient customers, and non-preemptive priorities is analyzed. The initial priority of a customer can increase during its waiting time in the queue. The behavior of the system is described by a multi-dimensional Markov chain. The generator of this chain, having essential dependencies between the components, is derived and formulas for computation of the most important performance indicators of the system are presented. The dependence of some of these indicators on the capacity of the buffer space is illustrated. The profound effect of the phenomenon of correlation of successive inter-arrival times and variance of the service time is numerically demonstrated. Results can be used for the optimization of dispatching various types of customers in information transmission systems, emergency departments and first aid stations, perishable foods supply chains, etc. Full article

A new flexible discipline for providing priority to one of two types of customers in a single-server queue is proposed. This discipline assumes the use of additional finite storages for each type of arriving customer. During the stay in a storage, a customer can leave the system or transfer to the main infinite buffer. Preference to priority customers is provided via the proper choice of the rates of a customer transfer from the storages to the buffer. Analysis of this discipline is implemented under quite general assumptions about the arrival and service processes. The advantage of the proposed discipline over the classical non-preemptive discipline is numerically demonstrated. Full article

The use of priorities allows us to improve the quality of service of inhomogeneous customers in telecommunication networks, inventory and health-care systems. An important modern direction of research is to analyze systems in which priority of a customer can be changed during his/her stay in the system. We considered a single-server queuing system with a finite buffer, where two types of customers arrive according to a batch marked Markov arrival process. Type 1 customers have non-preemptive priority over type 2 customers. Low priority customers are able to receive high priority after the random amount of time. For each non-priority customer accepted into the buffer, a timer, which counts a random time having a phase type distribution, is switched-on. When the timer expires, the customer with some probability leaves the system unserved and with the complimentary probability gains the high priority. Such a type of queues is typical in many health-care systems, contact centers, perishable inventory, etc. We describe the behavior of the system by a multi-dimensional continuous-time Markov chain and calculate a number of the stationary performance measures of the system including the various loss probabilities as well as the distribution function of the waiting time of priority customers. The illustrative numerical examples giving insights into the system behavior are presented. Full article

Studies of the IEEE 802.15.4 Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) scheme have been received considerable attention recently, with most of these studies focusing on homogeneous or saturated traffic. Two novel transmission schemes—OSTS/BSTS (One Service a Time Scheme/Bulk Service a Time Scheme)—are proposed in this paper to improve the behaviors of time-critical buffered networks with heterogeneous unsaturated traffic. First, we propose a model which contains two modified semi-Markov chains and a macro-Markov chain combined with the theory of M/G/1/K queues to evaluate the characteristics of these two improved CSMA/CA schemes, in which traffic arrivals and accessing packets are bestowed with non-preemptive priority over each other, instead of prioritization. Then, throughput, packet delay and energy consumption of unsaturated, unacknowledged IEEE 802.15.4 beacon-enabled networks are predicted based on the overall point of view which takes the dependent interactions of different types of nodes into account. Moreover, performance comparisons of these two schemes with other non-priority schemes are also proposed. Analysis and simulation results show that delay and fairness of our schemes are superior to those of other schemes, while throughput and energy efficiency are superior to others in more heterogeneous situations. Comprehensive simulations demonstrate that the analysis results of these models match well with the simulation results. Full article