3018 search results - page 370 / 604 » Replicating for Performance: Case Studies |
179
click to vote
P2P
2006
IEEE
16 years 20 days ago
2006
IEEE
Peer-to-peer grids aim to build computational grids encompassing thousands of sites. To achieve this scale, such systems cannot rely on trust or off-line negotiations among partic...
185
click to vote
SPAA
2003
ACM
15 years 12 months ago
2003
ACM
Link reversal algorithms provide a simple mechanism for routing in mobile ad hoc networks. These algorithms maintain routes to any particular destination in the network, even when...
173
click to vote
AOSD
2007
ACM
15 years 10 months ago
2007
ACM
Modern source-level debuggers support dynamic breakpoints that are guarded by conditions based on program state. Such breakpoints address situations where a static breakpoint is n...
173
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract-- The calculation of network reliability in a probabilistic context has long been an issue of practical and academic importance. Conventional approaches (determination of ...
151
click to vote
CN
2006
15 years 6 months ago
2006
We study in this paper two competing AIMD flows that share a common bottleneck link. When congestion occurs, one (or both) flows will suffer a loss that will cause its throughput ...