1674 search results - page 167 / 335 » On the Optimality of the ARQ-DDF Protocol |
193
click to vote
INFOCOM
2003
IEEE
15 years 11 months ago
2003
IEEE
Abstract— Network throughput and packet delay are two important parameters in the design and the evaluation of routing protocols for ad-hoc networks. While mobility has been show...
149
click to vote
IPPS
2003
IEEE
15 years 11 months ago
2003
IEEE
Our recent work on uniprocessor and single-node multiprocessor (SMP) active memory systems uses address remapping techniques in conjunction with extended cache coherence protocols...
148
click to vote
SRDS
2003
IEEE
15 years 11 months ago
2003
IEEE
The perfectly synchronized round model provides the abstraction of crash-stop failures with atomic message delivery. This abstraction makes distributed programming very easy. We p...
152
click to vote
PODC
2003
ACM
15 years 11 months ago
2003
ACM
Routing topologies for distributed hashing in peer-to-peer networks are classified into two categories: deterministic and randomized. A general technique for constructing determi...
184
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using ˜O(log n) rounds of interaction. The number of rounds in our protocol is optimal,...