Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols

In this paper we present a deterministic protocol for routing arbitrary permutations in arbitrary networks. The protocol is analyzed in terms of the size of the network and the routing number of the network. Given a network H of n nodes, the routing number of H is defined as the maximum over all permutations on {1, ..., n} of the minimal number of steps to route offline in H. We show that for any network H of size n with routing number R our protocol needs time to route any permutation in H using only constant size edge buffers. This significantly improves all previously known results on deterministic routing. In particular, our result yields optimal deterministic routing protocols for arbitrary networks with diameter or bisection width , constant. Furthermore we can extend our result to deterministic compact routing. This yields, e.g., a deterministic routing protocol with runtime O(R logn) for arbitrary bounded degree networks if only O(logn) bits are available at each node for storing routing information.

Our protocol is a combination of a generalized ``routing via simulation'' technique with an new deterministic protocol for routing h-relations in an extended version of a multibutterfly network. This protocol improves upon all previous routing protocols known for variants of the multibutterfly network. The ``routing via simulation'' technique used here extends a method previously introduced by the authors for designing compact routing protocols.

This is a preview of subscription content, access via your institution.

Author information



Additional information

Received July 18, 1997

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Meyer auf der Heide, F., Scheideler, C. Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols. Combinatorica 21, 95–138 (2001).

Download citation

  • AMS Subject Classification (1991) Classes:  68W10, 68W15, 68W20