Abstract
Kaklamanis, Krizanc, and Tsantilas (1991) gave an asymptotically optimal oblivious algorithm for many—one routing in hypercubes. It is shown that their argument needs to be modified in order for the algorithm to attain the asymptotic lower bound. They also applied the algorithm to permutation routing via the many—one and one—many routing phases. They claimed to save a factor of two by proposing to divide the packets into halves, routing the first half forward and the second half backward in the bit sequence. It is shown that this idea cannot reduce the total number of steps by a factor of two.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received January 1995, and in final form May 1997.
Rights and permissions
About this article
Cite this article
Hwang, F., Yao, Y. Comments on the Oblivious Routing Algorithm of Kaklamanis, Krizanc, and Tsantilas in the Hypercube. Theory Comput. Systems 31, 63–66 (1998). https://doi.org/10.1007/s002240000077
Published:
Issue Date:
DOI: https://doi.org/10.1007/s002240000077