scholarly journals Design and Analysis of a Vacation Model for Two-phase Queueing System with Gated Service

2015 ◽  
Vol 50 ◽  
pp. 301-306
Author(s):  
K. Ramya ◽  
S. Palaniammal ◽  
C. Vijayalakshmi
Keyword(s):  
Queueing System ◽  
Two Phase ◽  
Vacation Model ◽  
Gated Service

An outline of Vacation Model of Two-Phase Queueing System

2011 ◽  
Vol 3 (7) ◽  
pp. 460-462
Author(s):  
S.Palaniammal S.Palaniammal ◽  
◽  
C.Vijayalakshmi C.Vijayalakshmi ◽  
K. Ramya K. Ramya
Keyword(s):  
Queueing System ◽  
Two Phase ◽  
Vacation Model

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.

The backlog and depletion-time process for M/G/1 vacation models with exhaustive service discipline

1988 ◽  
Vol 25 (2) ◽  
pp. 404-412 ◽  
Author(s):  
Julian Keilson ◽  
Ravi Ramaswamy
Keyword(s):  
Steady State ◽  
Queueing System ◽  
Time Dependent ◽  
Service Discipline ◽  
Time Process ◽  
State Space Methods ◽  
Ergodic Distribution ◽  
Vacation Model ◽  
Primary Service ◽  
Decomposition Theorems

The vacation model studied is an M/G/1 queueing system in which the server attends iteratively to ‘secondary' or ‘vacation' tasks at ‘primary' service completion epochs, when the primary queue is exhausted. The time-dependent and steady-state distributions of the backlog process [6] are obtained via their Laplace transforms. With this as a stepping stone, the ergodic distribution of the depletion time [5] is obtained. Two decomposition theorems that are somewhat different in character from those available in the literature [2] are demonstrated. State space methods and simple renewal-theoretic tools are employed.

scholarly journals New Analytic Solutions of Queueing System for Shared–Short Lanes at Unsignalized Intersections

Symmetry ◽  
2019 ◽  
Vol 11 (1) ◽  
pp. 55 ◽  
Author(s):  
Ilija Tanackov ◽  
Darko Dragić ◽  
Siniša Sremac ◽  
Vuk Bogdanović ◽  
Bojan Matić ◽  
...  
Keyword(s):  
Traffic Flow ◽  
Queueing System ◽  
Analytic Solutions ◽  
Service Discipline ◽  
Second Phase ◽  
Single Server ◽  
Two Phase ◽  
Left Turn ◽  
Unsignalized Intersections ◽  
High Level

Designing the crossroads capacity is a prerequisite for achieving a high level of service with the same sustainability in stochastic traffic flow. Also, modeling of crossroad capacity can influence on balancing (symmetry) of traffic flow. Loss of priority in a left turn and optimal dimensioning of shared-short line is one of the permanent problems at intersections. A shared–short lane for taking a left turn from a priority direction at unsignalized intersections with a homogenous traffic flow and heterogeneous demands is a two-phase queueing system requiring a first in–first out (FIFO) service discipline and single-server service facility. The first phase (short lane) of the system is the queueing system M(pλ)/M(μ)/1/∞, whereas the second phase (shared lane) is a system with a binomial distribution service. In this research, we explicitly derive the probability of the state of a queueing system with a short lane of a finite capacity for taking a left turn and shared lane of infinite capacity. The presented formulas are under the presumption that the system is Markovian, i.e., the vehicle arrivals in both the minor and major streams are distributed according to the Poisson law, and that the service of the vehicles is exponentially distributed. Complex recursive operations in the two-phase queueing system are explained and solved in manuscript.

Two-Phase Queueing System with a Markov Arrival Process and Blocking

2006 ◽  
Vol 132 (5) ◽  
pp. 578-589 ◽  
Author(s):  
P. P. Bocharov ◽  
R. Manzo ◽  
A. V. Pechinkin
Keyword(s):  
Queueing System ◽  
Arrival Process ◽  
Two Phase ◽  
Markov Arrival ◽  
Markov Arrival Process

Analysis of a Two-Phase Queueing System with a Markov Arrival Process and Losses

2005 ◽  
Vol 131 (3) ◽  
pp. 5606-5613 ◽  
Author(s):  
P. P. Bocharov ◽  
R. Manzo ◽  
A. V. Pechinkin
Keyword(s):  
Queueing System ◽  
Arrival Process ◽  
Two Phase ◽  
Markov Arrival ◽  
Markov Arrival Process
Sign in / Sign up

Export Citation Format

Share Document