scholarly journals Optimal Open-Loop Routing and Threshold-Based Allocation in TWO Parallel QUEUEING Systems with Heterogeneous Servers

Mathematics ◽  
2021 ◽  
Vol 9 (21) ◽  
pp. 2766
Author(s):  
Dmitry Efrosinin ◽  
Natalia Stepanova
Keyword(s):  
Optimal Allocation ◽  
Queueing Systems ◽  
Open Loop ◽  
Arrival Process ◽  
Optimal Routing ◽  
Threshold Policy ◽  
Loop Control ◽  
Allocation Policy ◽  
Routing Policy ◽  
Markov Modulated

In this paper, we study the problem of optimal routing for the pair of two-server heterogeneous queues operating in parallel and subsequent optimal allocation of customers between the servers in each queue. Heterogeneity implies different servers in terms of speed of service. An open-loop control assumes the static resource allocation when a router has no information about the state of the system. We discuss here the algorithm to calculate the optimal routing policy based on specially constructed Markov-modulated Poisson processes. As an alternative static policy, we consider an optimal Bernoulli splitting which prescribes the optimal allocation probabilities. Then, we show that the optimal allocation policy between the servers within each queue is of threshold type with threshold levels depending on the queue length and phase of an arrival process. This dependence can be neglected by using a heuristic threshold policy. A number of illustrative examples show interesting properties of the systems operating under the introduced policies and their performance characteristics.

scholarly journals Algorithmic Analysis of Finite-Source Multi-Server Heterogeneous Queueing Systems

Mathematics ◽  
2021 ◽  
Vol 9 (20) ◽  
pp. 2624
Author(s):  
Dmitry Efrosinin ◽  
Natalia Stepanova ◽  
Janos Sztrik
Keyword(s):  
Optimal Allocation ◽  
Queueing Systems ◽  
Mean Value ◽  
Threshold Policy ◽  
Heterogeneous Model ◽  
Finite Source ◽  
Long Run ◽  
The Matrix ◽  
Number Of Customers ◽  
Main Model

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.

Open-loop control of compensation for optical propagation through a turbulent shear flow

1998 ◽  
Author(s):  
C. Truman ◽  
Lenore McMackin ◽  
Robert Pierson ◽  
Kenneth Bishop ◽  
Ellen Chen
Keyword(s):  
Shear Flow ◽  
Open Loop ◽  
Turbulent Shear ◽  
Turbulent Shear Flow ◽  
Open Loop Control ◽  
Loop Control ◽  
Optical Propagation

scholarly journals Sensuator: A Hybrid Sensor–Actuator Approach to Soft Robotic Proprioception Using Recurrent Neural Networks

Actuators ◽  
2021 ◽  
Vol 10 (2) ◽  
pp. 30
Author(s):  
Pornthep Preechayasomboon ◽  
Eric Rombokas
Keyword(s):  
Neural Networks ◽  
Recurrent Neural Networks ◽  
Linear Models ◽  
Open Loop ◽  
Proof Of Concept ◽  
State Estimator ◽  
Loop Control ◽  
Practical Applications ◽  
Soft Actuator ◽  
The Cost

Soft robotic actuators are now being used in practical applications; however, they are often limited to open-loop control that relies on the inherent compliance of the actuator. Achieving human-like manipulation and grasping with soft robotic actuators requires at least some form of sensing, which often comes at the cost of complex fabrication and purposefully built sensor structures. In this paper, we utilize the actuating fluid itself as a sensing medium to achieve high-fidelity proprioception in a soft actuator. As our sensors are somewhat unstructured, their readings are difficult to interpret using linear models. We therefore present a proof of concept of a method for deriving the pose of the soft actuator using recurrent neural networks. We present the experimental setup and our learned state estimator to show that our method is viable for achieving proprioception and is also robust to common sensor failures.

Filtering of Markov renewal queues, IV: Flow processes in feedback queues

1985 ◽  
Vol 17 (2) ◽  
pp. 386-407 ◽  
Author(s):  
Jeffrey J. Hunter
Keyword(s):  
Queue Length ◽  
Queueing Systems ◽  
Arrival Process ◽  
Markov Renewal Process ◽  
Renewal Processes ◽  
Flow Process ◽  
Special Cases ◽  
Flow Processes ◽  
Transition Points ◽  
The Times

This paper is a continuation of the study of a class of queueing systems where the queue-length process embedded at basic transition points, which consist of ‘arrivals’, ‘departures’ and ‘feedbacks’, is a Markov renewal process (MRP). The filtering procedure of Çinlar (1969) was used in [12] to show that the queue length process embedded separately at ‘arrivals’, ‘departures’, ‘feedbacks’, ‘inputs’ (arrivals and feedbacks), ‘outputs’ (departures and feedbacks) and ‘external’ transitions (arrivals and departures) are also MRP. In this paper expressions for the elements of each Markov renewal kernel are derived, and thence expressions for the distribution of the times between transitions, under stationary conditions, are found for each of the above flow processes. In particular, it is shown that the inter-event distributions for the arrival process and the departure process are the same, with an equivalent result holding for inputs and outputs. Further, expressions for the stationary joint distributions of successive intervals between events in each flow process are derived and interconnections, using the concept of reversed Markov renewal processes, are explored. Conditions under which any of the flow processes are renewal processes or, more particularly, Poisson processes are also investigated. Special cases including, in particular, the M/M/1/N and M/M/1 model with instantaneous Bernoulli feedback, are examined.

Stationary Poisson departure processes from non-stationary queues

1986 ◽  
Vol 23 (1) ◽  
pp. 256-260 ◽  
Author(s):  
Robert D. Foley
Keyword(s):  
Poisson Process ◽  
Service Time ◽  
Queueing Systems ◽  
Arrival Rate ◽  
Distribution Functions ◽  
Arrival Process ◽  
Service Time Distribution ◽  
Departure Process ◽  
Infinite Server ◽  
Departure Processes

We present some non-stationary infinite-server queueing systems with stationary Poisson departure processes. In Foley (1982), it was shown that the departure process from the Mt/Gt/∞ queue was a Poisson process, possibly non-stationary. The Mt/Gt/∞ queue is an infinite-server queue with a stationary or non-stationary Poisson arrival process and a general server in which the service time of a customer may depend upon the customer's arrival time. Mirasol (1963) pointed out that the departure process from the M/G/∞ queue is a stationary Poisson process. The question arose whether there are any other Mt/Gt/∞ queueing systems with stationary Poisson departure processes. For example, if the arrival rate is periodic, is it possible to select the service-time distribution functions to fluctuate in order to compensate for the fluctuations of the arrival rate? In this situation and in more general situations, it is possible to select the server such that the system yields a stationary Poisson departure process.

Precise open-loop control of MEMS deformable mirror shape

2008 ◽  
Author(s):  
Thomas Bifano ◽  
Jason Stewart ◽  
Alioune Diouf
Keyword(s):  
Open Loop ◽  
Deformable Mirror ◽  
Open Loop Control ◽  
Loop Control

Active Control of Combustion Instability Using Symmetric and Asymmetric Premix Fuel Modulation

2007 ◽  
Author(s):  
Daniel Guyot ◽  
Christian Oliver Paschereit
Keyword(s):  
Heat Release ◽  
Closed Loop ◽  
Modulation Frequency ◽  
Combustion Instability ◽  
Open Loop ◽  
Closed Loop Control ◽  
Nox Emissions ◽  
Loop Control ◽  
Asymmetric Modulation ◽  
Control Schemes

Active instability control was applied to an atmospheric swirl-stabilized premixed combustor using open loop and closed loop control schemes. Actuation was realised by two on-off valves allowing for symmetric and asymmetric modulation of the premix fuel flow while maintaining constant time averaged overall fuel mass flow. Pressure and heat release fluctuations in the combustor as well as NOx, CO and CO2 emissions in the exhaust were recorded. In the open loop circuit the heat release response of the flame was first investigated during stable combustion. For symmetric fuel modulation the dominant frequency in the heat release response was the modulation frequency, while for asymmetric modulation it was its first harmonic. In stable open loop control a reduction of NOx emissions due to fuel modulation of up to 19% was recorded. In the closed loop mode phase-shift control was applied while triggering the valves at the dominant oscillation frequency as well as at its second subharmonic. Both, open and closed loop control schemes were able to successfully control a low-frequency combustion instability, while showing only a small increase in NOx emissions compared to, for example, secondary fuel modulation. Using premixed open loop fuel modulation, attenuation was best when modulating the fuel at frequencies different from the dominant instability frequency and its subharmonic. The performance of asymmetric fuel modulation was generally slightly better than for symmetric modulation in terms of suppression levels as well as emissions. Suppression of the instability’s pressure rms level of up to 15.7 dB was recorded.

Sign in / Sign up

Export Citation Format

Share Document