Asymptotic expansions for closed Markovian networks with state-dependent service rates
Journal of the ACM (JACM)
Asymptotic approximations for a queueing network with multiple classes
SIAM Journal on Applied Mathematics
Asymptotic analysis of multiclass closed queueing networks: common bottleneck
Performance Evaluation
Asymptotic analysis of multiclass closed queueing networks: multiple bottlenecks
Performance Evaluation
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
Mean-Value Analysis of Closed Multichain Queuing Networks
Journal of the ACM (JACM)
Managing energy and server resources in hosting centers
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Computer Performance Modeling Handbook
Computer Performance Modeling Handbook
IEEE Transactions on Software Engineering
Queueing Networks and Markov Chains
Queueing Networks and Markov Chains
Assessing the Robustness of Self-Managing Computer Systems under Highly Variable Workloads
ICAC '04 Proceedings of the First International Conference on Autonomic Computing
Resource Allocation for Autonomic Data Centers using Analytic Performance Models
ICAC '05 Proceedings of the Second International Conference on Automatic Computing
Provisioning servers in the application tier for e-commerce systems
ACM Transactions on Internet Technology (TOIT)
Analytic modeling of multitier Internet applications
ACM Transactions on the Web (TWEB)
Resource Management in the Autonomic Service-Oriented Architecture
ICAC '06 Proceedings of the 2006 IEEE International Conference on Autonomic Computing
Approximate Solution of Multiclass Queuing Networks with Region Constraints
MASCOTS '07 Proceedings of the 2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
Queuing networks with multiple closed chains: theory and computational algorithms
IBM Journal of Research and Development
| Hi-index | 0.00 |
In this paper, we prove the asymptotic equivalence between closed, open and mixed multiclass BCMP queueing networks. Under the assumption that the service demands of a given station, for sufficiently large population sizes, are greater than the ones of all the other stations, we prove that as the total number of customers semi-proportionallygrows to infinity the underlying Markov chain of a closed network converges to the underlying Markov chain of a suitable open or mixed network. The equivalence theorem lets us extend the state of the art exact asymptotic theory of queueing networks considering a general population growth and including the case in which stations have load-dependent rates of service, and provides a natural technique for the approximate on-line solution of closed networks with large populations. We also show the validity of Little's law in the limit.