2076 search results - page 224 / 416 » Universal Routing in Distributed Networks |
158
click to vote
PCRCW
1997
Springer
15 years 8 months ago
1997
Springer
In recent years, theChaos Project at theUniversityofWashingtonhas analyzed and simulated a dozen routing algorithms. Three new routing algorithms have been invented; of these, the...
121
click to vote
NOSSDAV
2001
Springer
15 years 8 months ago
2001
Springer
This paper presents an extensive analysis of the client workloads for educational media servers at two major U.S. universities. The goals of the analysis include providing data fo...
116
click to vote
CJ
2008
15 years 3 months ago
2008
This article advocates a new computing paradigm, called computing with time, that is capable of efficiently performing a certain class of computation, namely, searching in paralle...
150
click to vote
ADHOCNETS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Wireless sensor networks are vulnerable to the node clone attack because of low-cost, resource-constrained sensor nodes, and uncontrolled environments where they are left...
138
click to vote
SSS
2005
Springer
15 years 9 months ago
2005
Springer
We present simple algorithms for achieving self-stabilizing location management and routing in mobile ad-hoc networks. While mobile clients may be susceptible to corruption and sto...