Show simple item record

Files in this item

Thumbnail
Name:
1006.3465v1
Size:
496.5Kb
Format:
PDF
View/Open

Hosting Byzantine Fault Tolerant Services on a Chord ring

Item metadata

dc.contributor.authorDearle, Alan
dc.contributor.authorKirby, Graham
dc.contributor.authorNorcross, Stuart
dc.date.accessioned2011-01-07T16:51:06Z
dc.date.available2011-01-07T16:51:06Z
dc.date.issued2007
dc.identifier5006514
dc.identifier8472a9d8-1998-487c-9dbe-692b9bece163
dc.identifier.citationDearle , A , Kirby , G & Norcross , S 2007 , Hosting Byzantine Fault Tolerant Services on a Chord ring . University of St Andrews .en
dc.identifier.otherArXiv: http://arxiv.org/abs/1006.3465v1
dc.identifier.otherORCID: /0000-0002-4422-0190/work/28429103
dc.identifier.urihttps://hdl.handle.net/10023/1670
dc.descriptionSubmitted to DSN 2007 Workshop on Architecting Dependable Systemsen
dc.description.abstractIn this paper we demonstrate how stateful Byzantine Fault Tolerant services may be hosted on a Chord ring. The strategy presented is fourfold: firstly a replication scheme that dissociates the maintenance of replicated service state from ring recovery is developed. Secondly, clients of the ring based services are made replication aware. Thirdly, a consensus protocol is introduced that supports the serialization of updates. Finally Byzantine fault tolerant replication protocols are developed that ensure the integrity of service data hosted on the ring.
dc.format.extent6
dc.format.extent508468
dc.language.isoeng
dc.publisherUniversity of St Andrews
dc.subjectcs.DCen
dc.subjectDistributed, parallel, and cluster computingen
dc.subjectQA75 Electronic computers. Computer scienceen
dc.subject.lccQA75en
dc.titleHosting Byzantine Fault Tolerant Services on a Chord ringen
dc.typeReporten
dc.contributor.institutionUniversity of St Andrews. School of Computer Scienceen
dc.identifier.urlhttp://arxiv.org/abs/1006.3465en


This item appears in the following Collection(s)

Show simple item record

Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.