Title :
Optimization in the fast knockout algorithm for self-route concentration
Author :
Li, Shuo-Yen Robert ; Li, Hui
Author_Institution :
Dept. of Inf. Eng., Chinese Univ. of Hong Kong, Shatin, Hong Kong
Abstract :
The fast knockout (FKO) algorithm constructs self-route concentrators from multi-stage cascades of 2×2 sorters. It is an especially efficient technique for m-to-n concentration when m and n are within the practical range. The algorithm calls a sub-algorithm for pairing, where different choices of the sub-algorithm yield FKO concentrators of different efficiencies. The present paper provides a new sub-algorithm for pairing. The result complements the existing technique of “k-sorting” in generating a best-known m-to-n concentrator for all m and n within the range of ail practical purposes
Keywords :
line concentrators; multistage interconnection networks; optimisation; packet switching; telecommunication network routing; FKO concentrators; fast knockout algorithm; m-to-n concentrator; multi-stage cascades; optimization; packet switching; pairing sub-algorithm; self-route concentration; Added delay; Costs; Delay effects; Logistics; Packet switching; Sorting; Time measurement; Upper bound; Very large scale integration;
Conference_Titel :
Communications, 1998. ICC 98. Conference Record. 1998 IEEE International Conference on
Print_ISBN :
0-7803-4788-9
DOI :
10.1109/ICC.1998.682962
