Raising the BAR in dependable cooperative services

dc.contributor.advisorAlvisi, Lorenzo
dc.creatorWong, Edmund Liangfeien
dc.date.accessioned2013-09-26T20:58:18Zen
dc.date.accessioned2017-05-11T22:34:06Z
dc.date.available2017-05-11T22:34:06Z
dc.date.issued2013-08en
dc.date.submittedAugust 2013en
dc.date.updated2013-09-26T20:58:18Zen
dc.descriptiontexten
dc.description.abstractCooperative services--a term which includes any system that relies on the resources and participation of its clients to function--have proven to be a popular, naturally scalable means to disseminate content, distribute computational workloads, or provide network connectivity. However, because these services critically depend on participants that are not controlled by a single administrative domain, these services must be designed to function in environments where no participant--because of failure or selfishness--will necessarily follow the specified protocol. This thesis addresses the challenge of establishing and maintaining cooperation in cooperative services by (1) advancing our understanding of the limits to what our services can guarantee in the presence of failure, (2) demonstrating the critical role that correct participants can play in the incentives provided by the service, and (3) proposing a new notion of equilibrium that, unlike traditional notions, provides both rigorous yet practical guarantees in the presence of collusion. Furthermore, we demonstrate that our ideas can be applied to practice by designing and implementing Seer, a system that provides a scalable, reliable, and robust method for disseminating content even if participants may fail arbitrarily or deviate selfishly as a coalition.en
dc.description.departmentComputer Sciencesen
dc.format.mimetypeapplication/pdfen
dc.identifier.urihttp://hdl.handle.net/2152/21358en
dc.language.isoen_USen
dc.subjectCooperative servicesen
dc.subjectP2Pen
dc.subjectGame theoryen
dc.titleRaising the BAR in dependable cooperative servicesen

Files