loading
Papers

Research.Publish.Connect.

Paper

Authors: Robert Schadek ; Oliver Kramer and Oliver Theel

Affiliation: Carl von Ossietzky University of Oldenburg, Germany

ISBN: 978-989-758-275-2

Keyword(s): Distributed Systems, Fault Tolerance, Data Replication, Quorum Protocols, Operation Availability Prediction, K-nearest Neighbors.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Artificial Intelligence and Decision Support Systems ; Computational Intelligence ; Enterprise Information Systems ; Evolutionary Computing ; Formal Methods ; Industrial Applications of AI ; Informatics in Control, Automation and Robotics ; Intelligent Control Systems and Optimization ; Knowledge Discovery and Information Retrieval ; Knowledge-Based Systems ; Machine Learning ; Planning and Scheduling ; Simulation and Modeling ; Soft Computing ; Symbolic Systems ; Uncertainty in AI

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 propertie s 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. (More)

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.233.217.242

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
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 1: ICAART, ISBN 978-989-758-275-2, pages 550-558. DOI: 10.5220/0006645705500558

@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 1: ICAART,},
year={2018},
pages={550-558},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006645705500558},
isbn={978-989-758-275-2},
}

TY - CONF

JO - Proceedings of the 10th International Conference on Agents and Artificial Intelligence - Volume 1: 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

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.