Zobrazeno 1 - 10
of 31
pro vyhledávání: '"Sakavalas, Dimitris"'
In this work, we study the approximate consensus problem in asynchronous message-passing networks where some nodes may become Byzantine faulty. We answer an open problem raised by Tseng and Vaidya, 2012, proposing the first algorithm of optimal resil
Externí odkaz:
http://arxiv.org/abs/2004.09054
Consider a point-to-point message-passing network. We are interested in the asynchronous crash-tolerant consensus problem in incomplete networks. We study the feasibility and efficiency of approximate consensus under different restrictions on topolog
Externí odkaz:
http://arxiv.org/abs/1803.04513
A fundamental primitive in distributed computing is Reliable Message Transmission (RMT), which refers to the task of correctly sending a message from a party (or player) to another, in a network where some intermediate relays might be controlled by a
Externí odkaz:
http://arxiv.org/abs/1711.01725
We study distributed broadcasting protocols with few transmissions (`shots') in radio networks where the topology is unknown. In particular, we examine the case in which a bound $k$ is given and a node may transmit at most $k$ times during the broadc
Externí odkaz:
http://arxiv.org/abs/1603.08393
Publikováno v:
In Journal of Discrete Algorithms January 2017 42:2-13
Consider an asynchronous incomplete directed network. We study the feasibility and efficiency of approximate crash-tolerant consensus under different restrictions on topology knowledge and relay depth, i.e., the maximum number of hops any message can
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9d36faa531990d60c6696fca35dc0397
Consider a point-to-point message-passing network. We are interested in the asynchronous crash-tolerant consensus problem in incomplete networks. We study the feasibility and efficiency of approximate consensus under different restrictions on topolog
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::acf19947191324864a75d4a48250da34
We address the problem of Reliable Message Transmission (RMT), in the general adversary model of Hirt and Maurer [2], which subsumes earlier models such as the global or local threshold adversaries. We employ the recently introduced Partial Knowledge
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2127::f2e99cde8cc01c1ca47c52065e7450c8
https://pergamos.lib.uoa.gr/uoa/dl/object/uoadl:3168354
https://pergamos.lib.uoa.gr/uoa/dl/object/uoadl:3168354
Autor:
Sakavalas, Dimitris, Tseng, Lewis
Publikováno v:
Synthesis Lectures on Distributed Computing Theory; 2019, Vol. 9 Issue 1, p77-88, 12p