18 search results - page 3 / 4 » Near-optimal oblivious routing on three-dimensional mesh net... |
IPPS
2005
IEEE
13 years 11 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...
AUTONOMICS
2008
ACM
13 years 8 months ago
2008
ACM
Inspired by the collective foraging behavior of specific ant species, ant-based routing algorithms are able to find optimal or near optimal packet routes for Wireless Mesh Network...
TON
2010
13 years 22 days ago
2010
Abstract--We present a number of significant engineering insights on what makes a good configuration for medium- to largesize wireless mesh networks (WMNs) when the objective funct...
ANCS
2009
ACM
13 years 3 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...
FOCS
2002
IEEE
13 years 11 months ago
2002
IEEE
A principle task in parallel and distributed systems is to reduce the communication load in the interconnection network, as this is usually the major bottleneck for the performanc...