Predicting Read- and Write-Operation Availabilities of Quorum Protocols based on Graph Properties

Robert Schadek, Oliver Kramer, Oliver Theel

2018

Abstract

Highly available services can be implemented by means of quorum protocols. Unfortunately, using real-world physical networks as underlying communication medium for quorum protocols turns out to be difficult, since efficient quorum protocols often depend on a particular graph structure imposed on the replicas managed by it. Mapping the replicas of the quorum protocol to the vertices of the real-world physical network usually decreases the availability of the operation provided by the quorum protocol. Therefore, finding mappings with little decrease in operation availability is the desired goal. The mapping with the smallest decrease in operation availability can be found by iterating all mappings. This approach has a runtime complexity of O(N!) where N is the number of vertices in the graph structure. Finding the optimal mapping with this approach, therefore, quickly becomes unfeasible. We present, an approach to predict the operation availability of the best mapping based on properties like e. g. degree or betweenness centrality. This prediction can then be used to decide whether it is worth to execute the O(N!) algorithm to find the best possible mapping. We test this new approach by cross-validating its predictions of the operation availability with the operation availability of the best mapping.

Paper Citation

in Harvard Style

Schadek R., Kramer O. and Theel O. (2018). Predicting Read- and Write-Operation Availabilities of Quorum Protocols based on Graph Properties.In Proceedings of the 10th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-758-275-2, pages 550-558. DOI: 10.5220/0006645705500558

in Bibtex Style

@conference{icaart18,
author={Robert Schadek and Oliver Kramer and Oliver Theel},
title={Predicting Read- and Write-Operation Availabilities of Quorum Protocols based on Graph Properties},
booktitle={Proceedings of the 10th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},
year={2018},
pages={550-558},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006645705500558},
isbn={978-989-758-275-2},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 10th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,
TI - Predicting Read- and Write-Operation Availabilities of Quorum Protocols based on Graph Properties
SN - 978-989-758-275-2
AU - Schadek R.
AU - Kramer O.
AU - Theel O.
PY - 2018
SP - 550
EP - 558
DO - 10.5220/0006645705500558