55 search results - page 1 / 11 » Oblivious Routing for the Lp-norm |
EUROPAR
2009
Springer
13 years 11 months ago
2009
Springer
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...
ANCS
2009
ACM
13 years 2 months ago
2009
ACM
Torus, mesh, and flattened butterfly networks have all been considered as candidate architectures for on-chip interconnection networks. In this paper, we study the problem of opti...
MOBIHOC
2012
ACM
11 years 7 months ago
2012
ACM
We propose a routing scheme to implement multicast communication in wireless networks. The scheme is oblivious, compact, and completely decentralized. It is intended to support dy...
STOC
2005
ACM
14 years 5 months ago
2005
ACM
SPAA
2003
ACM
13 years 10 months ago
2003
ACM
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...