Abstract
In this thesis, we propose the multi-stage architecture for quasi-circuit switching to discuss. In the previous work, we have assumed that all input flows are (r, T)-smooth. Furthermore, it is assumed that the all inputs of an switch satisfy the no overbooking condition. Load balanced Birkoff-von Neumann quasi-circuit switch is one of quasi-circuit switches. It can provide guaranteed rate services and all the packets would be transmitted their destinations without lost. Although this quasi-circuit switch can offer quality of services, the maximum delay becomes larger and the hardware complexity increases as the size of switch fabric is large. Therefore, we propose a multi-stage architecture for quasi-circuit switch, called Banyan-based scheme. It is composed of some quasi-circuit switches. Each of crossbar fabrics has one-cycle permutation matrix and changes its matrix every frame time. We will prove that the Banyan-based scheme has less maximum delay than former scheme as the size of switch fabric is larger than . To compare with Benes quasi-circuit switches; the Banyan-based scheme has less maximum and average delay as the frame size is less than some values.