Mathematical theory of queueing networks (Q913640): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 11:07, 30 July 2024

scientific article

Language	Label	Description	Also known as
English	Mathematical theory of queueing networks	scientific article

Statements

scholarly article

0 references

Mathematical theory of queueing networks (English)

0 references

M. Ya. Kel'bert

0 references

0 references

Journal of Soviet Mathematics

0 references

publication date

1988

0 references

See the review in Zbl 0689.90034.

0 references

zbMATH Keywords

Jackson network

0 references

stable process

0 references

survey

0 references

queueing networks

0 references

stationary random processes

0 references

MaRDI profile type

MaRDI publication profile

0 references

An analytic model for random multiple access in a local computer network

0 references

0 references

0 references

0 references

On Stably Weak Convergence of Semi-Martingales and of Point Processes

0 references

Asymptotic approach to the investigation of message switching networks of linear structure with a large number of centers

0 references

0 references

Existence and uniqueness conditions for a random field describing the state of a switching network

0 references

0 references

0 references

0 references

0 references

0 references

Fully connected message-switching network with a large number of nodes, bypass routes, and a limited number of waiting places at nodes

0 references

0 references

0 references

Stationary distributions of time-homogeneous Markov processes modeling message-switching communication networks

0 references

0 references

0 references

0 references

Error estimates for approximations of countable Markov chains associated with repeated calls models

0 references

0 references

0 references

0 references

0 references

Invariant measures for the zero range process

0 references

The asymmetric simple exclusion process on Z d

0 references

Derivation of the hydrodynamical equation for the zero-range interaction process

0 references

The motion of a tagged particle in the simple symmetric exclusion system on Z

0 references

Construction of the stationary regime of queues with locking

0 references

An Extension of Norton's Theorem for Queueing Networks

0 references

Hydrodynamical limit for the asymmetric simple exclusion process

0 references

Mean sojourn times in Markov queueing networks: Little's formula revisited

0 references

Multivariate Poisson flows on Markov step processes

0 references

On a tandem queueing model with identical service times at both counters, II

0 references

The cyclic queue with one general and one exponential server

0 references

M/G/\(\infty\) tandem queues

0 references

Pseudo-conservation laws in cyclic-service systems

0 references

The Product Form for Sojourn Time Distributions in Cyclic Exponential Queues

0 references

0 references

0 references

0 references

0 references

Point processes and queues. Martingale dynamics

0 references

Some distributional approximations in Markovian queueing networks

0 references

Insensitivity of blocking probabilities in a circuit-switching network

0 references

0 references

The dependence of sojourn times on service times in tandem queues

0 references

An operational approach to perturbation analysis of closed queuing networks

0 references

Sojourn times in a tandem queue with overtaking: reduction to a boundary value problem

0 references

Stability of a Queueing System with Concurrent Service and Locking

0 references

Passage times for overtake-free paths in Gordon–Newell networks

0 references

On passage times in Jackson networks: Two-stations walk and overtake-free paths

0 references

The busy period distribution in a closed tandem of queues

0 references

The cycle-time distribution in a central server network with state-dependent branching

0 references

0 references

Networks of queues in discrete time

0 references

Queueing output processes

0 references

Some comparability results for waiting times in single- and many-server queues

0 references

The weakly asymmetric simple exclusion process

0 references

Queueing Networks: A Survey of Their Random Processes

0 references

Stationary queue-length and waiting-time distributions in single-server feedback queues

0 references

0 references

0 references

Approximating the distribution functions in stochastic networks

0 references

Minimum Number Of Arcs In Conditional Monte Carlo Sampling Of Stochastic Networks

0 references

Single-line repeated orders queueing systems<sup>1</sup>

0 references

On a functional equation arising in the analysis of a protocol for a multi-access broadcast channel

0 references

Analysis of a stack algorithm for random multiple-access communication

0 references

Criteria for the non-ergodicity of stochastic processes: application to the exponential back-off protocol

0 references

The simple exclusion process as seen from a tagged particle

0 references

Control of arrivals to two queues in series

0 references

The non-ergodic Jackson network

0 references

Closed Queuing Systems with Exponential Servers

0 references

The Proof of a Folk Theorem on Queuing Delay with Applications to Routing in Networks

0 references

The diffusion approximation for tandem queues in heavy traffic

0 references

0 references

Reflected Brownian motion on an orthant

0 references

On the Distribution of Multidimensional Reflected Brownian Motion

0 references

A tandem storage system and its diffusion limit

0 references

0 references

0 references

Stochastic inequalities for an overflow model

0 references

A golden ratio control policy for a multiple-access channel

0 references

Characterization problems in queueing and their stability

0 references

Perturbation theory approach for a class of hybrid switching networks with small transit flows

0 references

0 references

Networks of queues with customers of different types

0 references

Networks of queues

0 references

0 references

Blocking, reordering, and the throughput of a series of servers

0 references

Segregating the Input to a Series of Buffers

0 references

Blocking probabilities in large circuit-switched networks

0 references

0 references

0 references

One-dimensional circuit-switched networks

0 references

Sojourn times in closed queueing networks

0 references

0 references

Central limit theorems for infinite series of queues and applications to simple exclusion

0 references

0 references

Central limit theorem for additive functionals of reversible Markov processes and applications to simple exclusions

0 references

Asymptotic Expansions for a Closed Multiple Access System

0 references

Invariance Properties Of Queueing Networks And Their Application To Computer/Communications Systems

0 references

Twenty Five Years of Cyclic Queues and Closed Queue Networks: A Review

0 references

On the identification of Poisson arrivals in queues with coinciding time-stationary and customer-stationary state distributions

0 references

Stationary queue-length characteristics in queues with delayed feedback

0 references

Individually optimal routing in parallel systems

0 references

Dynamic Scaling and Growth Behavior of Queuing Network Normalization Constants

0 references

Queueing network models of packet switching networks part 2: Networks with population size constraints

0 references

Spectral theory for the differential equations of simple birth and death processes

0 references

State of the Art—Networks of Queues: A Survey of Weak Convergence Results

0 references

A stochastic network formulation for complex sequential processes

0 references

On sojourn time in Jackson networks of queues

0 references

0 references

Monotone and associated Markov chains, with applications to reliability theory

0 references

Construction of stationary state distributions for loss systems

0 references

A method for solving a class of recursive stochastic equations

0 references

0 references

Open networks of queues: their algebraic structure and estimating their transient behavior

0 references

A family of bounds for the transient behavior of a Jackson network

0 references

Calculating exit times for series Jackson networks

0 references

Integral Representations and Asymptotic Expansions for Closed Markovian Queueing Networks: Normal Usage

0 references

Asymptotic Expansions and Integral Representations of Moments of Queue Lengths in Closed Markovian Networks

0 references

A Class of Closed Markovian Queuing Networks: Integral Representations, Asymptotic Expansions, and Generalizations*

0 references

Characterizations of Poisson traffic streams in Jackson queueing networks

0 references

On Poisson traffic processes in discrete-state Markovian systems by applications to queueing theory

0 references

Sojourn Times in Queueing Networks

0 references

On the reversibility of queueing networks

0 references

Randomization Procedures in the Computation of Cumulative-Time Distributions over Discrete State Markov Processes

0 references

Numerical Computation of Sojourn-Time Distributions in Queuing Networks

0 references

Asymptotic analysis and computational methods for a class of simple, circuit-switched networks with blocking

0 references

Asymptotic Expansions of Moments of the Waiting Time in a Shared-Processor of an Interactive System

0 references

Asymptotic expansions of moments of the waiting time in closed and open processor-sharing systems with multiple job classes

0 references

Probabilistic Models of Database Locking

0 references

0 references

The derivation of invariance relations in complex queueing systems with stationary inputs

0 references

The intensity conservation law for queues with randomly changed service rate

0 references

Priority Queuing Networks

0 references

Response-Time Distribution for a Processor-Sharing System

0 references

Heavy-usage asymptotic expansions for the waiting time in closed processor-sharing systems with multiple classes

0 references

The substability and ergodicity of complicated queueing systems

0 references

Substability and ergodicity of queue series

0 references

0 references

The M/M/\(\infty\) service system with ranked servers in heavy traffic. With a preface by Franz Ferschl

0 references

Approximations for Superposition Arrival Processes in Queues

0 references

Normal fluctuations and the FKG inequalities

0 references

An invariance principle for certain dependent sequences

0 references

Associated random variables and martingale inequalities

0 references

Connecting reversible Markov processes

0 references

A Solution For Multiserver And Multiclass Open Queueing Networks

0 references

Open Queueing Networks in Heavy Traffic

0 references

0 references

0 references

Bounds for the optimal decentralized access protocol in a local area network

0 references

Optimal hop-by-hop flow control in computer networks

0 references

0 references

Sojourn times in queuing networks with multiserver modes

0 references

Central limit theorem for the contact process

0 references

Conditions for the non-ergodicity of Markov chains with application to a communication system

0 references

On stochastic comparison of random vectors

0 references

Stochastic majorization of random variables by proportional equilibrium rates

0 references

The effect of increasing service rates in a closed queueing network

0 references

0 references

On the nonconcavity of throughput in certain closed queueing networks

0 references

0 references

On a General Class of Models for Interaction

0 references

Stationary representation of queues. II

0 references

A propagation of chaos result for Burgers' equation

0 references

Bounds for Queue Lengths in a Contention Packet Broadcast System

0 references

Survey of USSR contributions to random multiple-access communications

0 references

A note on Norton's theorem for queuing networks

0 references

A probabilistic look at networks of quasi-reversible queues

0 references

A discrete-time queueing network

0 references

A note on ''Optimal control of a queueing system with two heterogeneous servers''

0 references

Sojourn times and the overtaking condition in Jacksonian networks

0 references

Flows in Queueing Networks: A Martingale Approach

0 references

Heavy-Traffic Approximations for Service Systems With Blocking

0 references

Queues with superposition arrival processes in heavy traffic

0 references

Uniform conditional variability ordering of probability distributions

0 references

Weak coupling in stochastic systems

0 references

0 references

Partial balance and insensitivity

0 references

0 references

Partial balance, insensitivity and weak coupling

0 references

0 references

0 references

0 references

0 references

Processor-sharing queues: Some progress in analysis

0 references

Quasi-stationary distributions and one-dimensional circuit-switched networks

0 references

full work available at URL

https://doi.org/10.1007/bf01096288

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/BF01096288

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:913640

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q913640&oldid=37216080"