Performance Evaluation of log2 √N Switching Networks
[ 1 ] Katedra Sieci Telekomunikacyjnych i Komputerowych, Wydział Elektroniki i Telekomunikacji, Politechnika Poznańska | [ P ] employee
2009
chapter in monograph
english
- Banyan type switching network
- self-routing switching network
- packet switching
- packet blocking probability
EN In this paper we present a new architecture of self-routing switching networks called multi-log₂√N. This architecture was considered by us in several earlier papers. We proved condition for strict-sense nonblocking and rearrangeable operation of this switching network. Strict-sense nonblocking multi-log₂√N switching networks for N < 128 require less switching elements than nonblocking multi-log₂N switching networks proposed by Lea [1]. Rearrangeable multi-log₂√N switching networks for some value of N requires less switching elements than nonblocking multi-log₂N switching networks. In this paper we will consider a performance of the proposed architecture when a single plane is used (i.e. blocking one), and compare it with standard log₂N switching networks of the same capacity, as well as with multi-log₂N switching networks of the same cost.
73 - 90