Performance analysis of a packet switch with demand assignment capabilities

A packet switch based on the idea of assignment on demand has been proposed and analyzed. The switch model assumes that switch connection can be reconfigured by a control unit according to a switching schedule. The switching schedule may either be provided by an algorithm which will optimize performance or can be a sequence of fixed switching configurations. In both cases, queuing analysis has been carried out. In the analysis, it is assumed that buffer capacity is limited and that the transmission period (frame length) is variable. The analysis is based on a discrete time Markov chain from which state probabilities of the transmission period have been derived. Delay and throughput characteristics with different buffer sizes are presented and compared for each of the above cases