A Tandem Network of Queues with Deterministic Service and Intermediate Arrivals

  title={A Tandem Network of Queues with Deterministic Service and Intermediate Arrivals},
  author={Michael Shalmon and Michael A. Kaplan},
  journal={Oper. Res.},
We present a complete analysis of delays for a tandem network of queues with deterministic service and multiple, interfering sources. The model is of a packet-based data collection system consisting of some finite, but arbitrary, number of stations connected in tandem by a unidirectional, asynchronous transmission network. Packets, or, more generally, tasks enter the system at every station, are handed from station to station in store-and-forward fashion, and exit at the downstream end; there… 

Exact Delay Analysis of Packet-Switching Concentrating Networks

We present an exact delay analysis for a packet-switching concentrating system consisting of an arbitrary number of active stations connected in tandem by unidirectional, asynchronous transmission

Tandem queues with deterministic service times

The joint queue length process at all queues is studied in detail for the 2-queue and 3-queue cases, and an approach to the case of an arbitrary number of queues in series is outlined.

Reduction of a polling network to a single node

An arbitrary tree network of polling servers is reduced to a much simpler system of one node, while preserving the mean end-to-end delay of type i packets.

Equivalent Models and Analysis for Multi-Stage Tree Networks of Deterministic Service Time Queues

This paper presents a method for analyzing packet occupancy in multi-stage tree systems without making any assumptions about the nature of the underlying input processes, and develops an expression for first Moments of queue occupancy in terms of first moments of a simple 1-stage equiva- lent model.

Exact queueing analysis of discrete time tandems with arbitrary arrival processes

  • M. Neely
  • Mathematics
    2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577)
  • 2004
This work presents an exact analysis of the queue occupancy distribution at each stage when all queues operate according to the furthest-to-go service discipline, which is the first analysis of a multi-input multi-output queueing network yielding exact solutions for general arrival processes.

Equivalent models for queueing analysis of deterministic service time tree networks

The feedforward tree networks of queues serving fixed-length packets are analyzed and are shown to exhibit a natural traffic smoothing property, where preliminary stages act to smooth or improve traffic for downstream nodes.

A tandem of discrete-time queues with arrivals and departures at each stage

An approximate analysis of the occupancy and busy-period distributions of each stage based on a General Busy-period with batches and Memoryless (geometric) Idle period renewal Process (GBMIP) provides improved performance over two-state Markov approximations and gives exact results when there are no interstage departures.

A Tandem Queueing System with Deterministic Service *

This paper deals with the waiting time analysis of a tandem queueing system arising in the context of ATM communication networks and packetized voice systems. The focal point of interest is the

Analysis of an open tandem queueing network with population constraint and constant service times

  • Young RheeH. Perros
  • Mathematics, Business
    MASCOTS '95. Proceedings of the Third International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
  • 1995
It is shown that an open tandem queueing network with population constraint and constant service times can be transformed into a simple network involving only two nodes and an upper and lower bound on the mean waiting time is obtained.



Message Delays in Repeated-Service Tandem Connections

  • S. Calo
  • Computer Science, Mathematics
    IEEE Trans. Commun.
  • 1981
A number of recent results concerning the delay properties of such systems are presented, including: ordering relations for the successive waiting times in the channel; characterizations of waiting time properties under extreme conditions; and, simple bounds on performance parameters for systems with uniformly bounded service processes.

Two Discrete-Time Queues in Tandem

A discrete-time queueing problem involving two queues in tandem, with unit service time, is considered, and the steady state probability that the length of the second queue exceeds m is calculated.

On a tandem queueing model with identical service times at both counters, I

  • O. Boxma
  • Mathematics, Business
    Advances in Applied Probability
  • 1979
This paper considers a queueing system consisting of two single-server queues in series, in which the service times of an arbitrary customer at both queues are identical. Customers arrive at the

A Two-Fold Tandem Net with Deterministic Links and Source Interference

The problem is to quantify the effect of flow interference on waiting-times in a two-fold tandem network of queues with deterministic servers and two Poisson sources, and an approximation technique is described.

Reduction Methods for Tandem Queuing Systems

It follows that certain steady-state and time-and customer-dependent problems for the system and for its stages can for any interarrival distribution be reduced to corresponding problems for a system of fewer stages, possibly a single stage.

A study of queueing networks with deterministic service and applications to computer networks

The results obtained show that when neglecting the interferences between paths the response time is independent of the order of the stations, and prove the necessity to have a limited memorisation capacity at each node of a packet-switching network.

On a tandem queueing model with identical service times at both counters, II

  • O. Boxma
  • Mathematics
    Advances in Applied Probability
  • 1979
This paper is devoted to the practical implications of the theoretical results obtained in Part I [1] for queueing systems consisting of two single-server queues in series in which the service times

Delay Decomposition at a Single Server queue with Constant Service Time and Multiple Inputs

It is shown that the waiting time experienced by a customer can be decomposed into two basic components called self delay and interference delay.

Superimposed renewal processes and storage with gradual input