scholarly journals Study on the Departure Process of Discrete-TimeGeo/G/1Queue with Randomized Vacations

2014 ◽  
Vol 2014 ◽  
pp. 1-9
Author(s):  
Chuanyi Luo ◽  
Xiaoying Huang ◽  
Chuan Ding
Keyword(s):  
Discrete Time ◽  
Renewal Process ◽  
Queueing Network ◽  
Arrival Process ◽  
Time Interval ◽  
Decomposition Techniques ◽  
Expected Number ◽  
Departure Process ◽  
State Process ◽  
Probability Decomposition

This paper presents an analysis of the departure process of a discrete-timeGeo/G/1queue with randomized vacations. By using probability decomposition techniques and renewal process, the expression of expected number of departures during time interval(0+,n+]is derived. The relation among departure process, server state process, and service renewal process is obtained. The relation displays the decomposition characteristic of the departure process. Furthermore, the approximate expansion of the expected number of departures is gained. Since the departure process also often corresponds to an arrival process for a downstream queue in queueing network, it is hoped that the results obtained in this paper may provide useful information for queueing network.

The departure process of the M/G/1 queueing model with server vacation and exhaustive service discipline

1994 ◽  
Vol 31 (4) ◽  
pp. 1070-1082 ◽  
Author(s):  
Yinghui Tang
Keyword(s):  
Renewal Theory ◽  
Service Discipline ◽  
Time Interval ◽  
Single Server ◽  
Stieltjes Transform ◽  
Expected Number ◽  
Departure Process ◽  
Server Vacation ◽  
Server Queue ◽  
Interdeparture Time

In this paper we study the departure process of M/G/1 queueing models with a single server vacation and multiple server vacations. The arguments employed are direct probability decomposition, renewal theory and the Laplace–Stieltjes transform. We discuss the distribution of the interdeparture time and the expected number of departures occurring in the time interval (0, t] from the beginning of the state i (i = 0, 1, 2, ···), and provide a new method for analysis of the departure process of the single-server queue.

The departure process of the M/G/1 queueing model with server vacation and exhaustive service discipline

1994 ◽  
Vol 31 (04) ◽  
pp. 1070-1082 ◽  
Author(s):  
Yinghui Tang
Keyword(s):  
Renewal Theory ◽  
Service Discipline ◽  
Time Interval ◽  
Single Server ◽  
Stieltjes Transform ◽  
Expected Number ◽  
Departure Process ◽  
Server Vacation ◽  
Server Queue ◽  
Interdeparture Time

In this paper we study the departure process of M/G/1 queueing models with a single server vacation and multiple server vacations. The arguments employed are direct probability decomposition, renewal theory and the Laplace–Stieltjes transform. We discuss the distribution of the interdeparture time and the expected number of departures occurring in the time interval (0, t] from the beginning of the state i (i = 0, 1, 2, ···), and provide a new method for analysis of the departure process of the single-server queue.

scholarly journals Capacity Planning of Electric Car Charging Station Based on Discrete Time Observations and MAP(2)/G/c Queue

2018 ◽  
Author(s):  
Csaba Farkas ◽  
Miklós Telek
Keyword(s):  
Discrete Time ◽  
Continuous Time ◽  
Arrival Process ◽  
Time Interval ◽  
Correlation Parameter ◽  
Charging Station ◽  
Electric Car ◽  
Time Map ◽  
Discrete Time Observations ◽  
Charging Stations

The modeling of electric car charging stations is essential for determining the required number of chargers in order to ensure the required service quality. In this paper we propose a new estimation method for the stochastic modeling of electric car charging stations, based on Markov arrival process (MAP).The input of the proposed model is empirical data for the arrival and service process of electric cars, given as histograms: the number of arriving cars during a fixed time slot (5 minutes in our case) and the histogram of service times (in 5 minutes granularity). The fact that observations on the continuous time process of car charging are available in discrete time steps poses a modeling challenge, which was not considered before. We propose a procedure to fit the observed data with a continuous time MAP of order 2 such that three moments and a correlation parameter of the discrete time observations are matched with three moments and the correlation parameter of the continuous time MAP for the given time interval. We implemented the fitting procedure in MATLAB and verified the obtained model of car charging station against simulation. As the MAP model of the arrival processes is reasonably close to the observations, the obtained MAP/G/c queue allows a more accurate dimensioning of car charging station than the previously applied ones.

scholarly journals Time to Intervene: A Continuous-Time Approach to Network Analysis and Centrality

Psychometrika ◽  
2021 ◽  
Author(s):  
Oisín Ryan ◽  
Ellen L. Hamaker
Keyword(s):  
Network Analysis ◽  
Discrete Time ◽  
Continuous Time ◽  
Centrality Measures ◽  
Time Interval ◽  
Direct Effects ◽  
Network Approach ◽  
Var Models ◽  
Auto Regressive ◽  
Conceptual Shift

AbstractNetwork analysis of ESM data has become popular in clinical psychology. In this approach, discrete-time (DT) vector auto-regressive (VAR) models define the network structure with centrality measures used to identify intervention targets. However, VAR models suffer from time-interval dependency. Continuous-time (CT) models have been suggested as an alternative but require a conceptual shift, implying that DT-VAR parameters reflect total rather than direct effects. In this paper, we propose and illustrate a CT network approach using CT-VAR models. We define a new network representation and develop centrality measures which inform intervention targeting. This methodology is illustrated with an ESM dataset.

scholarly journals Implementation of an FPGA-Based Current Control and SVPWM ASIC with Asymmetric Five-Segment Switching Scheme for AC Motor Drives

Energies ◽  
2021 ◽  
Vol 14 (5) ◽  
pp. 1462
Author(s):  
Ming-Fa Tsai ◽  
Chung-Shi Tseng ◽  
Po-Jen Cheng
Keyword(s):  
Discrete Time ◽  
Control Function ◽  
Current Control ◽  
Motor Drives ◽  
Modulation Scheme ◽  
Time Interval ◽  
Switching Scheme ◽  
Two Phase ◽  
Ac Motor ◽  
Ac Motor Drives

This paper presents the design and implementation of an application-specific integrated circuit (ASIC) for a discrete-time current control and space-vector pulse-width modulation (SVPWM) with asymmetric five-segment switching scheme for AC motor drives. As compared to a conventional three-phase symmetric seven-segment switching SVPWM scheme, the proposed method involves five-segment two-phase switching in each switching period, so the inverter switching times and power loss can be reduced by 33%. In addition, the produced PWM signal is asymmetric with respect to the center-symmetric triangular carrier wave, and the voltage command signal from the discrete-time current control output can be given in each half period of the PWM switching time interval, hence increasing the system bandwidth and allowing the motor drive system with better dynamic response. For the verification of the proposed SVPWM modulation scheme, the current control function in the stationary reference frame is also included in the design of the ASIC. The design is firstly verified by using PSIM simulation tool. Then, a DE0-nano field programmable gate array (FPGA) control board is employed to drive a 300W permanent-magnet synchronous motor (PMSM) for the experimental verification of the ASIC.

scholarly journals Tail Asymptotics for Monotone-Separable Networks

2007 ◽  
Vol 44 (02) ◽  
pp. 306-320
Author(s):  
Marc Lelarge
Keyword(s):  
Queueing Network ◽  
Network Models ◽  
Moment Generating Function ◽  
Stochastic Petri Nets ◽  
Arrival Process ◽  
Polling Systems ◽  
Tail Asymptotics ◽  
State Variables ◽  
Monotone Functions ◽  
Jackson Networks

A network belongs to the monotone separable class if its state variables are homogeneous and monotone functions of the epochs of the arrival process. This framework contains several classical queueing network models, including generalized Jackson networks, max-plus networks, polling systems, multiserver queues, and various classes of stochastic Petri nets. We use comparison relationships between networks of this class with independent and identically distributed driving sequences and the GI/GI/1/1 queue to obtain the tail asymptotics of the stationary maximal dater under light-tailed assumptions for service times. The exponential rate of decay is given as a function of a logarithmic moment generating function. We exemplify an explicit computation of this rate for the case of queues in tandem under various stochastic assumptions.

scholarly journals Homogeneous Discrete Time Alternating Compound Renewal Process: A Disability Insurance Application

2015 ◽  
Vol 2015 ◽  
pp. 1-13
Author(s):  
Guglielmo D’Amico ◽  
Fulvio Gismondi ◽  
Jacques Janssen ◽  
Raimondo Manca
Keyword(s):  
Discrete Time ◽  
Renewal Process ◽  
Real Life ◽  
Disability Insurance ◽  
Insurance Contract ◽  
Compound Renewal Process ◽  
Simple Tool ◽  
Life Problems ◽  
Alternating Renewal Process

Discrete time alternating renewal process is a very simple tool that permits solving many real life problems. This paper, after the presentation of this tool, introduces the compound environment in the alternating process giving a systematization to this important tool. The claim costs for a temporary disability insurance contract are presented. The algorithm and an example of application are also provided.

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.

Sign in / Sign up

Export Citation Format

Share Document