231 search results - page 40 / 47 » A Byzantine Fault Tolerant Distributed Commit Protocol |
SAINT
2008
IEEE
15 years 3 months ago
2008
IEEE
An increasing proportion of distributed hash tables (DHTs) maintain additional routing information regarding each node’s immediately surrounding neighbors in a network overlay. ...
80
Voted
IPPS
2005
IEEE
15 years 3 months ago
2005
IEEE
An important problem in wireless networks, such as wireless ad hoc and sensor networks, is to select a few nodes to form a virtual backbone that supports routing and other tasks s...
MOBIHOC
2003
ACM
15 years 2 months ago
2003
ACM
Reliable storage of data with concurrent read/write accesses (or query/update) is an ever recurring issue in distributed settings. In mobile ad hoc networks, the problem becomes e...
87
Voted
PPL
2000
14 years 9 months ago
2000
In this paper we analyze the computational power of random geometric networks in the presence of random (edge or node) faults considering several important network parameters. We ...
ICNP
2003
IEEE
15 years 2 months ago
2003
IEEE
Peer-to-peer systems enable efficient resource aggregation and are inherently scalable since they do not depend on any centralized authority. However, lack of a centralized autho...