This paper deals with the fixed-cycle traffic-light (FCTL) queue, where vehicles arrive to an intersection controlled by a traffic light and form a queue. The traffic light alternates between green and red periods, and delayed vehicles are assumed to depart during the green period at equal time intervals. The key performance characteristic in the FCTL queue is the so-called mean overflow, defin...

existence of capacity drop phenomenon, as the difference between pre-queue and queue discharge flow rates, has been one of the controversial concepts of traffic engineering. several researches have focused on capacity drop existence and also its estimation issues. this paper aims to estimate capacity drop based not only on a comparison between breakdown and queue discharge flow rates, but also ...

This paper analyses a single server with bulk service queue with general arrival pattern and multiple working vacation period. The model is analyzed by using Embedded Markov Chain technique. The steady state probability distribution at pre arrival epoch and arbitrary epoch are derived and measures like mean queue length are calculated. Finally, through some numerical examples, the parametric ef...

In this paper, we discuss the waiting-time distribution for a finite-space, single-server queueing system, in which customers arrive singly following Poisson process and server operates under (a,b)-bulk service rule. The system has finite-buffer capacity ‘N’ excluding batch service. service-time of batches follows general distribution, is independent arrival process. We first develop an alterna...

In this paper a single server preemptive priority queuing system consisting of two types of customer units with Poisson arrival, exponential service time distribution and exponential vacation is analyzed. Two type of customer units of which higher priority units of unlimited Poisson input are served by bulk service rule and limited Poisson input of low priority units served singly. The bulk ser...

It is shown that a Markovian queue, with bulk arrivals and departures having any probability mass functions for their batch sizes, has geometrically distributed queue length at equilibrium (when this exists) provided there is an additional special bulk arrival stream, with particular rate and batch size distribution, when the server is idle. It is shown that the time-averaged input rate of the ...

The problem considered in this paper is the single server bulk service queuing system characterized by (i) Hyper-Poisson arrival time distribution with k branches, the mean arrival rates depending upon the state of the system; (ii) first come, first served queue discipline; (iii) exponential service time distribution, the mean service rate depending upon the state of the system; and (iv) finite...

An embedded Markov chain is used to analyze a G/M/1 queuing system with N policy. When the system is empty, the server remains idle (deactivates) and does not start serving the waiting customers in the queue until the number of arrivals reaches N. The service is performed in batches of min(n, N) if there are n customers waiting at the completion of service. Service times of the server depend o...

This paper gives a natural definition of the relaxation time for general single server queues. First, we describe a GI/GI/I queue as a limit of GI/GPH/I queues. Each GI/GPH/I queue is transferred to some equivalent bulk arrival GIx/M/I queue, which is formulated by a spatially homogeneous Markov chain with reflecting barrior at zero. An upper bound, which is easy to calculate, of the relaxation...