An investigation of phase-distribution moment-matching algorithms for use in queueing models
Queueing Systems: Theory and Applications
Improved queueing analysis of shared buffer switching networks
IEEE/ACM Transactions on Networking (TON)
Performance analysis of ATM Banyan networks with shared queueing—part I: random offered traffic
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
A performance model for ATM switches with general packet length distributions
IEEE/ACM Transactions on Networking (TON)
Analysis of nonblocking ATM switches with multiple input queues
IEEE/ACM Transactions on Networking (TON)
Modeling multiple IP traffic streams with rate limits
IEEE/ACM Transactions on Networking (TON)
Analysis of multi-server systems via dimensionality reduction of markov chains
Analysis of multi-server systems via dimensionality reduction of markov chains
Efficient phase-type fitting with aggregated traffic traces
Performance Evaluation
A novel analytical model for switches with shared buffer
IEEE/ACM Transactions on Networking (TON)
IEEE Communications Magazine
Multi-stage switching system using optical WDM grouped links based on dynamic bandwidth sharing
IEEE Communications Magazine
| Hi-index | 0.00 |
Existing analytical methods to model multistage switch networks cannot be applied to the performance modeling of switch networks with phase-type and bursty traffic because of the problem of state-space explosion and unrealistic assumptions, e.g., uniform traffic and independent destination (UTID). This paper presents an approximate scheme to model and analyze such networks. First, a traffic aggregation technique is proposed to deal with phase-type and bursty traffic, including splitting and merging. For the aggregation of two bursty traffic, a closed-form solution is obtained for buffer state probabilities. For the aggregation of more bursty traffic, a recursive algorithm is derived in terms of the buffer size and number of inputs of a switch. Second, a switch decomposition technique is developed, by which the crossbar of a switch is decomposed from its preceding and succeeding buffers. In this way, a switch network of N inputs and outputs is converted to N tandem queues, for which the performance can be easily evaluated. Our extensive numerical and simulation examples have shown that the proposed scheme achieves satisfied accuracy and computational efficiency.