MONOTONICITY RESULTS FOR SINGLE-SERVER FINITE-CAPACITY QUEUES WITH RESPECT TO DIRECTIONALLY CONVEX ORDER

2004 ◽  
Vol 18 (03) ◽  
Author(s):  
Shigeo Shioda ◽  
Daisuke Ishii
Keyword(s):  
Single Server ◽  
Finite Capacity ◽  
Convex Order ◽  
Finite Capacity Queues ◽  
Directionally Convex Order ◽  
Monotonicity Results

Analysis of finite-capacity polling systems

1991 ◽  
Vol 23 (2) ◽  
pp. 373-387 ◽  
Author(s):  
Hideaki Takagi
Keyword(s):  
Time Distribution ◽  
Arrival Process ◽  
Polling Systems ◽  
Single Server ◽  
Service Time Distribution ◽  
Finite Capacity ◽  
Poisson Arrival ◽  
Finite Capacity Queues ◽  
General Service ◽  
Limited Service

We consider a system of N finite-capacity queues attended by a single server in cyclic order. For each visit by the server to a queue, the service is given continuously until that queue becomes empty (exhaustive service), given continuously only to those customers present at the visiting instant (gated service), or given to only a single customer (limited service). The server then switches to the next queue with a random switchover time, and administers the same type of service there similarly. For such a system where each queue has a Poisson arrival process, general service time distribution, and finite capacity, we find the distribution of the waiting time at each queue by utilizing the known results for a single M/G/1/K queue with multiple vacations.

Analysis of finite-capacity polling systems

1991 ◽  
Vol 23 (02) ◽  
pp. 373-387 ◽  
Author(s):  
Hideaki Takagi
Keyword(s):  
Time Distribution ◽  
Arrival Process ◽  
Polling Systems ◽  
Single Server ◽  
Service Time Distribution ◽  
Finite Capacity ◽  
Poisson Arrival ◽  
Finite Capacity Queues ◽  
General Service ◽  
Limited Service

We consider a system of N finite-capacity queues attended by a single server in cyclic order. For each visit by the server to a queue, the service is given continuously until that queue becomes empty (exhaustive service), given continuously only to those customers present at the visiting instant (gated service), or given to only a single customer (limited service). The server then switches to the next queue with a random switchover time, and administers the same type of service there similarly. For such a system where each queue has a Poisson arrival process, general service time distribution, and finite capacity, we find the distribution of the waiting time at each queue by utilizing the known results for a single M/G/1/K queue with multiple vacations.

scholarly journals Stochastic Approximations and Monotonicity of a Single Server Feedback Retrial Queue

2012 ◽  
Vol 2012 ◽  
pp. 1-13 ◽  
Author(s):  
Mohamed Boualem ◽  
Natalia Djellab ◽  
Djamil Aïssani
Keyword(s):  
Markov Chains ◽  
Service Time ◽  
Retrial Queue ◽  
Stochastic Ordering ◽  
Stochastic Comparison ◽  
Single Server ◽  
Stochastic Approximations ◽  
Bernoulli Feedback ◽  
Monotonicity Results

This paper focuses on stochastic comparison of the Markov chains to derive some qualitative approximations for anM/G/1retrial queue with a Bernoulli feedback. The main objective is to use stochastic ordering techniques to establish various monotonicity results with respect to arrival rates, service time distributions, and retrial parameters.

Convex ordering of the attained waiting times in single-server queues and related problems

1991 ◽  
Vol 28 (02) ◽  
pp. 433-445 ◽  
Author(s):  
Masakiyo Miyazawa ◽  
Genji Yamazaki
Keyword(s):  
Waiting Time ◽  
Time Distribution ◽  
Waiting Times ◽  
Service Discipline ◽  
Single Server ◽  
Waiting Time Distribution ◽  
Convex Order ◽  
Convex Ordering ◽  
Single Server Queues ◽  
Service Disciplines

The attained waiting time of customers in service of the G/G/1 queue is compared for various work-conserving service disciplines. It is proved that the attained waiting time distribution is minimized (maximized) in convex order when the discipline is FCFS (PR-LCFS). We apply the result to characterize finiteness of moments of the attained waiting time in the GI/GI/1 queue with an arbitrary work-conserving service discipline. In this discussion, some interesting relationships are obtained for a PR-LCFS queue.

Scale functions of Lévy processes and busy periods of finite-capacity M/GI/1 queues

2004 ◽  
Vol 41 (4) ◽  
pp. 1145-1156 ◽  
Author(s):  
Parijat Dube ◽  
Fabrice Guillemin ◽  
Ravi R. Mazumdar
Keyword(s):  
Closed Form ◽  
Lévy Processes ◽  
Busy Period ◽  
Exit Time ◽  
Levy Processes ◽  
Finite Capacity ◽  
Scale Functions ◽  
Period Distribution ◽  
Finite Capacity Queues ◽  
Time Theory

In this paper we use the exit time theory for Lévy processes to derive new closed-form results for the busy period distribution of finite-capacity fluid M/G/1 queues. Based on this result, we then obtain the busy period distribution for finite-capacity queues with on–off inputs when the off times are exponentially distributed.

scholarly journals Two parallel finite queues with simultaneous services and Markovian arrivals

1997 ◽  
Vol 10 (4) ◽  
pp. 383-405 ◽  
Author(s):  
S. R. Chakravarthy ◽  
S. Thiagarajan
Keyword(s):  
Markov Process ◽  
Performance Measures ◽  
System Performance ◽  
Arrival Process ◽  
Single Server ◽  
Queueing Model ◽  
Finite Capacity ◽  
Numerical Examples ◽  
Finite Queues ◽  
Large State Space

In this paper, we consider a finite capacity single server queueing model with two buffers, A and B, of sizes K and N respectively. Messages arrive one at a time according to a Markovian arrival process. Messages that arrive at buffer A are of a different type from the messages that arrive at buffer B. Messages are processed according to the following rules: 1. When buffer A(B) has a message and buffer B(A) is empty, then one message from A(B) is processed by the server. 2. When both buffers, A and B, have messages, then two messages, one from A and one from B, are processed simultaneously by the server. The service times are assumed to be exponentially distributed with parameters that may depend on the type of service. This queueing model is studied as a Markov process with a large state space and efficient algorithmic procedures for computing various system performance measures are given. Some numerical examples are discussed.

A solvable model for a finite-capacity queueing system

1985 ◽  
Vol 22 (4) ◽  
pp. 903-911 ◽  
Author(s):  
V. Giorno ◽  
C. Negri ◽  
A. G. Nobile
Keyword(s):  
Queueing System ◽  
Waiting Times ◽  
Queueing Systems ◽  
Solvable Model ◽  
Probability Density Functions ◽  
Single Server ◽  
Finite Capacity ◽  
System Service ◽  
Transient Probabilities ◽  
Number Of Customers

Single–server–single-queue–FIFO-discipline queueing systems are considered in which at most a finite number of customers N can be present in the system. Service and arrival rates are taken to be dependent upon that state of the system. Interarrival intervals, service intervals, waiting times and busy periods are studied, and the results obtained are used to investigate the features of a special queueing model characterized by parameters (λ (Ν –n), μn). This model retains the qualitative features of the C-model proposed by Conolly [2] and Chan and Conolly [1]. However, quite unlike the latter, it also leads to closed-form expressions for the transient probabilities, the interarrival and service probability density functions and their moments, as well as the effective interarrival and service densities and their moments. Finally, some computational results are given to compare the model discussed in this paper with the C-model.

Scale functions of Lévy processes and busy periods of finite-capacity M/GI/1 queues

2004 ◽  
Vol 41 (04) ◽  
pp. 1145-1156 ◽  
Author(s):  
Parijat Dube ◽  
Fabrice Guillemin ◽  
Ravi R. Mazumdar
Keyword(s):  
Closed Form ◽  
Lévy Processes ◽  
Busy Period ◽  
Exit Time ◽  
Levy Processes ◽  
Finite Capacity ◽  
Scale Functions ◽  
Period Distribution ◽  
Finite Capacity Queues ◽  
Time Theory

In this paper we use the exit time theory for Lévy processes to derive new closed-form results for the busy period distribution of finite-capacity fluid M/G/1 queues. Based on this result, we then obtain the busy period distribution for finite-capacity queues with on–off inputs when the off times are exponentially distributed.

Sign in / Sign up

Export Citation Format

Share Document