A Push-Pull Network with Infinite Supply of Work

Anat Kopzon, Yoni Nazarathy, Gideon Weiss

Research output: Contribution to journalArticlepeer-review


We consider a two-node multiclass queueing network with two types of jobs moving through two servers in opposite directions, and there is infinite supply of work of both types. We assume exponential processing times and preemptive resume service. We identify a family of policies which keep both servers busy at all times and keep the queues between the servers positive recurrent. We analyze two specific policies in detail, obtaining steady state distributions. We perform extensive calculations of expected queue lengths under these policies. We compare this network with the Kumar-Seidman-Rybko-Stolyar network, in which there are two random streams of arriving jobs rather than infinite supply of work.

Original languageEnglish
Pages (from-to)75-111
Number of pages37
JournalQueueing Systems
Issue number1-2
StatePublished - 2009

Bibliographical note

Funding Information:
Research supported in part by Israel Science Foundation Grants 249/02 and 454/05 and by European Network of Excellence Euro-NGI.


  • Infinite supply of work
  • Infinite virtual queues
  • Kumar-Seidman-Rybko-Stolyar network
  • Manufacturing
  • Markovian multiclass queueing networks
  • Maximum pressure policies
  • Queueing
  • Threshold policies

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 'A Push-Pull Network with Infinite Supply of Work'. Together they form a unique fingerprint.

Cite this