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