STABILITY OF JACKSON-TYPE QUEUEING NETWORKS, I

STABILITY OF JACKSON-TYPE QUEUEING NETWORKS, I (1999)

by François Baccelli , Serguei Foss

Citations:

1 - 0 self

Datum	Value	Source
TITLE	STABILITY OF JACKSON-TYPE QUEUEING NETWORKS, I	SVM HeaderParse 0.2
AUTHOR NAME	François Baccelli	SVM HeaderParse 0.2
AUTHOR ADDR	INRIA Centre Sophia Antipolis 06565 Valbonne France;	SVM HeaderParse 0.2
AUTHOR NAME	Serguei Foss	SVM HeaderParse 0.2
AUTHOR ADDR	NOVOSIBIRSK State University, 630090 Novosibirsk, Russia;	SVM HeaderParse 0.2
ABSTRACT	This paper gives a pathwise construction of Jackson-type queueing networks allowing the derivation of stability and convergence theorems under general probabilistic assumptions on the driving sequences; namely, it is only assumed that the input process, the service sequences and the routing mechanism are jointly stationary and ergodic in a sense that is made precise in the paper. The main tools for these results are the subadditive ergodic theorem, which is used to derive a strong law of large numbers, and basic theorems on monotone stochastic recursive sequences. The techniques which are proposed here apply to other and more general classes of discrete event systems, like Petri nets or GSMP’s. The paper also provides new results on the Jackson-type networks with i.i.d. driving sequences which were studied in the past.	SVM HeaderParse 0.2
YEAR	1999	SVM HeaderParse 0.2
CITATIONS	33 found	ParsCit 1.0