scholarly journals A finite-buffer queue with a single vacation policy: An analytical study with evolutionary positioning

2014 ◽  
Vol 24 (4) ◽  
pp. 887-900 ◽  
Author(s):  
Marcin Woźniak ◽  
Wojciech M. Kempa ◽  
Marcin Gabryel ◽  
Robert K. Nowicki
Keyword(s):  
Busy Period ◽  
Optimization Problem ◽  
Analytical Study ◽  
Cost Optimization ◽  
Queueing Systems ◽  
Evolutionary Strategy ◽  
Finite Buffer ◽  
Single Vacation ◽  
Erlang Distributions ◽  
Finite Buffer Queue

Abstract In this paper, application of an evolutionary strategy to positioning a GI/M/1/N-type finite-buffer queueing system with exhaustive service and a single vacation policy is presented. The examined object is modeled by a conditional joint transform of the first busy period, the first idle time and the number of packets completely served during the first busy period. A mathematical model is defined recursively by means of input distributions. In the paper, an analytical study and numerical experiments are presented. A cost optimization problem is solved using an evolutionary strategy for a class of queueing systems described by exponential and Erlang distributions.

scholarly journals An Analytical Study in Multi-physics and Multi-criteria Shape Optimization

2021 ◽  
Author(s):  
Hanno Gottschalk ◽  
Marco Reese
Keyword(s):  
Shape Optimization ◽  
Physical System ◽  
Pareto Front ◽  
Optimization Problem ◽  
Analytical Study ◽  
Static Pressure ◽  
Hausdorff Metric ◽  
Objective Functions ◽  
Hölder Continuous ◽  
Turbine Vane

AbstractA simple multi-physical system for the potential flow of a fluid through a shroud, in which a mechanical component, like a turbine vane, is placed, is modeled mathematically. We then consider a multi-criteria shape optimization problem, where the shape of the component is allowed to vary under a certain set of second-order Hölder continuous differentiable transformations of a baseline shape with boundary of the same continuity class. As objective functions, we consider a simple loss model for the fluid dynamical efficiency and the probability of failure of the component due to repeated application of loads that stem from the fluid’s static pressure. For this multi-physical system, it is shown that, under certain conditions, the Pareto front is maximal in the sense that the Pareto front of the feasible set coincides with the Pareto front of its closure. We also show that the set of all optimal forms with respect to scalarization techniques deforms continuously (in the Hausdorff metric) with respect to preference parameters.

scholarly journals Transient and Stationary Losses in a Finite-Buffer Queue with Batch Arrivals

2012 ◽  
Vol 2012 ◽  
pp. 1-17 ◽  
Author(s):  
Andrzej Chydzinski ◽  
Blazej Adamczyk
Keyword(s):  
Batch Size ◽  
Buffer Size ◽  
Arrival Process ◽  
Time Interval ◽  
Finite Buffer ◽  
Finite Time Interval ◽  
Batch Arrivals ◽  
Batch Markovian Arrival Process ◽  
Buffer Overflows ◽  
Finite Buffer Queue

We present an analysis of the number of losses, caused by the buffer overflows, in a finite-buffer queue with batch arrivals and autocorrelated interarrival times. Using the batch Markovian arrival process, the formulas for the average number of losses in a finite time interval and the stationary loss ratio are shown. In addition, several numerical examples are presented, including illustrations of the dependence of the number of losses on the average batch size, buffer size, system load, autocorrelation structure, and time.

scholarly journals Volume and duration of losses in finite buffer fluid queues

2015 ◽  
Vol 52 (3) ◽  
pp. 826-840 ◽  
Author(s):  
Fabrice Guillemin ◽  
Bruno Sericola
Keyword(s):  
Busy Period ◽  
Buffer Capacity ◽  
Exact Expression ◽  
Loss Probability ◽  
Finite Buffer ◽  
Fluid Queues ◽  
Buffer Content ◽  
Phase Type ◽  
Phase Type Distributions ◽  
Arrival Processes

We study congestion periods in a finite fluid buffer when the net input rate depends upon a recurrent Markov process; congestion occurs when the buffer content is equal to the buffer capacity. Similarly to O'Reilly and Palmowski (2013), we consider the duration of congestion periods as well as the associated volume of lost information. While these quantities are characterized by their Laplace transforms in that paper, we presently derive their distributions in a typical stationary busy period of the buffer. Our goal is to compute the exact expression of the loss probability in the system, which is usually approximated by the probability that the occupancy of the infinite buffer is greater than the buffer capacity under consideration. Moreover, by using general results of the theory of Markovian arrival processes, we show that the duration of congestion and the volume of lost information have phase-type distributions.

scholarly journals M/G/1 vacation model with limited service discipline and hybrid switching-on policy

1997 ◽  
Vol 3 (3) ◽  
pp. 243-253
Author(s):  
Alexander V. Babitsky
Keyword(s):  
Generating Function ◽  
Busy Period ◽  
Optimization Problem ◽  
Queueing System ◽  
Service Discipline ◽  
Multiple Vacations ◽  
Queueing Process ◽  
Vacation Model ◽  
Hybrid Switching ◽  
Limited Service

The author studies an M/G/1 queueing system with multiple vacations. The server is turned off in accordance with the K-limited discipline, and is turned on in accordance with the T-N-hybrid policy. This is to say that the server will begin a vacation from the system if either the queue is empty orKcustomers were served during a busy period. The server idles until it finds at leastNwaiting units upon return from a vacation.Formulas for the distribution generating function and some characteristics of the queueing process are derived. An optimization problem is discussed.

Sign in / Sign up

Export Citation Format

Share Document