Papers by rodrigo rodrigues
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Distributed hash tables have been around for a long time (1, 2). A number of recent projects prop... more Distributed hash tables have been around for a long time (1, 2). A number of recent projects propose peer-to-peer DHTs, based on multi-hop lookup optimizations. Some of these systems also require data permanence. This paper presents an analysis of when these optimizations are useful. We conclude that the multi-hop optimizations make sense only for truly vast and very dynamic peer
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
ACM Transactions on Computer Systems, 2003
Bookmarks Related papers MentionsView impact
The original work on quorum systems assumed that servers fail benignly, by crashing or omitting s... more The original work on quorum systems assumed that servers fail benignly, by crashing or omitting some steps. More recently, researchers have developed techniques that enable quorum systems to provide data availability in the presence of arbitrary (Byzantine) faults [6]. Earlier work provides correct semantics despite server (i.e., replica) failures and also handles some of the problems of Byzantine clients [1,2,4,6, 9]. This paper describes the first protocols to handle all problems caused by Byzantine clients. Our protocols ensure that bad clients cannot interfere with good clients. Bad clients cannot prevent good clients from completing reads and writes, nor can they cause good clients to see inconsistencies. In addition bad clients that have been removed from operation can leave behind at most a bounded number of “lurking” writes that could be done on their behalf by a colluder.
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
High availability in peer-to-peer DHTs requires data redundancy. This paper compares two popular ... more High availability in peer-to-peer DHTs requires data redundancy. This paper compares two popular redundancy schemes: replication and erasure coding. Unlike previous comparisons, we take the characteristics of the nodes that comprise the overlay into account, and conclude that in some cases the benefits from coding are limited, and may not be worth its disadvantages.
Bookmarks Related papers MentionsView impact
IEEE Transactions on Parallel and Distributed Systems, 2009
Citation Fonseca, P. et al. Full-Information Lookups for Peer-to-Peer Overlays. Parallel and Di... more Citation Fonseca, P. et al. Full-Information Lookups for Peer-to-Peer Overlays. Parallel and Distributed Systems, IEEE Transactions on 20.9 (2009): 1339-1351. © 2009 IEEE ... As Published http://dx.doi.org/10.1109/tpds.2008.222 ... Publisher Institute of Electrical and Electronics ...
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Uploads
Papers by rodrigo rodrigues