Sciweavers

18 search results - page 3 / 4
» Near-optimal oblivious routing on three-dimensional mesh net...
Sort
View
IPPS
2005
IEEE
14 years 4 months ago
Optimal Oblivious Path Selection on the Mesh
— 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...
Costas Busch, Malik Magdon-Ismail, Jing Xi
AUTONOMICS
2008
ACM
14 years 10 days ago
QoS-aware ant routing with colored pheromones in wireless mesh networks
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...
Martina Umlauft, Wilfried Elmenreich
TON
2010
168views more  TON 2010»
13 years 5 months ago
Engineering Wireless Mesh Networks: Joint Scheduling, Routing, Power Control, and Rate Adaptation
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...
Jun Luo, Catherine Rosenberg, André Girard
ANCS
2009
ACM
13 years 8 months ago
Weighted random oblivious routing on torus networks
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...
Rohit Sunkam Ramanujam, Bill Lin
FOCS
2002
IEEE
14 years 3 months ago
Minimizing Congestion in General Networks
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...
Harald Räcke