Sciweavers

55 search results - page 2 / 11
» Better Deterministic Routing on Meshes
Sort
View
SODA
1994
ACM
133views Algorithms» more  SODA 1994»
13 years 8 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
EUROPAR
2009
Springer
14 years 1 months ago
A Lower Bound for Oblivious Dimensional Routing
In this work we consider deterministic oblivious dimensional routing algorithms on d-dimensional meshes. In oblivious dimensional routing algorithms the path of a packet depends o...
Andre Osterloh
GLOBECOM
2010
IEEE
13 years 5 months ago
Performance-Oriented Routing in Telecommunication Networks
A lot of attention has been devoted to flow routing in networks by the past. Usually, each commodity to be routed is characterized by a single deterministic traffic value. However,...
Hassan Hijazi, Olivier Klopfenstein
COMCOM
2008
158views more  COMCOM 2008»
13 years 7 months ago
Load aware traffic engineering for mesh networks
Wireless Mesh Network (WMN) is a multi-hop mesh network that consists of mesh routers and mesh clients, where mesh routers are static and form the backbone of the mesh network. Th...
Devu Manikantan Shila, Tricha Anjali
EUROPAR
2001
Springer
13 years 12 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