Results

**1 - 3**of**3**### Direct routing on trees (Extended Abstract)

- In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 98
, 1998

"... We consider off-line permutation routing on trees. We are particularly interested in direct tree routing schedules where packets once started move directly towards their destination. The scheduling of start times ascertains that no two packets will use the same edge in the same direction in the same ..."

Abstract
- Add to MetaCart

We consider off-line permutation routing on trees. We are particularly interested in direct tree routing schedules where packets once started move directly towards their destination. The scheduling of start times ascertains that no two packets will use the same edge in the same direction in the same time step. In O(n log n log log n) time and O(n log n) space, we construct a direct tree routing schedule guaranteed to complete the routing within the general optimum of n \Gamma 1 steps. In addition, our scheme guarantees that at most two packets arrive at the same node in the same time step. Furthermore, if the length of the route of a given packet is d and the maximum number of other routes intersecting the route in a single node is k then the packet arrives to its destination within d + k steps. 1 Introduction In this paper, we consider off-line hot-potato permutation packet routing on trees. We are given a permutation ß of the nodes, and for each node v, we want to send a packet fr...

### Potential-function-based Analysis of an off-line Heap Construction Algorithm

, 2000

"... In this paper we examine the problem of heap construction on a rooted tree T from a packet routing perspective. Each node of T initially contains a packet which has a key-value associated with it. The aim of the heap construction algorithm is to route the packets along the edges of the tree so that ..."

Abstract
- Add to MetaCart

In this paper we examine the problem of heap construction on a rooted tree T from a packet routing perspective. Each node of T initially contains a packet which has a key-value associated with it. The aim of the heap construction algorithm is to route the packets along the edges of the tree so that, at the end of the routing, the tree is heap ordered with respect to the key values associated with the packets. We consider the case where the routing is performed according to the matching model and we present and analyse an off-line algorithm that heap orders the tree within 2h(T) routing steps, where h(T) is the height of tree T. The main contribution of the paper is the novel analysis of the algorithm based on potential functions. It is our belief that potential functions will be the main vehicle in analysing fast non-recursive routing algorithms.

### c ○ 1999 Society for Industrial and Applied Mathematics OPTIMAL BOUNDS FOR MATCHING ROUTING ON TREES ∗

"... Abstract. The permutation routing problem is studied for trees under the matching model. By introducing a novel and useful (so-called) caterpillar tree partition, we prove that any permutation on an n-node tree (and thus graph) can be routed in 3 n + O(log n) steps. This answers an open 2 ..."

Abstract
- Add to MetaCart

Abstract. The permutation routing problem is studied for trees under the matching model. By introducing a novel and useful (so-called) caterpillar tree partition, we prove that any permutation on an n-node tree (and thus graph) can be routed in 3 n + O(log n) steps. This answers an open 2