License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.OPODIS.2016.8
URN: urn:nbn:de:0030-drops-70775
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2017/7077/
Go to the corresponding LIPIcs Volume Portal

Godard, Emmanuel ; Perdereau, Eloi

k-Set Agreement in Communication Networks with Omission Faults

pdf-format:
LIPIcs-OPODIS-2016-8.pdf (0.6 MB)

Abstract

We consider an arbitrary communication network G where at most f messages can be lost at each round, and consider the classical k-set agreement problem in this setting. We characterize exactly for which f the k-set agreement problem can be solved on G.

The case with k = 1, that is the Consensus problem, has first been introduced by Santoro and Widmayer in 1989, the characterization is already known from [Coulouma/Godard/Peters, TCS, 2015]. As a first contribution, we present a detailed and complete characterization for the 2-set problem. The proof of the impossibility result uses topological methods. We introduce a new subdivision approach for these topological methods that is of independent interest.

In the second part, we show how to extend to the general case with k in N. This characterization is the first complete characterization for this kind of synchronous message passing model, a model that is a subclass of the family of oblivious message adversaries.

BibTeX - Entry

@InProceedings{godard_et_al:LIPIcs:2017:7077,
  author =	{Emmanuel Godard and Eloi Perdereau},
  title =	{{k-Set Agreement in Communication Networks with Omission Faults}},
  booktitle =	{20th International Conference on Principles of Distributed Systems (OPODIS 2016)},
  pages =	{8:1--8:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-031-6},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{70},
  editor =	{Panagiota Fatourou and Ernesto Jim{\'e}nez and Fernando Pedone},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/7077},
  URN =		{urn:nbn:de:0030-drops-70775},
  doi =		{10.4230/LIPIcs.OPODIS.2016.8},
  annote =	{Keywords: k-set agreement, message passing, dynamic networks, message adversary, omission faults}
}

Keywords: k-set agreement, message passing, dynamic networks, message adversary, omission faults
Collection: 20th International Conference on Principles of Distributed Systems (OPODIS 2016)
Issue Date: 2017
Date of publication: 06.04.2017

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI