You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

GeoRep – Resilient Storage for Wide Area Networks

Fulltext:


Authors:

Daniel Brahneborg, Romaric Duvignau , Wasif Afzal, Saad Mubeen

Publication Type:

Journal article

Venue:

Journal of IEEE Access

DOI:

10.1109/ACCESS.2022.3191686

Abstract

Embedded systems typically have limited processing and storage capabilities, and may only intermittently be powered on. After sending an event upstreams with data from its sensors, the system must therefore be able to trust that the data, once acknowledged, is not lost. The purpose of this work is to propose a novel solution for replicating data between the upstreams nodes in such systems, with a minimal effect on the software architecture. Based on the assumption that there would be no relative order between replicated data tuples, we designed a new replication protocol which uses only 2 communication steps per data tuple, instead of between 3 and 12 used by other solutions. We verified its failover mechanism in a proof-of-concept implementation of the protocol using simulated network failures, and evaluated the implementation on throughput and latency in several controlled experiments using up to 7 nodes in up to 5 geographically separated areas, with up to 1000 data producers per node. The recorded system throughput increased linearly relative to both the number of nodes and the number of data producers. For comparison, with 3 nodes Paxos showed a similar performance as our protocol, but it instead got slower when nodes were added. The lack of a relative order, in combination with partial replication, enables our system to continue working during network partitions, not only in the part containing the majority of the nodes, but also in any sufficiently large minority partitions.

Bibtex

@article{Brahneborg6501,
author = {Daniel Brahneborg and Romaric Duvignau and Wasif Afzal and Saad Mubeen},
title = {GeoRep – Resilient Storage for Wide Area Networks},
volume = {2},
number = {1},
month = {July},
year = {2022},
journal = {Journal of IEEE Access},
url = {http://www.es.mdu.se/publications/6501-}
}