Mathematical theory of queueing networks

DOI10.1007/BF01096288zbMath0699.90037OpenAlexW2027363041MaRDI QIDQ913640

M. Ya. Kel'bert, Yu. M. Sukhov

Publication date: 1988

Published in: Journal of Soviet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01096288

zbMATH Keywords

surveyqueueing networksstable processstationary random processesJackson network

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Deterministic network models in operations research (90B10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

Higher-order Lindley equations ⋮ Processor sharing: a survey of the mathematical theory

Cites Work

• Blocking probabilities in large circuit-switched networks
• The effect of increasing service rates in a closed queueing network
• A family of bounds for the transient behavior of a Jackson network
• Bounds for the optimal decentralized access protocol in a local area network
• A Solution For Multiserver And Multiclass Open Queueing Networks
• A stochastic network formulation for complex sequential processes
• Optimal hop-by-hop flow control in computer networks
• Bounds for Queue Lengths in a Contention Packet Broadcast System
• On a General Class of Models for Interaction
• Asymptotic Expansions for a Closed Multiple Access System
• Single-line repeated orders queueing systems¹
• Conditions for the non-ergodicity of Markov chains with application to a communication system
• Partial balance, insensitivity and weak coupling
• Stationary representation of queues. II
• On the nonconcavity of throughput in certain closed queueing networks
• Stochastic inequalities for an overflow model
• On sojourn time in Jackson networks of queues
• The Proof of a Folk Theorem on Queuing Delay with Applications to Routing in Networks
• Numerical Computation of Sojourn-Time Distributions in Queuing Networks
• Probabilistic Models of Database Locking
• Sojourn times in queuing networks with multiserver modes
• Monotone and associated Markov chains, with applications to reliability theory
• Substability and ergodicity of queue series
• Stochastic majorization of random variables by proportional equilibrium rates
• Connecting reversible Markov processes
• Stability of a Queueing System with Concurrent Service and Locking
• Quasi-stationary distributions and one-dimensional circuit-switched networks
• Asymptotic Expansions and Integral Representations of Moments of Queue Lengths in Closed Markovian Networks
• Pseudo-conservation laws in cyclic-service systems
• The Product Form for Sojourn Time Distributions in Cyclic Exponential Queues
• Construction of stationary state distributions for loss systems
• Sojourn times and the overtaking condition in Jacksonian networks
• The asymmetric simple exclusion process on Z d
• A Class of Closed Markovian Queuing Networks: Integral Representations, Asymptotic Expansions, and Generalizations*
• On the Distribution of Multidimensional Reflected Brownian Motion
• Priority Queuing Networks
• Associated random variables and martingale inequalities
• A method for solving a class of recursive stochastic equations
• Invariance Properties Of Queueing Networks And Their Application To Computer/Communications Systems
• Multivariate Poisson flows on Markov step processes
• Integral Representations and Asymptotic Expansions for Closed Markovian Queueing Networks: Normal Usage
• An Extension of Norton's Theorem for Queueing Networks
• Twenty Five Years of Cyclic Queues and Closed Queue Networks: A Review
• Passage times for overtake-free paths in Gordon–Newell networks
• Queueing network models of packet switching networks part 2: Networks with population size constraints
• Some distributional approximations in Markovian queueing networks
• Dynamic Scaling and Growth Behavior of Queuing Network Normalization Constants
• Sojourn Times in Queueing Networks
• Flows in Queueing Networks: A Martingale Approach
• Networks of queues with customers of different types
• Networks of queues
• Queueing output processes
• The diffusion approximation for tandem queues in heavy traffic
• On Poisson traffic processes in discrete-state Markovian systems by applications to queueing theory
• State of the Art—Networks of Queues: A Survey of Weak Convergence Results
• Characterizations of Poisson traffic streams in Jackson queueing networks
• On a tandem queueing model with identical service times at both counters, II
• Asymptotic analysis and computational methods for a class of simple, circuit-switched networks with blocking
• On stochastic comparison of random vectors
• Mean sojourn times in Markov queueing networks: Little's formula revisited
• Partial balance and insensitivity
• Closed Queuing Systems with Exponential Servers
• Spectral theory for the differential equations of simple birth and death processes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• One-dimensional circuit-switched networks
• A tandem storage system and its diffusion limit
• Derivation of the hydrodynamical equation for the zero-range interaction process
• Blocking, reordering, and the throughput of a series of servers
• Existence and uniqueness conditions for a random field describing the state of a switching network
• The M/M/\(\infty\) service system with ranked servers in heavy traffic. With a preface by Franz Ferschl
• M/G/\(\infty\) tandem queues
• The motion of a tagged particle in the simple symmetric exclusion system on Z
• Control of arrivals to two queues in series
• A note on Optimal control of a queueing system with two heterogeneous servers
• Fully connected message-switching network with a large number of nodes, bypass routes, and a limited number of waiting places at nodes
• Queues with superposition arrival processes in heavy traffic
• Central limit theorem for additive functionals of reversible Markov processes and applications to simple exclusions
• A propagation of chaos result for Burgers' equation
• Central limit theorems for infinite series of queues and applications to simple exclusion
• Approximating the distribution functions in stochastic networks
• Hydrodynamical limit for the asymmetric simple exclusion process
• An analytic model for random multiple access in a local computer network
• The simple exclusion process as seen from a tagged particle
• Processor-sharing queues: Some progress in analysis
• Construction of the stationary regime of queues with locking
• Error estimates for approximations of countable Markov chains associated with repeated calls models
• The weakly asymmetric simple exclusion process
• Normal fluctuations and the FKG inequalities
• Asymptotic approach to the investigation of message switching networks of linear structure with a large number of centers
• Reflected Brownian motion on an orthant
• An invariance principle for certain dependent sequences
• Stationary distributions of time-homogeneous Markov processes modeling message-switching communication networks
• Point processes and queues. Martingale dynamics
• On the reversibility of queueing networks
• Invariant measures for the zero range process
• An operational approach to perturbation analysis of closed queuing networks
• Central limit theorem for the contact process
• Criteria for the non-ergodicity of stochastic processes: application to the exponential back-off protocol
• On a functional equation arising in the analysis of a protocol for a multi-access broadcast channel
• Calculating exit times for series Jackson networks
• Asymptotic Expansions of Moments of the Waiting Time in a Shared-Processor of an Interactive System
• Networks of queues in discrete time
• Asymptotic expansions of moments of the waiting time in closed and open processor-sharing systems with multiple job classes
• On passage times in Jackson networks: Two-stations walk and overtake-free paths
• On the identification of Poisson arrivals in queues with coinciding time-stationary and customer-stationary state distributions
• A discrete-time queueing network
• Insensitivity of blocking probabilities in a circuit-switching network
• Heavy-usage asymptotic expansions for the waiting time in closed processor-sharing systems with multiple classes
• Approximations for Superposition Arrival Processes in Queues
• Open networks of queues: their algebraic structure and estimating their transient behavior
• The cyclic queue with one general and one exponential server
• On Stably Weak Convergence of Semi-Martingales and of Point Processes
• The derivation of invariance relations in complex queueing systems with stationary inputs
• Stationary queue-length and waiting-time distributions in single-server feedback queues
• A probabilistic look at networks of quasi-reversible queues
• A golden ratio control policy for a multiple-access channel
• Weak coupling in stochastic systems
• A note on Norton's theorem for queuing networks
• Randomization Procedures in the Computation of Cumulative-Time Distributions over Discrete State Markov Processes
• The dependence of sojourn times on service times in tandem queues
• Open Queueing Networks in Heavy Traffic
• Some comparability results for waiting times in single- and many-server queues
• Response-Time Distribution for a Processor-Sharing System
• Perturbation theory approach for a class of hybrid switching networks with small transit flows
• Sojourn times in closed queueing networks
• The non-ergodic Jackson network
• Analysis of a stack algorithm for random multiple-access communication
• Stationary queue-length characteristics in queues with delayed feedback
• The intensity conservation law for queues with randomly changed service rate
• Segregating the Input to a Series of Buffers
• Uniform conditional variability ordering of probability distributions
• The cycle-time distribution in a central server network with state-dependent branching
• The busy period distribution in a closed tandem of queues
• Individually optimal routing in parallel systems
• Queueing Networks: A Survey of Their Random Processes
• Characterization problems in queueing and their stability
• Survey of USSR contributions to random multiple-access communications
• The substability and ergodicity of complicated queueing systems
• Heavy-Traffic Approximations for Service Systems With Blocking
• Minimum Number Of Arcs In Conditional Monte Carlo Sampling Of Stochastic Networks
• Sojourn times in a tandem queue with overtaking: reduction to a boundary value problem

This page was built for publication: Mathematical theory of queueing networks