Anat Kopzon, Yoni Nazarathy, and Gideon Weiss, The University of Haifa.

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.

[home]