The deflection network: a reliable high speed packet network for computer communication

The performance of deflection networks (extension of Manhattan Street network) under bursty traffic has been analyzed assuming the use of a preference routing algorithm. The throughput performance under these conditions has proven to be almost independent from the burstiness of the traffic. Packets of a single burst are often received in the wrong alignment. Analyses simulating the generation of bursts that do not use all the bandwidth of the links are required. The reliability of the network has been studied in conjunction with the use of the minimum distance (MD), minimum weight (MW) and preference algorithms, and the backword learning (BL) technique, and the results are presented