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...
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...
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,...
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...
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...