About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
STOC 1989
Conference paper
O(log N) deterministic packet routing scheme
Abstract
We present a deterministic O(log N) time algorithm for the problem of routing an arbitrary permutation on an N-processor bounded-degree network with bounded buffers. Unlike all previous deterministic solutions to this problem, our routing scheme does not reduce the routing problem to sorting and does not use the M. Ajtai, J. Komlos and E. Szemeredi sorting network. Consequently, the constant in the run time of our routing scheme is substantially smaller, and the network topology is significantly simpler.