Queueing Systems

, 62:75

A Push–Pull Network with Infinite Supply of Work

Article

DOI: 10.1007/s11134-009-9121-1

Cite this article as:
Kopzon, A., Nazarathy, Y. & Weiss, G. Queueing Syst (2009) 62: 75. doi:10.1007/s11134-009-9121-1

Abstract

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.

Keywords

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

Mathematics Subject Classification (2000)

60K25 68M20 90B15 

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  1. 1.Department of StatisticsThe University of HaifaMount CarmelIsrael

Personalised recommendations