SMM Clos-Network Switches under SD Algorithm

Authors

  • Janusz Kleban
  • Jarosław Warczyński

DOI:

https://doi.org/10.26636/jtit.2018.123017

Keywords:

Clos-network switch, packet dispatching algorithms, packet switching network, stability of switching network

Abstract

This paper is devoted to evaluating the performance of Space-Memory-Memory (SMM) Clos-network switches under a packet dispatching scheme employing static connection patterns, referred to as Static Dispatching (SD). The control algorithm with static connection patterns can be easily implemented in the SMM fabric due to bufferless switches in the first stage. Stability is one of the very important performance factors of packet switching nodes. In general, a switch is stable for a particular arrival process if the expected length of the packet queues does not increase without limitation. To prove the stability of the SMM Clos-network switches considered under the SD packet dispatching scheme the discrete Markov chain model of the switch is used and Foster’s criteria to extend Lyapunov’s second (direct) method of stability investigation of discrete time stochastic systems are used. The results of simulation experiments, in terms of average cell delay and packet queue lengths, are shown as well.

Downloads

Download data is not yet available.

Downloads

Published

2018-03-30

Issue

Section

ARTICLES FROM THIS ISSUE

How to Cite

[1]
J. Kleban and J. Warczyński, “SMM Clos-Network Switches under SD Algorithm”, JTIT, vol. 71, no. 1, pp. 24–31, Mar. 2018, doi: 10.26636/jtit.2018.123017.