Brief announcement: fault-tolerant broadcast service in anonymous distributed systems with fair lossy communication channels

Tang, Jian and Larrea, Mikel and Arévalo Viñuales, Sergio and Jiménez Merino, José Ernesto (2015). Brief announcement: fault-tolerant broadcast service in anonymous distributed systems with fair lossy communication channels. In: "2015 ACM Symposium on Principles of Distributed Computing", 21-23 Jul 2015, San Sebastián. ISBN 978-1-4503-3617-8. pp. 203-205. https://doi.org/10.1145/2767386.2767443.

Description

Title: Brief announcement: fault-tolerant broadcast service in anonymous distributed systems with fair lossy communication channels
Author/s:
  • Tang, Jian
  • Larrea, Mikel
  • Arévalo Viñuales, Sergio
  • Jiménez Merino, José Ernesto
Item Type: Presentation at Congress or Conference (Article)
Event Title: 2015 ACM Symposium on Principles of Distributed Computing
Event Dates: 21-23 Jul 2015
Event Location: San Sebastián
Title of Book: PODC '15 ACM Symposium on Principles of Distributed Computing
Date: 2015
ISBN: 978-1-4503-3617-8
Volume: 1
Subjects:
Freetext Keywords: Anonymous; Reliable broadcast; Failure detector; Quiescent
Faculty: E.T.S. de Ingenieros Informáticos (UPM)
Department: Lenguajes y Sistemas Informáticos e Ingeniería del Software
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 (311kB) | Preview

Abstract

Fault-tolerant broadcast is a fundamental service in distributed systems, by which processes can communicate with each other consistently and reliably. It has two main forms: Reliable Broadcast (RB) and Uniform Reliable Broadcast(URB). This service has been extensively investigated in non-anonymous distributed systems where processes have unique identi?ers, usually assume the communication chan- nels are reliable, which is not always the case in real systems. In this paper, the fault-tolerant broadcast service is studied in an anonymous asynchronous message passing distributed system model with fair lossy communication chan- nels. Firstly, two simple and non-quiescent algorithms implementing RB and URB are given. Secondly, two new classes of failure detectors A? and AP? are proposed. Finally, with the information provided by A? and AP?, quiescent algorithms for both RB and URB are given.

Funding Projects

TypeCodeAcronymLeaderTitle
Government of SpainTIN2013-46883-PUnspecifiedUniversidad Politécnica de MadridBIGDATAPAAS: UNA PLATAFORMA COMO SERVICIO PARA BIG DATA
Madrid Regional GovernmentS2013/ICE-2894CLOUD4BIGDATA.UnspecifiedEfficient Cloud and BigData. Infrastructure.

More information

Item ID: 41547
DC Identifier: http://oa.upm.es/41547/
OAI Identifier: oai:oa.upm.es:41547
DOI: 10.1145/2767386.2767443
Official URL: http://dl.acm.org/citation.cfm?doid=2767386.2767443
Deposited by: Memoria Investigacion
Deposited on: 23 Jan 2017 15:12
Last Modified: 23 Jan 2017 15:12
  • 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