581 search results - page 58 / 117 » Approximation algorithms for constructing wavelength routing... |
113
click to vote
INFOCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
104
click to vote
INFORMS
2008
15 years 1 months ago
2008
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
128
click to vote
ADHOC
2007
15 years 1 months ago
2007
Abstract— This paper investigates optimal routing and adaptive scheduling in a wireless mesh network composed of mesh clients and mesh routers. The mesh clients are power constra...
128
click to vote
INFOCOM
2003
IEEE
15 years 6 months ago
2003
IEEE
—The terrorist attacks on September 11, 2001 have drawn attention to the use of wireless technology in order to locate survivors of structural collapse. We propose to construct a...
110
click to vote
IMC
2003
ACM
15 years 6 months ago
2003
ACM
Internet topology information is only made available in aggregate form by standard routing protocols. Connectivity information and latency characteristicsmust therefore be inferre...