A performance modeling scheme for multistage switch networks with phase-type and bursty traffic

Ming Yu, Mengchu Zhou

Research output: Contribution to journalArticlepeer-review

8 Scopus citations

Abstract

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.

Original languageEnglish (US)
Article number5352328
Pages (from-to)1091-1104
Number of pages14
JournalIEEE/ACM Transactions on Networking
Volume18
Issue number4
DOIs
StatePublished - Aug 1 2010

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Science Applications
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Keywords

  • Finite buffer
  • performance modeling
  • switch network
  • traffic modeling

Fingerprint

Dive into the research topics of 'A performance modeling scheme for multistage switch networks with phase-type and bursty traffic'. Together they form a unique fingerprint.

Cite this