Browsing by Subject "Fault-tolerant"
Now showing items 1-8 of 8
-
Article
Coordinated cooperative task computing using crash-prone processors with unreliable multicast
(2017)This paper presents a new message-passing algorithm, called Do-UM, for distributed cooperative task computing in synchronous settings where processors may crash, and where any multicasts (or broadcasts) performed by crashing ...
-
Conference Object
Distributed function calculation via linear iterations in the presence of malicious agents - Part II: Overcoming malicious behavior
(2008)Given a network of interconnected nodes, each with a given initial value, we develop a distributed strategy that enables some or all of the nodes to calculate any arbitrary function of these initial values, despite the ...
-
Article
Distributed function calculation via linear iterative strategies in the presence of malicious agents
(2011)Given a network of interconnected nodes, each with its own value (such as a measurement, position, vote, or other data), we develop a distributed strategy that enables some or all of the nodes to calculate any arbitrary ...
-
Article
Fault-tolerant semifast implementations of atomic read/write registers
(2009)This paper investigates time-efficient implementations of atomic read-write registers in message-passing systems where the number of readers can be unbounded. In particular we study the case of a single writer, multiple ...
-
Conference Object
Fault-tolerant supervisory control of discrete event systems modeled by bounded Petri nets
(2007)This paper considers bounded Petri nets with both controllable and uncontrollable transitions, and addresses the synthesis of a fault-tolerant supervisor in a setting where the control specifications are described via ...
-
Conference Object
A hybrid fault-tolerant algorithm for MPLS networks
(2006)In this paper we present a novel fault-tolerant algorithm for use in MPLS based networks. The algorithm is employing both protection switching and path rerouting techniques and satisfies four selected performance criteria.
-
Article
Meeting the deadline: On the complexity of fault-tolerant continuous gossip
(2011)In this paper we introduce the problem of Continuous Gossip in which rumors are continually and dynamically injected throughout the network. Each rumor has a deadline, and the goal of a continuous gossip protocol is to ...
-
Conference Object
Meeting the deadline: On the complexity of fault-tolerant Continuous Gossip
(2010)In this paper, we introduce the problem of Continuous Gossip in which rumors are continually and dynamically injected throughout the network. Each rumor has a deadline, and the goal of a continuous gossip protocol is to ...