15 search results - page 1 / 3 » Optimal Oblivious Path Selection on the Mesh |
IPPS
2005
IEEE
13 years 10 months ago
2005
IEEE
— In the oblivious path selection problem, each packet in the network independently chooses a path, which is an important property if the routing algorithm is to be independent 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...
SPAA
2005
ACM
13 years 10 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
SECON
2008
IEEE
13 years 10 months ago
2008
IEEE
—Traffic routing plays a critical role in determining the performance of a wireless mesh network. To investigate the best solution, existing work proposes to formulate the mesh ...
CLUSTER
2004
IEEE
13 years 4 months ago
2004
IEEE
The efficient use of network capacity in shared restoration schemes strongly depends upon the path selection procedure. In this paper we propose and evaluate path selection algorit...