Approximate analysis of general open queuing networks with restricted capacity
Performance Evaluation
Analysis of a queueing network model with class dependent window flow control
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 2)
A unified view of product-form approximation techniques for general closed queueing networks
Performance Evaluation
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
SIGCOMM '84 Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials & symposium
Calculating equilibrium probabilities for &lgr;(n)/Ck/1/N queues
PERFORMANCE '80 Proceedings of the 1980 international symposium on Computer performance modelling, measurement and evaluation
An EM-based technique for approximating long-tailed data sets with PH distributions
Performance Evaluation - Internet performance symposium (IPS 2002)
Multiple class memory constrained queueing networks
SIGMETRICS '82 Proceedings of the 1982 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Fast approximate solution of multiprogramming models
SIGMETRICS '82 Proceedings of the 1982 ACM SIGMETRICS conference on Measurement and modeling of computer systems
SIGMETRICS '82 Proceedings of the 1982 ACM SIGMETRICS conference on Measurement and modeling of computer systems
An Approximate Analytical Method for General Queueing Networks
IEEE Transactions on Software Engineering
Computers and Industrial Engineering
| Hi-index | 0.00 |
A semi-open queuing network (SOQN) is a special type of a queuing network consisting of two parts: an inner network with a population constraint and an external queue to accommodate jobs whose entrance is delayed. We first study an SOQN with a single class of jobs in tandem configuration and then extend our study to multiclass configurations. Multiclass SOQNs fall into two categories: general pallet and dedicated pallet SOQNs. For the general pallet case, we aggregate all classes and solve the resulting single-class SOQN. For the dedicated pallet case, we construct a method based on an existing product-form approximation method for general, multiclass closed networks. Our approximation method combines the matrix-geometric method with the decomposition-aggregation approach. Numerical results show that our approximations have desirable accuracy and efficiency.