ISSN:
1572-9443
Keywords:
Queueing networks
;
nonproduct form networks
;
stability
;
stochastic continuity
;
functional limit theorems
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Abstract A finite number of nodes, each with a single server and infinite buffers, is considered in discrete time. The service may be FIFO and the service times are constant. The external arrivals and the routing decision variables form a general stationary sequence. Stability of the system is proved under these assumptions. Extension to multiple servers at a node and general stationary distributions holds. If the external input is i.i.d. and the routing is Markovian then stochastic ordering, continuity of stationary distributions, rates of convergence, a functional CLT and a functional LIL and various other limit theorems for the queue length process are also proved. Generalizations to multiple servers at nodes, customers with priority, multiple customer classes, general service length and Markov modulated external arrival cases are discussed.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01153532
