Performance analysis of a cut-through vs. packet-switching techniques

A simulation package containing a class of five adaptive routing algorithms has been used to investigate the performance of the virtual cut-through switching technique. The five algorithms are: the shortest path, the learning automata, and deterministic rule, the distributed computations and the relaxation principle routing algorithms. Performance criteria include the average delay, average transit time, average retransmission probability and network utilization. These parameters are intimately related to each other. They are compared with that of the packet switching using the same routing algorithms. Efficient switching techniques guarantee the best value for these performance parameters. The results obtained will be an aid in comparing the two switching techniques under different routing algorithms