Results 131 to 140 of about 251,192 (174)

On the Shortest Queue Policy for the Tandem Parallel Queue

Probability in the Engineering and Informational Sciences, 1992
We consider two nodes in tandem. At each node or service center, there are two exponential servers present with the same service rate μ and each with its own queue. Customers arrive at the first node according to a Poisson process with arrival rate λ.
Hordijk, Arie, Koole, Ger
openaire   +2 more sources

Age of Information for Queues in Tandem

MILCOM 2018 - 2018 IEEE Military Communications Conference (MILCOM), 2018
As a stepping stone towards understanding the freshness of information in multi-hop networks, we study the age of information metric for queues in tandem. Applying the recent stochastic hybrid systems approach for age of information, we derive the average age for two non-preemptive first-come, first-served queues in tandem with memoryless arrival and ...
Clement Kam, Joseph P. Molnar, Sastry Kompella   +2 more
openaire   +2 more sources

Tandem queues with impatient customers

Performance Evaluation, 2019
Abstract This paper studies a Markovian two-station tandem queueing network with impatient customers. Queueing networks with abandonment are common in many industries, e.g., call centers and healthcare. Therefore, their management has received much attention. The resulting model is a level-dependent quasi-birth-and-death (LDQBD) process.
Jianfu Wang, Hossein Abouee-Mehrizi, Opher Baron, Oded Berman   +3 more
openaire   +1 more source

Tandem queue with server slow-down

ACM SIGMETRICS Performance Evaluation Review, 2007
We study how rare events happen in the standard two-node tandem Jackson queue and in a generalization, the socalled slow-down network, see [2]. In the latter model the service rate of the first server depends on the number of jobs in the second queue: the first server slows down if the amount of jobs in the second queue is above some ...
Miretskiy, D.I., Scheinhardt, W.R.W., Mandjes, M.R.H.   +2 more
openaire   +6 more sources

The Optimal Order of Service in Tandem Queues

Operations Research, 1974
This paper considers tandem queues for which the order of performing service tasks can be changed, the service times being independent of this order. It determines the optimal order of service when either the service times of different tasks are nonoverlapping or, for two queues in tandem, the service time of one task is constant.
Shantanu V. Tembe, Ronald W. Wolff
openaire   +1 more source

Tandem Queues and Queueing Networks

2016
Markov processes are a special class of stochastic processes. In order to fully understand Markov processes we first need to introduce stochastic processes. However, to help us understand stochastic process we need to remember the basic probability theory associated with it, which was briefly reviewed in the last chapter.
openaire   +1 more source

Transient Behaviour of a Tandem Queue

Management Science, 1967
Customers arrive in a Poisson process at a queueing system with two counters in series, with an infinite queue allowed before the first counter and no queue allowed before the second. The steady-state behaviour of this system was studied by earlier authors.
openaire   +2 more sources

Queueing analysis of ATM tandem queues with correlated arrivals

Proceedings of INFOCOM'95, 2002
Considers tandem queues with correlated arrivals and joining interference, which model a portion of a virtual circuit at the access node in an ATM network. The authors focus the main analysis on a two-node tandem network, which they model as a discrete-time queueing system.
Faouzi Kamoun, Mustafa K. Mehmet Ali
openaire   +2 more sources

On Queue-Length Information in a Tandem Queueing System

SSRN Electronic Journal, 2020
We consider a system where customers have to go through two service phases. For example, patients who arrive to an ER first wait for being admitted and then wait to be seeing by a physician. Assuming patients are served according to the order of their arrival (FCFS), we study the case where queue-length information is available at arrival: customers ...
Jingwei Ji, Ricky Roet-Green
openaire   +1 more source

A tandem queueing system with priorities

Computing, 1978
A system ofN unlimited queues andN time-discrete servers in series, is investigated. The input consists ofN stochastic processes where requests which have been generated according to thei-th process leave the system after they have received serivice by servers 1, 2, ...,i.
openaire   +1 more source