4744 search results - page 177 / 949 » Connected Computing |
178
click to vote
PAM
2005
Springer
16 years 15 days 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...
152
click to vote
GI
2005
Springer
16 years 16 days 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...
156
click to vote
SPAA
1992
ACM
15 years 11 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 ...
192
click to vote
AP2PC
2004
Springer
16 years 12 days 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...
188
click to vote
IPPS
1998
IEEE
15 years 11 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...