4744 search results - page 177 / 949 » Connected Computing |
128
click to vote
PAM
2005
Springer
15 years 9 months ago
2005
Springer
We propose two methods to passively measure and monitor changes in round-trip times (RTTs) throughout the lifetime of a TCP connection. Our first method associates data segments w...
100
click to vote
GI
2005
Springer
15 years 9 months ago
2005
Springer
: While software design is increasingly based on models, requirements engineering is generally performed using structured text; as a consequence, only a weakly structured connectio...
112
click to vote
SPAA
1992
ACM
15 years 7 months ago
1992
ACM
d abstract) Michael Kaufmann Sanguthevar Rajasekaran Jop F. Sibeyn In this paper we present randomized algorithms for kk routing, k-k sorting, and cut through routing on the mesh ...
138
Voted
AP2PC
2004
Springer
15 years 8 months ago
2004
Springer
In a peer-to-peer (P2P) system, nodes typically connect to a small set of random nodes (their neighbors), and queries are propagated along these connections. Such query flooding t...
126
Voted
IPPS
1998
IEEE
15 years 7 months ago
1998
IEEE
The RAIN (Reliable Array of Independent Nodes) project at Caltech is focusing on creating highly reliable distributed systems by leveraging commercially available personal compute...