The impact of autocorrelation on queuing systems
Management Science
The Markov-modulated Poisson process (MMPP) cookbook
Performance Evaluation
An approximate model for performance evaluation of real-time multimedia communication systems
Performance Evaluation - Special issue: high speed networks and their performance
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
Approximate Analysis of Networks of PH|PH|1|K Queues: Theory & Tool Support
MMB '95 Proceedings of the 8th International Conference on Modelling Techniques and Tools for Computer Performance Evaluation: Quantitative Evaluation of Computing and Communication Systems
Approximation models of feed-forward G/G/1/N queueing networks with correlated arrivals
Performance Evaluation
A Two-Phase BMAP|G|1|N → PH|1|M – 1 System with Blocking
Automation and Remote Control
The BMAP/G/1/N -- · /PH/1/M tandem queue with losses
Performance Evaluation
Semi-Markov-Based Approach for the Analysis of Open Tandem Networks with Blocking and Truncation
International Journal of Applied Mathematics and Computer Science
Analytical modelling of networks in multicomputer systems under bursty and batch arrival traffic
The Journal of Supercomputing
Journal of Systems and Software
Simulative and analytical evaluation for ASD-Based embedded software
MMB'12/DFT'12 Proceedings of the 16th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
Traffic splitting in a network: split traffic models and applications
Computer Communications
Lumping and reversed processes in cooperating automata
ASMTA'12 Proceedings of the 19th international conference on Analytical and Stochastic Modeling Techniques and Applications
| Hi-index | 0.00 |
For nontrivial general (open) queueing networks, decomposition often represents the only feasible solution method besides simulation. The network is partitioned into individual nodes which are analyzed in isolation with respect to approxamate internal traffic representations. The quality of the quickly obtained results very much depends on the descriptors for the traffic processes within the network, which may be split and merged before traversing the next queue. Recently, one of the existing decomposition formalisms based on renewal processes as traffic descriptors has been extended in order to include semi-Markov processes (SMPs) mad Markov-modulated Poisson processes (MMPPs) with two states. However, due to the restriction to tandem networks, no operations for the splitting and and merging were provided.The numerical procedures for the splitting of SMPs and the superposition of MMPPs proposed in this paper render the extended decomposition framework available for general queueing networks. The correlations in the traffic processes, which are known to have a considerable impact on performance measures, are taken into account to some extent. Moreover, in addition to renewal processes, MMPP inputs--as they frequently arise in computer communication modeling--increase the range of applications of general queueing networks.Numerical experiments on different network configurations illustrate the capabilities and accuracy of the extended decomposition framework.