13214 search results - page 278 / 2643 » Pseudorandomness for network algorithms |
153
Voted
DC
2010
15 years 6 months ago
2010
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
189
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constr...
124
click to vote
INFOCOM
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper concerns the design of distributed algorithms for sharing network bandwidth resources among contending flows. The classical fairness notion is the so-called max
170
click to vote
INFOCOM
2003
IEEE
15 years 12 months ago
2003
IEEE
— We present a new algorithm for routing of messages in ad-hoc networks where the nodes are energy-constrained. The routing objective is to maximize the total number of messages ...
169
click to vote
MUE
2007
IEEE
16 years 29 days ago
2007
IEEE
Swarm Intelligence (SI) inspired routing algorithms have become a research focus in recent years due to their self-organizing nature, which is very suitable to the routing problem...