Keyword: queueing networks

Found 214 papers in total
A multiclass network with non-linear, non-convex, non-monotonic stability conditions
A multiclass network with non-linear, non-convex, non-monotonic stability conditions
1997,
We consider a stochastic queueing network with fixed routes and class priorities. The...
Structure-reversibility and departure functions of queueing networks with batch movements and state dependent routing
Structure-reversibility and departure functions of queueing networks with batch movements and state dependent routing
1997,
We consider characterizations of departure functions in Markovian queueing networks...
Transient and stationary waiting times in (max, +)-linear systems with Poisson input
Transient and stationary waiting times in (max, +)-linear systems with Poisson input
1997,
We consider a certain class of vectorial evolution equations, which are linear in the...
Piecewise linear test functions for stability and instability of queueing networks
Piecewise linear test functions for stability and instability of queueing networks
1997,
We develop the use of piecewise linear test functions for the analysis of stability of...
Branching/queueing networks: Their introduction and near-decomposability asymptotics
Branching/queueing networks: Their introduction and near-decomposability asymptotics
1997,
A new class of models, which combines closed queueing networks with branching...
An analytical method for performance evaluation of kanban controlled production systems
An analytical method for performance evaluation of kanban controlled production systems
1996,
The aim of this paper is to develop a general purpose analytical method for...
An adaptive aggregation/disaggregation algorithm for hierarchical Markovian models
An adaptive aggregation/disaggregation algorithm for hierarchical Markovian models
1999,
A new analysis technique for large continuous time Markov chains resulting from...
Overall station balance and decomposability for non-Markovian queueing networks
Overall station balance and decomposability for non-Markovian queueing networks
1998,
Introducing the concept of overall station balance which extends the notion of station...
On normalization constants for closed queueing networks with finite local buffers
On normalization constants for closed queueing networks with finite local buffers
1998,
We present new closed form solutions for partition functions used to normalize the...
Optimal scheduling in heterogeneous two-station queueing networks
Optimal scheduling in heterogeneous two-station queueing networks
1998,
We consider a two-station network with two types of jobs: type 0 jobs require service...
Geometric product form queueing networks with concurrent batch movements
Geometric product form queueing networks with concurrent batch movements
1998,
Queueing networks have been rather restricted in order to have product form...
New linear program performance bounds for queueing networks
New linear program performance bounds for queueing networks
1999,
We obtain new linear programs for bounding the performance and proving the stability...
Ergodicity properties of rerouting strategies in queueing networks
Ergodicity properties of rerouting strategies in queueing networks
1996,
In this paper we study ergodicity properties for simple Markovian models describing...
Convergence to equilibria for fluid models of head-of-the-line proportional processor sharing queueing networks
Convergence to equilibria for fluid models of head-of-the-line proportional processor sharing queueing networks
1996,
Fluid models have recently become an important tool for the study of open multiclass...
Diffusion approximations for re-entrant lines with a first-buffer-first-served priority discipline
Diffusion approximations for re-entrant lines with a first-buffer-first-served priority discipline
1996,
The diffusion approximation is proved for a class of queueing networks, known as...
Error bounds for asymptotic approximations of the partition function
Error bounds for asymptotic approximations of the partition function
1996,
We consider Markovian queueing models with a finite number of states and a product...
Asymptotic analysis for closed multichain queueing networks with bottlenecks
Asymptotic analysis for closed multichain queueing networks with bottlenecks
1996,
We consider a two-chain exponential queueing network with a large number of customers...
A decomposition approximation for assembly–disassembly queueing networks with finite buffer and blocking
A decomposition approximation for assembly–disassembly queueing networks with finite buffer and blocking
1999,
The throughputs of assembly and disassembly queueing networks with finite buffer and...
On closed support T-invariants and the traffic equations
On closed support T-invariants and the traffic equations
1998,
The traffic equations are the basis for the exact analysis of product form queueing...
Analysis of a finite-source customer assignment model with no state information
Analysis of a finite-source customer assignment model with no state information
1998,
In this paper we analyse a closed queueing network in which customers have to be...
Admission controls for Erlang's loss system with service times distributed as a finite sum of exponential random variables
Admission controls for Erlang's loss system with service times distributed as a finite sum of exponential random variables
1998,
It is known that a threshold policy (or trunk reservation policy) is optimal for...
Quasi-product form to a multinode queueing system with a common exponential set-up server
Quasi-product form to a multinode queueing system with a common exponential set-up server
1999,
We consider a K-node queueing system sharing a set-up server. Each node has a node...
Scheduling in a multi-class series of queues with deterministic service times
Scheduling in a multi-class series of queues with deterministic service times
1996,
We consider a problem of scheduling in a multi-class network of single-server queues...
Rapid, efficient analysis of the λ(n)/Ck/r/N queue, with application to decomposition of closed queuing networks
Rapid, efficient analysis of the λ(n)/Ck/r/N queue, with application to decomposition of closed queuing networks
1998,
In this paper, we exploit advances in computational linear algebra and computing power...
Papers per page: