Reliable broadcast in anonymous distributed systems with fair lossy channels

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

Descripción

Título: Reliable broadcast in anonymous distributed systems with fair lossy channels
Autor/es:
  • Arévalo Viñuales, Sergio
  • Tang, Jian
  • Larrea Álava, Mikel
  • Jiménez Merino, José Ernesto
Tipo de Documento: Ponencia en Congreso o Jornada (Artículo)
Título del Evento: 21st IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2015)
Fechas del Evento: 18-20 de noviembre de 2015
Lugar del Evento: Zhangjiajie (China)
Título del Libro: Proceedings of the 2015 IEEE 21st Pacific Rim International Symposium on Dependable Computing (PRDC)
Fecha: 2015
Materias:
Palabras Clave Informales: Anonymous distributed system ;asynchronous system ; reliable broadcast ;fair lossy communication channels ;failure detector ; quiescent
Escuela: E.T.S.I. de Sistemas Informáticos (UPM)
Departamento: Sistemas Informáticos
Licencias Creative Commons: Reconocimiento - Sin obra derivada - No comercial

Texto completo

[img]
Vista Previa
PDF (Document Portable Format) - Se necesita un visor de ficheros PDF, como GSview, Xpdf o Adobe Acrobat Reader
Descargar (924kB) | Vista Previa

Resumen

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?.

Proyectos asociados

TipoCódigoAcrónimoResponsableTítulo
Gobierno de EspañaTIN2013-46883-PSin especificarSin especificarBIGDATAPAAS: Una plataforma como servicio para big data
Comunidad de MadridS2013/ICE-2894Sin especificarSin especificarCLOUD4BIGDATA. Efficient Cloud and BigData. Infrastructure

Más información

ID de Registro: 41993
Identificador DC: http://oa.upm.es/41993/
Identificador OAI: oai:oa.upm.es:41993
Depositado por: Memoria Investigacion
Depositado el: 13 Jul 2017 17:06
Ultima Modificación: 13 Jul 2017 17:06
  • Open Access
  • Open Access
  • Sherpa-Romeo
    Compruebe si la revista anglosajona en la que ha publicado un artículo permite también su publicación en abierto.
  • Dulcinea
    Compruebe si la revista española en la que ha publicado un artículo permite también su publicación en abierto.
  • Recolecta
  • e-ciencia
  • Observatorio I+D+i UPM
  • OpenCourseWare UPM