Add to ORKGIn this work we consider deterministic oblivious k-k routing algorithms with buffer size O(k). Our main focus lie is the design of algorithms for d- dimensional n n meshes, d > 1. For these networks we present asymptotically optimal O(k d ) step oblivious k-k routing algorithms for all k and d > 1
A recent seminal result of Räcke is that for any network there is an oblivious routing algorithm wit...
We study oblivious routing in which the packet paths are constructed independently of each other. We...
In this paper, we present a randomized algorithm for the multipacket (i.e., k - k) routing problem o...
AbstractIn this work we consider deterministic oblivious k–k routing algorithms with buffer size O(k...
We present an optimal oblivious randomized algorithm for permutation routing on the MIMD version of ...
For each d <= 8 we provide an oblivious algorithm for routing any permutation on the d-dimensional h...
k-k Routing, k-k Sorting, and Cut Through Routing on the Mesh In this paper we present randomized al...
AbstractThe problem of oblivious routing in fixed connection networks with a limited amount of space...
In this paper we present randomized algorithms for k \Gamma k routing, k \Gamma k sorting, and cut ...
Optimal randomized and deterministic algorithms have been given for $k$-$k$ routing on two-dimension...
Optimal randomized and deterministic algorithms have been given for k-k routing on two-dimensional n...
In the oblivious path selection problem, each packet in the network independently chooses a path, wh...
AbstractA recent seminal result of Räcke is that for any undirected network there is an oblivious ro...
We consider the problem of routing packets on an n \Theta \Delta \Delta \Delta \Theta n MIMD mesh-co...
In this paper a generalization of the robust network design problem with oblivious routing is invest...
A recent seminal result of Räcke is that for any network there is an oblivious routing algorithm wit...
We study oblivious routing in which the packet paths are constructed independently of each other. We...
In this paper, we present a randomized algorithm for the multipacket (i.e., k - k) routing problem o...
AbstractIn this work we consider deterministic oblivious k–k routing algorithms with buffer size O(k...
We present an optimal oblivious randomized algorithm for permutation routing on the MIMD version of ...
For each d <= 8 we provide an oblivious algorithm for routing any permutation on the d-dimensional h...
k-k Routing, k-k Sorting, and Cut Through Routing on the Mesh In this paper we present randomized al...
AbstractThe problem of oblivious routing in fixed connection networks with a limited amount of space...
In this paper we present randomized algorithms for k \Gamma k routing, k \Gamma k sorting, and cut ...
Optimal randomized and deterministic algorithms have been given for $k$-$k$ routing on two-dimension...
Optimal randomized and deterministic algorithms have been given for k-k routing on two-dimensional n...
In the oblivious path selection problem, each packet in the network independently chooses a path, wh...
AbstractA recent seminal result of Räcke is that for any undirected network there is an oblivious ro...
We consider the problem of routing packets on an n \Theta \Delta \Delta \Delta \Theta n MIMD mesh-co...
In this paper a generalization of the robust network design problem with oblivious routing is invest...
A recent seminal result of Räcke is that for any network there is an oblivious routing algorithm wit...
We study oblivious routing in which the packet paths are constructed independently of each other. We...
In this paper, we present a randomized algorithm for the multipacket (i.e., k - k) routing problem o...