Reliable broadcast in anonymous distributed systems with fair lossy channels

Arévalo Viñuales, Sergio and Tang, Jian and Larrea Álava, Mikel and Jiménez Merino, José Ernesto (2015). Reliable broadcast in anonymous distributed systems with fair lossy channels. In: "21st IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2015)", 18-20 de noviembre de 2015, Zhangjiajie (China).

Description

Title: Reliable broadcast in anonymous distributed systems with fair lossy channels
Author/s:
  • Arévalo Viñuales, Sergio
  • Tang, Jian
  • Larrea Álava, Mikel
  • Jiménez Merino, José Ernesto
Item Type: Presentation at Congress or Conference (Article)
Event Title: 21st IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2015)
Event Dates: 18-20 de noviembre de 2015
Event Location: Zhangjiajie (China)
Title of Book: Proceedings of the 2015 IEEE 21st Pacific Rim International Symposium on Dependable Computing (PRDC)
Date: 2015
Subjects:
Freetext Keywords: Anonymous distributed system ;asynchronous system ; reliable broadcast ;fair lossy communication channels ;failure detector ; quiescent
Faculty: E.T.S.I. de Sistemas Informáticos (UPM)
Department: Sistemas Informáticos
Creative Commons Licenses: Recognition - No derivative works - Non commercial

Full text

[img]
Preview
PDF - Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (924kB) | Preview

Abstract

Reliable Broadcast (RB) is a basic abstraction in distributed systems, because it allows processes to communicate consistently and reliably to each other. It guarantees that all correct process reliable deliver the same set of messages. This abstraction has been extensively investigated in distributed systems where all processes have different identifiers, and the communication channels are reliable. However, more and more anonymous systems appear due to the motivation of privacy. It is significant to extend RB into anonymous system model where each process has no identifier. In another hand, the requirement of reliable communication channels is not always satisfied in real systems. Hence, this paper is aimed to study RB abstraction in anonymous distributed systems with fair lossy communication channels. In distributed systems, symmetry always mean that two systems should be considered symmetric if they behave identically, and two components of a system should be considered symmetric if they are indistinguishable. Hence, the anonymous distributed systems is symmetry. The design difficulty of RB algorithm lies in how to break the symmetry of the system. In this paper, we propose to use a random function to break it. Firstly, a non-quiescent RB algorithm tolerating an arbitrary number of crashed processes is given. Then, we introduce an anonymous perfect failure detector AP?. Finally, we propose an extended and quiescent RB algorithm using AP?.

Funding Projects

TypeCodeAcronymLeaderTitle
Government of SpainTIN2013-46883-PUnspecifiedUnspecifiedBIGDATAPAAS: Una plataforma como servicio para big data
Madrid Regional GovernmentS2013/ICE-2894UnspecifiedUnspecifiedCLOUD4BIGDATA. Efficient Cloud and BigData. Infrastructure

More information

Item ID: 41993
DC Identifier: http://oa.upm.es/41993/
OAI Identifier: oai:oa.upm.es:41993
Deposited by: Memoria Investigacion
Deposited on: 13 Jul 2017 17:06
Last Modified: 13 Jul 2017 17:06
  • Logo InvestigaM (UPM)
  • Logo GEOUP4
  • Logo Open Access
  • Open Access
  • Logo Sherpa/Romeo
    Check whether the anglo-saxon journal in which you have published an article allows you to also publish it under open access.
  • Logo Dulcinea
    Check whether the spanish journal in which you have published an article allows you to also publish it under open access.
  • Logo de Recolecta
  • Logo del Observatorio I+D+i UPM
  • Logo de OpenCourseWare UPM