806 search results - page 90 / 162 » Lower Bounds on Correction Networks |
167
click to vote
JCST
2008
15 years 6 months ago
2008
Geographic Routing (GR) algorithms, require nodes to periodically transmit HELLO messages to allow neighbors know their positions (beaconing mechanism). Beacon-less routing algorit...
163
click to vote
INFOCOM
2009
IEEE
16 years 18 days ago
2009
IEEE
—We analyze how node mobility can influence the convergence time of averaging gossip algorithms on networks. Our main result is that even a small number of fully mobile nodes ca...
143
click to vote
QEST
2006
IEEE
15 years 12 months ago
2006
IEEE
We analyze the effect of a few fiber delay loops on the number of deflections in an all optical packet switch. The switch is based on the ROMEO architecture developed by Alcatel...
169
click to vote
SIGOPSE
2004
ACM
15 years 11 months ago
2004
ACM
Overlay networks are widely used to deploy functionality at edge nodes without changing network routers. Each node in an overlay network maintains pointers to a set of neighbor no...
170
click to vote
INFOCOM
2000
IEEE
15 years 10 months ago
2000
IEEE
—This paper considers the design of handoff rerouting algorithms for reducing the overall session cost in personal communication systems (PCS). Most modern communication systems ...