Sciweavers

31 search results - page 1 / 7
» Constant Queue Routing on a Mesh
Sort
View
EUROPAR
2001
Springer
13 years 10 months ago
Optimal Many-to-One Routing on the Mesh with Constant Queues
We present randomized and deterministic algorithms for many-to-one routing on an n-node two-dimensional mesh under the store-and-forward model of packet routing. We consider the g...
Andrea Pietracaprina, Geppino Pucci
STACS
1991
Springer
13 years 9 months ago
Constant Queue Routing on a Mesh
Sanguthevar Rajasekaran, Richard Overholt
SPDP
1991
IEEE
13 years 9 months ago
Optimal randomized algorithms for multipacket and cut through routing on the mesh
In this paper, we present a randomized algorithm for the multipacket (i.e., k − k) routing problem on an n × n mesh. The algorithm completes with high probability in at the mos...
Sanguthevar Rajasekaran, Mukund Raghavachari
IICS
2009
Springer
14 years 1 days ago
An Adaptive Policy Routing with Thermal Field Approach
: This paper introduces an adaptive routing approach based on buffer status and distance in a mesh overlay network: Thermal Field is used for considering buffer stage and distance ...
Lada-On Lertsuwanakul, Herwig Unger
SODA
1994
ACM
133views Algorithms» more  SODA 1994»
13 years 6 months ago
Derandomizing Algorithms for Routing and Sorting on Meshes
We describe a new technique that can be used to derandomize a number of randomized algorithms for routing and sorting on meshes. We demonstrate the power of this technique by deri...
Michael Kaufmann, Jop F. Sibeyn, Torsten Suel