A discrete-time queueing network

Jean C. Walrand

58 citations0/0 files storedJournal of Applied Probability

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Stochastic processes and statistical mechanics Petri Nets in System Modeling

Abstract

A discrete-time network with multiple transitions is defined. It is characterized by the independence of the service processes at different nodes. That network is shown to have the familiar quasi-reversibility properties.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 58 citations exist upstream.

Cited by

1991Some new results on queueing networks with batch movement 1996An operator analytic approach to product-farm networks 1993Transient product from distributions in queueing networks 1991Product forms for queueing networks with state-dependent multiple job transitions 1995Triggered batch movement in queueing networks 1993On the Problem of Establishing the Existence of Stationary Distributions for Continuous-Time Markov Chains 1992Queueing systems for modelling ATM networks11Supported by NATO under grant n° CRG 900580

Imported from OpenAlex (CC0) — nothing here is generated.