376 search results - page 37 / 76 » Hardware-Assisted Fast Routing |
116
Voted
INFOCOM
2006
IEEE
15 years 8 months ago
2006
IEEE
— We consider the fundamental delay tradeoffs for utility optimal scheduling in a general network with time varying channels. A network controller acts on randomly arriving data ...
120
click to vote
IFIP
1999
Springer
15 years 6 months ago
1999
Springer
In this paper we describe Frontier, an FPGA placement system that uses design macro-blocks in conjuction with a series of placement algorithms to achieve highly-routable and high-...
145
click to vote
OPODIS
2004
15 years 3 months ago
2004
A localized Delaunay triangulation owns the following interesting properties in a wireless ad hoc setting: it can be built with localized information, the communication cost impos...
129
Voted
SODA
2003
ACM
15 years 3 months ago
2003
ACM
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorithms for two problems. Given a network, we first show how to compute connected a...
139
Voted
IM
2008
15 years 2 months ago
2008
Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...