Results 151 to 160 of about 278,053 (189)
Some of the next articles are maybe not open access.

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

On infinite queueing tandems

Systems & Control Letters, 1994
Abstract We study the flow of jobs on an infinite series of first-come-first-served queues. Jobs are placed in the buffer of the first queue and allowed to flow through the infinite tandem of queues. The service times of each job on consecutive queues form a stationary and ergodic sequence.
Bambos, Nicholas, Prabhakar, Balaji
openaire   +1 more source

On a tandem queue with retrials and losses

Operational Research, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Two Discrete-Time Queues in Tandem

IEEE Transactions on Communications, 1979
A discrete-time queueing problem involving two queues in tandem, with unit service time, is considered. Such a situation can arise within a packet-switching network. Arrivals at the queues occur from separate sources, which may be correlated. The joint arrivals from the two sources are assumed to be independently and identically distributed in each ...
openaire   +2 more sources

Joint distributions in Poissonian tandem queues

Queueing Systems, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
F. I. Karpelevitch, A. Ya. Kreinin
openaire   +2 more sources

Home - About - Disclaimer - Privacy