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

Superlinear and Bandwidth Friendly Geo-replication for Store-And-Forward Systems


Fulltext:


Authors:

Daniel Brahneborg, Wasif Afzal, Adnan Causevic, Mats Björkman

Research group:

Software Testing Laboratory

Publication Type:

Conference/Workshop Paper

Venue:

15th International Conference on Software Technologies

Abstract

To keep internet based services available despite inevitable local internet and power outages, their data must be replicated to one or more other sites. For most systems using the store-and-forward architecture, data loss can also be prevented by using end-to-end acknowledgements. So far we have not found any sufficiently good solutions for replication of data in store-and-forward systems without acknowledgements and with geographically separated system nodes. We therefore designed a new replication protocol, which could take advantage of the lack of a global order between the messages and the acceptance of a slightly higher risk for duplicated deliveries than existing protocols. We tested a proof-of-concept implementation of the protocol for throughput and latency in a controlled experiment using 7 nodes in 4 geographically separated areas, and observed the throughput increasing superlinearly with the number of nodes up to almost 3500 messages per second. It is also, to the best of our knowledge, the first replication protocol with a bandwidth usage that scales according to the number of nodes allowed to fail and not the total number of nodes in the system.

Bibtex

@inproceedings{Brahneborg5776,
author = {Daniel Brahneborg and Wasif Afzal and Adnan Causevic and Mats Bj{\"o}rkman},
title = {Superlinear and Bandwidth Friendly Geo-replication for Store-And-Forward Systems},
number = {15},
month = {July},
year = {2020},
booktitle = {15th International Conference on Software Technologies},
url = {http://www.es.mdu.se/publications/5776-}
}