Average latency and loss probability analysis of Crosspoint Queued crossbar switches

Crossbar switch fabric is one of the most popular architectures for design of high-speed packet switches. Recently, it has been actualized crossbar architecture with buffers only in crosspoints. Such architecture has not problem with implementation of large buffers in crosspoints, any more. Performance analysis of Crosspoint Queued switch for several work conserving scheduling algorithms is presented in this paper. Since there are detailed results of throughput analysis presented in the available literature, in this paper we extended previous research with analysis of average cell latency and loss probability. Maximal buffer occupancy during the simulations is also observed so we can estimate and compare memory requirements of Crosspoint Queued switch for analyzed scheduling algorithms. It is shown that Longest Queue First has lowest memory requirements among simulated algorithms. Also, we proved results from literature that for longer buffers it becomes less important which algorithm is used. Due to easier hardware implementation and absence of starvation, Frame-based Round Robin Matching algorithm becomes most serious candidate among round robin based algorithms.