581 search results - page 36 / 117 » Approximation algorithms for constructing wavelength routing... |
175
Voted
STOC
2004
ACM
15 years 11 months ago
2004
ACM
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
390
click to vote
INFOCOM
2012
IEEE
13 years 8 months ago
2012
IEEE
— Reliability and energy efficiency are critical issues in wireless sensor networks. In this work, we study Delay-bounded Energy-constrained Adaptive Routing (DEAR) problem with...
162
click to vote
TON
2002
15 years 5 months ago
2002
Current means of providing loop-back recovery, which is widely used in SONET, rely on ring topologies, or on overlaying logical ring topologies upon physical meshes. Loop-back is d...
162
click to vote
INFOCOM
2008
IEEE
16 years 12 days ago
2008
IEEE
—IEEE 802.11 WiFi equipment based wireless mesh networks have recently been proposed as an inexpensive approach to connect far-flung rural areas. Such networks are built using h...
161
click to vote
SIGCOMM
2004
ACM
15 years 11 months ago
2004
ACM
We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be kn...