This paper investigates stability behavior in a variant of a generalized Jackson queueing network. In our network, some customers use a join-the-shortest-queue policy when entering the network or moving to the next station. Further-more, we allow interarrival and service times to have gen-eral distributions. For networks with two stations we derive necessary and sufficient conditions for positive Harris recur-rence of the network process. These conditions involve only the mean values of the network primitives. We also provide counterexamples showing that more information on distrib-utions and tie-breaking probabilities is needed for network
Consider a system of N parallel single-server queues with unit-exponential service time distribution...
[[abstract]]© 1994 Institute of Electrical and Electronics Engineers-We present two types of stabili...
[[abstract]]We present two types of stability problems: 1) conditions for queueing networks that ren...
In this thesis, the stability of queueing networks is studied. The use of test functions is a unifyi...
This paper proves that the stability region of a 2-station, 5-class reentrant queueing network, ope...
This article proves that the stability region of a two-station, five-class reentrant queueing networ...
This paper gives a pathwise construction of Jackson-type queuing networks allowing the derivation of...
Jackson networks are versatile models for analyzing complex networks. In this paper we study general...
Classical Jackson networks are a well-established tool for the analysis of complex systems. In this ...
We study generalized Jackson networks with single server stations, where some nodes have an in nite ...
textabstractJackson networks are versatile models for analyzing complex networks. In this paper we s...
This paper studies the queue-length process in series Jackson networks with external input to the fi...
We consider a system of two parallel queues sharing a common arrival process, where the arriving cus...
We give criteria for the stability of a very general queueing model under different levels of contro...
Consider a system of N parallel single-server queues with unit-exponential service time distribution...
Consider a system of N parallel single-server queues with unit-exponential service time distribution...
[[abstract]]© 1994 Institute of Electrical and Electronics Engineers-We present two types of stabili...
[[abstract]]We present two types of stability problems: 1) conditions for queueing networks that ren...
In this thesis, the stability of queueing networks is studied. The use of test functions is a unifyi...
This paper proves that the stability region of a 2-station, 5-class reentrant queueing network, ope...
This article proves that the stability region of a two-station, five-class reentrant queueing networ...
This paper gives a pathwise construction of Jackson-type queuing networks allowing the derivation of...
Jackson networks are versatile models for analyzing complex networks. In this paper we study general...
Classical Jackson networks are a well-established tool for the analysis of complex systems. In this ...
We study generalized Jackson networks with single server stations, where some nodes have an in nite ...
textabstractJackson networks are versatile models for analyzing complex networks. In this paper we s...
This paper studies the queue-length process in series Jackson networks with external input to the fi...
We consider a system of two parallel queues sharing a common arrival process, where the arriving cus...
We give criteria for the stability of a very general queueing model under different levels of contro...
Consider a system of N parallel single-server queues with unit-exponential service time distribution...
Consider a system of N parallel single-server queues with unit-exponential service time distribution...
[[abstract]]© 1994 Institute of Electrical and Electronics Engineers-We present two types of stabili...
[[abstract]]We present two types of stability problems: 1) conditions for queueing networks that ren...