Performance Evaluation and Policy Selection in Multiclass Networks
Discrete Event Dynamic Systems
In Search of Sensitivity in Network Optimization
Queueing Systems: Theory and Applications
A Two-Node Jackson Network With Infinite Supply Of Work
Probability in the Engineering and Informational Sciences
Maximum Pressure Policies in Stochastic Processing Networks
Operations Research
Analysis of a simple Markovian re-entrant line with infinite supply of work under the LBFS policy
Queueing Systems: Theory and Applications
Positive harris recurrence and diffusion scale analysis of a push pull queueing network
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Markov Chains and Stochastic Stability
Markov Chains and Stochastic Stability
Control Techniques for Complex Networks
Control Techniques for Complex Networks
Operations Research Letters
Dynamic server allocation for unstable queueing networks with flexible servers
Queueing Systems: Theory and Applications
Stability of multi-class queueing networks with infinite virtual queues
Queueing Systems: Theory and Applications
| Hi-index | 0.00 |
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.