Browsing Department of Electrical Engineering and Computer Sciences by Title
Now showing items 11-30 of 108
-
Asynchronous Failure Detectors
(2013-01-30)Failure detectors -- oracles that provide information about process crashes -- are an important abstraction for crash tolerance in distributed systems. The generality of failure-detector theory, while providing great ... -
Asynchronous Failure Detectors
(2013-10-10)Failure detectors -- oracles that provide information about process crashes -- are an important abstraction for crash tolerance in distributed systems. The generality of failure-detector theory, while providing great ... -
Automated Formal Verification of the DHCP Failover Protocol Using Timeout Order Abstraction
(Institute of Electrical and Electronics Engineers (IEEE), 2010-11)In this paper, we present automated formal verification of the DHCP Failover protocol. We conduct bounded model-checking for the protocol using Timeout Order Abstraction (TO-Abstraction), a technique to abstract a given ... -
Bounded-Contention Coding for Wireless Networks in the High SNR Regime
(Springer-Verlag, 2012)Efficient communication in wireless networks is typically challenged by the possibility of interference among several transmitting nodes. Much important research has been invested in decreasing the number of collisions in ... -
Bounded-Contention Coding for Wireless Networks in the High SNR Regime
(2012-08-27)Efficient communication in wireless networks is typically challenged by the possibility of interference among several transmitting nodes. Much important research has been invested in decreasing the number of collisions in ... -
Bounded-Contention Coding for wireless networks in the high SNR regime
(2015-04)Efficient communication in wireless networks is typically challenged by the possibility of interference among several transmitting nodes. Much important research has been invested in decreasing the number of collisions in ... -
Bounds on Contention Management in Radio Networks
(Springer-Verlag, 2012)The local broadcast problem assumes that processes in a wireless network are provided messages, one by one, that must be delivered to their neighbors. In this paper, we prove tight bounds for this problem in two well-studied ... -
Brief announcement: Hardness of broadcasting in wireless networks with unreliable communication
(Association for Computing Machinery, 2009)We prove two broadcast lower bounds for a wireless network model that includes unreliable links. For deterministic algorithms, we show n − 1 rounds are required, where n is the number of processes. For randomized algorithms, ... -
Brief announcement: Integrating temporal information to spatial information in a neural circuit
(2019)© Nancy Lynch and Mien Brabeeba Wang. In this paper, we consider networks of deterministic spiking neurons, firing synchronously at discrete times. We consider the problem of translating temporal information into spatial ... -
Brief announcement: Integrating temporal information to spatial information in a neural circuit
(2019)© Nancy Lynch and Mien Brabeeba Wang. In this paper, we consider networks of deterministic spiking neurons, firing synchronously at discrete times. We consider the problem of translating temporal information into spatial ... -
Brief announcement: Minimum spanning trees and cone-based topology control
(Association for Computing Machinery, 2009)Consider a setting where nodes can vary their transmission power thereby changing the network topology, the goal of topology control is to reduce the transmission power while ensuring the communication graph remains ... -
Brief announcement: On simple back-off in unreliable radio networks
(2018)© Seth Gilbert, Nancy Lynch, Calvin Newport, and Dominik Pajak. In this paper, we study local broadcast in the dual graph model, which describes communication in a radio network with both reliable and unreliable links. ... -
Brief announcement: On simple back-off in unreliable radio networks
(2018)© Seth Gilbert, Nancy Lynch, Calvin Newport, and Dominik Pajak. In this paper, we study local broadcast in the dual graph model, which describes communication in a radio network with both reliable and unreliable links. ... -
Brief Announcement: Partial Reversal Acyclicity
(Association for Computing Machinery (ACM), 2011)Partial Reversal (PR) is a link reversal algorithm which ensures that an initially directed acyclic graph (DAG) is eventually a destination-oriented DAG. While proofs exist to establish the acyclicity property of PR, they ... -
Broadcasting in Unreliable Radio Networks
(2010-06-08)Practitioners agree that unreliable links, which fluctuate between working and not working, are an important characteristic of wireless networks. In contrast, most theoretical models of radio networks fix a static set of ... -
Broadcasting in unreliable radio networks
(Association for Computing Machinery, 2010-07)Practitioners agree that unreliable links, which sometimes deliver messages and sometime do not, are an important characteristic of wireless networks. In contrast, most theoretical models of radio networks fix a static set ... -
Coded Emulation of Shared Atomic Memory for Message Passing Architectures
(2013-07-17)This paper considers the communication and storage costs of emulating atomic (linearizable) read/write shared memory in distributed message-passing systems. We analyze the costs of previously-proposed algorithms by Attiya, ... -
Coded Emulation of Shared Atomic Memory for Message Passing Architectures
(Institute of Electrical and Electronics Engineers (IEEE), 2014-08)This paper considers the communication and storage costs of emulating atomic (linearizable) multi-writer multi-reader shared memory in distributed message-passing systems. The paper contains two main contributions: (1) ... -
A Coded Shared Atomic Memory Algorithm for Message Passing Architectures
(2014-08-01)This paper considers the communication and storage costs of emulating atomic (linearizable) multi-writer multi-reader shared memory in distributed message-passing systems. The paper contains three main contributions: (1) ... -
A coded shared atomic memory algorithm for message passing architectures
(Springer Berlin Heidelberg, 2016-06)This paper considers the communication and storage costs of emulating atomic (linearizable) multi-writer multi-reader shared memory in distributed message-passing systems. The paper contains three main contributions: (1) ...
