Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
6,621
Queueing Networks
, 2008
"... The fluid model has proven to be one of the most effective tools for the analysis of stochastic queueing networks, specifically for the analysis of stability. It is known that stability of a fluid model implies positive (Harris) recurrence (stability) of a corresponding stochastic queueing network, ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
The fluid model has proven to be one of the most effective tools for the analysis of stochastic queueing networks, specifically for the analysis of stability. It is known that stability of a fluid model implies positive (Harris) recurrence (stability) of a corresponding stochastic queueing network
QUEUEING NETWORK
, 2009
"... 1. If you haven’t turned in the Entrance Exam, then you’re not on my email list. Please turn it in! 2. To brush up on probability, I recommend that you do all the problems and examples in the first 3 chapters of Sheldon Ross ’ book [5], or equivalent. 3. Please read the course web page: www.cs.cmu.e ..."
Abstract
- Add to MetaCart
theory is the study of queueing behavior in networks and systems. Figure 1 shows the solution process. Model as Real−world system with question: "Should we buy faster disk or faster CPU?"
queueing networks
"... A uniformization-based algorithm for model checking the CSL until operator on labeled ..."
Abstract
- Add to MetaCart
A uniformization-based algorithm for model checking the CSL until operator on labeled
Stability Of Queueing Networks And Scheduling Policies
- IEEE Transactions on Automatic Control
, 1995
"... Usually, the stability of queueing networks is established by explicitly determining the invariant distribution. However, outside of the narrow class of queueing networks possessing a product form solution, such explicit solutions are rare, and consequently little is known concerning stability too. ..."
Abstract
-
Cited by 132 (16 self)
- Add to MetaCart
Usually, the stability of queueing networks is established by explicitly determining the invariant distribution. However, outside of the narrow class of queueing networks possessing a product form solution, such explicit solutions are rare, and consequently little is known concerning stability too
Stabilizing Queueing Networks with Setups
, 2002
"... For multiclass queueing networks, dispatch policies govern the assignment of servers to the jobs they process. Production policies perform the analogous task for queueing networks whose servers are subject to switch-over delays or setups, a model we refer to as setup networks. ..."
Abstract
-
Cited by 8 (1 self)
- Add to MetaCart
For multiclass queueing networks, dispatch policies govern the assignment of servers to the jobs they process. Production policies perform the analogous task for queueing networks whose servers are subject to switch-over delays or setups, a model we refer to as setup networks.
On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models
- Annals of Applied Probability
, 1995
"... It is now known that the usual traffic condition (the nominal load being less than one at each station) is not sufficient for stability for a multiclass open queueing network. Although there has been some progress in establishing the stability conditions for a multiclass network, there is no unified ..."
Abstract
-
Cited by 357 (27 self)
- Add to MetaCart
It is now known that the usual traffic condition (the nominal load being less than one at each station) is not sufficient for stability for a multiclass open queueing network. Although there has been some progress in establishing the stability conditions for a multiclass network
Monotone control of queueing networks
- Queueing Systems
, 1992
"... This paper uses submodularity to obtain monotonicity results for a class of Markovian queueing network service rate control problems. Nonlinear costs of queueing and service are allowed. In contrast o Weber and Stidham [14], our monotonicity theorem considers arbitrary directions in the state space ..."
Abstract
-
Cited by 11 (3 self)
- Add to MetaCart
This paper uses submodularity to obtain monotonicity results for a class of Markovian queueing network service rate control problems. Nonlinear costs of queueing and service are allowed. In contrast o Weber and Stidham [14], our monotonicity theorem considers arbitrary directions in the state space
Stability, queue length and delay of deterministic and stochastic queueing networks
- IEEE Transactions on Automatic Control
, 1994
"... Motivated by recent development in high speed networks, in this paper we study two types of stability problems: (i) conditions for queueing networks that render bounded queue lengths and bounded delay for customers, and (ii) conditions for queueing networks in which the queue length distribution of ..."
Abstract
-
Cited by 231 (21 self)
- Add to MetaCart
Motivated by recent development in high speed networks, in this paper we study two types of stability problems: (i) conditions for queueing networks that render bounded queue lengths and bounded delay for customers, and (ii) conditions for queueing networks in which the queue length distribution
Results 1 - 10
of
6,621
