Solution of the Sylvester matrix equation AXBT + CXDT = E
ACM Transactions on Mathematical Software (TOMS)
Waiting time, busy periods and output models of a server analyzed via Wiener-Hopf factorization
Performance Evaluation - Special issue on performance and control of network systems
Decomposition of general tandem queueing networks with MMPP input
Performance Evaluation
Bounding stationary results of Tandem networks with MAP input and PH service time distributions
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Correlation bounds for second-order MAPs with application to queueing network decomposition
Performance Evaluation - Modelling techniques and tools for computer performance evaluation
A tool for the analysis of hierarchical service-oriented extended open fork/join queueing networks
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
A traffic based decomposition of two-class queueing networks with priority service
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
For non-trivial (open) queueing networks, traffic-based decomposition often represents the only feasible--and at the same time fast--solution method besides simulation. The network is partitioned into individual nodes which are analyzed in isolation with respect to approximate internal traffic representations. Since the correlations of network traffic may have a considerable impact on performance measures, they must be captured to some extent by the employed traffic descriptors. The decomposition methodology presented in this paper is based on Markovian arrival processes (MAPs), whose correlation structure is determined from the busy-period behavior of the upstream queues. The resulting compact MAPs in connection with sophisticated moment-matching techniques allow an efficient decomposition of large queueing networks. Numerical experiments demonstrate the substantially enhanced precision due to improved output models compared with the experiments of Heindl and Telek [MAP-based decomposition of tandem networks of ./PH/1(/K) queues with MAP input, in: Proceedings of the 11th GI/ITG Conference on Measuring, Modelling and Evaluation of Computer and Communication Systems, Aachen, Germany, 2001, pp. 179-194].