Markovian network processes: Congestion-dependent routing and processing

DOI10.1007/BF01149184zbMath0714.60082MaRDI QIDQ751071

Richard F. Serfozo

Publication date: 1989

Published in: Queueing Systems (Search for Journal in Brave)

zbMATH Keywords

queueing networkequilibrium distributioncharacterization of blockinginterchangeability property

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (17)

Conditional intensities and coincidence properties of stochastic processes with embedded point processes ⋮ Little laws for utility processes and waiting times in queues ⋮ On the characterization of departure rules for discrete-time queueing networks with batch movements and its applications ⋮ Maxima of sojourn times in acyclic Jackson queueing networks ⋮ Artificial immune systems -- today and tomorrow ⋮ `Stop=recirculate' for exponential product form queueing networks with departure blocking ⋮ Aggregation of Markov chains ⋮ Queueing networks with dependent nodes and concurrent movements ⋮ A generalization of Norton's theorem for queueing networks ⋮ Batch Routing Queueing Networks with Jump-Over Blocking ⋮ Markov network processes with string transitions ⋮ State-dependent stochastic networks. I: Approximation and applications with continuous diffusion limits ⋮ Analysis of a finite-source customer assignment model with no state information ⋮ Quasi-reversibility and networks of queues with nonstandard batch movements. ⋮ Transient product form distributions in queueing networks ⋮ Travel times in queueing networks and network sojourns ⋮ Local balance in queueing networks with positive and negative customers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Palm probabilities and stationary queues
• On queueing network models of flexible manufacturing systems
• Characteristics of queueing systems observed at events and the connection between stochastic intensity and Palm probability
• On arrivals that see time averages: a martingale approach
• On Arrivals That See Time Averages
• Multiclass Queueing Networks with State-Dependent Routing
• Queuing Network Models with State-Dependent Routing
• Poisson Arrivals See Time Averages
• Flows in Queueing Networks: A Martingale Approach
• Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
• On Poisson traffic processes in discrete-state Markovian systems by applications to queueing theory
• Preserving partial balance in continuous-time Markov chains
• Poisson functionals of Markov processes and queueing networks
• Cyclic Queuing Systems with Restricted Length Queues
• Markov population processes
• Equilibrium distributions for an open migration process

This page was built for publication: Markovian network processes: Congestion-dependent routing and processing