Weighted Raft and its Application to Geographically Distributed Servers

Simple item page
dc.contributor.advisorSafavi-Naini, Reihaneh
dc.contributor.authorLiu, Xi
dc.contributor.committeememberSafavi-Naini, Reihanah
dc.contributor.committeememberFong, Philip W. L.
dc.contributor.committeememberReardon, Joel
dc.date2018-11
dc.date.accessioned2018-09-27T15:53:05Z
dc.date.available2018-09-27T15:53:05Z
dc.date.issued2018-09-17
dc.description.abstractModern application are usually deployed in a distributed architecture where several servers are involved in providing service to users. Distributed systems offer fault tolerance and increased availability. In some cases, the servers are distributed in different geographic locations to reduce latency and provide better service to end users. Keeping data consistent across servers is a fundamental problem. Raft consensus algorithm has been prepared to achieve data consistency in the presence of server failure. In Raft, servers elect a leader server that manages client-side requests and updates the data files. Each server has the same chance to becoming a leader. Although typical Raft servers are in a local cluster, in many natural applications, Raft can be used in a geographically distributed setting to ensure data consistency. In such a setting, it is natural to allow the “closest” server to a user to respond to the user request. The notation of “closeness” could capture not only geographic location but also network connectivity and capacity. Motivated by the above challenge, we propose Geo-Raft which is the application of Raft protocol in geographically distributed systems. To reduce the performance cost, we add weights to servers’ election timeout to enable the most suitable server to be elected as the leader and serve the users. We propose a model to optimize Geo-Raft performance and present an approach to determine Raft timeouts for a given set of weights. We discuss our results and directions for future work.en_US
dc.identifier.citationLiu, Xi. (2018). Weighted Raft and its Application to Geographically Distributed Servers (Master's thesis, University of Calgary, Calgary, Canada). Retrieved from https://prism.ucalgary.ca. doi:10.11575/PRISM/33043en_US
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/33043
dc.identifier.urihttp://hdl.handle.net/1880/108690
dc.language.isoeng
dc.publisher.facultyGraduate Studies
dc.publisher.facultyScience
dc.publisher.institutionUniversity of Calgaryen
dc.publisher.placeCalgaryen
dc.rightsUniversity of Calgary graduate students retain copyright ownership and moral rights for their thesis. You may use this material in any way that is permitted by the Copyright Act or through licensing that has been assigned to the document. For uses that are not allowable under copyright legislation or licensing, you are required to seek permission.
dc.subjectRaft Consensus Algorithm
dc.subjectGeographically Distributed System
dc.subjectCost Optimization
dc.subject.classificationComputer Scienceen_US
dc.titleWeighted Raft and its Application to Geographically Distributed Servers
dc.typemaster thesis
thesis.degree.disciplineComputer Science
thesis.degree.grantorUniversity of Calgary
thesis.degree.nameMaster of Science (MSc)
ucalgary.item.requestcopytrue
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
ucalgary_2018_liu_xi.pdf
Size:
2.48 MB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
1.74 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Open Theses and Dissertations