Configuration of computing systems: an approach using queueing network models.
Configuration of computing systems: an approach using queueing network models.
Approximate Analysis of Load Dependent General Queueing Networks
IEEE Transactions on Software Engineering
On approximating higher order MAPs with MAPs of order two
Queueing Systems: Theory and Applications
Approximate Analysis of Multi-Class Synchronized Closed Queueing Networks
MASCOTS '95 Proceedings of the 3rd International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
Queueing delays on virtual circuits using a sliding window flow control scheme
SIGMETRICS '83 Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems
The queue-length distribution of the M/Ck/1 queue
SCORE '82 Selected papers of the 1982 ACM SIGMETRICS workshop on Software metrics: part 2
STOCHASTIC DISCRETIZATION FOR THE LONG-RUN AVERAGE REWARD IN FLUID MODELS
Probability in the Engineering and Informational Sciences
Extensions and computational aspects of an iterative method
SIGMETRICS '82 Proceedings of the 1982 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Closed form solutions for mapping general distributions to quasi-minimal PH distributions
Performance Evaluation - Modelling techniques and tools for computer performance evaluation
Performance analysis of an ingress switch in a JumpStart optical burst switching network
Performance Evaluation
Iterative approximation of k-limited polling systems
Queueing Systems: Theory and Applications
Solving Semi-Open Queuing Networks
Operations Research
Class treatment in queueing systems: discrimination and fairness aspects
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Solving generalized semi-Markov decision processes using continuous phase-type distributions
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
On the achievable diversity orders over non-severely faded lognormal channels
IEEE Communications Letters
Branching-type polling systems with large setups
OR Spectrum
Performance evaluation of a synchronization station with multiple inputs and population constraints
Computers and Operations Research
Predicting departure times in multi-stage queueing systems
Computers and Operations Research
Busy period analysis of C2/C2b/1 queue: Lattice path approach
Mathematical and Computer Modelling: An International Journal
Computers and Industrial Engineering
| Hi-index | 0.00 |
Equilibrium state distributions are determined for queues with load-dependent Poisson arrivals and service time distributions representable by Cox's generalized method of stages. The solution is obtained by identifying a birth-death process that has the same equilibrium state distribution as the original queue. Special cases of two-stage (C2) and Erlang-k (Ek) service processes permit particularly efficient algorithms for calculating the load - dependent service rates of the birth-death process corresponding to the original queue. Knowing the parameters of the birth-death process, the equilibrium state probabilities can be calculated straight-forwardly. This technique is particularly useful when subsystems are reduced to flow-equivalent servers representing the complementary network.