Features of some discrete-time cyclic queueing networks

Victor Pestien, S. Ramakrishnan

Research output: Contribution to journalArticlepeer-review

9 Scopus citations


A class of discrete-time closed cyclic networks is analyzed, where queues at each node have ample waiting room and have independent geometric service times with possibly unequal means. If each node has a single server or if there are sufficiently many parallel servers at each node to accommodate all jobs, equilibrium vectors of product form are obtained. For some other cases, equilibrium vectors of product form need not exist. For the single-server model, a normalization constant is computed and used to determine the queue-length distribution at a node.

Original languageEnglish (US)
Pages (from-to)117-132
Number of pages16
JournalQueueing Systems
Issue number1-2
StatePublished - Mar 1 1994


  • Discrete-time queue
  • cyclic queueing network
  • normalization constant
  • product form

ASJC Scopus subject areas

  • Statistics and Probability
  • Computer Science Applications
  • Management Science and Operations Research
  • Computational Theory and Mathematics


Dive into the research topics of 'Features of some discrete-time cyclic queueing networks'. Together they form a unique fingerprint.

Cite this